tla-ts 0.0.10-dev.3a85c3a9e → 0.0.10-dev.4a2a53c48
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/run.cjs +15 -15
- package/dist/run.js +38 -38
- package/dist/transfer.cjs +4 -4
- package/dist/transfer.js +4 -4
- package/package.json +1 -1
- package/src/cli/tlc-output.ts +3 -3
- package/src/cli/tlc.ts +15 -1
- package/src/environment.ts +10 -5
- package/src/resolve.ts +1 -2
- package/src/runtime.ts +4 -0
- package/src/search.ts +29 -20
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/tlc/tlcext-operators.ts +44 -12
package/dist/transfer.js
CHANGED
|
@@ -75,7 +75,7 @@ It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the
|
|
|
75
75
|
`:`/\\ %s = %s
|
|
76
76
|
`;if(typeof o!=`string`)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must be a string.`);return r.filter(([e])=>!(a&&e===`_format`)).filter(([e,n])=>!t||!Va(t[e],n)).map(([e,t])=>{let n=Ua(o,[e,N(R(t))]);if(n===void 0)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},Ga=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Ka=Ga[0];const qa=()=>Ka,Ja=/* @__PURE__ */ new Int32Array(256),Ya=/* @__PURE__ */ new Int32Array(256),Xa=/* @__PURE__ */ new Int32Array(256),Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256);let no=0,ro=0,io=0,ao=0;const oo=e=>{let t=(e^ao)&255;ao=(ao>>>8|io<<24)^Qa[t],io=io>>>8^Ja[t]},so=e=>{let t=Ga[e];Ka=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Ja[e]=Number(BigInt.asIntN(32,t>>32n)),Qa[e]=Number(BigInt.asIntN(32,t))}let i=[Ja,Ya,Xa,Za],a=[Qa,$a,eo,to];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Qa[o],i[e][r]=t[r]>>>8^Ja[o]}}no=Number(BigInt.asIntN(32,t>>32n)),ro=Number(BigInt.asIntN(32,t))};so(0);const co=e=>{let t=ao^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;ao=io^to[n]^eo[r]^$a[i]^Qa[a],io=Za[n]^Xa[r]^Ya[i]^Ja[a]},lo=e=>{if(typeof e==`boolean`)return oo(0),oo(e?116:102),2;if(typeof e==`number`)return oo(1),co(e),5;if(typeof e==`string`){oo(3),co(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)co(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)oo(e.charCodeAt(n));return 5+e.length}return oo(21),co(Vn(e.name)+1),5},uo=e=>{let t=io,n=ao;io=0,ao=0;let r=[lo(e),io,ao];return io=t,ao=n,r},fo=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,po=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,mo={integer:e=>`${fo(`1`)} ${po(e)}`,boolean:e=>`${fo(`0`)} ${fo(`(${e} ? 116 : 102)`)}`,set:e=>`${fo(`5`)} ${po(e)}`,function:e=>`${fo(`9`)} ${po(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${po(`0`)} } for (; r > 0; r--) { ${fo(`0`)} } h ^= ${t}; l ^= ${n}; }`},ho=()=>({H0:Ja,H1:Ya,H2:Xa,H3:Za,L0:Qa,L1:$a,L2:eo,L3:to,initialHigh:no,initialLow:ro}),go=(e,t)=>{let n=io,r=ao;ao=e[0],io=e[1],yo(t),e[0]=ao,e[1]=io,io=n,ao=r},_o=e=>{oo(5),co(e)},vo=e=>{oo(9),co(e)},yo=e=>{if(typeof e!=`object`||dn(e))lo(e);else if(un(e)){let t=L(e);vo(t.domain.length);for(let e=0;e<t.domain.length;e++)yo(t.domain[e]),yo(t.range[e])}else{let t=I(e).elements;_o(t.length);for(let e of t)yo(e)}},bo=e=>{let t=io,n=ao;io=no,ao=ro;for(let t of e)yo(t);let r=BigInt(io>>>0)<<32n|BigInt(ao>>>0);return io=t,ao=n,r},xo=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=io,a=ao;for(let n=0;n<e;n++)io=no,ao=ro,t(n),r[2*n]=ao,r[2*n+1]=io;return io=i,ao=a,n},So=(e,t)=>xo(e.length,n=>{for(let r of t)yo(e[n][r])}),Co=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),wo=1024,To=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*wo),relations:[]}),Eo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Do=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Oo=(e,t,n,r,i)=>{let a=t===`next`?Do(e,t,r):void 0;if(a!==void 0)return a;let o=Eo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},ko=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Ao=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?m(a):`Unknown location`}`:ko(r.body.location.range,a)||!a?`${r.name} ${m(i)}`:`${r.name} ${m(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},jo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Mo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,No=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Po=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Fo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Io=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Lo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Ro=(e,t,n)=>{let r=new Set(n.map(jo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Co.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Eo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(jo(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Lo(t.bounds):t.params.map(e=>e.name);m(t.body,Io(n,e.scope)),t.kind===`Function`&&Fo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Io(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Io(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Po(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,Mo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,No(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,Mo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Io(Lo(e.bounds),t)),r(Fo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Io(Lo(e.bounds),t)),r(Fo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Io(Lo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Io(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Io(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},zo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=zo(e,r,n);if(t!==-1)return t}}return-1},Bo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=zo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:zo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Vo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Ho=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Uo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Wo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Go=(e,t)=>t.forEach((t,n)=>{let r=bo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*wo+i;e.registers[o]=Math.max(e.registers[o],Wo(a)+1)}),Ko=(e,t)=>{let n=e.registers.subarray(t*wo,(t+1)*wo),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*wo*wo/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*wo?a===0?i:wo*Math.log(wo/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},qo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Jo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>qo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Yo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Xo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Zo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Qo=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},$o=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Xo(e,t))&&Yo(n,a),Zo(e,t).forEach(e=>i(e).forEach(e=>Yo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?m(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Zo(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Yo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Xo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Jo(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Zo(e,t).forEach(e=>{i(e),s(e,0)}),n},es=[`init`,`next`,`invariant`,`constraint`,`implied`],ts=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,ns=e=>es.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>ts(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||ts(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),rs=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?m(i):`Unknown location`}`,distinct:Ko(e,r)}}),relations:ns(e).map(t=>({kind:t.kind,label:t.label,...Qo(e,t),expressions:$o(e,t.node)}))}),is=(e,t,n)=>{let r=Do(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},as=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),os=(e,t)=>as.has(e)?new y(t):new x(t),ss=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${R(r)}`),cs=(e,t,n=e)=>{if(!P(e)||Un(e))throw new x(`Applying ${t} to the following value,\nwhich is not a finite set:\n${R(n)}`);return I(e)},ls=e=>typeof e==`object`&&e.kind===`Operator`,z=(e,t,n)=>{let r=e[t];if(r===void 0||ls(r))throw os(n,`${n} expects a value as argument ${t+1}`);return r},us=(e,t,n)=>{let r=z(e,t,n);if(typeof r!=`boolean`)throw os(n,`${n} expects a boolean but received ${R(r)}`);return r},ds=(e,t,n)=>{let r=e[t];if(r===void 0||!ls(r))throw os(n,`${n} expects an operator as argument ${t+1}`);return r},fs=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),B=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ps=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ms=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),hs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(z(n,0,e),z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),gs=e=>e>2147483647||e<-2147483648,_s=e=>new x(`Overflow when computing ${e}`),vs={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},ys={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},bs={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},xs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ss=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ys[e.operator];if(e.kind!==`Function`)return vs[e.kind];let t=or(e);return t===void 0?`FcnRcdValue`:xs[t]},Cs=e=>bs[Ss(e)],ws=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ts=(e,t)=>{let n=n=>(...r)=>{let i=Hi.sets?.length??0;try{return n(...r)}catch(n){if(!(n instanceof y)||n instanceof ne)throw n;let r=Wi(i);throw Hi.sets&&(Hi.sets.length=i),e.isLazy!==!0&&n instanceof x&&!r?n:ws(t,n.message)}},r=n(e.evaluate);return{...e,evaluate:(n,i)=>{if(n.length!==e.arity)throw ws(t,`array is not of length ${e.arity}`);return r(n,i)},evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Es=(e,t)=>{if(typeof e!=`number`)throw ws(t,`Cannot cast tlc2.value.impl.${Ss(e)} to tlc2.value.impl.IntValue`);return e},Ds=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Os=(e,t,n,r)=>{let i=Ds(e,n,`IntValue`,2);return hs(t,(e,n)=>{let a=Es(n,i),o=Es(e,i),s=r(o,a);if(gs(s))throw _s(`${o}${t}${a}`);return s})},ks=(e,t,n)=>{if(typeof e!=`number`)throw new x(`The ${t} argument of ${n} should be an integer, but instead it is:\n${R(e)}`);return e},As=(e,t,n=e)=>hs(e,(e,r)=>t(ks(e,`first`,n),ks(r,`second`,n))),js=(e,t,n)=>({...ms(e,t,n),isLazy:!0}),Ms=(e,t,n)=>{let r=ds(e,t,n);return()=>r.call([])},Ns=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Ps=()=>({implication:lg,negate:ug,equivalent:dg,body:fg,condition:(e,t)=>{if(typeof e!=`boolean`)throw Kh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw qh(t,n,e);return e},apply:ca,expectFunction:ag,tuple:li,set:qr,record:di,writtenRecord:bn,equal:mr,enumerate:yg,choiceElements:G_,noChoice:e=>{throw K_(e)},filterPredicate:W_,isReducible:ln,finiteElements:e=>I(e).elements,addBounded:on,normalizedSet:nr,isBeyondBound:sn,cardinality:Fi,functionDomain:si,sortedFunction:rr,unassigned:(e,t)=>{throw eg(e,t)},prime:h_,keepLazyContext:og,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>rg(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Fs,Is;const Ls=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Rs=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),zs=e=>`local${e.counter++}`,Bs=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),mt(e).forEach(e=>Bs(e,t)),t},Vs=(e,t,n)=>{let r=Bs(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=Rs(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},Hs=(e,t,n)=>`${Rs(e,C_(t,e.environment))}(${Vs(e,t,n)})`,Us=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Ws=(e,t,n,r)=>{let i=zs(e),a=zs(e),o=zs(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Gs=(e,t,n)=>{let r=t.kind===`Forall`;return Us(e,n,n=>{let i=t.bounds.map(()=>zs(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${Qs(e,r.set,n)}, ${Rs(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=zs(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Qs(e,t.body,n)}, ${Rs(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Ws(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Ks=(e,t,n,r,i)=>Us(e,i,i=>{let a=zs(e),o=zs(e),s=Rs(e,t),c=`choiceElements(${Qs(e,n,i)}, ${s}, ${Rs(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Qs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Ws(e,a,o,l)} return noChoice(${s});`}),qs=(e,t,n,r)=>Us(e,r,r=>{let i=zs(e),a=zs(e),o=zs(e),s=zs(e),c=Rs(e,t),l=`if (!isReducible(${i})) return ${Rs(e,U_(t,e.environment))}(${i}, ${Vs(e,t,r)});`,u=Qs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${Qs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Ws(e,a,s,d)} return normalizedSet(${o});`}),Js=(e,t,n,r)=>Us(e,r,r=>{let i=zs(e),a=zs(e),o=zs(e),s=zs(e),c=zs(e),l=zs(e),u=Rs(e,B_(t,e.environment)),d=Vs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Qs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Qs(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Ws(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Ys=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Qs(e,r[0],n),a=Qs(e,r[1],n),o=Rs(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Qs(e,r[0],n)}, ${Rs(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)}, ${Rs(e,t)})`;if(M(t))return Hs(e,t,n);let i=Kg(t.operator,e.environment);if(i?.kind!==`Builtin`)return Hs(e,t,n);if(i.name===`DOMAIN`)return`${Rs(e,Xh(t))}(${Qs(e,r[0],n)})`;if(i.name===`TLCEval`)return Hs(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Rs(e,Zh(t,i))}(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&E_(r[0],a))return`${Rs(e,i.evaluateUnary)}(${Qs(e,r[0],n)})`;let o=r.length===2&&E_(r[0],a)&&E_(r[1],a);return i.evaluateBinary&&o?`${Rs(e,i.evaluateBinary)}(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)})`:Hs(e,t,n)},Xs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=r_(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Xs(e.expression,t,n);case`FieldAccess`:return Xs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Xs(e,t,n));default:return!1}},Zs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Zs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Zs);default:return!1}},Qs=(e,t,n)=>{let r=(t,r=n)=>Qs(e,t,r);switch(t.kind){case`Number`:return mn(t.value)?String(t.value):Hs(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return Hs(e,t,n);let i=r_(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Rs(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Rs(e,i.value):Hs(e,t,n)}case`Apply`:return Ys(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Rs(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Rs(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{F_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Xs(t.function,n,e.environment)?r(t.function):Zs(t.function)?r(t.function,i):Hs(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Rs(e,t)}))`,o=Yh(e.environment.runtime.version),s=o?`, ${Rs(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Rs(e,Jh(t))}(${r(t.record)})`;case`Record`:{let i=J_(t.fields);if(Y_(i))return Hs(e,t,n);let a=Rs(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Rs(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?Hs(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Gs(e,t,n):Hs(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Ks(e,t,t.set,t.pattern.name,n):Hs(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!z_(t)?Js(e,t,r.pattern.name,n):Hs(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?qs(e,t,t.bound.pattern.name,n):Hs(e,t,n);default:return Hs(e,t,n)}},$s=(e,t)=>{if(!Ns.has(e.kind)||(Is??=Ls(),!Is))return;let n={environment:t,references:[],helpers:[],counter:0},r=Qs(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
77
77
|
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Fs??=Ps(),Function(...Object.keys(Fs),...i,a)(...Object.values(Fs),...n.references)},ec={kind:`Local`},tc=/* @__PURE__ */ new WeakSet,nc=/* @__PURE__ */ new WeakMap,rc=/* @__PURE__ */ new WeakMap,ic=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ac=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),oc=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,sc=e=>e.kind===`Operator`?e.params.length:0,cc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],lc=e=>e.name.includes(`!`),uc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},dc=(e,t,n)=>{let r=t.bindings.get(e);return r&&oc(r.position,t.location)&&(!n||oc(r.position,n.start))?r:void 0},fc=(e,t)=>e!==void 0&&t!==void 0&&m(e)===m(t),pc=(e,t,n,r)=>{if(t===void 0)return!0;if(fc(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=m(i),o=t.range&&m(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},mc=(e,t,n,r)=>pc(t,uc(e,t)??dc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,hc=(e,t,n)=>{pc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},gc=(e,t,n,r)=>t.reduce((e,t,i)=>mc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),_c=(e,t,n)=>t.reduce((e,t)=>mc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),vc=e=>e.kind===`Name`?[e.name]:e.names,yc=e=>e.flatMap(e=>vc(e.pattern)),bc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||oc(n.location,t.location))?n:void 0},xc=(e,t)=>{let n=bc(e,t);return n?{key:t.getKey(n),arity:sc(n),params:cc(n),kind:`Definition`}:t.imported.get(e)},Sc=(e,t,n)=>uc(t,e)??xc(e,n),Cc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),wc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Cc(e.location,e.spelling??t)},Tc=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return oc(e.location,e.args[0].location)?`prefix`:`postfix`}},Ec=e=>!/^[\p{L}\d_]/u.test(e),Dc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Oc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,kc=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Ac=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?kc(e.name,[],void 0):kc(e.operator,e.args,e.argumentCounts),jc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Mc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:yc(e.bounds),body:e.body,sets:jc(e.bounds)};case`SetMap`:return{names:yc(e.bounds),body:e.expression,sets:jc(e.bounds)};case`SetFilter`:return{names:vc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:vc(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Nc=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Pc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Fc=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ic=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Ic(e.body,t):mt(e).reduce((e,n)=>e??Ic(n,t),void 0)},Lc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Lc(i,t,n||Fc(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ic(e.set,t):Ic(e,t)},Rc=e=>e.kind===`Label`?Rc(e.body):e,zc=e=>typeof e==`number`?`argument selector ${e}`:e,Bc=`within the scope of a declaration
|
|
78
|
-
from outside that declaration's scope.`,Vc=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:m(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Rc(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:Lc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?Ic(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Fc(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Bc}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=zc(n.operand);if(l.isSufficesOpen){if(Oc(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=Rc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Sc(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=Mc(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Nc(e);if(!c)return;let f=Oc(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Oc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Fc(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Bc}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},Hc=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:m(e.location.range),message:n}),!0)},Uc=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=m(r),a=e.params.filter((r,i)=>{let a=uc(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:m(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Wc=(e,t,n,r)=>{if(!Pc(e))return!1;let i=Ac(e),a=i[0],o=i.length>1&&a.kind===`Name`?uc(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Vc(e,i,o,t,n,r),o!==void 0},Gc=(e,t,n,r)=>{let i=e.location;if(tl(e,n,r))return;let a=rc.get(e);if(a!==void 0)return a;if(ic(t))return e.kind===`Apply`?e.args.length:0;let o=uc(n,t);if(o?.isNonFact){r.errors.push({location:m(wc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Wc(e,n,r,!1)||Dc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=ec),o)return o.arity;let s=xc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,rc.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(uc(n,c)!==void 0||xc(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=m(e.kind===`Apply`&&l===`-.`?Cc(i,`-`):wc(e,t));if(!Ec(t)||Dc(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=Tc(e);d&&i.range&&r.errors.push({location:m(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},Kc=(e,t,n)=>(e.forEach(e=>V(e.set,t,n)),e.reduce((e,t)=>gc(e,vc(t.pattern),t.pattern.ranges,n),t)),qc=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>qc(e,t)),Jc=(e,t)=>{e.kind===`FunctionConstruction`&&qc(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>Jc(e,t))},Yc=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?yc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:m(o),message:e})},c=e.kind===`Function`?Kc(e.bounds,t,i):_c(t,e.params,i),l=uc(c,a)??dc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(V(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Jc(e.body,a),e.isSelfReferential=qc(e.body,a)):V(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:pc(a,uc(t,a)??dc(a,i,o),{kind:`Definition`,arity:sc(e),range:o},i)},Xc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(uc(e,t.name)?.isPending)return e;let n={name:t.name,arity:sc(t),params:cc(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>sl(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ic(t.name)?e:s(e,e=>!oc(t.location,e.location)),o={name:t.name,arity:sc(t),kind:`Definition`,range:t.location.range,parent:a};if(lc(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ic(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Yc(t,a,u,i)?{...o,params:cc(t)}:a},a),()=>!0)},Zc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:uc(t,r)??dc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Qc=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Zc(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:m(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},$c=(e,t,n)=>{if(Qc(e,t,n))return;let r=e.operator,i=Sc(r,t,n),a=Gc(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:m(e.argumentsRange??wc(e,r)),message:`The operator ${r} requires ${a-(Zc(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>el(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:m(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Gc(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else V(i,t,n);return!0}if(i.kind===`Lambda`){V(i,t,n);let o=i.params.length===c;return!o&&tc.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??wc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return V(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Sc(u,t,n)?.params??[],f=Gc(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(wc(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},el=(e,t,n)=>{e.kind===`Identifier`?Gc(e,e.name,t,n):V(e,t,n)},tl=(e,t,n)=>{let r=nc.get(e);return r?(r.args.forEach(e=>el(e,t,n)),n.errors.push(r.error),!0):!1},V=(e,t,n)=>{if(tc.has(e)&&!n.isGenerated){V(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>V(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Qc(e,t,n))return;let r=e.name,i=Gc(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:m(wc(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Gc(e,e.operator,t,n);return;case`Apply`:$c(e,t,n);return;case`Lambda`:V(e.body,gc(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:V(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&V(e.other,t,n);return;case`Let`:V(e.body,Xc(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:V(e.body,Kc(e.bounds,t,n),i(yc(e.bounds)));return;case`UnboundedQuantifier`:V(e.body,gc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&V(e.set,t,n),V(e.body,gc(t,vc(e.pattern),e.pattern.ranges,n),i(vc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:V(e.predicate,Kc([e.bound],t,n),i(vc(e.bound.pattern)));return;case`SetMap`:V(e.expression,Kc(e.bounds,t,n),i(yc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:m(r.location.range??Cc(r.location,r.name)),message:`Non-unique fields in constructor.`}),V(r.value,t,n)});return;case`Except`:V(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),V(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:V(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Hc(e,n))return;V(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Uc(e,t,n);return;case`Subexpression`:if(tl(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>el(e,t,n)),Wc(e,t,n,!1)}},nl=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Qc(e,t,n)||Wc(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&uc(t,r)?.isNonFact?n.errors.push({location:m(wc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||V(e,t,n)}),rl=(e,t,n)=>(e.set&&V(e.set,t,n),mc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),il=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:rl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?il(t,e.scope,e.unit,!0):V(t,e.scope,e.unit),e),{scope:t,unit:n});return V(e.conclusion,i.scope,i.unit),i.scope},al=(e,t,n)=>e.kind===`AssumeProve`?il(e,t,n):(V(e,t,n),t),ol=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&nl(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>cl(t,e,r),t)},sl=(e,t,n)=>{let r=ml(e,t,n);return e.name===void 0?r:mc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},cl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=al(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return ol(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return ol(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return nl(r.facts,t,n),o(t);case`Instance`:return o(sl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?sl(t,e,i):Xc([t],e,n),t));case`Have`:case`Case`:return V(r.expression,t,i),ol(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>V(e,t,i)),a(t);case`Take`:return a(gc(Kc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=gc(Kc(r.bounds,t,i),r.names,r.nameRanges,i);return V(r.body,o,{...i,labelParams:[...i.labelParams,...yc(r.bounds),...r.names]}),ol(e.proof,a(t),n),a(o)}default:return ol(e.proof,a(t),n),a(t)}},ll=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:al(e.statement,void 0,t);e.name!==void 0&&hc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),ol(e.proof,n,t),r&&(r.isInProof=!1)},ul={line:0,column:0},dl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),fl=(e,t)=>{let n=new Map([...ac,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},pl=(e,t,n,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){V(n,o,a);return}let i=Gc(n,n.name,o,a);if(i!==void 0&&i!==t.arity)throw new r(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){a.errors.push({location:m(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(n)?o&&a.errors.push({location:m(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):c.set(n,i)});let l=t.filter(e=>!c.has(e.name)),u=e=>!uc(o,e.name)&&!xc(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&a.errors.push({location:m(r),message:`Substitution missing for symbol ${t.name} declared at ${m(i)} \nand instantiated in module ${n}.`})}),c},ml=(e,t,n)=>{let r=n.getInstance(e);return pl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>mc(e,t,r,n),t)},hl=(e,t,n,r)=>{let i=fl(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),pl(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:ul}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},gl=(e,t)=>{let n=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>oc(e.location,t.location)?-1:+!!oc(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof r)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(n,e)),o.forEach(e=>i(t,e))}),n},_l=(e,t)=>{let n=fl(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ac,...t.bound].map(([e,t])=>[e,{...t,position:ul}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c)=>({location:e,check:(l,u)=>c({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),l=(e,t)=>e.map(e=>c(e.location,void 0,!1,n=>hc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return gl([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>c(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=pc(e.name,a.get(e.name),n,t);r&&(a.set(e.name,n),o.add(n)),s.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>c(t.location,t,!0,n=>{dl(e,t)?V(t.body,void 0,n):Yc(t,void 0,n,o)&&a.set(t.name,{kind:`Definition`,arity:sc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>c(e.location,void 0,!1,n=>{_c(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>hc(t,e,n)),e.name!==void 0&&hc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>c(e.location,void 0,e.name!==void 0,t=>{V(e.expression,void 0,t),e.name!==void 0&&hc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>c(e.location,void 0,e.name!==void 0,t=>ll(e,t))),...e.uses.map(e=>c(e.location,void 0,!1,t=>nl(e.facts,void 0,t))),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:m(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},vl=/* @__PURE__ */ new WeakSet,yl=/* @__PURE__ */ new WeakMap,bl=(e,t)=>{if(t.length===0)return e;let n={...e};return vl.has(e)&&vl.add(n),yl.set(n,[...t,...yl.get(e)??[]]),n},xl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Dl(e,(e,r)=>xl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Sl=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Cl=/* @__PURE__ */ new WeakMap,wl=e=>Cl.get(e)??e.name,Tl=(e,t)=>(wl(t)!==e.name&&Cl.set(e,wl(t)),e),El=(e,t)=>Tl(e.kind===`Function`?{...e,bounds:Sl(e.bounds,e=>t(e,[])),body:t(e.body,yc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Dl=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>El(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Sl(e.bounds,n),body:t(e.body,yc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,vc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,vc(e.bound.pattern))};case`SetMap`:return{...e,bounds:Sl(e.bounds,n),expression:t(e.expression,yc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Ol=(e,t)=>{Dl(e,(e,n)=>(t(e,n),e))},kl=`LAMBDA`,Al=e=>`${e}@SUBSTITUTION`,jl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(jl),Ml=(e,t)=>{if(e.kind!==`Identifier`)return!jl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!jl(n.body)},Nl=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return Ol(e,(e,n)=>r.push(...Nl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Pl=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Fl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Il=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ll=(e,t)=>e.map(e=>({pattern:Il(e.pattern,t),set:e.set})),Rl=(e,t)=>e.kind===`Function`?{...e,bounds:Ll(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},zl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Tl({...Rl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ll(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Il(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Il(e.bound.pattern,n),set:e.bound.set}};default:return e}},Bl=e=>`${e}@ENABLED`,Vl=(e,t)=>e.modes.get(t)??e,Hl=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),Ul=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ul(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Hl(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ul(r.body,t,/* @__PURE__ */ new Map):void 0},Wl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Hl(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Bl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Xl(e.expression,Vl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Xl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Xl(e.subscript,Vl(t,`Primed`),n),location:r},Xl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ul(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Bl(r),location:e.location},location:e.location},Xl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Gl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ec}),Kl=(e,t)=>e.map(e=>Gl(e.name,t)),ql=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:Kl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Jl=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...Kl(t,r),...i.map(e=>Gl(e,r))],location:r},location:r}},Yl=(e,t)=>e.instantiation.isParameterized(t)?Ql(e,t):void 0,Xl=(e,t,n)=>{let i=e=>Xl(e,t,n),a=t.instantiation,o=a.params,s=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Xl(e.expression,Vl(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Xl(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Vl(t,`Enabled`),n)};let c=Wl(e,t,n);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let n=a.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Ml(n,a)))return bl(n,[e]);if(n&&r){let t=Al(e.name);return r.set(t,n),Gl(t,e.location)}let i=Yl(t,e.name);if(i===void 0)return e;if(o.length===0)return{...e,name:i};let s=a.getDefinition(e.name);return s&&sc(s)>0?Jl(i,o,sc(s),e.location):{kind:`Apply`,operator:i,args:Kl(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let n=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||vl.has(e),l=e=>(c&&vl.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:n,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...n],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:kl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:kl,args:n,resolution:ec},location:e.location};if(s)throw new r(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Yl(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Kl(o,e.location),...n]}}if(e.kind===`OperatorReference`&&s(e.operator)){let n=a.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return bl(n,[e]);let r=Yl(t,e.operator);if(r===void 0)return e;let i=a.getDefinition(e.operator);return o.length>0&&i?Jl(r,o,sc(i),e.location):{...e,operator:r}}let l=Pl(t),u=Dl(e,(e,r)=>r.length===0?i(e):Xl(e,t,Fl(n,r,l)));return zl(u,n,l)},Zl=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Gl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ql=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Pl(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Rl(El(i,(e,t)=>Xl(e,s,Fl(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&yl.set(l,[u,...yl.get(i.body)??[]]),Zl({...c,body:l},r.params,i.location)}):t},$l=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Nl(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Yl(i,e)??e,getQualifiedKey:t=>{let n=Yl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Zl(r,e.params,r.location)):t}}},eu=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(eu),tu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Dl(e,e=>tu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>oc(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},nu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ru=(e,t)=>e.definitions.some(e=>eu(e.body))||e.assumptions.some(e=>eu(e.expression))||e.theorems.some(e=>{let t=nu(e);return t!==void 0&&eu(t)})?{...e,definitions:e.definitions.map(e=>El(e,e=>tu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:tu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=nu(e);return n===void 0?e:{...e,statement:tu(n,t,[])}})}:e,iu=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),au={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},ou=(e,t)=>{let n=au[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},su=(e,t)=>`${e}${t}`,cu=(e,t,n)=>`${e}${t}${n}`,lu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},uu=(e,t,n)=>`${e},${t},${n}`,du=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),fu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),pu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),mu=(e,t)=>{t.constraints.forEach((t,n)=>fu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>pu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},hu=(e,t,n,r)=>({...du(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),gu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,_u=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,vu=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...hu(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),yu=hu(`$Set`,0,[2],[1]),bu=hu(`$Junction`,0,[3],[1]),xu=hu(`$Choose`,0,[2],[1]),Su=hu(`$Function`,0,[3],[1]),Cu=hu(`$FcnApply`,0,[2,2],[1,1]),wu=hu(`$RcdSelect`,0,[2,0],[1,1]),Tu=hu(`'`,2,[1],[0]),Eu=hu(`ENABLED`,1,[2],[0]),Du=hu(`[]`,3,[3],[0]),Ou=hu(`$SquareAct`,2,[2,1],[0,0]),ku=hu(`$WF`,3,[1,2],[0,0]),Au=hu(`$TemporalExists`,3,[3],[0]),ju=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Mu=e=>e.map(e=>({name:e,arity:0})),Nu=(e,t)=>t.location.range?a(`${e}.`,t.location.range):new r(`${e} at line ${t.location.line}, column ${t.location.column}`),Pu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Fu=e=>e.kind!==`Let`&&e.kind!==`Label`,Iu=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=vu.get(t)??iu.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=du(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(cu(e,n,t))}),pu(r.argConstraints,su(e,n),t.data.level),mu(r,t.data)}),r},a=(e,t,n=[],i=[])=>{let a=e=>i.includes(e);if(t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>gu(e,n))throw new r(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new r(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},s=(t,n,r)=>e.conditions.has(uu(t,n,r)),c=du(Math.max(e.level,...t.filter((t,n)=>_u(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{_u(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>fu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||fu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>fu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||fu(c.constraints,t,gu(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>fu(c.constraints,e,gu(r,a)))}))}),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);n?.kind===`Operator`&&fu(c.constraints,t.param,gu(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>pu(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>pu(c.argConstraints,su(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&pu(c.argConstraints,su(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);n&&pu(c.argConstraints,su(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(lu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(cu(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(cu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(cu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,Mu(e.params),e.body,t)};let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=du();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:du()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=ju(n,Mu(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Nu(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Nu(`Action used where only temporal formula or state predicate allowed`,e);Pu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Fu(n)&&n.kind!==r)throw Nu(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>mu(i,v(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof r)||t.sany?t:Nu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return du();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=s(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(bu,n)}case`Prime`:case`Unchanged`:return c(Tu,[e.expression],t);case`Enabled`:return c(Eu,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Du,[n])}case`If`:return c(bu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(bu,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(bu,[e.body],t,e.bounds.map(e=>e.set),yc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Nu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Au:bu,[e.body],t,[],e.names);case`Choose`:return c(xu,[e.body],t,e.set?[e.set]:[],vc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(yu,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(yu,[e.predicate],t,[e.bound.set],vc(e.bound.pattern));case`SetMap`:return c(yu,[e.expression],t,e.bounds.map(e=>e.set),yc(e.bounds));case`FunctionConstruction`:return c(Su,[e.body],t,e.bounds.map(e=>e.set),yc(e.bounds));case`Record`:return c(Su,e.fields.map(e=>e.value),t);case`RecordSet`:return c(yu,e.fields.map(e=>e.value),t);case`Except`:return c(yu,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Cu,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(yu,e.args,t)}]);case`Bracket`:return du();case`FieldAccess`:return a(wu,[o(e.record,t),{kind:`Value`,data:du()}]);case`BoxAction`:case`AngleAction`:return c(Ou,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(ku,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return du()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,ju(t,Mu(e.names))),i;default:return Ol(e,(e,n)=>a(e,r,ju(t,Mu(n)))),i}},_=(e,t,n,r)=>{let i=ju(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...du(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(su(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(cu(e.name,n,t.name))).map(e=>uu(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(lu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=lu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...du(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},Lu=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Lu(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=du(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),mu(a,e)}),a},Ru=(e,t,n,r)=>{let i=Iu(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Lu(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=m(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:m(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=gl([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Lu(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw te(n)}})),...n],r);if(l.length>0)throw te(l,!1,void 0,r)},zu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Bu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Vu=/* @__PURE__ */ new Set([...zu,...Bu,`Enabled`]),Hu=/* @__PURE__ */ new Set([`~>`,`-+->`]),Uu=/* @__PURE__ */ new Set([...Hu,`\\cdot`]),Wu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Gu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Ku=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),qu=(e,t)=>Wu.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ju=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(zu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Bu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Hu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Vu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Uu.has(e.operator))&&(r[0]|=1),Vu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=ht(e);if(u!==void 0&&!M(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{qu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Gu.has(u)&&(r[0]|=8),Ku.has(u)&&(r[0]|=256),!a&&qu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Yu=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Xu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Zu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Ju(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Yu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Yu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Xu(t[e],l[e*r])))),p=Yu(a,r,f,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&270:e),words:r}},Qu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?$u(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},$u=(e,t)=>{let n=t.facts.words,r=Ju(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Qu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Xu(e.callee,r[0])||(i[0]|=r[0]&270)}),i},ed=(e,t)=>!(Qu(e,t)[0]&1),td={any:2,repeated:4,streamed:8,replayed:260},nd=(e,t,n)=>($u(e,t)[0]&td[n])!==0,rd=(e,t,n=`any`)=>(Qu(e,t)[0]&td[n])!==0,id=(e,t)=>{let n=Qu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},ad=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},od=(e,t)=>{let n=$u([e],t);return n[0]&16?void 0:ad(n)},sd=(e,t)=>!!($u([e],t)[0]&1),cd=(e,t,n)=>new x(`Applying ${e} to the following value,\nwhich is not ${t}:\n${R(n)}`),ld=e=>un(e)?L(e):void 0,ud=`a function with a finite domain`,dd=(e,t,n)=>{let r=z(e,t,n),i=ld(r);if(!i)throw cd(n,ud,r);return i},fd=(e,t)=>{let n=z(e,1,t),r=ld(n),i=r&&gd(r,z(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw ss(`second`,t,`bag`,n);return i},pd=(e,t,n)=>{let r=t[n];if(!r||!hd(r))throw ss(n===0?`first`:`second`,`(+)`,`bag`,z(e,n,`(+)`));return r},md=(e,t)=>{if(!P(e)||!F(e))throw t();return I(e).elements},hd=e=>e.range.every(e=>typeof e==`number`&&e>0),gd=(e,t)=>{let n=e.domain.findIndex(e=>Ur(t,e));return n===-1?void 0:e.range[n]},_d=e=>{if(typeof e==`number`)return e;let t=`tlc2.value.impl.${Ss(e)}`;throw new y(`class ${t} cannot be cast to class tlc2.value.impl.IntValue (${t} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},vd=(e,t)=>{let n=_d(e)+_d(t);if(gs(n))throw _s(`${e}+${t}`);return n},yd=(e,t,n)=>{let r=_d(e.range[t]),i=gd(n,e.domain[t]);if(i===void 0)return r;let a=r-_d(i);if(gs(a))throw _s(`${r}-${i}`);return a},bd=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>Ur(t,e[0]));i?i[1]=vd(i[1],n):e.push([t,n])},xd=e=>e.domain.map((t,n)=>[t,e.range[n]]),Sd=rr([],[]),Cd=e=>[fs(`EmptyBag`,Sd),B(`IsABag`,1,e=>{let t=ld(z(e,0,`IsABag`));return t!==void 0&&hd(t)}),B(`BagCardinality`,1,e=>{let t=z(e,0,`BagCardinality`);return dd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw cd(`BagCardinality`,`a bag`,t);return vd(e,n)},0)}),B(`BagIn`,2,e=>{let t=fd(e,`BagIn`);return t!==void 0&&t>0}),B(`CopiesIn`,2,e=>fd(e,`CopiesIn`)??0),B(`\\oplus`,2,e=>{let t=[0,1].map(t=>ld(z(e,t,`(+)`))),n=pd(e,t,0),r=pd(e,t,1),i=xd(n);return r.domain.forEach((e,t)=>bd(i,e,r.range[t],n.domain.length)),Qr(i)}),B(`\\ominus`,2,e=>{let t=z(e,0,`(-)`),n=z(e,1,`(-)`),r=ld(t),i=ld(n);if(!r)throw ss(`first`,`(-)`,`bag`,t);if(!i)throw ss(`second`,`(-)`,`bag`,n);return Qr(r.domain.flatMap((e,t)=>{let n=yd(r,t,i);return n>0?[[e,n]]:[]}))}),B(`BagUnion`,1,e=>{let t=z(e,0,`BagUnion`),n=md(t,()=>cd(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Sd;let r=e=>{let n=ld(e);if(!n)throw new x(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(t)}`);return n},i=xd(r(n[0]));return n.slice(1).forEach(e=>{let t=r(e);t.domain.forEach((e,n)=>bd(i,e,t.range[n]))}),Qr(i)}),B(`\\sqsubseteq`,2,e=>{let t=z(e,0,`\\sqsubseteq`),n=z(e,1,`\\sqsubseteq`),r=ld(t),i=ld(n);if(!r)throw cd(`\\sqsubseteq`,ud,t);if(!i)throw cd(`\\sqsubseteq`,ud,n);return r.domain.every((e,t)=>{let n=gd(i,e);return _d(r.range[t])<=(n===void 0?0:_d(n))})}),ps(`BagOfAll`,2,e=>{let t=ds(e,0,`BagOfAll`),n=z(e,1,`BagOfAll`),r=ld(n);if(!r)throw ss(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>bd(i,t.call([e]),r.range[n])),Qr(i)}),B(`SubBag`,1,t=>{let n=z(t,0,`SubBag`);if(!un(n))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Cs(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=L(n),i=I(qr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${R(r)}, which is not in its domain`);return Kr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>rr(e.map(e=>e[0]),e.map(e=>e[1]))))}),B(`BagToSet`,1,e=>ua(dd(e,0,`BagToSet`))),B(`SetToBag`,1,e=>{let t=z(e,0,`SetToBag`),n=md(t,()=>cd(`BagToSet`,ud,t));return rr([...n],n.map(()=>1))})],wd={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Td={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Ed=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Dd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
78
|
+
from outside that declaration's scope.`,Vc=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:m(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Rc(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:Lc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?Ic(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Fc(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Bc}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=zc(n.operand);if(l.isSufficesOpen){if(Oc(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=Rc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Sc(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=Mc(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Nc(e);if(!c)return;let f=Oc(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Oc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Fc(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Bc}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},Hc=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:m(e.location.range),message:n}),!0)},Uc=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=m(r),a=e.params.filter((r,i)=>{let a=uc(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:m(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Wc=(e,t,n,r)=>{if(!Pc(e))return!1;let i=Ac(e),a=i[0],o=i.length>1&&a.kind===`Name`?uc(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Vc(e,i,o,t,n,r),o!==void 0},Gc=(e,t,n,r)=>{let i=e.location;if(tl(e,n,r))return;let a=rc.get(e);if(a!==void 0)return a;if(ic(t))return e.kind===`Apply`?e.args.length:0;let o=uc(n,t);if(o?.isNonFact){r.errors.push({location:m(wc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Wc(e,n,r,!1)||Dc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=ec),o)return o.arity;let s=xc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,rc.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(uc(n,c)!==void 0||xc(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=m(e.kind===`Apply`&&l===`-.`?Cc(i,`-`):wc(e,t));if(!Ec(t)||Dc(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=Tc(e);d&&i.range&&r.errors.push({location:m(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},Kc=(e,t,n)=>(e.forEach(e=>V(e.set,t,n)),e.reduce((e,t)=>gc(e,vc(t.pattern),t.pattern.ranges,n),t)),qc=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>qc(e,t)),Jc=(e,t)=>{e.kind===`FunctionConstruction`&&qc(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>Jc(e,t))},Yc=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?yc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:m(o),message:e})},c=e.kind===`Function`?Kc(e.bounds,t,i):_c(t,e.params,i),l=uc(c,a)??dc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(V(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Jc(e.body,a),e.isSelfReferential=qc(e.body,a)):V(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:pc(a,uc(t,a)??dc(a,i,o),{kind:`Definition`,arity:sc(e),range:o},i)},Xc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(uc(e,t.name)?.isPending)return e;let n={name:t.name,arity:sc(t),params:cc(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>sl(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ic(t.name)?e:s(e,e=>!oc(t.location,e.location)),o={name:t.name,arity:sc(t),kind:`Definition`,range:t.location.range,parent:a};if(lc(t))return{...o,params:cc(t)};let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ic(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Yc(t,a,u,i)?{...o,params:cc(t)}:a},a),()=>!0)},Zc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:uc(t,r)??dc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Qc=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Zc(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:m(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},$c=(e,t,n)=>{if(Qc(e,t,n))return;let r=e.operator,i=Sc(r,t,n),a=Gc(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:m(e.argumentsRange??wc(e,r)),message:`The operator ${r} requires ${a-(Zc(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>el(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:m(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Gc(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else V(i,t,n);return!0}if(i.kind===`Lambda`){V(i,t,n);let o=i.params.length===c;return!o&&tc.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??wc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return V(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Sc(u,t,n)?.params??[],f=Gc(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(wc(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},el=(e,t,n)=>{e.kind===`Identifier`?Gc(e,e.name,t,n):V(e,t,n)},tl=(e,t,n)=>{let r=nc.get(e);return r?(r.args.forEach(e=>el(e,t,n)),n.errors.push(r.error),!0):!1},V=(e,t,n)=>{if(tc.has(e)&&!n.isGenerated){V(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>V(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Qc(e,t,n))return;let r=e.name,i=Gc(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:m(wc(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Gc(e,e.operator,t,n);return;case`Apply`:$c(e,t,n);return;case`Lambda`:V(e.body,gc(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:V(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&V(e.other,t,n);return;case`Let`:V(e.body,Xc(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:V(e.body,Kc(e.bounds,t,n),i(yc(e.bounds)));return;case`UnboundedQuantifier`:V(e.body,gc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&V(e.set,t,n),V(e.body,gc(t,vc(e.pattern),e.pattern.ranges,n),i(vc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:V(e.predicate,Kc([e.bound],t,n),i(vc(e.bound.pattern)));return;case`SetMap`:V(e.expression,Kc(e.bounds,t,n),i(yc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:m(r.location.range??Cc(r.location,r.name)),message:`Non-unique fields in constructor.`}),V(r.value,t,n)});return;case`Except`:V(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),V(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:V(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Hc(e,n))return;V(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Uc(e,t,n);return;case`Subexpression`:if(tl(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>el(e,t,n)),Wc(e,t,n,!1)}},nl=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Qc(e,t,n)||Wc(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&uc(t,r)?.isNonFact?n.errors.push({location:m(wc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||V(e,t,n)}),rl=(e,t,n)=>(e.set&&V(e.set,t,n),mc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),il=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:rl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?il(t,e.scope,e.unit,!0):V(t,e.scope,e.unit),e),{scope:t,unit:n});return V(e.conclusion,i.scope,i.unit),i.scope},al=(e,t,n)=>e.kind===`AssumeProve`?il(e,t,n):(V(e,t,n),t),ol=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&nl(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>cl(t,e,r),t)},sl=(e,t,n)=>{let r=ml(e,t,n);return e.name===void 0?r:mc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},cl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=al(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return ol(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return ol(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return nl(r.facts,t,n),o(t);case`Instance`:return o(sl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?sl(t,e,i):Xc([t],e,n),t));case`Have`:case`Case`:return V(r.expression,t,i),ol(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>V(e,t,i)),a(t);case`Take`:return a(gc(Kc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=gc(Kc(r.bounds,t,i),r.names,r.nameRanges,i);return V(r.body,o,{...i,labelParams:[...i.labelParams,...yc(r.bounds),...r.names]}),ol(e.proof,a(t),n),a(o)}default:return ol(e.proof,a(t),n),a(t)}},ll=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:al(e.statement,void 0,t);e.name!==void 0&&hc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),ol(e.proof,n,t),r&&(r.isInProof=!1)},ul={line:0,column:0},dl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),fl=(e,t)=>{let n=new Map([...ac,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},pl=(e,t,n,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){V(n,o,a);return}let i=Gc(n,n.name,o,a);if(i!==void 0&&i!==t.arity)throw new r(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){a.errors.push({location:m(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(n)?o&&a.errors.push({location:m(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):c.set(n,i)});let l=t.filter(e=>!c.has(e.name)),u=e=>!uc(o,e.name)&&!xc(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&a.errors.push({location:m(r),message:`Substitution missing for symbol ${t.name} declared at ${m(i)} \nand instantiated in module ${n}.`})}),c},ml=(e,t,n)=>{let r=n.getInstance(e);return pl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>mc(e,t,r,n),t)},hl=(e,t,n,r)=>{let i=fl(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),pl(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:ul}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},gl=(e,t)=>{let n=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>oc(e.location,t.location)?-1:+!!oc(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof r)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(n,e)),o.forEach(e=>i(t,e))}),n},_l=(e,t)=>{let n=fl(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ac,...t.bound].map(([e,t])=>[e,{...t,position:ul}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c)=>({location:e,check:(l,u)=>c({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),l=(e,t)=>e.map(e=>c(e.location,void 0,!1,n=>hc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return gl([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>c(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=pc(e.name,a.get(e.name),n,t);r&&(a.set(e.name,n),o.add(n)),s.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>c(t.location,t,!0,n=>{dl(e,t)?V(t.body,void 0,n):Yc(t,void 0,n,o)&&a.set(t.name,{kind:`Definition`,arity:sc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>c(e.location,void 0,!1,n=>{_c(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>hc(t,e,n)),e.name!==void 0&&hc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>c(e.location,void 0,e.name!==void 0,t=>{V(e.expression,void 0,t),e.name!==void 0&&hc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>c(e.location,void 0,e.name!==void 0,t=>ll(e,t))),...e.uses.map(e=>c(e.location,void 0,!1,t=>nl(e.facts,void 0,t))),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:m(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},vl=/* @__PURE__ */ new WeakSet,yl=/* @__PURE__ */ new WeakMap,bl=(e,t)=>{if(t.length===0)return e;let n={...e};return vl.has(e)&&vl.add(n),yl.set(n,[...t,...yl.get(e)??[]]),n},xl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Dl(e,(e,r)=>xl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Sl=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Cl=/* @__PURE__ */ new WeakMap,wl=e=>Cl.get(e)??e.name,Tl=(e,t)=>(wl(t)!==e.name&&Cl.set(e,wl(t)),e),El=(e,t)=>Tl(e.kind===`Function`?{...e,bounds:Sl(e.bounds,e=>t(e,[])),body:t(e.body,yc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Dl=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>El(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Sl(e.bounds,n),body:t(e.body,yc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,vc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,vc(e.bound.pattern))};case`SetMap`:return{...e,bounds:Sl(e.bounds,n),expression:t(e.expression,yc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Ol=(e,t)=>{Dl(e,(e,n)=>(t(e,n),e))},kl=`LAMBDA`,Al=e=>`${e}@SUBSTITUTION`,jl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(jl),Ml=(e,t)=>{if(e.kind!==`Identifier`)return!jl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!jl(n.body)},Nl=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return Ol(e,(e,n)=>r.push(...Nl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Pl=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Fl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Il=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ll=(e,t)=>e.map(e=>({pattern:Il(e.pattern,t),set:e.set})),Rl=(e,t)=>e.kind===`Function`?{...e,bounds:Ll(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},zl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Tl({...Rl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ll(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Il(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Il(e.bound.pattern,n),set:e.bound.set}};default:return e}},Bl=e=>`${e}@ENABLED`,Vl=(e,t)=>e.modes.get(t)??e,Hl=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),Ul=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ul(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Hl(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ul(r.body,t,/* @__PURE__ */ new Map):void 0},Wl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Hl(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Bl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Xl(e.expression,Vl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Xl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Xl(e.subscript,Vl(t,`Primed`),n),location:r},Xl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ul(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Bl(r),location:e.location},location:e.location},Xl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Gl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ec}),Kl=(e,t)=>e.map(e=>Gl(e.name,t)),ql=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:Kl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Jl=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...Kl(t,r),...i.map(e=>Gl(e,r))],location:r},location:r}},Yl=(e,t)=>e.instantiation.isParameterized(t)?Ql(e,t):void 0,Xl=(e,t,n)=>{let i=e=>Xl(e,t,n),a=t.instantiation,o=a.params,s=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Xl(e.expression,Vl(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Xl(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Vl(t,`Enabled`),n)};let c=Wl(e,t,n);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let n=a.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Ml(n,a)))return bl(n,[e]);if(n&&r){let t=Al(e.name);return r.set(t,n),Gl(t,e.location)}let i=Yl(t,e.name);if(i===void 0)return e;if(o.length===0)return{...e,name:i};let s=a.getDefinition(e.name);return s&&sc(s)>0?Jl(i,o,sc(s),e.location):{kind:`Apply`,operator:i,args:Kl(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let n=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||vl.has(e),l=e=>(c&&vl.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:n,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...n],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:kl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:kl,args:n,resolution:ec},location:e.location};if(s)throw new r(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Yl(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Kl(o,e.location),...n]}}if(e.kind===`OperatorReference`&&s(e.operator)){let n=a.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return bl(n,[e]);let r=Yl(t,e.operator);if(r===void 0)return e;let i=a.getDefinition(e.operator);return o.length>0&&i?Jl(r,o,sc(i),e.location):{...e,operator:r}}let l=Pl(t),u=Dl(e,(e,r)=>r.length===0?i(e):Xl(e,t,Fl(n,r,l)));return zl(u,n,l)},Zl=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Gl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ql=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Pl(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Rl(El(i,(e,t)=>Xl(e,s,Fl(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&yl.set(l,[u,...yl.get(i.body)??[]]),Zl({...c,body:l},r.params,i.location)}):t},$l=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Nl(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Yl(i,e)??e,getQualifiedKey:t=>{let n=Yl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Zl(r,e.params,r.location)):t}}},eu=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(eu),tu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Dl(e,e=>tu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>oc(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},nu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ru=(e,t)=>e.definitions.some(e=>eu(e.body))||e.assumptions.some(e=>eu(e.expression))||e.theorems.some(e=>{let t=nu(e);return t!==void 0&&eu(t)})?{...e,definitions:e.definitions.map(e=>El(e,e=>tu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:tu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=nu(e);return n===void 0?e:{...e,statement:tu(n,t,[])}})}:e,iu=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),au={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},ou=(e,t)=>{let n=au[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},su=(e,t)=>`${e}${t}`,cu=(e,t,n)=>`${e}${t}${n}`,lu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},uu=(e,t,n)=>`${e},${t},${n}`,du=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),fu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),pu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),mu=(e,t)=>{t.constraints.forEach((t,n)=>fu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>pu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},hu=(e,t,n,r)=>({...du(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),gu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,_u=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,vu=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...hu(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),yu=hu(`$Set`,0,[2],[1]),bu=hu(`$Junction`,0,[3],[1]),xu=hu(`$Choose`,0,[2],[1]),Su=hu(`$Function`,0,[3],[1]),Cu=hu(`$FcnApply`,0,[2,2],[1,1]),wu=hu(`$RcdSelect`,0,[2,0],[1,1]),Tu=hu(`'`,2,[1],[0]),Eu=hu(`ENABLED`,1,[2],[0]),Du=hu(`[]`,3,[3],[0]),Ou=hu(`$SquareAct`,2,[2,1],[0,0]),ku=hu(`$WF`,3,[1,2],[0,0]),Au=hu(`$TemporalExists`,3,[3],[0]),ju=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Mu=e=>e.map(e=>({name:e,arity:0})),Nu=(e,t)=>t.location.range?a(`${e}.`,t.location.range):new r(`${e} at line ${t.location.line}, column ${t.location.column}`),Pu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Fu=e=>e.kind!==`Let`&&e.kind!==`Label`,Iu=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=vu.get(t)??iu.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=du(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(cu(e,n,t))}),pu(r.argConstraints,su(e,n),t.data.level),mu(r,t.data)}),r},a=(e,t,n=[],i=[])=>{let a=e=>i.includes(e);if(t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>gu(e,n))throw new r(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new r(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},s=(t,n,r)=>e.conditions.has(uu(t,n,r)),c=du(Math.max(e.level,...t.filter((t,n)=>_u(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{_u(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>fu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||fu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>fu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||fu(c.constraints,t,gu(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>fu(c.constraints,e,gu(r,a)))}))}),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);n?.kind===`Operator`&&fu(c.constraints,t.param,gu(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>pu(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>pu(c.argConstraints,su(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&pu(c.argConstraints,su(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);n&&pu(c.argConstraints,su(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(lu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(cu(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(cu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(cu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,Mu(e.params),e.body,t)};let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=du();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:du()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=ju(n,Mu(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Nu(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Nu(`Action used where only temporal formula or state predicate allowed`,e);Pu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Fu(n)&&n.kind!==r)throw Nu(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>mu(i,v(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof r)||t.sany?t:Nu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return du();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=s(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(bu,n)}case`Prime`:case`Unchanged`:return c(Tu,[e.expression],t);case`Enabled`:return c(Eu,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Du,[n])}case`If`:return c(bu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(bu,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(bu,[e.body],t,e.bounds.map(e=>e.set),yc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Nu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Au:bu,[e.body],t,[],e.names);case`Choose`:return c(xu,[e.body],t,e.set?[e.set]:[],vc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(yu,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(yu,[e.predicate],t,[e.bound.set],vc(e.bound.pattern));case`SetMap`:return c(yu,[e.expression],t,e.bounds.map(e=>e.set),yc(e.bounds));case`FunctionConstruction`:return c(Su,[e.body],t,e.bounds.map(e=>e.set),yc(e.bounds));case`Record`:return c(Su,e.fields.map(e=>e.value),t);case`RecordSet`:return c(yu,e.fields.map(e=>e.value),t);case`Except`:return c(yu,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Cu,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(yu,e.args,t)}]);case`Bracket`:return du();case`FieldAccess`:return a(wu,[o(e.record,t),{kind:`Value`,data:du()}]);case`BoxAction`:case`AngleAction`:return c(Ou,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(ku,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return du()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,ju(t,Mu(e.names))),i;default:return Ol(e,(e,n)=>a(e,r,ju(t,Mu(n)))),i}},_=(e,t,n,r)=>{let i=ju(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...du(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(su(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(cu(e.name,n,t.name))).map(e=>uu(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(lu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=lu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...du(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},Lu=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Lu(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=du(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),mu(a,e)}),a},Ru=(e,t,n,r)=>{let i=Iu(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Lu(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=m(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:m(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=gl([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Lu(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw te(n)}})),...n],r);if(l.length>0)throw te(l,!1,void 0,r)},zu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Bu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Vu=/* @__PURE__ */ new Set([...zu,...Bu,`Enabled`]),Hu=/* @__PURE__ */ new Set([`~>`,`-+->`]),Uu=/* @__PURE__ */ new Set([...Hu,`\\cdot`]),Wu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Gu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Ku=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),qu=(e,t)=>Wu.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ju=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(zu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Bu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Hu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Vu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Uu.has(e.operator))&&(r[0]|=1),Vu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=ht(e);if(u!==void 0&&!M(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{qu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Gu.has(u)&&(r[0]|=8),Ku.has(u)&&(r[0]|=256),!a&&qu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Yu=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Xu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Zu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Ju(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Yu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Yu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Xu(t[e],l[e*r])))),p=Yu(a,r,f,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&270:e),words:r}},Qu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?$u(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},$u=(e,t)=>{let n=t.facts.words,r=Ju(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Qu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Xu(e.callee,r[0])||(i[0]|=r[0]&270)}),i},ed=(e,t)=>!(Qu(e,t)[0]&1),td={any:2,repeated:4,streamed:8,replayed:260},nd=(e,t,n)=>($u(e,t)[0]&td[n])!==0,rd=(e,t,n=`any`)=>(Qu(e,t)[0]&td[n])!==0,id=(e,t)=>{let n=Qu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},ad=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},od=(e,t)=>{let n=$u([e],t);return n[0]&16?void 0:ad(n)},sd=(e,t)=>!!($u([e],t)[0]&1),cd=(e,t,n)=>new x(`Applying ${e} to the following value,\nwhich is not ${t}:\n${R(n)}`),ld=e=>un(e)?L(e):void 0,ud=`a function with a finite domain`,dd=(e,t,n)=>{let r=z(e,t,n),i=ld(r);if(!i)throw cd(n,ud,r);return i},fd=(e,t)=>{let n=z(e,1,t),r=ld(n),i=r&&gd(r,z(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw ss(`second`,t,`bag`,n);return i},pd=(e,t,n)=>{let r=t[n];if(!r||!hd(r))throw ss(n===0?`first`:`second`,`(+)`,`bag`,z(e,n,`(+)`));return r},md=(e,t)=>{if(!P(e)||!F(e))throw t();return I(e).elements},hd=e=>e.range.every(e=>typeof e==`number`&&e>0),gd=(e,t)=>{let n=e.domain.findIndex(e=>Ur(t,e));return n===-1?void 0:e.range[n]},_d=e=>{if(typeof e==`number`)return e;let t=`tlc2.value.impl.${Ss(e)}`;throw new y(`class ${t} cannot be cast to class tlc2.value.impl.IntValue (${t} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},vd=(e,t)=>{let n=_d(e)+_d(t);if(gs(n))throw _s(`${e}+${t}`);return n},yd=(e,t,n)=>{let r=_d(e.range[t]),i=gd(n,e.domain[t]);if(i===void 0)return r;let a=r-_d(i);if(gs(a))throw _s(`${r}-${i}`);return a},bd=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>Ur(t,e[0]));i?i[1]=vd(i[1],n):e.push([t,n])},xd=e=>e.domain.map((t,n)=>[t,e.range[n]]),Sd=rr([],[]),Cd=e=>[fs(`EmptyBag`,Sd),B(`IsABag`,1,e=>{let t=ld(z(e,0,`IsABag`));return t!==void 0&&hd(t)}),B(`BagCardinality`,1,e=>{let t=z(e,0,`BagCardinality`);return dd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw cd(`BagCardinality`,`a bag`,t);return vd(e,n)},0)}),B(`BagIn`,2,e=>{let t=fd(e,`BagIn`);return t!==void 0&&t>0}),B(`CopiesIn`,2,e=>fd(e,`CopiesIn`)??0),B(`\\oplus`,2,e=>{let t=[0,1].map(t=>ld(z(e,t,`(+)`))),n=pd(e,t,0),r=pd(e,t,1),i=xd(n);return r.domain.forEach((e,t)=>bd(i,e,r.range[t],n.domain.length)),Qr(i)}),B(`\\ominus`,2,e=>{let t=z(e,0,`(-)`),n=z(e,1,`(-)`),r=ld(t),i=ld(n);if(!r)throw ss(`first`,`(-)`,`bag`,t);if(!i)throw ss(`second`,`(-)`,`bag`,n);return Qr(r.domain.flatMap((e,t)=>{let n=yd(r,t,i);return n>0?[[e,n]]:[]}))}),B(`BagUnion`,1,e=>{let t=z(e,0,`BagUnion`),n=md(t,()=>cd(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Sd;let r=e=>{let n=ld(e);if(!n)throw new x(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(t)}`);return n},i=xd(r(n[0]));return n.slice(1).forEach(e=>{let t=r(e);t.domain.forEach((e,n)=>bd(i,e,t.range[n]))}),Qr(i)}),B(`\\sqsubseteq`,2,e=>{let t=z(e,0,`\\sqsubseteq`),n=z(e,1,`\\sqsubseteq`),r=ld(t),i=ld(n);if(!r)throw cd(`\\sqsubseteq`,ud,t);if(!i)throw cd(`\\sqsubseteq`,ud,n);return r.domain.every((e,t)=>{let n=gd(i,e);return _d(r.range[t])<=(n===void 0?0:_d(n))})}),ps(`BagOfAll`,2,e=>{let t=ds(e,0,`BagOfAll`),n=z(e,1,`BagOfAll`),r=ld(n);if(!r)throw ss(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>bd(i,t.call([e]),r.range[n])),Qr(i)}),B(`SubBag`,1,t=>{let n=z(t,0,`SubBag`);if(!un(n))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Cs(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=L(n),i=I(qr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${R(r)}, which is not in its domain`);return Kr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>rr(e.map(e=>e[0]),e.map(e=>e[1]))))}),B(`BagToSet`,1,e=>ua(dd(e,0,`BagToSet`))),B(`SetToBag`,1,e=>{let t=z(e,0,`SetToBag`),n=md(t,()=>cd(`BagToSet`,ud,t));return rr([...n],n.map(()=>1))})],wd={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Td={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Ed=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Dd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
79
|
`],[`r`,`\r`],[`f`,`\f`]]),Od=1024,kd=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=H.none,s=0,c=[wd.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===wd.emptyArray||e===wd.nonemptyArray?`[${u[t]}]`:e===wd.emptyDocument||e===wd.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new y(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
80
80
|
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new y(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
81
81
|
`.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
@@ -84,7 +84,7 @@ See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`)
|
|
|
84
84
|
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=b();if(e===void 0)throw m();return e},x=()=>{let t=Ed.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return H.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return H.none}return n+r<e.length&&g(e[n+r])?H.none:(n+=r,t.token)},S=()=>{let t=Td.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===Od)return H.none;let a=e[n+i];if(a===`-`){if(t===Td.none)t=Td.sign;else if(t===Td.exponentE)t=Td.exponentSign;else return H.none}else if(a===`+`){if(t!==Td.exponentE)return H.none;t=Td.exponentSign}else if(a===`e`||a===`E`){if(t!==Td.digit&&t!==Td.fractionDigit)return H.none;t=Td.exponentE}else if(a===`.`){if(t!==Td.digit)return H.none;t=Td.decimal}else if(a<`0`||a>`9`){if(g(a))return H.none;break}else if(t===Td.sign||t===Td.none)r=a===`0`,t=Td.digit;else if(t===Td.digit){if(r)return H.none}else t===Td.decimal?t=Td.fractionDigit:(t===Td.exponentE||t===Td.exponentSign)&&(t=Td.exponentDigit)}return i===Od||t!==Td.digit&&t!==Td.fractionDigit&&t!==Td.exponentDigit?H.none:(s=i,H.number)},te=()=>{let t=c.length-1,r=c[t];if(r===wd.emptyArray)c[t]=wd.nonemptyArray;else if(r===wd.nonemptyArray){let e=ee();if(e===`]`)return H.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===wd.emptyObject||r===wd.nonemptyObject){if(c[t]=wd.danglingName,r===wd.nonemptyObject){let e=ee();if(e===`}`)return H.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=ee();if(e===`"`)return H.doubleQuotedName;if(e===`'`)return h(),H.singleQuotedName;if(e===`}`){if(r!==wd.nonemptyObject)return H.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return H.unquotedName;throw p(`Expected name`)}else if(r===wd.danglingName){c[t]=wd.nonemptyObject;let r=ee();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===wd.emptyDocument){if(b()===void 0)return H.eof;n--,e.startsWith(`)]}'
|
|
85
85
|
`,n)&&(n+=5),c[t]=wd.nonemptyDocument}else if(r===wd.nonemptyDocument){if(b()===void 0)return H.eof;h(),n--}let i=b();if(i===void 0){if(r===wd.emptyDocument)return H.eof;throw m()}if(i===`]`&&r===wd.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==wd.emptyArray&&r!==wd.nonemptyArray)throw p(`Unexpected value`);return h(),n--,H.null}if(i===`'`)return h(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;n--;let a=x();if(a!==H.none)return a;let o=S();if(o!==H.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),H.unquoted},C=()=>(o===H.none&&(o=te()),o),w=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=Dd.get(t);if(a!==void 0)return a;if(t===`
|
|
86
86
|
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},ne=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+w(),o=n):s===`
|
|
87
|
-
`&&(r++,i=n)}throw p(`Unterminated string`)},T=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},re=e=>{if(c.length-1>=255)throw new y(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ae=()=>{let e=C();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=C(),t=e===H.unquotedName?T():ne(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},se=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?T():ne(t===H.singleQuoted?`'`:`"`),ce=()=>{let e=C();if(e===H.beginArray){re(wd.emptyArray);let e=[];for(;ae();)e.push(ce());return ie(),e}if(e===H.beginObject){re(wd.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return ie(),e}let t=se(e);return o=H.none,u[c.length-1]++,t};if(C()===H.eof)return null;let le=ce();return a=!1,le!==null&&C(),le},Ad=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),jd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Md=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Nd=e=>{if(!un(e))return;let t=L(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?ui(n):void 0},Pd=(e,t)=>{let n=`tlc2.value.impl.${Ss(e)}`,r=`tlc2.value.impl.${t}`;return new y(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Fd=e=>new y(`Cannot convert value: unsupported value type tlc2.value.impl.${Ss(e)}`),Id=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ld=e=>`[${e.map(Vd).join(`,`)}]`,Rd=e=>`{${yn(e).map(e=>`${Id(typeof e[0]==`string`?e[0]:R(e[0]))}:${Vd(e[1])}`).join(`,`)}}`,zd=e=>{let t=L(e),n=Bi(t);return n?Ld(n):Rd(t)},Bd=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Vd=e=>typeof e==`string`?Id(e):typeof e==`object`?e.kind===`ModelValue`?Id(e.name):Ss(e)===`RecordValue`?Rd(L(e)):Hd(e):String(e),Hd=e=>{let t=Ss(e);if(t===`TupleValue`)return Ld(L(e).range);if(Bd(t))return zd(e);if(fi(e))return Ld(I(e).elements);throw Fd(e)},Ud=e=>e.map(e=>`${Vd(e)}\n`).join(``),Wd=e=>{let t=Ss(e);if(t===`RecordValue`)return Rd(L(e));if(t===`TupleValue`)return`{${L(e).range.map((e,t)=>`"${t}":${Vd(e)}`).join(`,`)}}`;if(Bd(t))return zd(e);throw Fd(e)},Gd=e=>{if(e===null)throw new y(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Bn(e);if(Array.isArray(e))return li(e.map(Gd));if(e instanceof Map)return ui([...e].map(e=>[Bn(e[0]),Gd(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||gs(t))throw new y(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Kd=e=>{if(typeof e!=`string`)throw new y(`Cannot cast tlc2.value.impl.${Ss(e)} to tlc2.value.impl.StringValue`);return e},qd=(e,t)=>{let n=ca(e,t);if(typeof n!=`string`)throw Pd(n,`StringValue`);return n},Jd=e=>{if(!jd.has(e.toLowerCase()))throw Md.has(e.toLowerCase())?new t(`IOUtils!Serialize does not support the charset ${e}`):new y(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Yd=(e,n,r,i)=>{let a=r.find(e=>!Ad.has(e));if(a!==void 0)throw new y(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new y(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new y(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new t(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=e.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new y(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new y(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?e.writeFile?.(n,i):e.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Xd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Zd=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new y(`${t} (No such file or directory)`);return n},Qd=e=>[Ts(ms(`ToJson`,1,e=>Bn(Vd(z(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonArray`,1,e=>Bn(Hd(z(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonObject`,1,e=>Bn(Wd(z(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`JsonSerialize`,2,t=>{let n=Kd(z(t,0,`JsonSerialize`)),r=z(t,1,`JsonSerialize`);if(!Bi(r)&&!Nd(r))throw ss(`second`,`JsonSerialize`,`sequence or record`,r);return Xd(e,n),e.writeFile?.(n,Vd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`ndJsonSerialize`,2,t=>{let n=Kd(z(t,0,`ndJsonSerialize`)),r=z(t,1,`ndJsonSerialize`),i=Bi(r);if(!i)throw ss(`second`,`ndJsonSerialize`,`sequence`,r);return Xd(e,n),e.writeFile?.(n,Ud(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`JsonDeserialize`,1,t=>Gd(kd(Zd(e,Kd(z(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Ts(ms(`ndJsonDeserialize`,1,t=>li(Zd(e,Kd(z(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Gd(kd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],$d=(e,t)=>[Ts(js(`Serialize`,3,(n,r)=>{let i=Ms(n,2,`Serialize`)(),a=Nd(i);if(!a)throw ss(`third`,`ndJsonSerialize`,`sequence`,i);if(qd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ms(n,0,`Serialize`)(),s=Bi(o);if(!s)throw ss(`first`,`Serialize`,`sequence`,o);let c=Ms(n,1,`Serialize`)();if(typeof c!=`string`)throw ss(`second`,`ndJsonSerialize`,`sequence`,c);let l=ca(a,`openOptions`);if(Ss(l)!==`TupleValue`)throw Pd(l,`TupleValue`);let u=qd(a,`charset`),d=L(l).range.map(e=>{if(typeof e!=`string`)throw Pd(e,`StringValue`);return e});return Jd(u),Yd(e,c,d,Ud(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],ef={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},tf=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=er(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(ef.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(ef.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(ef.boolean),o(+!!e);return}if(typeof e==`number`){o(ef.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(ef.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(ef.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),P(e)){let t=I(e).elements;o(ef.set),c(t.length),t.forEach(f);return}let p=L(e),m=or(e);m===`tuple`?(o(ef.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(ef.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(ef.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ae(Uint8Array.from(t))},nf=e=>[Ts(ms(`_TLCTraceSerialize`,2,t=>{let n=Kd(z(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,tf(z(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],rf=25214903917n,af=(1n<<48n)-1n,of=e=>{let t=(BigInt.asUintN(64,e)^rf)&af,n=e=>(t=t*rf+11n&af,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^rf)&af},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},sf=[],cf=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},lf=()=>{for(let e=1277011;sf.length<1341;e++)cf(e)&&sf.push(e);return sf},uf=e=>{let t=lf(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},df=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},ff=e=>{for(let t=Math.max(e,9);;t++){let e=df(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},pf=(e,t,n)=>{if(t<=0)return[];let r=ff(t),i=BigInt(n.nextInt(t)),a=BigInt(uf(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},mf=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$t),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},hf=(1n<<63n)-1n-24n,gf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(hf*BigInt(n)+i)%t;return r<0n?r+t:r})},_f=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,vf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=si(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>rr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>ui(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:li}}},yf=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,bf=(e,t,n,r)=>{if(Mi(t))return[];let i=r===`1.7.4`?mf:pf;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=yf(t,r)?void 0:vf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?gf(e,t,n):i(e,Number(t),n)).map(e=>a.create(_f(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},xf=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...cs(e.domain,`RandomElement`,e).elements];return rr(n,n.map(()=>xf(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return ui(e.names.map((n,r)=>[n,xf(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return li(e.factors.map(e=>xf(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new y(`Attempted to retrieve out-of-bounds element from the interval value ${R(e)}.`);return e.low+r}let n=cs(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new y(`Index ${r} out of bounds for length ${n.length}`);return n[r]},Sf=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ss(t,n,`nonnegative integer`,e);return e},Cf=(e,t,n,r)=>Kr(Array.from({length:t},()=>Kr(e.filter(()=>r.nextDouble()<n)))),wf=(e,t)=>{let n=`RandomSetOfSubsets`,r=Sf(z(e,0,n),`first`,n),i=Sf(z(e,1,n),`second`,n),a=z(e,2,n);if(!P(a)||!F(a))throw ss(`third`,n,`finite set`,a);let o=I(a).elements;if(o.length<31&&r>2**o.length)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ss(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Cf(o,r,o.length===0?0:i/o.length,t.getRandom())},Tf=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Ef=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Df=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Tf.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Ef.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Of=e=>B(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Sf(z(t,0,n),`first`,n),i=z(t,1,n);if(typeof i!=`string`)throw ss(`second`,n,`string literal representing a probability`,i);let a=Df(i);if(a===void 0||a<0||a>1)throw ss(`second`,n,`string literal does not represent a parsable probability`,i);let o=z(t,2,n);if(!P(o)||Un(o)||!Li(o))throw ss(`third`,n,`finite set`,o);let s=Fi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Cf(I(o).elements,r,a,e.getRandom())}),kf=e=>[Ts(B(`RandomSubset`,2,t=>{let n=Sf(z(t,0,`RandomSubset`),`first`,`RandomSubset`),r=z(t,1,`RandomSubset`);if(!fi(r)||!Li(r))throw ss(`second`,`RandomSubset`,`a finite set`,r);let i=yf(r,e.version);if(i&&i.reduce((e,t)=>e*I(t).elements.length,1)>rn())throw new y(an());return Kr(bf(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),B(`RandomSetOfSubsets`,3,t=>wf(t,e)),B(`TestRandomSetOfSubsets`,3,t=>li(Array.from({length:5},()=>I(wf(t,e)).elements.length)))],Af=(e,t=0n)=>{let n=of(t),r=of(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>ui([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:bo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},jf=e=>Qr([...e.possibleCounts].map(([e,t])=>[e,t])),Mf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,jf(e)]]),Nf=e=>ui([[`name`,e??`UnnamedAction`],[`location`,ui([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Pf=/* @__PURE__ */ new WeakSet,Ff=(e,t)=>{let n=ui([[`action`,Kr(e)],[`state`,Kr(t)]]);return Pf.add(n),n},If=(e,t,n)=>{let r=e.map((e,t)=>li([t+1,ui(Object.entries(e))])),i=r.slice(1).map((e,n)=>li([r[n],t[n],e])),a=n?[li([r[r.length-1],n.action,r[n.start]])]:[];return Ff([...i,...a],r)},Lf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Mf(e).get(t)},Rf=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0||!e.pause)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),R(r));else throw new x(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(n)}`)},zf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Bf=e=>e.every(e=>e!==void 0),Vf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Vf(e,t,n)),o=i?pg(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Vf(o.body,t,n))),Math.max(0,...a)},Hf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[js(`AssertError`,2,e=>{let n=ds(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw new y(`In computing AssertError, a non-string expression (${zf(n)}) was used as the err of an AssertError(err, exp).`);let r=Ms(e,0,`AssertError`)();try{Ms(e,1,`AssertError`)()}catch(e){if(e instanceof y)return It(e.message,t.isTool)===r;throw e}return!1}),ms(`TLCGetOrDefault`,2,e=>Lf(t,z(e,0,`TLCGetOrDefault`))??z(e,1,`TLCGetOrDefault`)),ms(`Trace`,0,(e,n)=>{let r=n?.environment.variables??[],i=n?.state??r.map(()=>void 0);if(!n||!Bf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new y(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return n.state?li(t.getBehavior(i).map(e=>{let r=n.environment.variables.map((t,n)=>[t,e[n]]),i=t.getSimulationValue?.(`action`,e);return ui(i===void 0?r:[[`_action`,i],...r])})):li([ui([])])}),ms(`CounterExample`,0,()=>t.counterExample??Ff([],[])),B(`ToTrace`,1,e=>{let t=z(e,0,`ToTrace`);if(typeof t!=`object`||!Pf.has(t))throw new x(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(t)}`);let n=I(ca(t,`state`)).elements.map(e=>Bi(e)??[]);return li(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),B(`TLCModelValue`,1,e=>{let t=z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new x(`The argument of ModelValue should be a string, but instead it is:\n${R(t)}`);return $n(t)}),js(`TLCDefer`,1,(e,n)=>{let r=ds(e,0,`TLCDefer`).expression;return n&&r&&(t.deferred=e=>{W(r,{...n,next:e})}),!0}),B(`TLCNoOp`,1,e=>z(e,0,`TLCNoOp`)),{...js(`PickSuccessor`,1,(n,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(!Bf(i)||r?.next&&t.isSeen(i))return!0;let a=ds(n,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new y(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Cs(o)}) was used as the condition of an IF.\n${a.expression?zf(a.expression):``}`);if(o||!r?.next||!r.state||!Bf(r.state))return!0;let s=t.getSuccessorAction(r.state,i);throw e(Tt(t.isTool,St.moduleOverrideStdout,Ct.none,`Extend behavior of length ${t.getLevel(r.state)} with a "${s?.name}" step [<Action ${s?.location.range&&m(s.location.range)}>]? (Yes/no/explored/states/diff):`)),new ne}),isActionLevel:!0},js(`TLCCache`,2,(e,r)=>{let a=ds(e,0,`TLCCache`),o=ka(Ms(e,1,`TLCCache`)()),s=a.expression;if(!s||!r)return a.call([]);let c=Vf(s,r.environment,/* @__PURE__ */ new Set);if(c===2)return a.call([]);let l=c===1;if(l&&r.state&&t.getSimulationValue===void 0)return a.call([]),a.call([]);let u=l&&r.state?i(r.state):n,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=a.call([]);return d.set(o,p),p}),B(`TLCFP`,1,e=>{let t=z(e,0,`TLCFP`),n=ba(t);if(n)throw n;return Number(BigInt.asIntN(32,bo([t])))}),js(`TLCEvalDefinition`,1,(e,t)=>{let n=Ms(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new x(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${R(n)}`);let r=t?pg(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new x(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new x(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?W(r.body,t):W({kind:`Identifier`,name:n,location:r.location},t)})]},Uf=(e,t)=>[ms(`_Track`,2,e=>{let n=String(z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,z(e,0,`_Track`)===!0?r+1:r),!0}),ms(`_Counts`,0,()=>jf(t)),ms(`_CheckName`,1,n=>{let r=String(z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(jf(t),!0)),!1)}),ms(`_PrintCounts`,0,()=>(e(R(jf(t),!0)),!0))],Wf=e=>`${e.getUTCFullYear()}.${Lt(e.getUTCMonth()+1)}.${Lt(e.getUTCDate())}.${Lt(e.getUTCHours())}${Lt(e.getUTCMinutes())}${Lt(e.getUTCSeconds())}`,Gf=e=>Qr([...e].map(([e,t])=>[e,li([t])])),Kf=e=>ar($r(e),`record`),qf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Jf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Yf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Xf=(e,t,n)=>{if(e.version===`1.7.4`?!Jf.has(t)||!e.isStarted&&Yf.has(t):!e.isStarted&&qf.has(t))throw new x(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Kf([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Kf([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,qa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Kf([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Bn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Bn(Wf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Nf(void 0);case`all`:return Gf(e.registers);case`all:named`:return Gf(Mf(e))}if(t.startsWith(`s:`)){let n=Mf(e).get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Bn(e.properties.get(t.slice(2))??t);throw new x(`TLCGet(${t}) was undefined.`)},Zf=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new x(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(t)}`);return Xf(e,t,n?.state)},Qf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Qf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),$f=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach($f),e.kind===`Function`&&e.range.forEach($f))},ep=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return L(e);default:return I(e)}},tp=(e,t)=>[B(`Print`,2,t=>(e(Ba([z(t,0,`Print`),z(t,1,`Print`)]).map(N).join(` `)),z(t,1,`Print`))),B(`PrintT`,1,t=>(e(N(Ba([z(t,0,`PrintT`)])[0])),!0)),B(`Assert`,2,e=>{if(z(e,0,`Assert`)!==!0)throw new x(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(R(z(e,1,`Assert`)))}`,S.assertViolation);return!0}),B(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),B(`:>`,2,e=>Qr([[z(e,0,`:>`),z(e,1,`:>`)]])),B(`@@`,2,e=>{let t=z(e,0,`@@`),n=z(e,1,`@@`),r=un(t)?L(t):void 0,i=un(n)?L(n):void 0;if(!r)throw ss(`first`,`@@`,`function`,t);if(!i)throw ss(`second`,`@@`,`function`,n);let a=vn(r),o=vn(i).filter(e=>!a.some(t=>Ur(e[0],t[0])));return $r([...a,...o])}),B(`ToString`,1,e=>Bn(R(z(e,0,`ToString`),!0))),{...js(`TLCEval`,1,(e,t)=>{let n=ep(Ms(e,0,`TLCEval`)());return t===void 0&&$f(n),n}),isStateLevel:!1},B(`Permutations`,1,e=>{let t=cs(z(e,0,`Permutations`),`Permutations`).elements;return Kr(Qf(t).map(e=>Qr(t.map((t,n)=>[t,e[n]]))))}),ps(`SortSeq`,2,e=>{let t=z(e,0,`SortSeq`),n=Bi(t);if(!n)throw ss(`first`,`SortSeq`,`natural number`,t);let r=ds(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ss(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),li(a)}),t.version===`1.7.4`?Ts({...ms(`TLCGet`,1,(e,n)=>Zf(t,z(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ts(js(`TLCGet`,1,(e,n)=>Zf(t,Ms(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ms(`TLCSet`,2,n=>(Rf(t,e,z(n,0,`TLCSet`),z(n,1,`TLCSet`)),!0)),fs(`Any`,qn),B(`RandomElement`,1,e=>xf(z(e,0,`RandomElement`),t.getRandom()))],np=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),rp=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],ip=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),ap=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),op=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),sp=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
87
|
+
`&&(r++,i=n)}throw p(`Unterminated string`)},T=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},re=e=>{if(c.length-1>=255)throw new y(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ae=()=>{let e=C();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=C(),t=e===H.unquotedName?T():ne(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},se=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?T():ne(t===H.singleQuoted?`'`:`"`),ce=()=>{let e=C();if(e===H.beginArray){re(wd.emptyArray);let e=[];for(;ae();)e.push(ce());return ie(),e}if(e===H.beginObject){re(wd.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return ie(),e}let t=se(e);return o=H.none,u[c.length-1]++,t};if(C()===H.eof)return null;let le=ce();return a=!1,le!==null&&C(),le},Ad=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),jd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Md=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Nd=e=>{if(!un(e))return;let t=L(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?ui(n):void 0},Pd=(e,t)=>{let n=`tlc2.value.impl.${Ss(e)}`,r=`tlc2.value.impl.${t}`;return new y(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Fd=e=>new y(`Cannot convert value: unsupported value type tlc2.value.impl.${Ss(e)}`),Id=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ld=e=>`[${e.map(Vd).join(`,`)}]`,Rd=e=>`{${yn(e).map(e=>`${Id(typeof e[0]==`string`?e[0]:R(e[0]))}:${Vd(e[1])}`).join(`,`)}}`,zd=e=>{let t=L(e),n=Bi(t);return n?Ld(n):Rd(t)},Bd=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Vd=e=>typeof e==`string`?Id(e):typeof e==`object`?e.kind===`ModelValue`?Id(e.name):Ss(e)===`RecordValue`?Rd(L(e)):Hd(e):String(e),Hd=e=>{let t=Ss(e);if(t===`TupleValue`)return Ld(L(e).range);if(Bd(t))return zd(e);if(fi(e))return Ld(I(e).elements);throw Fd(e)},Ud=e=>e.map(e=>`${Vd(e)}\n`).join(``),Wd=e=>{let t=Ss(e);if(t===`RecordValue`)return Rd(L(e));if(t===`TupleValue`)return`{${L(e).range.map((e,t)=>`"${t}":${Vd(e)}`).join(`,`)}}`;if(Bd(t))return zd(e);throw Fd(e)},Gd=e=>{if(e===null)throw new y(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Bn(e);if(Array.isArray(e))return li(e.map(Gd));if(e instanceof Map)return ui([...e].map(e=>[Bn(e[0]),Gd(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||gs(t))throw new y(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Kd=e=>{if(typeof e!=`string`)throw new y(`Cannot cast tlc2.value.impl.${Ss(e)} to tlc2.value.impl.StringValue`);return e},qd=(e,t)=>{let n=ca(e,t);if(typeof n!=`string`)throw Pd(n,`StringValue`);return n},Jd=e=>{if(!jd.has(e.toLowerCase()))throw Md.has(e.toLowerCase())?new t(`IOUtils!Serialize does not support the charset ${e}`):new y(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Yd=(e,n,r,i)=>{let a=r.find(e=>!Ad.has(e));if(a!==void 0)throw new y(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new y(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new y(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new t(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=e.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new y(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new y(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?e.writeFile?.(n,i):e.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Xd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Zd=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new y(`${t} (No such file or directory)`);return n},Qd=e=>[Ts(ms(`ToJson`,1,e=>Bn(Vd(z(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonArray`,1,e=>Bn(Hd(z(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonObject`,1,e=>Bn(Wd(z(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`JsonSerialize`,2,t=>{let n=Kd(z(t,0,`JsonSerialize`)),r=z(t,1,`JsonSerialize`);if(!Bi(r)&&!Nd(r))throw ss(`second`,`JsonSerialize`,`sequence or record`,r);return Xd(e,n),e.writeFile?.(n,Vd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`ndJsonSerialize`,2,t=>{let n=Kd(z(t,0,`ndJsonSerialize`)),r=z(t,1,`ndJsonSerialize`),i=Bi(r);if(!i)throw ss(`second`,`ndJsonSerialize`,`sequence`,r);return Xd(e,n),e.writeFile?.(n,Ud(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`JsonDeserialize`,1,t=>Gd(kd(Zd(e,Kd(z(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Ts(ms(`ndJsonDeserialize`,1,t=>li(Zd(e,Kd(z(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Gd(kd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],$d=(e,t)=>[Ts(js(`Serialize`,3,(n,r)=>{let i=Ms(n,2,`Serialize`)(),a=Nd(i);if(!a)throw ss(`third`,`ndJsonSerialize`,`sequence`,i);if(qd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ms(n,0,`Serialize`)(),s=Bi(o);if(!s)throw ss(`first`,`Serialize`,`sequence`,o);let c=Ms(n,1,`Serialize`)();if(typeof c!=`string`)throw ss(`second`,`ndJsonSerialize`,`sequence`,c);let l=ca(a,`openOptions`);if(Ss(l)!==`TupleValue`)throw Pd(l,`TupleValue`);let u=qd(a,`charset`),d=L(l).range.map(e=>{if(typeof e!=`string`)throw Pd(e,`StringValue`);return e});return Jd(u),Yd(e,c,d,Ud(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],ef={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},tf=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=er(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(ef.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(ef.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(ef.boolean),o(+!!e);return}if(typeof e==`number`){o(ef.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(ef.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(ef.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),P(e)){let t=I(e).elements;o(ef.set),c(t.length),t.forEach(f);return}let p=L(e),m=or(e);m===`tuple`?(o(ef.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(ef.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(ef.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ae(Uint8Array.from(t))},nf=e=>[Ts(ms(`_TLCTraceSerialize`,2,t=>{let n=Kd(z(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,tf(z(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],rf=25214903917n,af=(1n<<48n)-1n,of=e=>{let t=(BigInt.asUintN(64,e)^rf)&af,n=e=>(t=t*rf+11n&af,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^rf)&af},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},sf=[],cf=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},lf=()=>{for(let e=1277011;sf.length<1341;e++)cf(e)&&sf.push(e);return sf},uf=e=>{let t=lf(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},df=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},ff=e=>{for(let t=Math.max(e,9);;t++){let e=df(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},pf=(e,t,n)=>{if(t<=0)return[];let r=ff(t),i=BigInt(n.nextInt(t)),a=BigInt(uf(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},mf=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$t),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},hf=(1n<<63n)-1n-24n,gf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(hf*BigInt(n)+i)%t;return r<0n?r+t:r})},_f=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,vf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=si(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>rr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>ui(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:li}}},yf=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,bf=(e,t,n,r)=>{if(Mi(t))return[];let i=r===`1.7.4`?mf:pf;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=yf(t,r)?void 0:vf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?gf(e,t,n):i(e,Number(t),n)).map(e=>a.create(_f(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},xf=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...cs(e.domain,`RandomElement`,e).elements];return rr(n,n.map(()=>xf(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return ui(e.names.map((n,r)=>[n,xf(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return li(e.factors.map(e=>xf(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new y(`Attempted to retrieve out-of-bounds element from the interval value ${R(e)}.`);return e.low+r}let n=cs(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new y(`Index ${r} out of bounds for length ${n.length}`);return n[r]},Sf=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ss(t,n,`nonnegative integer`,e);return e},Cf=(e,t,n,r)=>Kr(Array.from({length:t},()=>Kr(e.filter(()=>r.nextDouble()<n)))),wf=(e,t)=>{let n=`RandomSetOfSubsets`,r=Sf(z(e,0,n),`first`,n),i=Sf(z(e,1,n),`second`,n),a=z(e,2,n);if(!P(a)||!F(a))throw ss(`third`,n,`finite set`,a);let o=I(a).elements;if(o.length<31&&r>2**o.length)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ss(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Cf(o,r,o.length===0?0:i/o.length,t.getRandom())},Tf=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Ef=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Df=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Tf.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Ef.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Of=e=>B(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Sf(z(t,0,n),`first`,n),i=z(t,1,n);if(typeof i!=`string`)throw ss(`second`,n,`string literal representing a probability`,i);let a=Df(i);if(a===void 0||a<0||a>1)throw ss(`second`,n,`string literal does not represent a parsable probability`,i);let o=z(t,2,n);if(!P(o)||Un(o)||!Li(o))throw ss(`third`,n,`finite set`,o);let s=Fi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Cf(I(o).elements,r,a,e.getRandom())}),kf=e=>[Ts(B(`RandomSubset`,2,t=>{let n=Sf(z(t,0,`RandomSubset`),`first`,`RandomSubset`),r=z(t,1,`RandomSubset`);if(!fi(r)||!Li(r))throw ss(`second`,`RandomSubset`,`a finite set`,r);let i=yf(r,e.version);if(i&&i.reduce((e,t)=>e*I(t).elements.length,1)>rn())throw new y(an());return Kr(bf(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),B(`RandomSetOfSubsets`,3,t=>wf(t,e)),B(`TestRandomSetOfSubsets`,3,t=>li(Array.from({length:5},()=>I(wf(t,e)).elements.length)))],Af=(e,t=0n)=>{let n=of(t),r=of(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>ui([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:bo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},jf=e=>Qr([...e.possibleCounts].map(([e,t])=>[e,t])),Mf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,jf(e)]]),Nf=e=>ui([[`name`,e??`UnnamedAction`],[`location`,ui([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Pf=/* @__PURE__ */ new WeakSet,Ff=(e,t)=>{let n=ui([[`action`,Kr(e)],[`state`,Kr(t)]]);return Pf.add(n),n},If=(e,t,n)=>{let r=e.map((e,t)=>li([t+1,ui(Object.entries(e))])),i=r.slice(1).map((e,n)=>li([r[n],t[n],e])),a=n?[li([r[r.length-1],n.action,r[n.start]])]:[];return Ff([...i,...a],r)},Lf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Mf(e).get(t)},Rf=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0||!e.pause)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),R(r));else throw new x(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(n)}`)},zf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Bf=e=>e.every(e=>e!==void 0),Vf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Vf(e,t,n)),o=i?pg(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Vf(o.body,t,n))),Math.max(0,...a)},Hf=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[js(`AssertError`,2,e=>{let t=ds(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new y(`In computing AssertError, a non-string expression (${zf(t)}) was used as the err of an AssertError(err, exp).`);let r=Ms(e,0,`AssertError`)();try{Ms(e,1,`AssertError`)()}catch(e){if(e instanceof y)return It(e.message,n.isTool)===r;throw e}return!1}),ms(`TLCGetOrDefault`,2,e=>Lf(n,z(e,0,`TLCGetOrDefault`))??z(e,1,`TLCGetOrDefault`)),ms(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Bf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new y(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?li(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return ui(i===void 0?r:[[`_action`,i],...r])})):li([ui([])])}),ms(`CounterExample`,0,()=>n.counterExample??Ff([],[])),B(`ToTrace`,1,e=>{let t=z(e,0,`ToTrace`);if(typeof t!=`object`||!Pf.has(t))throw new x(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(t)}`);let n=I(ca(t,`state`)).elements.map(e=>Bi(e)??[]);return li(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),B(`TLCModelValue`,1,e=>{let t=z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new x(`The argument of ModelValue should be a string, but instead it is:\n${R(t)}`);return $n(t)}),js(`TLCDefer`,1,(e,t)=>{let r=ds(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),B(`TLCNoOp`,1,e=>z(e,0,`TLCNoOp`)),{...js(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!Bf(a)||i?.next&&n.isSeen(a))return!0;let o=ds(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new y(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Cs(s)}) was used as the condition of an IF.\n${o.expression?zf(o.expression):``}`);if(s||!i?.next||!i.state||!Bf(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=t=>e(Tt(n.isTool,St.moduleOverrideStdout,Ct.none,t));for(;;){u(`Extend behavior of length ${n.getLevel(c)} with a "${l?.name}" step [<Action ${l?.location.range&&m(l.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new ne;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)u(`${Wa(n.toRecord(c)).trimEnd()}\n~>\n${Wa(n.toRecord(a)).trimEnd()}`);else if(e[0]===`d`)u(Wa(n.toRecord(a),n.toRecord(c)));else if(e[0]===`e`){if(n.getSimulationValue===void 0)throw new t(`tla-ts can't mark a state explored while it checks a model.`);u(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},js(`TLCCache`,2,(e,t)=>{let i=ds(e,0,`TLCCache`),o=ka(Ms(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Vf(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),B(`TLCFP`,1,e=>{let t=z(e,0,`TLCFP`),n=ba(t);if(n)throw n;return Number(BigInt.asIntN(32,bo([t])))}),js(`TLCEvalDefinition`,1,(e,t)=>{let n=Ms(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new x(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${R(n)}`);let r=t?pg(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new x(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new x(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?W(r.body,t):W({kind:`Identifier`,name:n,location:r.location},t)})]},Uf=(e,t)=>[ms(`_Track`,2,e=>{let n=String(z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,z(e,0,`_Track`)===!0?r+1:r),!0}),ms(`_Counts`,0,()=>jf(t)),ms(`_CheckName`,1,n=>{let r=String(z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(jf(t),!0)),!1)}),ms(`_PrintCounts`,0,()=>(e(R(jf(t),!0)),!0))],Wf=e=>`${e.getUTCFullYear()}.${Lt(e.getUTCMonth()+1)}.${Lt(e.getUTCDate())}.${Lt(e.getUTCHours())}${Lt(e.getUTCMinutes())}${Lt(e.getUTCSeconds())}`,Gf=e=>Qr([...e].map(([e,t])=>[e,li([t])])),Kf=e=>ar($r(e),`record`),qf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Jf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Yf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Xf=(e,t,n)=>{if(e.version===`1.7.4`?!Jf.has(t)||!e.isStarted&&Yf.has(t):!e.isStarted&&qf.has(t))throw new x(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Kf([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Kf([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,qa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Kf([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Bn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Bn(Wf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Nf(void 0);case`all`:return Gf(e.registers);case`all:named`:return Gf(Mf(e))}if(t.startsWith(`s:`)){let n=Mf(e).get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Bn(e.properties.get(t.slice(2))??t);throw new x(`TLCGet(${t}) was undefined.`)},Zf=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new x(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(t)}`);return Xf(e,t,n?.state)},Qf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Qf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),$f=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach($f),e.kind===`Function`&&e.range.forEach($f))},ep=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return L(e);default:return I(e)}},tp=(e,t)=>[B(`Print`,2,t=>(e(Ba([z(t,0,`Print`),z(t,1,`Print`)]).map(N).join(` `)),z(t,1,`Print`))),B(`PrintT`,1,t=>(e(N(Ba([z(t,0,`PrintT`)])[0])),!0)),B(`Assert`,2,e=>{if(z(e,0,`Assert`)!==!0)throw new x(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(R(z(e,1,`Assert`)))}`,S.assertViolation);return!0}),B(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),B(`:>`,2,e=>Qr([[z(e,0,`:>`),z(e,1,`:>`)]])),B(`@@`,2,e=>{let t=z(e,0,`@@`),n=z(e,1,`@@`),r=un(t)?L(t):void 0,i=un(n)?L(n):void 0;if(!r)throw ss(`first`,`@@`,`function`,t);if(!i)throw ss(`second`,`@@`,`function`,n);let a=vn(r),o=vn(i).filter(e=>!a.some(t=>Ur(e[0],t[0])));return $r([...a,...o])}),B(`ToString`,1,e=>Bn(R(z(e,0,`ToString`),!0))),{...js(`TLCEval`,1,(e,t)=>{let n=ep(Ms(e,0,`TLCEval`)());return t===void 0&&$f(n),n}),isStateLevel:!1},B(`Permutations`,1,e=>{let t=cs(z(e,0,`Permutations`),`Permutations`).elements;return Kr(Qf(t).map(e=>Qr(t.map((t,n)=>[t,e[n]]))))}),ps(`SortSeq`,2,e=>{let t=z(e,0,`SortSeq`),n=Bi(t);if(!n)throw ss(`first`,`SortSeq`,`natural number`,t);let r=ds(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ss(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),li(a)}),t.version===`1.7.4`?Ts({...ms(`TLCGet`,1,(e,n)=>Zf(t,z(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ts(js(`TLCGet`,1,(e,n)=>Zf(t,Ms(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ms(`TLCSet`,2,n=>(Rf(t,e,z(n,0,`TLCSet`),z(n,1,`TLCSet`)),!0)),fs(`Any`,qn),B(`RandomElement`,1,e=>xf(z(e,0,`RandomElement`),t.getRandom()))],np=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),rp=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],ip=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),ap=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),op=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),sp=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
88
88
|
Nat == { }
|
|
89
89
|
a+b == {a, b}
|
|
90
90
|
a-b == CHOOSE n : b + n = a
|
|
@@ -1785,9 +1785,9 @@ _TEPosition ==
|
|
|
1785
1785
|
`,set:`
|
|
1786
1786
|
`},xS=(e,t,n,i=`Proof.Parser`)=>new r(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:i,printed:`${e}${n.printed}`}}),SS=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),CS=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),wS=/* @__PURE__ */ new Set([`NEW`,...CS.keys()]),TS=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),ES=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),DS=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),OS=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Jx.has(e.operator):eS.has(e.operator)),kS=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,AS=e=>Jx.has(e)||eS.has(e)||e===`-.`,jS=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},MS=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
1787
1787
|
`)}\n`},NS=(e,t,n=Ee(e,t===`tlapm`))=>{let i=t===`tlapm`,a=i?n:n.map(xe),o=0,s=[],c,l,u=[],d=/* @__PURE__ */ new Set,f=[],p=[],h,g=0,_=[],v=/* @__PURE__ */ new WeakMap,y=e=>u[u.length-1].has(e),b=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],x=[],S=[],C=(e,t=o-1)=>{let n=e===t?S[e]:void 0;if(n)return n;let r=a[t];ee[e]??=b(a[e]),x[t]??={line:r.line,column:r.endColumn};let i={module:p[0].name,start:ee[e],end:x[t]};return e===t&&(S[e]=i),i},w=(e,t)=>(e.location.range=C(t),e),ne=(e=0)=>a[Math.min(o+e,a.length-1)],T=(e=0)=>{let t=ne(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},re=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie=e=>i&&(e.kind===`Keyword`||DS.has(e.text)),ae=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:fS.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ie(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,se=(e,t=ne(),n)=>{let i=a[a.length-1],o=t.line===i.line&&t.column===i.column,s=new r(`${e} at line ${t.line}, column ${t.column}`,void 0,ce(e,t,o,n));return h!==void 0&&v.set(s,h),s},ce=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[_[0]-1],s=r?`Unexpected ${oe(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?ae(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},le=(e,t=ne())=>se(e,t,t),ue=e=>{let t={cursor:o,frame:h,restorePoints:_.length,offsideColumns:s.length,recursiveScopes:u.length},n=++g;h=n;try{let n=e();return h=t.frame,n}catch(e){if(!(e instanceof r)||v.get(e)!==n)throw e;o=t.cursor,h=t.frame,_.length=t.restorePoints,s.length=t.offsideColumns,u.length=t.recursiveScopes;return}},de=e=>{let t=h;h=void 0;let n=e();return h=t,n},pe=e=>{_.push(o);let t=e();return _.pop(),t},me=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ie(e),E=(e,t=0)=>{let n=T(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=T();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o++,e},O=e=>E(e)?(o++,!0):!1,k=e=>{if(!E(e))throw le(`Expected ${JSON.stringify(e)} but found ${re(T())}`);return D()},he=()=>{let e=T();if(e.kind!==`Identifier`)throw le(`Expected an identifier but found ${re(e)}`);if(ie(e))throw le(`Unexpected keyword ${e.text}`);return o++,e.text},ge=()=>{let e=o;return{name:he(),range:C(e)}},_e=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ve=()=>{let e=T();return e.kind!==`String`&&(rS.has(e.text)||Jx.has(e.text)||tS.has(e.text))?(o++,e.text):he()},ye=!1,be=()=>T().kind===`Identifier`||!me(T())?he():(ye=!0,D().text),Se=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},Ce=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},we=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;T(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;T(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},Te=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;T(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return T(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},De=()=>{if(!O(`<<`)){let e=ge();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=_e(E(`>>`)?[]:Ce(ge));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Oe=()=>{let e=()=>{let e=Ce(De);k(`\\in`);let t=de(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!i||we(1));)D(),t.push(e());return t.flat()},ke=()=>{let e=T();if(i&&DS.has(e.text)){let t=o;D();let n={kind:`Identifier`,name:e.text,location:b(e)};return{subscript:w(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(C(o,o)),n.push(he()),e&&E(`(`)?Ne():[]),s=[a(!i)];for(;E(`!`)&&T(1).kind===`Identifier`;)D(),s.push(a(!0));let c=s.slice(0,-1),l=b(e);l.range={...C(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=o,t=Ue();return{subscript:t.location.range?t:w(t,e),lastArgs:[]}}throw le(`Expected a subscript but found ${re(e)}`)},A=e=>{let t=T(1),n=T(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&E(`==`,tS.has(n.text)?3:4))},Ae=e=>{let t=T(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&cS.has(t.text)||A(e)},je=()=>{let e=T(),t=e.kind===`Operator`&&(Jx.has(e.text)||nS.has(e.text))&&Ae(e);if(i&&e.kind!==`String`&&(nS.has(e.text)||oS.has(e.text)&&e.text!==`'`&&!eS.has(e.text)||aS.has(e.text)&&T(-1).text===`(`&&T(-1).line===e.line&&T(-1).endColumn+1===e.column&&T(1).text===`)`&&T(1).line===e.line&&T(1).column===e.endColumn+1)&&Ae(e))throw se(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw se(`\\X may not be used as an infix operator`,e);if(t)return o++,w({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:b(e)},o-1);if(e.kind!==`String`&&oS.has(e.text)&&Ae(e)){o++;let t=b(e);if(eS.has(e.text))return w({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return w({kind:`Lambda`,params:[n.name],body:jS(e.text,n,t),operator:e.text,location:b(e)},o-1)}if(E(`LAMBDA`)){let t=o;D();let n=_e(Ce(ge));k(`:`);let r=j();return w({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:b(e)},t)}if(!i)return j();let n=ue(j);if(n)return n;throw le(`Unexpected ${re(T())}`)},Me,Ne=()=>Se(()=>{let e=o;k(`(`);let t=Ce(je);return k(`)`),Me=C(e),t}),Pe=()=>{let e=D();s.push(e.column);let t=[j()],n=()=>{for(;kS(ne())&&ne().text===e.text&&ne().column===e.column;)o++,t.push(j())};return i?de(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:b(e)}},Fe=e=>Se(()=>{let t=b(e),n=T().kind===`Identifier`,r=E(`|->`,1)&&(n||me(T()));if(r||n&&E(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=b(T()),i=e();return n.range=C(t),k(r?`|->`:`:`),{name:i,value:j(),location:n}},a=[i(()=>n?he():D().text),...O(`,`)?Ce(()=>i(he)):[]];return k(`]`),{kind:e,fields:a,location:t}}if(we()){let e=o,n=Oe();if(!i||E(`|->`)){k(`|->`);let e=j();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=j();if(O(`->`)){let e=j();return k(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(O(`EXCEPT`)){let e=Ce(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!me(T()))throw le(`Expected a field name but found ${re(T())}`);if(!i&&E(`@`))throw le(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:Ce(()=>j())}),k(`]`);return k(`=`),{path:e,value:j()}});return k(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!E(`]_`)){let e=[a];for(;O(`,`);)e.push(j());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:a,subscript:ke().subscript,location:t}}),Ie=()=>{let e=o,t=w(Ge(),e),n=b(D());return w({kind:`Apply`,operator:`\\in`,args:[t,de(j)],location:n},e)},Le=e=>Se(()=>{let t=b(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(we()&&(T(1).text===`\\in`||E(`<<`))){let e=o,n=De();k(`\\in`);let r=de(j);if(O(`:`)){let e=de(j);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=T().kind===`Identifier`&&E(`\\in`,1)?Ie():j();if(O(`:`)){let e=Oe();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(j());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Re=e=>{let t=b(e),n=Se(()=>E(`>>`)||E(`>>_`)?[]:Ce(()=>j()));if(O(`>>_`)){if(n.length!==1)throw se(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:de(ke).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},ze=e=>{let t=b(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&we()){let e=Oe();return k(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=_e(Ce(ge));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Be=e=>{let t=[];do{let n=o;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:j(),otherRange:C(n),location:b(e)};let r=j();k(`->`),t.push({condition:r,body:j()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:b(e)}},Ve=()=>{let e=T(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||sS.has(e.text)||e.kind===`Operator`&&(Jx.has(e.text)||tS.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&rS.has(e.text))},He=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:fe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:Ne()}}return{kind:`Name`,name:e.text,args:E(`(`)?Ne():[]}},Ue=e=>{let n=o,r=D(),a=b(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=Ce(he);return k(`:`),{kind:`Lambda`,params:e,body:j(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:fe(r.text),text:r.text,location:a};if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&wt(r);if(!i&&s&&N()<0&&xt.length<=1)throw se(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw se(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let t=s?Tt(r)??r.text:r.text;if(Te()){let o=_e(O(`(`)?Ce(ge):[]);o.names.length>0&&k(`)`),k(`::`);let s=C(n),l=j();if(!i&&e!==void 0&&c!==void 0&&OS(l)&&e.high>=c.low)throw se(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:t,params:o.names,paramRanges:o.ranges,head:s,body:l,location:a}}let l=E(`(`);if(t===`@`&&!l&&!Ve())return{kind:`ExceptAt`,location:a};let u=l?Ne():[],d=[l?Me:void 0];if(!Ve())return l?{kind:`Apply`,operator:t,args:u,argumentsRange:Me,location:a}:{kind:`Identifier`,name:t,location:a};let f=[{kind:`Name`,name:t,args:u}],p=[C(n,n)];for(;Ve();)D(),p.push(C(o,o)),Me=void 0,f.push(He()),d.push(Me);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??C(n);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&AS(r.text)&&E(`(`)){let e=Ne();return t===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&AS(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=Se(()=>j());return k(`)`),e}case`[`:return Fe(r);case`{`:return Le(r);case`<<`:return Re(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return ze(r);case`IF`:{let e=j();k(`THEN`);let t=j();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:a}}case`CASE`:return Be(r);case`LET`:{let e=[],t=[];for(u.push(/* @__PURE__ */ new Set);!O(`IN`);){if(i&&E(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){vt();continue}let n=ft(!i&&O(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}u.pop();let n=j();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=De(),t=O(`\\in`)?j():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:a}}case`WF_`:case`SF_`:{let e=ke(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:Se(()=>{k(`(`);let e=j();return k(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw le(`Unexpected ${re(r)}`,r)},We=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=T(),a=tS.has(i.text)?Kx.high:Jx.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw se(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Ge=()=>{let e=l;l=void 0;let t=T(),n=b(t);if(t.kind===`Operator`&&kS(t))return Pe();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[We(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[We(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),jS(t.text,We(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{kind:`Apply`,operator:t.text,args:[We(t,10,13)],location:n}}return Ue(e)},Ke=(e,t,n,r,i)=>{let a=b(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},qe=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:b(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:b(e)},Je=()=>{D();let e=Se(()=>Ce(()=>j()));return Se(()=>k(`]`)),e},Ye=e=>{let t=o,n=Ge(),r=n.location.range?n:w(n,t),i;for(;;){let n=T();if(n.kind!==`Operator`)break;let a=b(n);if(tS.has(n.text)&&e<=15){D(),c=Kx,r=w(qe(n,r),t);continue}if(n.text===`[`){let e=Je();c=qx,r=w({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&me(T(1))){D();let e=D().text;r=w({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=Jx.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw se(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw se(`Precedence conflict between ${n.text} and -`,T());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=w(Ke(n,r,s,u,C(t).end),t),i={...o,text:n.text}}return r},Xe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&wt(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&Qx.has(e.text),Ze=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:w(e,t)}),Qe=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),$e=e=>e.kind===`Operator`&&tS.has(e.text)&&E(`(`,1)?ue(()=>Se(()=>{D(),D();let t=j(),n=o-1;return k(`)`),{end:n,expression:qe(e,t)}})):void 0,et=()=>{let e=0;for(let t=o+1;t<a.length;t++){let n=a[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(a[t-1].text!==`!`&&(TS.has(n.text)&&e++,ES.has(n.text)&&--e===0))return!1}}return!1},tt=e=>E(`(`,1)&&et()?ue(()=>Se(()=>{D(),D();let t=j();k(`,`);let n=j();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:b(e)}})):void 0,nt=e=>{let t=o,n=T(),r=b(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?Jx.get(n.text):void 0;if(!e){if(E(`[`)){let e=Je();return Qe(t,`Postfix`,Zx,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&me(T(1))){D();let e=D().text;return Qe(t,`Postfix`,Zx,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(tt(n)){o=t;return}return D(),{...Qe(t,`Infix`,a,e=>Ke(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,C(e[0].start,e[1].end).end)),isLeft:Yx(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!tS.has(n.text))return;if($e(n)){o=t;return}return D(),Qe(t,`Postfix`,Kx,e=>qe(n,e[0].expression))}if(n.kind===`Operator`&&kS(n))return Ze(Pe(),t);let s=a?tt(n):void 0;if(s)return Ze(s,t);let c=$e(n);if(c)return c.expression.location.range=C(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?Xx.get(n.text):void 0;if(l)return D(),Qe(t,`Prefix`,l,e=>jS(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Xe(n))return;let u=n.kind===`Operator`&&$x.has(n.text);return Ze(u?Ue():de(Ue),t)},rt=e=>e!==void 0&&`fixity`in e,it=e=>e!==void 0&&!(`fixity`in e),at=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=C(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},ot=e=>{let t=e.pop(),n=e.pop();if(!it(t)||!rt(n))throw se(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(at(n,it(r)?[r,t]:[t]))},st=e=>{let t=e[e.length-2];return rt(t)?t:void 0},ct=(e,t)=>t!==void 0&&e.high<t.low,lt=()=>pe(()=>{let e=ue(()=>nt(!0));if(e===void 0){let e=ne();throw e.kind===`End`?le(`Unexpected end of expression`,e):se(`required expressions(s) missing before '${oe(e)}'`,e)}return de(()=>{let t=[e];for(;;){let e=ue(()=>nt(rt(t[t.length-1])));if(e===void 0)break;if(it(e)||e.fixity===`Prefix`){t.push(e);continue}for(;ct(e,st(t));)ot(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&it(n)){t.splice(-1,1,at(e,[n]));continue}let r=st(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!ct(r,e)&&ot(t),t.push(e)}for(;t.length>1;)ot(t);let n=t[0];if(!it(n))throw se(`incomplete expression`);return n.expression})}),j=(e=0)=>i?lt():Ye(e),ut=()=>{if(!O(`(`))return[];let e=_t();return k(`)`),e},dt=()=>{let e=b(T()),t=j(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:p[0].name,start:e,end:r}}},ft=e=>{let t=o;return w(mt(e),t)},pt=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),mt=e=>{let t=T(),n=o,r=b(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:C(n,o-2),...dt(),isLocal:e,isRecursive:y(t),location:r});if(t.kind===`Identifier`&&T(1).kind===`Operator`&&Jx.has(T(1).text)&&T(2).kind===`Identifier`&&E(`==`,3)){let e=ge(),t=D().text,n=ge();return k(`==`),i(t,[pt(e),pt(n)])}let a=t.kind!==`String`&&rS.has(t.text),s=t.kind===`Identifier`&&tS.has(T(1).text)&&E(`==`,2);if(a||s){let e=a?t.text:T(1).text;a&&D();let n=ge();return s&&D(),k(`==`),i(e,[pt(n)])}let c=he();if(O(`[`)){let t=Se(()=>Oe());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:y(c),location:r}}let l=o,u=ut();return k(`==`),E(`INSTANCE`)?{...ht(c,u,e,r),definitionRange:C(l)}:i(c,u)},ht=(e,t,n,r)=>{let i=o;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:be(),substitutions:O(`WITH`)?Ce(()=>{let e=o,t=ve(),n=C(e);return k(`<-`),{name:t,nameRange:n,expression:je()}}):[],isLocal:n,location:r,instanceRange:C(i)}},M=()=>{let e=o;return w(gt(),e)},gt=()=>{let e=b(T());if(E(`_`)&&T(1).kind===`Operator`)return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(T().kind!==`String`&&(rS.has(T().text)||i&&T().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=he();if(!O(`(`))return{name:t,arity:0,location:e};let n=Ce(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},_t=()=>Ce(M),vt=()=>{let e=_t();return e.forEach(e=>u[u.length-1].add(e.name)),e},yt=e=>{let t=0,n=e;do{let e=T(n);if(e.kind===`End`)return n;e.kind===`Operator`&&TS.has(e.text)&&t++,e.kind===`Operator`&&ES.has(e.text)&&t--,n++}while(t>0);return n},bt=()=>{let e=T(),t=T(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,yt(1)):t.kind===`Operator`&&tS.has(t.text)?E(`==`,2):t.kind===`Operator`&&Jx.has(t.text)?T(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&rS.has(e.text)&&t.kind===`Identifier`&&E(`==`,2)},xt=[],N=()=>xt[xt.length-1]??-1,St=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Ct=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},wt=e=>!e.text.endsWith(`.`)&&!pS.has(Ct(e)),Tt=e=>{let t=Ct(e);if(pS.has(t))return;let n=St(e);if(n>=0)return`<${n}>${t}`;let r=N(),i=xt[xt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Et=e=>{if(e.kind===`Keyword`)return uS.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return xt.length===0;if(e.text[1]===`+`||xt.length===0)return!0;let t=N();return t>=0&&St(e)>t},Dt=e=>{let t=St(e),n=xt.length-1,r=xt[n-1]??-1,i=xt[n]<0;return i&&(xt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:xt[n]===t},Ot=e=>!d.has(e)&&p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),kt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!DS.has(e.name)&&!Ot(e.name):!1,At=()=>{let e=T();return e.kind===`Step`?wt(e):e.kind===`Keyword`?SS.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!bt()},jt=()=>{let e=o,t=T();return t.kind===`Operator`&&!iS.has(t.text)&&AS(t.text)?(o++,w({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:b(t)},e)):O(`MODULE`)?w({kind:`ModuleFact`,name:he(),location:b(t)},e):j()},Mt=e=>f[f.length-1]?.add(e),Nt=e=>{f.push(/* @__PURE__ */ new Set);let t=e();return f.pop(),t},Pt=e=>f.some(t=>t.has(e))||p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ft=()=>{let e=o,t=T(),n=Ce(()=>{let e=T();if((e.kind!==`Identifier`||ie(e))&&e.kind!==`Operator`)throw le(`Expected a definition name but found ${re(e)}`,e);return o++,e.text},`!`),r=b(t);return w(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},It=()=>{if(i)return Ce(Ft);let e=Ce(jt),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&Pt(e.name)):void 0;if(n)throw se(`DEF clause entry should describe a defined operator`,n.location);return e},Lt=()=>{let e=ue(j);if(!e)return[];let t=[e];return pe(()=>{for(;E(`,`);){let e=ue(()=>(D(),j()));if(!e)return;t.push(e)}}),t},Rt=()=>{let e=i?Lt():At()?Ce(jt):[],t=O(`DEF`)||O(`DEFS`);if(i&&e.length===0&&!t)throw le(`Expected a fact`);return{facts:e,defs:t?It():[]}},zt=()=>{let e=o,n=D(),r=n.text===`USE`&&O(`ONLY`),i=C(e),a={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...Rt(),keyword:i,location:b(n)},s=a.kind===`Hide`&&t===`tlc`?a.facts.filter(e=>!kt(e)):[];if(s.length>0)throw te(s.map(t=>({location:m(t.location.range??C(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
1788
|
-
the name of a theorem, assumption, or step.`})));return w(a,e)},Bt=()=>{let e=o,t=b(T()),n=O(`NEW`),r=i?o:e,a=i?b(T()):t,s=T().kind===`Keyword`?CS.get(T().text):void 0;if(!n&&s===void 0)throw le(`Expected a declaration but found ${re(T())}`);if(s!==void 0&&D(),s===`Variable`){let e=ge();return Mt(e.name),w({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=M();Mt(c.name);let l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw se(`declared symbol with arguments before \\in`);return l&&D(),w({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:a},r)},Vt=()=>{if(T().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Nt(Ut);if(T().kind===`Keyword`&&wS.has(T().text))return i?de(Bt):Bt();if(!i)return j();let e=ue(j);if(e===void 0)throw le(`Expected a hypothesis`);return e},Ht=()=>{let e=[Vt()];return pe(()=>{for(;;){let t=ue(()=>(k(`,`),Vt()));if(t===void 0)break;e.push(t)}}),e},Ut=()=>{let e=o,t=b(k(`ASSUME`)),n=()=>{let n=i?Ht():Ce(Vt);return k(`PROVE`),w({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return i?de(n):n()},Wt=e=>{let t=0;for(;T(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return T(t).kind===`Identifier`&&E(e,t+1)},Gt=(e,t)=>{e.forEach(Mt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Mt))},Kt=()=>{let e=T();if(E(`USE`)||E(`HIDE`))return zt();if(!i&&E(`INSTANCE`)){let t=o;return w(ht(void 0,[],!1,b(e)),t)}if(E(`DEFINE`)||bt()){let t=o;O(`DEFINE`);let n=[ft(!1)];for(;bt();)n.push(ft(!1));let r={kind:`Define`,definitions:n,location:b(e)};return w(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:j()};if(O(`TAKE`)){let e=we(),t=_e(e?[]:Ce(ge)),n=e?Oe():[];return Gt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:Ce(()=>j())};if(O(`PICK`)){let e=Wt(`:`),t=_e(e?Ce(ge):[]),n=e?[]:Oe();return Gt(t.names,n),k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return O(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ut():j()}},qt=e=>{let n=T();if(n.kind!==`Step`)throw le(`Expected a step number but found ${re(n)}`,n);if(!Dt(n))throw se(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&St(n)<0&&Tt(n)!==void 0)throw se(`<*> and <+> cannot be used for a named step`,n);return o++,{name:Tt(n),token:n.text,location:b(n)}},Jt=()=>{let e=o,t=qt(E(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;f.push(r);let i=O(`QED`)?{kind:`Qed`}:Kt(),a=C(e),s=C(n),c=Et(T());if(c&&!dS.has(i.kind))throw se(`Proof of a step that does not take a proof`);let l=c?Zt():void 0;return f.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(Mt),w({...t,body:i,head:a,statement:s,proof:l},e)},Yt=e=>{if(O(`BY`)){let t=C(o-1);return{kind:`By`,isOnly:O(`ONLY`),...Rt(),keyword:t,location:e}}let t=T();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=C(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Xt=()=>{let e=b(T());O(`PROOF`);let t=Yt(e);if(t)return t;let n=[Jt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Jt());return{kind:`Steps`,level:N(),steps:n,location:e}},Zt=()=>{let e=o;xt.push(-1);let t=Nt(Xt);return xt.pop(),w(t,e)},Qt=()=>T().kind===`Step`||T().kind===`Keyword`&&uS.has(T().text),$t=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return _S(e);let n=t.defs[t.defs.length-1]?.location.range;return gS(_S({...e,end:e.start}),_S(n??t.keyword))},en=()=>{let e=o,t=b(T()),n=O(`PROOF`),r=Yt(t);if(r){let t=w(r,e);return{kind:`Leaf`,proof:t,span:_S(t.keyword),first:e,end:o-1}}let i=T();if(i.kind!==`Step`)throw le(`Expected a step number but found ${re(i)}`);let a=o;D();let s=o,c=O(`QED`)?{kind:`Qed`}:Kt(),l=C(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:C(s),span:$t(l,c),first:e,start:a,end:o-1}},tn=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=nn(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...b(a[i.first]),range:C(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},nn=(e,t,n,r,i)=>{let a=e[t];if(!a)throw xS(`Unexpected end of (sub)proof at level ${n} before QED step`,r,bS);if(a.kind===`Leaf`)throw xS(`Expecting a proof step but found a${mS[a.proof.kind]} leaf proof`,a.span,bS);if(!i&&a.isProof)throw xS(`PROOF keyword found in step that does not begin subproof`,a.span,yS);let o=a.token.text[1];if(o===`+`&&!i)throw xS(`<+> used but no subproof expected`,a.span,yS);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:St(a.token);if(s<n||!i&&s>n)return;let c=dS.has(a.body.kind)?tn(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Tt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...b(a.token),range:C(a.start,l)}},d=gS(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=nn(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:gS(d,f.span)}},rn=()=>{if(!Qt())return;let e=[];for(;Qt();)e.push(en());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=tn(e,0,0,t.span),r=e[n.next];if(r)throw xS(`extra step(s) after finished proof`,r.span,vS,`Proof.Parser.toplevel`);return n.proof},an=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},on=()=>{if(T().kind!==`Identifier`||!E(`==`,1))return;let e=he();return d.add(e),D(),e},sn=()=>{if(!i)return j();let e=ne(),t=ue(j);if(t)return t;throw le(`Expected "====" but found ${re(e)}`,e)},cn=e=>{let t=o,n=D(),r=on(),a=Nt(()=>{let e=E(`ASSUME`)?Ut():sn();return i?{statement:e,proof:rn()}:{statement:e,proof:Et(T())?Zt():void 0}}),s=a.statement,c=w({name:r,statement:s,proof:a.proof,location:b(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&an(e,r,s,c.location)},P=()=>{let e=o,t=D(),n=on();return w({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:b(t)},e)},ln=()=>{let e=b(k(`----`));k(`MODULE`);let t=be();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(p.push(n),u.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&Ce(()=>{let e=o;n.extends.push(be()),n.extendsRanges.push(C(e))});;){let t=o,r=T();if(r.kind===`ModuleEnd`)return e.range={module:p[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},p.pop(),u.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=ln();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=b(D()),r=_t();n.constants.push(...r),e.range=C(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=b(D()),r=Ce(()=>{let e=o,t=b(T());return w({name:he(),arity:0,location:t},e)});n.variables.push(...r),e.range=C(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=P();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&an(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw le(`Expected a module unit but found ${re(r)}`);let e=zt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=b(D()),r=vt();e.range=C(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:un(n,w(ht(void 0,[],!1,b(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){un(n,w(ht(void 0,[],!0,b(r)),t));continue}un(n,w(mt(!0),t));continue}r.kind===`Keyword`&&lS.has(r.text)?cn(n):un(n,ft(!1))}}},un=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},dn=ln(),fn=ye?Gx(e):void 0;if(fn!==void 0)throw new r(fn);return dn},PS=e=>NS(e,`tlc`),FS=(e,t)=>NS(e,`tlc`,t),IS=e=>NS(e,`tlapm`),LS=e=>NS(e,`sany`),RS=`$subexpression`,zS=(e,t)=>new r(`${e} at line ${t.line}, column ${t.column}`),BS=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return BS(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=BS(r,t,n);if(e)return e}},VS=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),HS=(e,t)=>{let n=e.location,r=VS(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw zS(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw zS(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:RS,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:RS,args:e.args,location:n,resolution:ec},location:n}},US=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:ec})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ec}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ec};return HS({...t,params:[...t.params,...r]},a)},WS=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s,c=!1,l=(t,r)=>{if(!t)throw zS(r,i);nc.set(n,{args:e.slice(0,o).flatMap(e=>`args`in e?e.args:[]),error:{location:m(t),message:r}}),c=!0},u=n=>{let r=[],a=[];for(;o<e.length;){let s=e[o];if(s.kind!==`Name`)throw zS(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>wl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o++}throw zS(`Unknown operator ${r.join(`!`)}`,i)},d=t=>{let c=u(t),d=c.definition,f=sc(d),p=o===e.length-1;if(c.args.length!==f&&(!r||c.args.length!==0))return l(n.argumentRanges?.[o]??i.range,`The operator ${c.name} requires ${f-c.earlier} arguments.`);if(p)return{definition:d,args:c.args};if(d.kind!==`Operator`)throw zS(`Cannot select a subexpression of ${d.name}`,i);a.params.push(...d.params),a.args.push(...c.args),s=d.body,o++},f=()=>{for(;o<e.length&&!c;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],c=s&&BS(s,t.name,[]);if(!c)return l(i,`Cannot find label \`${t.name}'.`);let u=c.label.params;if(!r&&t.args.length!==u.length)return l(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),s=c.label.body,o++}},p=t=>{if(!s)throw zS(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(s.kind===`Label`){s=s.body,p(t);return}if(s.kind===`Let`){if(t.kind!==`Operand`||Oc(t.operand,1)!==0)throw zS(`A LET/IN expression has only one operand`,i);a.lets.push(s.definitions),s=s.body;return}let n=Mc(s);if(n&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...n.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),s=n.body;return}if(s.kind===`Case`&&t.kind===`Operand`){let n=[...s.arms,...s.other?[{condition:void 0,body:s.other}]:[]],r=n[Oc(t.operand,n.length)],a=e[o+1];if(!r||a?.kind!==`Operand`)throw zS(`A subexpression of CASE must have the form !i!j`,i);o++;let c=Oc(a.operand,2),l=c===0?r.condition:c===1?r.body:void 0;if(!l)throw zS(`Nonexistent CASE operand`,i);s=l;return}if(t.kind!==`Operand`)throw zS(`Unexpected subexpression selector`,i);let r=n?n.sets:Nc(s),c=r?.[Oc(t.operand,r.length)];if(!c)throw zS(`Nonexistent operand specified by the selector`,i);s=c},h=d(void 0);if(c)return n;if(h)return US(h.definition,{...a,args:h.args});for(f();o<e.length&&!c;){let t=e[o];if(t.kind===`Name`){for(;s?.kind===`Label`;)s=s.body;if(s?.kind!==`Let`)throw zS(`A name selector here must be from a LET clause`,i);a.lets.push(s.definitions);let e=d(s.definitions);if(c)return n;if(e)return US(e.definition,{...a,args:[...a.args,...e.args]});f()}else p(t),o++}if(c)return n;if(!s)throw zS(`Subexpression selection failed`,i);return HS(a,s)},GS=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return kc(e,t,n)},KS=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(KS),qS=(e,t,n,r=!1)=>{if(!KS(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Dl(e,e=>qS(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>JS(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>qS(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Dl(e,e=>qS(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?GS(a.name,[],void 0,t):a.kind===`Apply`?GS(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=WS(o,t,a,r);return c!==a&&tc.add(c),c},JS=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:qS(e.expression,t,n,!0)}))}),YS=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},XS=(e,t)=>JS(e,YS(t.definitions),()=>!1),ZS=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=YS([...t,...e.definitions]),a=e=>n.has(e),o=YS([...t,...e.definitions,...r]),s=e=>qS(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>qS(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return JS(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?JS(e,i,c):El(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>KS(e.body))||e.assumptions.some(e=>KS(e.expression))?{...h,definitions:e.definitions.map(e=>El(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},QS=(e,t)=>e.maxLevels[t]??3,$S=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Iu({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>fu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>fu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>pu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=lu(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&fu(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Lu(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=m(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=c.argConstraints.get(su(e.name,n));i!==void 0&&QS(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),c.argParams.forEach(e=>{let n=lu(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=QS(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw te([...r.values()])}},eC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],tC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),nC=new Map(rp.flatMap(e=>e.map(t=>[t,e[0]]))),rC=e=>nC.get(e)??e,iC=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},aC=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),oC=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:rC(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:rC(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},sC=(e,t)=>{let n=[];for(let r=t;;){let t=oC(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},cC=e=>({line:e.line,column:e.column}),lC=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=sC(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}}return{references:s,end:e.length}};return i(0,t??``).references},uC=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,dC={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},fC=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&uC(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&uC(e[n+1],e[n+2])?n+=uC(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>dC[e])}"`:r.text)}return t},pC=e=>e[2]?.text,mC=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},hC=(e,t)=>e.find(e=>e.name===t)??e.map(e=>hC(e.modules,t)).find(Boolean),gC=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:mC(t),getModule:()=>n??=e===void 0?PS(``):FS(e,t)}},_C=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=gC(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??sp.get(i)??up.get(i)??MS(e,i),c=a(s),l=c.tokens,u=c.ranges.get(pC(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>hC(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},vC=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=sC(t,e+1);i.push({location:cC(t[e]),apply:e=>r.forEach(t=>e.put(aC(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:cC(n),apply:t=>t.put(aC(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&sC(t,u+1).every(e=>s.has(e))&&o(u,`definition`),tC.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(cC(n)),i.push({location:cC(n),apply:e=>e.put(aC(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(aC(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=rC(e.name);i.push({location:e.location,apply:n=>n.put(aC(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(aC(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(aC(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>oc(e.location,t.location)?-1:+!!oc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=iC();n.set(i??``,o),np.toReversed().forEach(e=>o.put(aC(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},yC=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),ip.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=lC(a(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;fC(a(void 0)).forEach((e,t)=>{t===3&&op.forEach(r),r(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),v.set(n.unit,[...v.get(n.unit)??[],i]),!_.has(i)){if(_.add(i),e(i).tokens.length===0){let t=n.unit??pC(e(void 0).tokens);throw o(i,t)}fC(a(i)).forEach(r)}}eC.forEach(r);let b=/* @__PURE__ */ new Set,ee=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return ee(void 0),ap.forEach(r),[...n]},bC=(e,t)=>{let n=_C(e,t),r=n.getParsed,i,a=()=>i??=vC(r);return{getStringOrder:e=>yC(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},xC=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),SC=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],CC=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof r))throw n;let i=Gx(e);throw i===void 0?n:te([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,i)}},wC=e=>new r(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),TC=(e,t)=>e.location.range&&t.location.range&&{location:m(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${m(t.location.range)}.`},EC=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,DC=e=>e===`Theorem`?`ThmOrAssumpDefNode`:EC(e),OC=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Gl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),kC=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>kC(e,t))},AC=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Bl(e),n.get(e)??n.size)),n},jC=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),MC=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Qh(e);if(e.kind===`Number`&&!mn(e.value))throw $h(e);MC(e.kind===`Let`?[...mt(e),...jC(e.instances??[])]:mt(e))}),NC=(e,t)=>{let n=t.order??bC(t.source,t.loadModule),i=n.parseModule(t.source),a=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(xp.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=Af(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`;let h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,b=[],ee=/* @__PURE__ */ new Map,x=[],S=[],C=(e,t)=>x.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),w=0,ne=e=>`${e}#${w++}`,T=[],re=[],ie=$S(e=>{let t=v.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=f.get(e);if(n)return n;let r=Up(e,t.print,p,t.files,d);if(!r)return;Vp.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Hp.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:iu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:ou(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},le=e=>{let n=Vp.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&C(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},ue=e=>(MC([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...jC(e.instances)]),e.modules.forEach(ue),e);ue(i);let de=(e,r)=>{let i=t.loadModule?.(e)??fp(p.version).get(e)??MS(t.source,e);if(i===void 0)throw o(e,r);let a=CC(i,e,n);if(a.name!==e)throw te([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return ue(a)},fe=e=>{let t=S.indexOf(e.name);if(t!==-1){let n=[...S.slice(t),e.name].map(e=>`${e}.tla`);throw new r(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,i=[],a=[],o=[];S.push(e.name),x.push(n);let s=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:re,levelChecks:o});if(x.pop(),S.pop(),a.length>0)throw te(a,!1,void 0,re);let c=i.find(e=>n.has(e.name)),l=c&&h.get(c.name),u=l&&TC(c,l.module);if(u)throw te([u],!1,void 0,re);if(c)throw wC(c);return o.forEach(e=>e()),{linked:s,closure:n}},pe=(e,n)=>{let r=h.get(e);if(r)return C(e,ee.get(e)??[]),r;let i=fe(de(e,n)),o=/* @__PURE__ */ new Map;return Bp(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new y(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:a_(Gg(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&xC.has(e))return;let r=a.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),a.delete(n.key)}),h.set(e,i.linked),ee.set(e,i.closure),C(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let o=i?void 0:le(e.module);if(o)return E(e,o);let d=i??pe(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=SC(d),p=`#${w++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=hl(XS(e,t),f,t,n);T.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=$l({params:g,substitutions:new Map([...h].map(([e,t])=>[e,xl(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,o)=>{let u=ne(`${i}@${t.name}`),d=o(u);return a.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??i}`),s.set(u,!r),c.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return D(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},E=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),D=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),k=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=O(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Kl(r,n),location:n}}},he=(e,t,n,r)=>{let i=e.location,o=r?void 0:le(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=O(n.arity);return ql(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${w++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=SC(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};T.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>kC(f(e),p),h=d.map(t=>{let n=k(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=$l({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Kl(e.params,i),location:i,resolution:ec}:Gl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:OC(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=O(n.arity),o=[...e.params,...a];return ql(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},ge=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let r=wb(e,t.loadClass?.(e.name),e===i);_e.set(e.name,r.overrides);let o=r.module,c=T.length,l=new Map([...xp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:ul,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||m(n.range)===m(e.range))return;let r=m(e.range),i=m(n.range);DC(n.kind)===DC(e.kind)?d.warnings.push({location:r,message:`Warning: the ${EC(n.kind)} of '${t}' conflicts with \nits ${EC(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${EC(e.kind)} of '${t}' conflicts with \nits ${EC(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,y=[],ee=[...o.constants],x=o.variables.filter((e,t)=>o.variables.findIndex(t=>t.name===e.name)===t),S=x.map(e=>e.name),te=x.map(e=>e.location);o.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:le(e);if(r){p(r);return}let i=t??pe(e,o.name);ee.push(...i.constants.filter(e=>ee.every(t=>t.name!==e.name)&&!S.includes(e.name))),i.variables.forEach((e,t)=>{S.includes(e)||ee.some(t=>t.name===e)||(S.push(e),te.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),y.push(i)});let C=new Map(l),w=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],ne=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,ne(e)));let ae=e=>({key:ce(e),arity:sc(e),params:cc(e),kind:dl(o,e)?`Theorem`:`Definition`,range:e.location.range}),oe=ee.length===0&&S.length===0,ce=e=>o===i?e.name:`${e.name}@${n.id}`,ue=/* @__PURE__ */ new Map,de=()=>new Map([...n.modules,..._]),fe=e=>{let t=o.modules.find(t=>t.name===e.module);return t?oc(t.location,e.location)?_.get(t.name):void 0:de().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=fe(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:E(e,n),instancer:o.name};let r=t??pe(e.module,o.name),i=SC(r);return{declarations:i,symbols:D(e,r.exported,i,e=>e),instancer:o.name}},bound:C,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,instanced:ue,facts:g,reports:f,warnings:n.warnings}),k=e=>[...w.filter(t=>oc(t.location,e)).map(e=>[e.name,ne(e)]),...o.definitions.filter(t=>oc(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),ye=e=>{let t=de(),r=t.get(e.name),i=r&&TC(e,r.module);if(r&&!i)throw wC(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:k(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||_.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=me(e,o,O(o),oe,de().get(e.module));ue.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>oc(e.location,t.location)?-1:1).forEach(e=>e.link());let be=ZS(ru(o,(e,t)=>he(e,t,o.name,fe(e))),ge(l));n.errors.push(..._l(be,O(be))),be.definitions.forEach(e=>{let t=ce(e);a.set(t,e),s.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!oc(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let xe={module:be,constants:ee,variables:S,variableLocations:te,visible:l,exported:h,modules:_,extended:y,facts:/* @__PURE__ */ new Set([...g,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};v.has(o.name)||v.set(o.name,xe);let Se=T.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>Ru(be,{constants:new Set(ee.map(e=>e.name)),variables:new Set(S),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,re)),b.push(xe),xe},ye=fe(i).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=pe(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});b.push(...b.splice(b.indexOf(ye),1)),re.length>0&&!t.isSanyReported&&t.print(g(re)),ye.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(ye,/* @__PURE__ */ new Set);let Te=ye.constants.map(e=>e.name),Ee=ye.variables,De=db(e,{root:ye,moduleSymbols:new Map([...f,...[...h].map(([e,t])=>[e,t.visible]),[i.name,ye.visible]]),definitions:a,builtins:d,copySources:c,operatorConstants:new Map(Se.flatMap(e=>pe(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),Oe=De.constants,ke=De.substitutions;be!==void 0&&d.forEach((e,t)=>{let n=Ep(e);n&&d.set(t,n)});let A=AC(Ee,b.flatMap(e=>e.module.variables.map(e=>e.name))),Ae=Zu({definitions:a,substitutions:ke,constants:Oe,variableIndex:A,builtins:d,variables:Ee}),je={runtime:p,definitions:a,builtins:d,constants:Oe,substitutions:ke,instanceNames:oe,variables:Ee,variableIndex:A,facts:Ae,startupValues:Array.from({length:Ae.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Me=Iu({constants:new Set(Oe.keys()),variables:/* @__PURE__ */ new Set([...Ee,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>pg(e,je)}),Ne=e=>{try{W(e,{environment:je,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};ke.forEach((e,t)=>{let n=a.get(e),r=Te.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Me.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ne(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new _(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Pe=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Fe=n.createDefinitionOrder();return{environment:je,assumptions:Ce,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:b.filter(e=>!Pe.has(e.module.name)||SC(e).length===0).flatMap(e=>Fe(e===ye?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:b.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,rootName:i.name}},PC=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),FC=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},IC=e=>v(new y(`${i}${e}`),S.error),LC=e=>{let t=L(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!dn(e)||!dn(i))throw IC(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},RC=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${zC(t)}`:n},zC=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(zC).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${RC(e.pattern,e.set)}:${zC(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(zC).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${zC(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>RC(e.pattern,e.set)).join(`,`)}|->${zC(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(zC);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},BC=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,VC=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new _(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw IC(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!P(a)||!F(a))throw IC(`The symmetry operator must specify a set of functions.`);let o=I(a).elements;if(!o.every(un))throw IC(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=zC(BC(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(LC).forEach(e=>{e.size>0&&d.set(PC(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=FC(n,e),r=PC(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!BC(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>dn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},HC=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=WC(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(WC(e[r],t));return a}},UC=(e,t)=>{let n=[],r=[];for(let i of e){let e=WC(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Xn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Xn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},WC=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=UC(e.elements,t);return n?tr(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=L(e),r=HC(n.domain,t),i=HC(n.range,t)??n.range;if(r){let e=Qr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?rr(n.domain,e.range):e}return i===n.range?n:rr(n.domain,i)}if(n===`Interval`||!P(e)||!F(e))return e;let r=I(e),i=HC(r.elements,t);return i?Kr(i):r},GC=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=WC(e[o],i),a===0&&(a=Xn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},KC={line:0,column:0},qC=e=>({kind:`Identifier`,name:e,location:KC}),JC=e=>({name:e,expression:qC(e),scope:void 0}),YC=/* @__PURE__ */ new Set([`name`,`property`]),XC=(e,t,n)=>{let r=pg(t,n);if(!r)throw new _(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new _(YC.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},ZC=e=>e.body.kind===`Number`||e.body.kind===`String`,QC=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(ed(t,n)&&!ZC(t))try{return W(qC(e),Cw(n,void 0,void 0))}catch(e){if(e instanceof y||C(e))return;throw e}},$C=(e,t,n)=>{if(n.constants.has(t))throw new _(`The ${e} ${t} cannot be a constant.`);let r=XC(e,t,n);if(QC(t,r,n)!==void 0)throw new _(`The ${e} ${t} cannot be a constant.`);return r},ew=(e,t,n)=>{let r=n.constants.has(t)?void 0:XC(e,t,n),i=r?QC(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new _(`The ${e} of ${t} is equal to ${R(i)}`);return i===void 0?r:void 0},tw=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},nw=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Hg(e.startupDefinitions,r),t.invariants.forEach(e=>{ew(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},rw=(e,t)=>{let n=Iu({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=ew(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1788
|
+
the name of a theorem, assumption, or step.`})));return w(a,e)},Bt=()=>{let e=o,t=b(T()),n=O(`NEW`),r=i?o:e,a=i?b(T()):t,s=T().kind===`Keyword`?CS.get(T().text):void 0;if(!n&&s===void 0)throw le(`Expected a declaration but found ${re(T())}`);if(s!==void 0&&D(),s===`Variable`){let e=ge();return Mt(e.name),w({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=M();Mt(c.name);let l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw se(`declared symbol with arguments before \\in`);return l&&D(),w({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:a},r)},Vt=()=>{if(T().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Nt(Ut);if(T().kind===`Keyword`&&wS.has(T().text))return i?de(Bt):Bt();if(!i)return j();let e=ue(j);if(e===void 0)throw le(`Expected a hypothesis`);return e},Ht=()=>{let e=[Vt()];return pe(()=>{for(;;){let t=ue(()=>(k(`,`),Vt()));if(t===void 0)break;e.push(t)}}),e},Ut=()=>{let e=o,t=b(k(`ASSUME`)),n=()=>{let n=i?Ht():Ce(Vt);return k(`PROVE`),w({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return i?de(n):n()},Wt=e=>{let t=0;for(;T(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return T(t).kind===`Identifier`&&E(e,t+1)},Gt=(e,t)=>{e.forEach(Mt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Mt))},Kt=()=>{let e=T();if(E(`USE`)||E(`HIDE`))return zt();if(!i&&E(`INSTANCE`)){let t=o;return w(ht(void 0,[],!1,b(e)),t)}if(E(`DEFINE`)||bt()){let t=o;O(`DEFINE`);let n=[ft(!1)];for(;bt();)n.push(ft(!1));let r={kind:`Define`,definitions:n,location:b(e)};return w(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:j()};if(O(`TAKE`)){let e=we(),t=_e(e?[]:Ce(ge)),n=e?Oe():[];return Gt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:Ce(()=>j())};if(O(`PICK`)){let e=Wt(`:`),t=_e(e?Ce(ge):[]),n=e?[]:Oe();return Gt(t.names,n),k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return O(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ut():j()}},qt=e=>{let n=T();if(n.kind!==`Step`)throw le(`Expected a step number but found ${re(n)}`,n);if(!Dt(n))throw se(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&St(n)<0&&Tt(n)!==void 0)throw se(`<*> and <+> cannot be used for a named step`,n);return o++,{name:Tt(n),token:n.text,location:b(n)}},Jt=()=>{let e=o,t=qt(E(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;f.push(r);let i=O(`QED`)?{kind:`Qed`}:Kt(),a=C(e),s=C(n),c=Et(T());if(c&&!dS.has(i.kind))throw se(`Proof of a step that does not take a proof`);let l=c?Zt():void 0;return f.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(Mt),w({...t,body:i,head:a,statement:s,proof:l},e)},Yt=e=>{if(O(`BY`)){let t=C(o-1);return{kind:`By`,isOnly:O(`ONLY`),...Rt(),keyword:t,location:e}}let t=T();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=C(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Xt=()=>{let e=b(T());O(`PROOF`);let t=Yt(e);if(t)return t;let n=[Jt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Jt());return{kind:`Steps`,level:N(),steps:n,location:e}},Zt=()=>{let e=o;xt.push(-1);let t=Nt(Xt);return xt.pop(),w(t,e)},Qt=()=>T().kind===`Step`||T().kind===`Keyword`&&uS.has(T().text),$t=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return _S(e);let n=t.defs[t.defs.length-1]?.location.range;return gS(_S({...e,end:e.start}),_S(n??t.keyword))},en=()=>{let e=o,t=b(T()),n=O(`PROOF`),r=Yt(t);if(r){let t=w(r,e);return{kind:`Leaf`,proof:t,span:_S(t.keyword),first:e,end:o-1}}let i=T();if(i.kind!==`Step`)throw le(`Expected a step number but found ${re(i)}`);let a=o;D();let s=o,c=O(`QED`)?{kind:`Qed`}:Kt(),l=C(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:C(s),span:$t(l,c),first:e,start:a,end:o-1}},tn=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=nn(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...b(a[i.first]),range:C(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},nn=(e,t,n,r,i)=>{let a=e[t];if(!a)throw xS(`Unexpected end of (sub)proof at level ${n} before QED step`,r,bS);if(a.kind===`Leaf`)throw xS(`Expecting a proof step but found a${mS[a.proof.kind]} leaf proof`,a.span,bS);if(!i&&a.isProof)throw xS(`PROOF keyword found in step that does not begin subproof`,a.span,yS);let o=a.token.text[1];if(o===`+`&&!i)throw xS(`<+> used but no subproof expected`,a.span,yS);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:St(a.token);if(s<n||!i&&s>n)return;let c=dS.has(a.body.kind)?tn(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Tt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...b(a.token),range:C(a.start,l)}},d=gS(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=nn(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:gS(d,f.span)}},rn=()=>{if(!Qt())return;let e=[];for(;Qt();)e.push(en());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=tn(e,0,0,t.span),r=e[n.next];if(r)throw xS(`extra step(s) after finished proof`,r.span,vS,`Proof.Parser.toplevel`);return n.proof},an=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},on=()=>{if(T().kind!==`Identifier`||!E(`==`,1))return;let e=he();return d.add(e),D(),e},sn=()=>{if(!i)return j();let e=ne(),t=ue(j);if(t)return t;throw le(`Expected "====" but found ${re(e)}`,e)},cn=e=>{let t=o,n=D(),r=on(),a=Nt(()=>{let e=E(`ASSUME`)?Ut():sn();return i?{statement:e,proof:rn()}:{statement:e,proof:Et(T())?Zt():void 0}}),s=a.statement,c=w({name:r,statement:s,proof:a.proof,location:b(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&an(e,r,s,c.location)},P=()=>{let e=o,t=D(),n=on();return w({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:b(t)},e)},ln=()=>{let e=b(k(`----`));k(`MODULE`);let t=be();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(p.push(n),u.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&Ce(()=>{let e=o;n.extends.push(be()),n.extendsRanges.push(C(e))});;){let t=o,r=T();if(r.kind===`ModuleEnd`)return e.range={module:p[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},p.pop(),u.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=ln();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=b(D()),r=_t();n.constants.push(...r),e.range=C(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=b(D()),r=Ce(()=>{let e=o,t=b(T());return w({name:he(),arity:0,location:t},e)});n.variables.push(...r),e.range=C(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=P();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&an(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw le(`Expected a module unit but found ${re(r)}`);let e=zt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=b(D()),r=vt();e.range=C(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:un(n,w(ht(void 0,[],!1,b(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){un(n,w(ht(void 0,[],!0,b(r)),t));continue}un(n,w(mt(!0),t));continue}r.kind===`Keyword`&&lS.has(r.text)?cn(n):un(n,ft(!1))}}},un=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},dn=ln(),fn=ye?Gx(e):void 0;if(fn!==void 0)throw new r(fn);return dn},PS=e=>NS(e,`tlc`),FS=(e,t)=>NS(e,`tlc`,t),IS=e=>NS(e,`tlapm`),LS=e=>NS(e,`sany`),RS=`$subexpression`,zS=(e,t)=>new r(`${e} at line ${t.line}, column ${t.column}`),BS=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return BS(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=BS(r,t,n);if(e)return e}},VS=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),HS=(e,t)=>{let n=e.location,r=VS(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw zS(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw zS(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:RS,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:RS,args:e.args,location:n,resolution:ec},location:n}},US=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:ec})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ec}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ec};return HS({...t,params:[...t.params,...r]},a)},WS=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s,c=!1,l=(t,r)=>{if(!t)throw zS(r,i);nc.set(n,{args:e.slice(0,o).flatMap(e=>`args`in e?e.args:[]),error:{location:m(t),message:r}}),c=!0},u=n=>{let r=[],a=[];for(;o<e.length;){let s=e[o];if(s.kind!==`Name`)throw zS(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>wl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o++}throw zS(`Unknown operator ${r.join(`!`)}`,i)},d=t=>{let c=u(t),d=c.definition,f=sc(d),p=o===e.length-1;if(c.args.length!==f&&(!r||c.args.length!==0))return l(n.argumentRanges?.[o]??i.range,`The operator ${c.name} requires ${f-c.earlier} arguments.`);if(p)return{definition:d,args:c.args};if(d.kind!==`Operator`)throw zS(`Cannot select a subexpression of ${d.name}`,i);a.params.push(...d.params),a.args.push(...c.args),s=d.body,o++},f=()=>{for(;o<e.length&&!c;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],c=s&&BS(s,t.name,[]);if(!c)return l(i,`Cannot find label \`${t.name}'.`);let u=c.label.params;if(!r&&t.args.length!==u.length)return l(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),s=c.label.body,o++}},p=t=>{if(!s)throw zS(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(s.kind===`Label`){s=s.body,p(t);return}if(s.kind===`Let`){if(t.kind!==`Operand`||Oc(t.operand,1)!==0)throw zS(`A LET/IN expression has only one operand`,i);a.lets.push(s.definitions),s=s.body;return}let n=Mc(s);if(n&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...n.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),s=n.body;return}if(s.kind===`Case`&&t.kind===`Operand`){let n=[...s.arms,...s.other?[{condition:void 0,body:s.other}]:[]],r=n[Oc(t.operand,n.length)],a=e[o+1];if(!r||a?.kind!==`Operand`)throw zS(`A subexpression of CASE must have the form !i!j`,i);o++;let c=Oc(a.operand,2),l=c===0?r.condition:c===1?r.body:void 0;if(!l)throw zS(`Nonexistent CASE operand`,i);s=l;return}if(t.kind!==`Operand`)throw zS(`Unexpected subexpression selector`,i);let r=n?n.sets:Nc(s),c=r?.[Oc(t.operand,r.length)];if(!c)throw zS(`Nonexistent operand specified by the selector`,i);s=c},h=d(void 0);if(c)return n;if(h)return US(h.definition,{...a,args:h.args});for(f();o<e.length&&!c;){let t=e[o];if(t.kind===`Name`){for(;s?.kind===`Label`;)s=s.body;if(s?.kind!==`Let`)throw zS(`A name selector here must be from a LET clause`,i);a.lets.push(s.definitions);let e=d(s.definitions);if(c)return n;if(e)return US(e.definition,{...a,args:[...a.args,...e.args]});f()}else p(t),o++}if(c)return n;if(!s)throw zS(`Subexpression selection failed`,i);return HS(a,s)},GS=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return kc(e,t,n)},KS=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(KS),qS=(e,t,n,r=!1)=>{if(!KS(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Dl(e,e=>qS(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>JS(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>qS(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Dl(e,e=>qS(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?GS(a.name,[],void 0,t):a.kind===`Apply`?GS(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=WS(o,t,a,r);return c!==a&&tc.add(c),c},JS=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:qS(e.expression,t,n,!0)}))}),YS=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},XS=(e,t)=>JS(e,YS(t.definitions),()=>!1),ZS=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=YS([...t,...e.definitions]),a=e=>n.has(e),o=YS([...t,...e.definitions,...r]),s=e=>qS(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>qS(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return JS(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?JS(e,i,c):El(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>KS(e.body))||e.assumptions.some(e=>KS(e.expression))?{...h,definitions:e.definitions.map(e=>El(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},QS=(e,t)=>e.maxLevels[t]??3,$S=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Iu({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>fu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>fu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>pu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=lu(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&fu(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Lu(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=m(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=c.argConstraints.get(su(e.name,n));i!==void 0&&QS(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),c.argParams.forEach(e=>{let n=lu(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=QS(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw te([...r.values()])}},eC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],tC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),nC=new Map(rp.flatMap(e=>e.map(t=>[t,e[0]]))),rC=e=>nC.get(e)??e,iC=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},aC=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),oC=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:rC(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:rC(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},sC=(e,t)=>{let n=[];for(let r=t;;){let t=oC(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},cC=e=>({line:e.line,column:e.column}),lC=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=sC(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}}return{references:s,end:e.length}};return i(0,t??``).references},uC=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,dC={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},fC=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&uC(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&uC(e[n+1],e[n+2])?n+=uC(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>dC[e])}"`:r.text)}return t},pC=e=>e[2]?.text,mC=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},hC=(e,t)=>e.find(e=>e.name===t)??e.map(e=>hC(e.modules,t)).find(Boolean),gC=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:mC(t),getModule:()=>n??=e===void 0?PS(``):FS(e,t)}},_C=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=gC(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??sp.get(i)??up.get(i)??MS(e,i),c=a(s),l=c.tokens,u=c.ranges.get(pC(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>hC(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},vC=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=sC(t,e+1);i.push({location:cC(t[e]),apply:e=>r.forEach(t=>e.put(aC(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:cC(n),apply:t=>t.put(aC(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&sC(t,u+1).every(e=>s.has(e))&&o(u,`definition`),tC.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(cC(n)),i.push({location:cC(n),apply:e=>e.put(aC(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(aC(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=rC(e.name);i.push({location:e.location,apply:n=>n.put(aC(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(aC(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(aC(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>oc(e.location,t.location)?-1:+!!oc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=iC();n.set(i??``,o),np.toReversed().forEach(e=>o.put(aC(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},yC=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),ip.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=lC(a(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;fC(a(void 0)).forEach((e,t)=>{t===3&&op.forEach(r),r(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),v.set(n.unit,[...v.get(n.unit)??[],i]),!_.has(i)){if(_.add(i),e(i).tokens.length===0){let t=n.unit??pC(e(void 0).tokens);throw o(i,t)}fC(a(i)).forEach(r)}}eC.forEach(r);let b=/* @__PURE__ */ new Set,ee=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return ee(void 0),ap.forEach(r),[...n]},bC=(e,t)=>{let n=_C(e,t),r=n.getParsed,i,a=()=>i??=vC(r);return{getStringOrder:e=>yC(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},xC=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),SC=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],CC=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof r))throw n;let i=Gx(e);throw i===void 0?n:te([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,i)}},wC=e=>new r(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),TC=(e,t)=>e.location.range&&t.location.range&&{location:m(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${m(t.location.range)}.`},EC=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,DC=e=>e===`Theorem`?`ThmOrAssumpDefNode`:EC(e),OC=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Gl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),kC=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>kC(e,t))},AC=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Bl(e),n.get(e)??n.size)),n},jC=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),MC=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Qh(e);if(e.kind===`Number`&&!mn(e.value))throw $h(e);MC(e.kind===`Let`?[...mt(e),...jC(e.instances??[])]:mt(e))}),NC=(e,t)=>{let n=t.order??bC(t.source,t.loadModule),i=n.parseModule(t.source),a=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(xp.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=Af(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`,p.readLine=t.readLine;let h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,b=[],ee=/* @__PURE__ */ new Map,x=[],S=[],C=(e,t)=>x.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),w=0,ne=e=>`${e}#${w++}`,T=[],re=[],ie=$S(e=>{let t=v.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=f.get(e);if(n)return n;let r=Up(e,t.print,p,t.files,d);if(!r)return;Vp.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Hp.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:iu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:ou(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},le=e=>{let n=Vp.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&C(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},ue=e=>(MC([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...jC(e.instances)]),e.modules.forEach(ue),e);ue(i);let de=(e,r)=>{let i=t.loadModule?.(e)??fp(p.version).get(e)??MS(t.source,e);if(i===void 0)throw o(e,r);let a=CC(i,e,n);if(a.name!==e)throw te([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return ue(a)},fe=e=>{let t=S.indexOf(e.name);if(t!==-1){let n=[...S.slice(t),e.name].map(e=>`${e}.tla`);throw new r(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,i=[],a=[],o=[];S.push(e.name),x.push(n);let s=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:re,levelChecks:o});if(x.pop(),S.pop(),a.length>0)throw te(a,!1,void 0,re);let c=i.find(e=>n.has(e.name)),l=c&&h.get(c.name),u=l&&TC(c,l.module);if(u)throw te([u],!1,void 0,re);if(c)throw wC(c);return o.forEach(e=>e()),{linked:s,closure:n}},pe=(e,n)=>{let r=h.get(e);if(r)return C(e,ee.get(e)??[]),r;let i=fe(de(e,n)),o=/* @__PURE__ */ new Map;return Bp(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new y(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:a_(Gg(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&xC.has(e))return;let r=a.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),a.delete(n.key)}),h.set(e,i.linked),ee.set(e,i.closure),C(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let o=i?void 0:le(e.module);if(o)return E(e,o);let d=i??pe(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=SC(d),p=`#${w++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=hl(XS(e,t),f,t,n);T.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=$l({params:g,substitutions:new Map([...h].map(([e,t])=>[e,xl(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,o)=>{let u=ne(`${i}@${t.name}`),d=o(u);return a.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??i}`),s.set(u,!r),c.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return D(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},E=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),D=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},O=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),k=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=O(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Kl(r,n),location:n}}},he=(e,t,n,r)=>{let i=e.location,o=r?void 0:le(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=O(n.arity,n.params);return ql(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${w++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=SC(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};T.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>kC(f(e),p),h=d.map(t=>{let n=k(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=$l({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Kl(e.params,i),location:i,resolution:ec}:Gl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:OC(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=O(n.arity,n.params),o=[...e.params,...a];return ql(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},ge=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let r=wb(e,t.loadClass?.(e.name),e===i);_e.set(e.name,r.overrides);let o=r.module,c=T.length,l=new Map([...xp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:ul,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||m(n.range)===m(e.range))return;let r=m(e.range),i=m(n.range);DC(n.kind)===DC(e.kind)?d.warnings.push({location:r,message:`Warning: the ${EC(n.kind)} of '${t}' conflicts with \nits ${EC(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${EC(e.kind)} of '${t}' conflicts with \nits ${EC(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,y=[],ee=[...o.constants],x=o.variables.filter((e,t)=>o.variables.findIndex(t=>t.name===e.name)===t),S=x.map(e=>e.name),te=x.map(e=>e.location);o.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:le(e);if(r){p(r);return}let i=t??pe(e,o.name);ee.push(...i.constants.filter(e=>ee.every(t=>t.name!==e.name)&&!S.includes(e.name))),i.variables.forEach((e,t)=>{S.includes(e)||ee.some(t=>t.name===e)||(S.push(e),te.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),y.push(i)});let C=new Map(l),w=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],ne=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,ne(e)));let ae=e=>({key:ce(e),arity:sc(e),params:cc(e),kind:dl(o,e)?`Theorem`:`Definition`,range:e.location.range}),oe=ee.length===0&&S.length===0,ce=e=>o===i?e.name:`${e.name}@${n.id}`,ue=/* @__PURE__ */ new Map,de=()=>new Map([...n.modules,..._]),fe=e=>{let t=o.modules.find(t=>t.name===e.module);return t?oc(t.location,e.location)?_.get(t.name):void 0:de().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=fe(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:E(e,n),instancer:o.name};let r=t??pe(e.module,o.name),i=SC(r);return{declarations:i,symbols:D(e,r.exported,i,e=>e),instancer:o.name}},bound:C,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,instanced:ue,facts:g,reports:f,warnings:n.warnings}),k=e=>[...w.filter(t=>oc(t.location,e)).map(e=>[e.name,ne(e)]),...o.definitions.filter(t=>oc(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),ye=e=>{let t=de(),r=t.get(e.name),i=r&&TC(e,r.module);if(r&&!i)throw wC(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:k(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||_.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=me(e,o,O(o),oe,de().get(e.module));ue.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>oc(e.location,t.location)?-1:1).forEach(e=>e.link());let be=ZS(ru(o,(e,t)=>he(e,t,o.name,fe(e))),ge(l));n.errors.push(..._l(be,O(be))),be.definitions.forEach(e=>{let t=ce(e);a.set(t,e),s.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!oc(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let xe={module:be,constants:ee,variables:S,variableLocations:te,visible:l,exported:h,modules:_,extended:y,facts:/* @__PURE__ */ new Set([...g,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};v.has(o.name)||v.set(o.name,xe);let Se=T.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>Ru(be,{constants:new Set(ee.map(e=>e.name)),variables:new Set(S),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,re)),b.push(xe),xe},ye=fe(i).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=pe(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});b.push(...b.splice(b.indexOf(ye),1)),re.length>0&&!t.isSanyReported&&t.print(g(re)),ye.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(ye,/* @__PURE__ */ new Set);let Te=ye.constants.map(e=>e.name),Ee=ye.variables,De=db(e,{root:ye,moduleSymbols:new Map([...f,...[...h].map(([e,t])=>[e,t.visible]),[i.name,ye.visible]]),definitions:a,builtins:d,copySources:c,operatorConstants:new Map(Se.flatMap(e=>pe(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),Oe=De.constants,ke=De.substitutions;be!==void 0&&d.forEach((e,t)=>{let n=Ep(e);n&&d.set(t,n)});let A=AC(Ee,b.flatMap(e=>e.module.variables.map(e=>e.name))),Ae=Zu({definitions:a,substitutions:ke,constants:Oe,variableIndex:A,builtins:d,variables:Ee}),je={runtime:p,definitions:a,builtins:d,constants:Oe,substitutions:ke,instanceNames:oe,variables:Ee,variableIndex:A,facts:Ae,startupValues:Array.from({length:Ae.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Me=Iu({constants:new Set(Oe.keys()),variables:/* @__PURE__ */ new Set([...Ee,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>pg(e,je)}),Ne=e=>{try{W(e,{environment:je,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};ke.forEach((e,t)=>{let n=a.get(e),r=Te.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Me.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ne(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new _(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Pe=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Fe=n.createDefinitionOrder();return{environment:je,assumptions:Ce,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:b.filter(e=>!Pe.has(e.module.name)||SC(e).length===0).flatMap(e=>Fe(e===ye?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:b.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,rootName:i.name}},PC=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),FC=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},IC=e=>v(new y(`${i}${e}`),S.error),LC=e=>{let t=L(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!dn(e)||!dn(i))throw IC(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},RC=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${zC(t)}`:n},zC=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(zC).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${RC(e.pattern,e.set)}:${zC(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(zC).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${zC(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>RC(e.pattern,e.set)).join(`,`)}|->${zC(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(zC);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},BC=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,VC=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new _(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw IC(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!P(a)||!F(a))throw IC(`The symmetry operator must specify a set of functions.`);let o=I(a).elements;if(!o.every(un))throw IC(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=zC(BC(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(LC).forEach(e=>{e.size>0&&d.set(PC(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=FC(n,e),r=PC(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!BC(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>dn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},HC=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=WC(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(WC(e[r],t));return a}},UC=(e,t)=>{let n=[],r=[];for(let i of e){let e=WC(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Xn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Xn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},WC=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=UC(e.elements,t);return n?tr(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=L(e),r=HC(n.domain,t),i=HC(n.range,t)??n.range;if(r){let e=Qr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?rr(n.domain,e.range):e}return i===n.range?n:rr(n.domain,i)}if(n===`Interval`||!P(e)||!F(e))return e;let r=I(e),i=HC(r.elements,t);return i?Kr(i):r},GC=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=WC(e[o],i),a===0&&(a=Xn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},KC={line:0,column:0},qC=e=>({kind:`Identifier`,name:e,location:KC}),JC=e=>({name:e,expression:qC(e),scope:void 0}),YC=/* @__PURE__ */ new Set([`name`,`property`]),XC=(e,t,n)=>{let r=pg(t,n);if(!r)throw new _(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new _(YC.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},ZC=e=>e.body.kind===`Number`||e.body.kind===`String`,QC=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(ed(t,n)&&!ZC(t))try{return W(qC(e),Cw(n,void 0,void 0))}catch(e){if(e instanceof y||C(e))return;throw e}},$C=(e,t,n)=>{if(n.constants.has(t))throw new _(`The ${e} ${t} cannot be a constant.`);let r=XC(e,t,n);if(QC(t,r,n)!==void 0)throw new _(`The ${e} ${t} cannot be a constant.`);return r},ew=(e,t,n)=>{let r=n.constants.has(t)?void 0:XC(e,t,n),i=r?QC(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new _(`The ${e} of ${t} is equal to ${R(i)}`);return i===void 0?r:void 0},tw=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},nw=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Hg(e.startupDefinitions,r),t.invariants.forEach(e=>{ew(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},rw=(e,t)=>{let n=Iu({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=ew(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1789
1789
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1790
1790
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1791
1791
|
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw v(new _(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),S.safetyEvaluationFailure)}return[JC(e)]})},iw=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>iw(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=pg(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&Vg(n,t)===void 0)return iw(n.body,t)}return[e]},aw=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||ny(r,e.scope,t)>0)return!1;let i=W(r,Cw(t,void 0,void 0,e.scope));if(i===!1)throw new _(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new _(`The operator ${r.name}, which equals ${R(i)},\ncannot be used as a ${n}`);return!0},ow=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return $C(n,e,t),qC(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new _(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):QC(e.specification,XC(`name`,e.specification,t),t);if(c!==void 0)throw new _(`The value of ${e.specification} is equal to ${R(c)}`);let l=XC(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;iy(l.body,void 0,t,!1).forEach(e=>{let c=e.expression;if(aw(e,t,`spec`))return;let l=c.kind===`Identifier`&&!M(c)?t.variableIndex.get(c.name):void 0;if(c.kind===`Identifier`&&l!==void 0){let e=n[l].range;throw new _(`The operator ${c.name}, which equals ${e?m(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw v(new _(`TLC does not support temporal existential, nor universal, quantification over state variables.`),S.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=Py(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:St.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1792
1792
|
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:St.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new _(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1793
|
-
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&ny(c.expression,e.scope,t)<2)throw v(new y(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let f=ny(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new _(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,h=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:KC},next:o.length===0?void 0:g(o[0],a.length),scope:h,temporals:s,isPropertyFairness:s.length>0&&!d}},sw=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=ew(`property`,e,t);if(!i)return;ny(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;iy(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(aw(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&ny(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?pg(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=ny(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new _(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},cw=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},lw=(e,t,n)=>t.flatMap(t=>ew(e,t,n)?[JC(t)]:[]),uw=(e,t)=>{let n=pg(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},dw=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);$C(`possible`,n,t);let i=JC(n);if(ny(i.expression,void 0,t)===3)throw new _(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),fw=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},pw=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=pg(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},mw=(e,t)=>e.flatMap(e=>iw(e.expression,t).map(n=>{let r=e.scope===void 0?od(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:fw(n,r,t),predicate:pw(e.expression,t)}})),hw=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},gw=/[\u0100-\uffff]/,_w=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),vw=e=>e.kind===`String`?gw.test(e.value):e.kind===`Set`&&e.elements.some(vw),yw=e=>e.kind===`String`&&gw.test(e.value)||e.kind===`Apply`&&_w.has(e.operator)||mt(e).some(yw),bw=(e,t)=>e.constants.some(e=>vw(e.value)||(e.args??[]).some(vw))||[...t.definitions.values()].some(e=>yw(e.body)||e.kind===`Function`&&e.bounds.some(e=>yw(e.set))),xw=e=>{if(!un(e))return;let t=vn(L(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},Sw=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},Cw=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ww=(e,t,n)=>cg(W(e,t),n),Tw=(e,t,n=Dw)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},Ew=(e,t,n)=>{let r=t.kind===`Identifier`?pg(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?m(a):Gh(i)}`},Dw=(e,t)=>Ew(`boolean`,e,t),Ow=(e,t)=>Tw(e.expression,t,(n,r)=>(Tw(e.predicate,t),Dw(n,r))),kw=()=>{},Aw=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ww(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),jw=(e,t)=>{try{return e(Cw(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},Mw=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=jw(e=>fg(W(n.expression,e),n.expression),t);if(e)return{name:Gh(n.expression),trace:[],message:e.message}}},Nw=(e,t,n,r=!1)=>{let i=bC(t.source,t.loadModule);return An(i.getStringOrder(e)),Fn(t),so(t.fingerprintPolynomial??0),r&&jn(),{order:i,specification:NC(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators})}},Pw=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=Nw(t,e,e.onPrint??console.log),r=n.specification;nw(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Ny(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Ry(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:Lw(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators),getDescription:o}},Fw=(e,t,n)=>{let r=Mw(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),S.assumptionViolation},Iw=e=>v(new y(`${i}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),Lw=(e,t,n,r,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw Iw(e);return{name:e.operator,key:e.key}}),c=rw(e.invariants,t),l=ow(e,t,n,r,a),u=sw(e,t,a),d=e.properties[0],f=d&&pg(d,t)?.location.range,p=e.specification,h=p&&pg(p,t)?.location.range;l.isPropertyFairness&&f&&h&&a?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${m(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${m(h)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let g=mw([...c,...u.invariants],t),b=[...new Map(g.map(e=>[e.predicate,e])).values()],ee=g.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(ee||u.initialPredicates.length>0||t.variables.length>0))throw new _(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&ee)throw new _(`The configuration file did not specify the next state predicate.`);let x=lw(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),te=mw(x,t),C=lw(`action constraint`,e.actionConstraints,t),w=t.coverage,ne=(e,n,r=!0)=>n.flatMap(n=>{if(!w)return[];let i=r?pw(n.expression,t):n.expression,a=Ao(r?n.name:void 0,i,t),o=Oo(w,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),T=[...ne(`invariant`,c),...ne(`invariant`,u.invariants,!1)],re=ne(`constraint`,C),ie=ne(`constraint`,x),ae=ne(`implied`,u.initialPredicates,!1),oe=ne(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),se=(e,n,r,i)=>{try{return Ho(e,n.node,()=>W(n.expression,Cw(t,r,i,n.scope)))}catch{return}},ce=(e,t,n)=>w!==void 0&&e.every(e=>se(w,e,t,n)===!0),le=(e,t,n)=>{if(w){for(let r of e){let e=se(w,r,t,n);if(typeof e!=`boolean`)return;if(!e)return w.primary[r.node]++,!1;w.secondary[r.node]++}return!0}};e.rlReward!==void 0&&XC(`rlreward`,e.rlReward,t),e.periodic!==void 0&&XC(`periodic`,e.periodic,t);let ue=dw(e.possible,t);if(t.variables.length===0)return;let de=e.symmetry===void 0?void 0:VC(e.symmetry,t,e.substitutions),fe=e.view===void 0?void 0:$C(`view function`,e.view,t),pe=e.view??s(`view`)[0]?.name,me=pe===void 0?void 0:JC(pe),E=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:KC};return{...e,unchanged:t}}),D=e=>ny(e.expression,void 0,t)>=2,O=ue.filter(e=>!D(e)),k=ue.filter(D),he=t.runtime,ge,_e=()=>{if(ge)return ge;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ge=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),ge},ve=(e,n)=>W(e,Cw(t,n,void 0)),ye=e=>{let t=de===void 0?e:GC(e,de,_e());return bo(me===void 0?_e().map(e=>t[e]):[ve(me.expression,t)])},be=e=>ce(ae,e)?void 0:u.initialPredicates.find(n=>!Tw(n.expression,Cw(t,e,void 0,n.scope))),xe=/* @__PURE__ */ new WeakSet,Se=(e,n,r)=>{let i=r&&!xe.has(r)?r:void 0;if(hw(e,n,i))return!1;try{let r=Cw(t,n,void 0,e.scope),a=e.membership;return i&&a?!Qi(n[a.variable],i[a.variable],W(a.set,r)):!Ow(e,r)}catch(t){throw r?Vt(v(t,S.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},Ce=bw(e,t);he.getFingerprint=ye;let we=()=>{let e=ue.find(e=>!he.possibleCounts.get(e.name));if(!e)return;let n=uw(e.name,t),r=n?` at ${m(n)}`:``;return{name:e.name,code:St.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(R(jf(he),!0))}},Te=fe?.body.kind===`Tuple`?fe.body.elements:[],Ee=Te.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),De=fe?.body.kind===`Tuple`&&Ee.length===Te.length&&new Set(Ee).size===Ee.length,Oe=(e,n)=>De?_e().filter(e=>Ee.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(R(n[e]))}\n`).join(``):N(R(ve(e,n))),ke=(e,n,r)=>Tw(e.expression,Cw(t,n,r),e=>`${i}${Dw(e,t)}`),A=e=>{let n=Object.fromEntries(_e().map(n=>[t.variables[n],e[n]]));return me===void 0?n:Ln(n,()=>Oe(me.expression,e))};return{properties:u,spec:l,toRecord:A,evaluateAlias:(e,n,r,i)=>{try{$C(`alias`,e,t);let i=W(qC(e),Cw(t,n,r)),a=xw(i);return a===void 0?A(n):zn(a,e)}catch(e){if(!(e instanceof _||e instanceof y))throw e;return{...A(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:de!==void 0,isConstrained:te.length>0||C.length>0,getTypedChecks:n=>{if(w!==void 0||ue.length>0||e.periodic!==void 0||[...g,...te].some(e=>e.scope!==void 0)||C.length>0||u.actionProperties.some(e=>e.scope!==void 0)||u.liveness.length>0&&(n===void 0||me!==void 0)||l.init===void 0||l.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(te.map(e=>e.predicate))],a=u.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=cw(l.scope),c=e=>Vg(e,t)===void 0&&rd(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&ed(e,t)&&c(e))||nd([l.init,l.next,...r,...i,...a,...u.actionProperties.flatMap(e=>[e.action,e.subscript]),...me?[me.expression]:[],...s,...ib(n??[])],t,`replayed`))?void 0:{init:l.init,next:l.next,scope:l.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>be(e)===void 0,actionProperties:u.actionProperties,symmetry:de,view:me?.expression,variableOrder:_e(),liveness:n}},getTlcOrder:_e,getStoredFingerprints:(e,t)=>me!==void 0||Ce?BigInt64Array.from(e,ye):So(t,_e()),getFingerprintState:e=>{if(Ce)return[String(ye(e))];let t=de===void 0?e:GC(e,de,_e());return me===void 0?t:[ve(me.expression,t)]},findViolatedInvariant:(e,t)=>{if(ce(T,e))return;let n=g.find(n=>Se(n,e,t));return n&&xe.add(e),n},getViolatedInvariants:e=>{let t=b.filter(t=>g.some(n=>n.predicate===t.predicate&&Se(n,e,void 0)));return t.length>0&&xe.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Tw(n,Cw(t,e,void 0,r));te.every(e=>r(e.predicate,e.scope))&&n();let i=b.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>Tw(e.predicate,Cw(n,t,void 0,e.scope)))&&C.every(r=>Tw(r.expression,Cw(n,e,t,r.scope))))||r())||b.every(e=>Tw(e.predicate,Cw(n,t,void 0,e.scope))))&&E.every(r=>Tw(r.box,Cw(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>le(ie,e)??te.every(r=>hw(r,e,n)||Ow(r,Cw(t,e,void 0))),findFailedInitialPredicate:be,findViolatedActionProperty:(e,n)=>ce(oe,e,n)?void 0:E.find(r=>{try{return!Tw(r.action,Cw(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!ww(r.unchanged,Cw(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(Rw(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>le(re,e,t)??C.every(n=>ke(n,e,t)),getExcludingConstraints:(e,n)=>[...te.filter(e=>!Ow(e,Cw(t,n,void 0))),...C.filter(t=>!ke(t,e,n))].map(e=>{let n=uw(e.name,t);return n?m(n):e.name}),trackStatePossible:O.length===0?kw:e=>Aw(O,he,Cw(t,e,void 0)),trackActionPossible:k.length===0?kw:(e,n)=>Aw(k,he,Cw(t,e,n)),findUnwitnessedPossible:we,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=qC(e.rlReward),o=W(a,Cw(t,n,r));if(typeof o!=`number`)throw new y(Ew(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=pg(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!ZC(n)&&Vg(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw v(new y(i),S.configParseError)}let a=(e,n)=>{let r=jw(e=>Tw(qC(n),e),t);if(!r)return;let i=pg(n,t)?.body,a=uw(n,t),o=a?` at ${i?.kind===`Number`?Gh(i):m(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=we();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},Rw=e=>e instanceof x?v(e,e.exitCode):e,zw=(e,t)=>e*((t-e)/2**64),Bw=e=>e.includes(`.`)?e:`${e}.0`,Vw=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Bw(String(e));let[n,r]=e.toExponential().split(`e`);return`${Bw(n)}E${r.replace(`+`,``)}`},Hw=e=>e!==void 0&&e>=`0`&&e<=`9`,Uw=e=>{if(e===0)return`0.0`;let t=Vw(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;Hw(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;Hw(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;Hw(t[n])&&r<2;)i+=t[n++],r++;for(Hw(t[n])&&Number(t[n])>=5&&(i=Ww(i));Hw(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},Ww=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ww(r)}.`:n===`9`?`${Ww(r)}0`:`${r}${Number(n)+1}`},Gw=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},Kw=(e,t,n)=>{if(zw(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},qw=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Jw=[void 0,`lambda`,`tuple`,`record`],Yw=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=la(e.domain);return t?(a(7),a(Jw.indexOf(or(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(Jw.indexOf(or(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},Xw=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return $n(t.strings[n[r++]]);if(e===5)return tr(i(n[r++]));let a=Jw[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=si({kind:`Interval`,low:e,high:e+t-1});return ar(rr(o,i(t)),a)}let o=n[r++],s=i(o);return ar(rr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Fh as $,I as $t,Ny as A,$t as At,uv as B,li as Bt,IS as C,Ao as Ct,rb as D,ho as Dt,ab as E,go as Et,lv as F,ui as Ft,b_ as G,rn as Gt,dv as H,R as Ht,tv as I,Kr as It,r_ as J,Di as Jt,U as K,er as Kt,av as L,rr as Lt,py as M,yr as Mt,Xv as N,Qr as Nt,Iy as O,uo as Ot,ev as P,$n as Pt,Nh as Q,pr as Qt,nv as R,di as Rt,LS as S,To as St,ob as T,mo as Tt,sv as U,ba as Ut,rv as V,Wa as Vt,$_ as W,xa as Wt,Vg as X,F as Xt,pg as Y,Mn as Yt,f_ as Z,gr as Zt,nw as _,tt as _n,nd as _t,Kw as a,zt as an,jm as at,MS as b,Ee as bn,Ro as bt,Nw as c,Zt as cn,dp as ct,Mw as d,Ht as dn,rp as dt,St as en,Ph as et,Cw as f,Jt as fn,Nf as ft,tw as g,ft as gn,ed as gt,Fw as h,mt as hn,uf as ht,Gw as i,It as in,Pm as it,Ry as j,Xn as jt,Ly as k,bo as kt,Iw as l,qt as ln,up as lt,Pw as m,gt as mn,of as mt,Yw as n,Et as nn,oh as nt,zw as o,Rt as on,Mm as ot,Sw as p,Lt as pn,If as pt,W as q,nn as qt,Uw as r,Ft as rn,Ih as rt,qw as s,Mt as sn,Nm as st,Xw as t,Ct as tn,Lh as tt,Lw as u,Nt as un,fp as ut,Rw as v,Ke as vn,oc as vt,Gx as w,rs as wt,PS as x,Go as xt,WC as y,xe as yn,Oo as yt,fv as z,tr as zt};
|
|
1793
|
+
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&ny(c.expression,e.scope,t)<2)throw v(new y(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let f=ny(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new _(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,h=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:KC},next:o.length===0?void 0:g(o[0],a.length),scope:h,temporals:s,isPropertyFairness:s.length>0&&!d}},sw=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=ew(`property`,e,t);if(!i)return;ny(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;iy(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(aw(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&ny(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?pg(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=ny(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new _(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},cw=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},lw=(e,t,n)=>t.flatMap(t=>ew(e,t,n)?[JC(t)]:[]),uw=(e,t)=>{let n=pg(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},dw=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);$C(`possible`,n,t);let i=JC(n);if(ny(i.expression,void 0,t)===3)throw new _(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),fw=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},pw=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=pg(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},mw=(e,t)=>e.flatMap(e=>iw(e.expression,t).map(n=>{let r=e.scope===void 0?od(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:fw(n,r,t),predicate:pw(e.expression,t)}})),hw=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},gw=/[\u0100-\uffff]/,_w=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),vw=e=>e.kind===`String`?gw.test(e.value):e.kind===`Set`&&e.elements.some(vw),yw=e=>e.kind===`String`&&gw.test(e.value)||e.kind===`Apply`&&_w.has(e.operator)||mt(e).some(yw),bw=(e,t)=>e.constants.some(e=>vw(e.value)||(e.args??[]).some(vw))||[...t.definitions.values()].some(e=>yw(e.body)||e.kind===`Function`&&e.bounds.some(e=>yw(e.set))),xw=e=>{if(!un(e))return;let t=vn(L(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},Sw=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},Cw=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ww=(e,t,n)=>cg(W(e,t),n),Tw=(e,t,n=Dw)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},Ew=(e,t,n)=>{let r=t.kind===`Identifier`?pg(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?m(a):Gh(i)}`},Dw=(e,t)=>Ew(`boolean`,e,t),Ow=(e,t)=>Tw(e.expression,t,(n,r)=>(Tw(e.predicate,t),Dw(n,r))),kw=()=>{},Aw=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ww(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),jw=(e,t)=>{try{return e(Cw(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},Mw=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=jw(e=>fg(W(n.expression,e),n.expression),t);if(e)return{name:Gh(n.expression),trace:[],message:e.message}}},Nw=(e,t,n,r=!1)=>{let i=bC(t.source,t.loadModule);return An(i.getStringOrder(e)),Fn(t),so(t.fingerprintPolynomial??0),r&&jn(),{order:i,specification:NC(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine})}},Pw=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=Nw(t,e,e.onPrint??console.log),r=n.specification;nw(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Ny(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Ry(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:Lw(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators),getDescription:o}},Fw=(e,t,n)=>{let r=Mw(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),S.assumptionViolation},Iw=e=>v(new y(`${i}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),Lw=(e,t,n,r,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw Iw(e);return{name:e.operator,key:e.key}}),c=rw(e.invariants,t),l=ow(e,t,n,r,a),u=sw(e,t,a),d=e.properties[0],f=d&&pg(d,t)?.location.range,p=e.specification,h=p&&pg(p,t)?.location.range;l.isPropertyFairness&&f&&h&&a?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${m(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${m(h)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let g=mw([...c,...u.invariants],t),b=[...new Map(g.map(e=>[e.predicate,e])).values()],ee=g.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(ee||u.initialPredicates.length>0||t.variables.length>0))throw new _(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&ee)throw new _(`The configuration file did not specify the next state predicate.`);let x=lw(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),te=mw(x,t),C=lw(`action constraint`,e.actionConstraints,t),w=t.coverage,ne=(e,n,r=!0)=>n.flatMap(n=>{if(!w)return[];let i=r?pw(n.expression,t):n.expression,a=Ao(r?n.name:void 0,i,t),o=Oo(w,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),T=[...ne(`invariant`,c),...ne(`invariant`,u.invariants,!1)],re=ne(`constraint`,C),ie=ne(`constraint`,x),ae=ne(`implied`,u.initialPredicates,!1),oe=ne(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),se=(e,n,r,i)=>{try{return Ho(e,n.node,()=>W(n.expression,Cw(t,r,i,n.scope)))}catch{return}},ce=(e,t,n)=>w!==void 0&&e.every(e=>se(w,e,t,n)===!0),le=(e,t,n)=>{if(w){for(let r of e){let e=se(w,r,t,n);if(typeof e!=`boolean`)return;if(!e)return w.primary[r.node]++,!1;w.secondary[r.node]++}return!0}};e.rlReward!==void 0&&XC(`rlreward`,e.rlReward,t),e.periodic!==void 0&&XC(`periodic`,e.periodic,t);let ue=dw(e.possible,t);if(t.variables.length===0)return;let de=e.symmetry===void 0?void 0:VC(e.symmetry,t,e.substitutions),fe=e.view===void 0?void 0:$C(`view function`,e.view,t),pe=e.view??s(`view`)[0]?.name,me=pe===void 0?void 0:JC(pe),E=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:KC};return{...e,unchanged:t}}),D=e=>ny(e.expression,void 0,t)>=2,O=ue.filter(e=>!D(e)),k=ue.filter(D),he=t.runtime,ge,_e=()=>{if(ge)return ge;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ge=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),ge},ve=(e,n)=>W(e,Cw(t,n,void 0)),ye=e=>{let t=de===void 0?e:GC(e,de,_e());return bo(me===void 0?_e().map(e=>t[e]):[ve(me.expression,t)])},be=e=>ce(ae,e)?void 0:u.initialPredicates.find(n=>!Tw(n.expression,Cw(t,e,void 0,n.scope))),xe=/* @__PURE__ */ new WeakSet,Se=(e,n,r)=>{let i=r&&!xe.has(r)?r:void 0;if(hw(e,n,i))return!1;try{let r=Cw(t,n,void 0,e.scope),a=e.membership;return i&&a?!Qi(n[a.variable],i[a.variable],W(a.set,r)):!Ow(e,r)}catch(t){throw r?Vt(v(t,S.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},Ce=bw(e,t);he.getFingerprint=ye;let we=()=>{let e=ue.find(e=>!he.possibleCounts.get(e.name));if(!e)return;let n=uw(e.name,t),r=n?` at ${m(n)}`:``;return{name:e.name,code:St.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(R(jf(he),!0))}},Te=fe?.body.kind===`Tuple`?fe.body.elements:[],Ee=Te.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),De=fe?.body.kind===`Tuple`&&Ee.length===Te.length&&new Set(Ee).size===Ee.length,Oe=(e,n)=>De?_e().filter(e=>Ee.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(R(n[e]))}\n`).join(``):N(R(ve(e,n))),ke=(e,n,r)=>Tw(e.expression,Cw(t,n,r),e=>`${i}${Dw(e,t)}`),A=e=>{let n=Object.fromEntries(_e().map(n=>[t.variables[n],e[n]]));return me===void 0?n:Ln(n,()=>Oe(me.expression,e))};return he.toRecord=A,{properties:u,spec:l,toRecord:A,evaluateAlias:(e,n,r,i)=>{try{$C(`alias`,e,t);let i=W(qC(e),Cw(t,n,r)),a=xw(i);return a===void 0?A(n):zn(a,e)}catch(e){if(!(e instanceof _||e instanceof y))throw e;return{...A(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:de!==void 0,isConstrained:te.length>0||C.length>0,getTypedChecks:n=>{if(w!==void 0||ue.length>0||e.periodic!==void 0||[...g,...te].some(e=>e.scope!==void 0)||C.length>0||u.actionProperties.some(e=>e.scope!==void 0)||u.liveness.length>0&&(n===void 0||me!==void 0)||l.init===void 0||l.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(te.map(e=>e.predicate))],a=u.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=cw(l.scope),c=e=>Vg(e,t)===void 0&&rd(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&ed(e,t)&&c(e))||nd([l.init,l.next,...r,...i,...a,...u.actionProperties.flatMap(e=>[e.action,e.subscript]),...me?[me.expression]:[],...s,...ib(n??[])],t,`replayed`))?void 0:{init:l.init,next:l.next,scope:l.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>be(e)===void 0,actionProperties:u.actionProperties,symmetry:de,view:me?.expression,variableOrder:_e(),liveness:n}},getTlcOrder:_e,getStoredFingerprints:(e,t)=>me!==void 0||Ce?BigInt64Array.from(e,ye):So(t,_e()),getFingerprintState:e=>{if(Ce)return[String(ye(e))];let t=de===void 0?e:GC(e,de,_e());return me===void 0?t:[ve(me.expression,t)]},findViolatedInvariant:(e,t)=>{if(ce(T,e))return;let n=g.find(n=>Se(n,e,t));return n&&xe.add(e),n},getViolatedInvariants:e=>{let t=b.filter(t=>g.some(n=>n.predicate===t.predicate&&Se(n,e,void 0)));return t.length>0&&xe.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Tw(n,Cw(t,e,void 0,r));te.every(e=>r(e.predicate,e.scope))&&n();let i=b.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>Tw(e.predicate,Cw(n,t,void 0,e.scope)))&&C.every(r=>Tw(r.expression,Cw(n,e,t,r.scope))))||r())||b.every(e=>Tw(e.predicate,Cw(n,t,void 0,e.scope))))&&E.every(r=>Tw(r.box,Cw(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>le(ie,e)??te.every(r=>hw(r,e,n)||Ow(r,Cw(t,e,void 0))),findFailedInitialPredicate:be,findViolatedActionProperty:(e,n)=>ce(oe,e,n)?void 0:E.find(r=>{try{return!Tw(r.action,Cw(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!ww(r.unchanged,Cw(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(Rw(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>le(re,e,t)??C.every(n=>ke(n,e,t)),getExcludingConstraints:(e,n)=>[...te.filter(e=>!Ow(e,Cw(t,n,void 0))),...C.filter(t=>!ke(t,e,n))].map(e=>{let n=uw(e.name,t);return n?m(n):e.name}),trackStatePossible:O.length===0?kw:e=>Aw(O,he,Cw(t,e,void 0)),trackActionPossible:k.length===0?kw:(e,n)=>Aw(k,he,Cw(t,e,n)),findUnwitnessedPossible:we,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=qC(e.rlReward),o=W(a,Cw(t,n,r));if(typeof o!=`number`)throw new y(Ew(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=pg(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!ZC(n)&&Vg(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw v(new y(i),S.configParseError)}let a=(e,n)=>{let r=jw(e=>Tw(qC(n),e),t);if(!r)return;let i=pg(n,t)?.body,a=uw(n,t),o=a?` at ${i?.kind===`Number`?Gh(i):m(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=we();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},Rw=e=>e instanceof x?v(e,e.exitCode):e,zw=(e,t)=>e*((t-e)/2**64),Bw=e=>e.includes(`.`)?e:`${e}.0`,Vw=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Bw(String(e));let[n,r]=e.toExponential().split(`e`);return`${Bw(n)}E${r.replace(`+`,``)}`},Hw=e=>e!==void 0&&e>=`0`&&e<=`9`,Uw=e=>{if(e===0)return`0.0`;let t=Vw(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;Hw(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;Hw(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;Hw(t[n])&&r<2;)i+=t[n++],r++;for(Hw(t[n])&&Number(t[n])>=5&&(i=Ww(i));Hw(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},Ww=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ww(r)}.`:n===`9`?`${Ww(r)}0`:`${r}${Number(n)+1}`},Gw=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},Kw=(e,t,n)=>{if(zw(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},qw=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Jw=[void 0,`lambda`,`tuple`,`record`],Yw=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=la(e.domain);return t?(a(7),a(Jw.indexOf(or(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(Jw.indexOf(or(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},Xw=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return $n(t.strings[n[r++]]);if(e===5)return tr(i(n[r++]));let a=Jw[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=si({kind:`Interval`,low:e,high:e+t-1});return ar(rr(o,i(t)),a)}let o=n[r++],s=i(o);return ar(rr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Fh as $,I as $t,Ny as A,$t as At,uv as B,li as Bt,IS as C,Ao as Ct,rb as D,ho as Dt,ab as E,go as Et,lv as F,ui as Ft,b_ as G,rn as Gt,dv as H,R as Ht,tv as I,Kr as It,r_ as J,Di as Jt,U as K,er as Kt,av as L,rr as Lt,py as M,yr as Mt,Xv as N,Qr as Nt,Iy as O,uo as Ot,ev as P,$n as Pt,Nh as Q,pr as Qt,nv as R,di as Rt,LS as S,To as St,ob as T,mo as Tt,sv as U,ba as Ut,rv as V,Wa as Vt,$_ as W,xa as Wt,Vg as X,F as Xt,pg as Y,Mn as Yt,f_ as Z,gr as Zt,nw as _,tt as _n,nd as _t,Kw as a,zt as an,jm as at,MS as b,Ee as bn,Ro as bt,Nw as c,Zt as cn,dp as ct,Mw as d,Ht as dn,rp as dt,St as en,Ph as et,Cw as f,Jt as fn,Nf as ft,tw as g,ft as gn,ed as gt,Fw as h,mt as hn,uf as ht,Gw as i,It as in,Pm as it,Ry as j,Xn as jt,Ly as k,bo as kt,Iw as l,qt as ln,up as lt,Pw as m,gt as mn,of as mt,Yw as n,Et as nn,oh as nt,zw as o,Rt as on,Mm as ot,Sw as p,Lt as pn,If as pt,W as q,nn as qt,Uw as r,Ft as rn,Ih as rt,qw as s,Mt as sn,Nm as st,Xw as t,Ct as tn,Lh as tt,Lw as u,Nt as un,fp as ut,Rw as v,Ke as vn,oc as vt,Gx as w,rs as wt,PS as x,Go as xt,WC as y,xe as yn,Oo as yt,fv as z,tr as zt};
|