tla-ts 0.0.4-dev.66582d4 → 0.0.4
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-cli.cjs +1 -1
- package/dist/run-cli.js +1 -1
- package/dist/transfer.cjs +7 -7
- package/dist/transfer.js +7 -7
- package/package.json +1 -1
- package/src/live-check.ts +4 -43
package/dist/transfer.js
CHANGED
|
@@ -1769,16 +1769,16 @@ _TEPosition ==
|
|
|
1769
1769
|
ELSE TLCGet("level") + 1
|
|
1770
1770
|
|
|
1771
1771
|
=============================================================================
|
|
1772
|
-
`]]),Nm=(e=`master`)=>e===`1.7.4`?Mm:jm,Pm=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),Fm=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Im=e=>P(e)?Ar(e):void 0,Lm=(e,t,n)=>{let r=V(e,t,n),i=Im(r);if(!i)throw Pm(n,`a function with a finite domain`,r);return i},Rm=(e,t,n)=>{let r=V(e,t,n),i=Im(r);if(!i)throw Fm(t===0?`first`:`second`,n,`bag`,r);return i},zm=(e,t)=>{if(!N(e)||!I(e))throw t();return L(e).elements},Bm=e=>e.range.every(e=>typeof e==`number`&&e>0),Vm=(e,t)=>{let n=e.domain.findIndex(e=>nn(e,t));return n===-1?void 0:e.range[n]},Hm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Um=Hm(`BagDiff`,`tlc2.value.impl.Value`,2),Wm=Hm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Gm=Hm(`BagUnion`,`tlc2.value.impl.Value`,1),Km=Hm(`BagOfAll`,`tlc2.value.impl.Value`,2),qm=Hm(`BagCup`,`tlc2.value.impl.Value`,2),Jm=Hm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Ym=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Vi(e)}`;throw Ui(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Xm=(e,t,n)=>{let r=Ym(e,n)+Ym(t,n);if(Fi(r))throw Ii(`${e}+${t}`);return r},Zm=(e,t,n,r)=>{let i=Vm(n,e.domain[t]),a=Ym(e.range[t],r);return i===void 0?a:a-Ym(i,r)|0},Qm=(e,t)=>Un(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>nn(e[0],r));a?a[1]=Xm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),$m=Ut([],[]),eh=e=>[ji(`EmptyBag`,$m),H(`IsABag`,1,e=>{let t=Im(V(e,0,`IsABag`));return t!==void 0&&Bm(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return Lm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Pm(`BagCardinality`,`a bag`,t);return Xm(e,n,Jm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Vm(Lm(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Fm(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Vm(Lm(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Fm(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Rm(e,t,`(+)`);if(!Bm(n))throw Fm(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Qm(t,qm)}),H(`\\ominus`,2,e=>{let t=Rm(e,0,`(-)`),n=Rm(e,1,`(-)`);return Un(t.domain.flatMap((e,r)=>{let i=Zm(t,r,n,Um);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=zm(t,()=>Pm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??$m;let r=n.map(e=>{let n=Im(e);if(!n)throw new S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return Qm(r,Gm)}),H(`\\sqsubseteq`,2,e=>{let t=Lm(e,0,`\\sqsubseteq`),n=Lm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Zm(t,r,n,Wm)<=0)}),Mi(`BagOfAll`,2,e=>{let t=Ai(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Im(n);if(!r)throw Fm(`second`,`BagOfAll`,`function with a finite domain`,n);return Qm(r.domain.map((e,n)=>Ut([t.call([e])],[r.range[n]])),Km)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!P(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Ar(n),i=Ln(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 ${z(r)}, which is not in its domain`);return Ln(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Ut(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Rr(Lm(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=zm(t,()=>Pm(`BagToSet`,`a function with a finite domain`,t));return Ut([...n],n.map(()=>1))})],th=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,nh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,rh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,ih=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,ah=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,oh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,sh=e=>{if(!P(e))return!1;let t=Ar(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},ch=(e,t)=>Ui(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Vi(t)}`),lh=(e,t)=>Ui(e,`Cannot cast tlc2.value.impl.${Vi(t)} to tlc2.value.impl.StringValue`),uh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),dh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw ch(t,e);return`[${L(e).elements.map(e=>ph(e,t)).join(`,`)}]`},fh=(e,t)=>{let n=Ar(e),r=Cr(n);return r?`[${r.map(e=>ph(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${uh(typeof e==`string`?e:z(e))}:${ph(n.range[r],t)}`).join(`,`)}}`},ph=(e,t)=>typeof e==`string`?uh(e):typeof e==`object`?e.kind===`ModelValue`?uh(e.name):N(e)?dh(e,t):fh(e,t):String(e),mh=e=>{if(N(e))return dh(e,th);if(!P(e)||sh(e))throw ch(th,e);return fh(e,th)},hh=e=>{if(!P(e))throw ch(nh,e);return fh(e,nh)},gh=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},_h=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return At(e);if(Array.isArray(e))return $n(e.map(e=>_h(e,t)));if(typeof e==`object`&&e)return er(Object.entries(e).map(([e,n])=>[At(e),_h(n,t)]));throw Ui(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},vh=(e,t)=>{if(e.trim()===``)return _h(null,t);try{return _h(JSON.parse(e,(e,t,n)=>typeof t==`number`?gh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ui(t,e.message):e}},yh=(e,t)=>{if(typeof e!=`string`)throw lh(t,e);return e},bh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ui(n,`${t} (No such file or directory)`);return r},xh=e=>[Ni(`ToJson`,1,e=>At(ph(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ni(`ToJsonArray`,1,e=>At(mh(V(e,0,`ToJsonArray`)))),Ni(`ToJsonObject`,1,e=>At(hh(V(e,0,`ToJsonObject`)))),Ni(`JsonSerialize`,2,t=>{let n=yh(V(t,0,`JsonSerialize`),rh),r=V(t,1,`JsonSerialize`);if(!Cr(r)&&!sh(r))throw new S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,ph(r,rh)),!0}),Ni(`ndJsonSerialize`,2,t=>{let n=yh(V(t,0,`ndJsonSerialize`),ih),r=V(t,1,`ndJsonSerialize`),i=Cr(r);if(!i)throw new S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${ph(e,ih)}\n`).join(``)),!0}),Ni(`JsonDeserialize`,1,t=>{let n=yh(V(t,0,`JsonDeserialize`),ah);return vh(bh(e,n,ah),ah)}),Ni(`ndJsonDeserialize`,1,t=>{let n=yh(V(t,0,`ndJsonDeserialize`),oh);return $n(bh(e,n,oh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>vh(e,oh)))})],Sh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Ch=1e6,wh=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Th=(e,t,n)=>{if(typeof e!=`number`||e<0)throw wh(t,n,`nonnegative integer`,z(e));return e},Eh=(e,t,n,r)=>{if(!N(e)||!I(e))throw wh(t,n,r,z(e));return L(e).elements},Dh=(e,t,n,r)=>Ln(Array.from({length:t},()=>Ln(e.filter(()=>r.nextDouble()<n)))),Oh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Th(V(e,0,n),`first`,n),i=Th(V(e,1,n),`second`,n),a=Eh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw wh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw wh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Dh(a,r,a.length===0?0:i/a.length,t.getRandom())},kh=e=>[Ni(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw wh(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Ui(Sh,String(n));let r=V(t,1,`RandomSubset`);if(!N(r)||!R(r)&&!I(r))throw wh(`second`,`RandomSubset`,`a finite set`,z(r));let i=Cm(r,e.version);if(i&&i.reduce((e,t)=>e*L(t).elements.length,1)>Ch)throw Ui(Sh,`Attempted to construct a set with too many elements (>${Ch}).`);return Ln(wm(n,r,e.getRandom(),e.version))}),Ni(`RandomSetOfSubsets`,3,t=>Oh(t,e)),Ni(`TestRandomSetOfSubsets`,3,t=>$n(Array.from({length:5},()=>L(Oh(t,e)).elements.length)))],Ah=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,jh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Ah})`,Mh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Ah}) throws java.io.IOException`,Nh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Ah})`,Ph=()=>er([[`action`,Ln([])],[`state`,Ln([])]]),Fh=()=>er([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Ih=e=>er([[`name`,e??`UnnamedAction`],[`location`,Fh()]]),Lh=(e,t,n)=>{let r=e.map((e,t)=>$n([t+1,er(Object.entries(e))])),i=r.slice(1).map((e,n)=>$n([r[n],t[n],e])),a=n?[$n([r[r.length-1],n.action,r[n.start]])]:[];return er([[`action`,Ln([...i,...a])],[`state`,Ln(r)]])},Rh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return km(e).get(t)},zh=(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)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),z(r));else throw new S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},Bh=e=>e.every(e=>e!==void 0),Vh=(e,t)=>er(t.variables.map((t,n)=>[t,e[n]])),Hh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!B(e)){if(t.variableIndex.has(r))return!0;let e=_l(r,t);if(e&&!n.has(e)&&(n.add(e),Hh(e.body,t,n)))return!0}return vi(e).some(e=>Hh(e,t,n))},Uh=(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[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=nn(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),Xi(`AssertError`,2,e=>{let n=Ai(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ui(jh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Zi(e,0,`AssertError`)();try{Zi(e,1,`AssertError`)()}catch(e){if(e instanceof y)return Ca(e.message,t.isTool)===r;throw e}return!1}),Ni(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Rh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...Mi(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Rh(t,r)??V(n,3,`TLCGetAndSet`),a=Ai(n,1,`TLCGetAndSet`);return zh(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ni(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Bh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ui(Mh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return $n(t.getBehavior(r).map(e=>Vh(e,n.environment)))}),Ni(`CounterExample`,0,()=>t.counterExample??Ph()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!P(t)||!nn(Rr(t),Ln([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=L(Ir(t,`state`)).elements.map(e=>Cr(e)??[]);return $n(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new S(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Vt(t)}),Xi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),Xi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Bh(r))throw Ui(Nh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||gl(Zi(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Xi(`TLCCache`,2,(e,t)=>{let r=Ai(e,0,`TLCCache`),a=oi(Zi(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Hh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,sm([V(e,0,`TLCFP`)])))),Ni(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?_l(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},Wh=(e,t)=>[Ni(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ni(`_Counts`,0,()=>Om(t)),Ni(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(Om(t),!0)),!1)}),Ni(`_PrintCounts`,0,()=>(e(z(Om(t),!0)),!0))],Gh=e=>String(e).padStart(2,`0`),Kh=e=>`${e.getUTCFullYear()}.${Gh(e.getUTCMonth()+1)}.${Gh(e.getUTCDate())}.${Gh(e.getUTCHours())}${Gh(e.getUTCMinutes())}${Gh(e.getUTCSeconds())}`,qh=e=>Un([...e].map(([e,t])=>[e,$n([t])])),Jh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Yh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Xh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Zh=(e,t,n)=>{if(e.version===`1.7.4`?!Yh.has(t)||!e.isStarted&&Xh.has(t):!e.isStarted&&Jh.has(t))throw new S(`TLCGet(${t}) was undefined.`);let r=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 r;case`stats`:return er([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return er([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return er([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,At(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,At(Kh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Ih(void 0);case`all`:return qh(e.registers);case`all:named`:return qh(km(e))}if(t.startsWith(`s:`)){let n=km(e).get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return At(e.properties.get(t.slice(2))??t);throw new S(`TLCGet(${t}) was undefined.`)},Qh=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return Zh(e,t,n?.state)},$h=e=>e.length===0?[[]]:e.flatMap((t,n)=>$h([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),eg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&L(e).elements.forEach(eg),e.kind===`Function`&&e.range.forEach(eg))},tg=(t,n)=>[H(`Print`,2,e=>(t(`${dt(z(V(e,0,`Print`),!0,!0))} ${dt(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(dt(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${dt(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>Un([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=ki(e,0,`@@`),n=ki(e,1,`@@`);return Wn([..._t(t),..._t(n)])}),H(`ToString`,1,e=>At(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return eg(t),t}),H(`Permutations`,1,e=>{let t=Di(e,0,`Permutations`);return Ln($h(t).map(e=>Un(t.map((t,n)=>[t,e[n]]))))}),Mi(`SortSeq`,2,e=>{let t=Ai(e,1,`SortSeq`);return $n(Oi(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?Wi({...Ni(`TLCGet`,1,(e,t)=>Qh(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Wi(Xi(`TLCGet`,1,(e,t)=>Qh(n,Zi(e,0,`TLCGet`)(),t)),`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)`),Ni(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return zh(n,t,r,V(e,1,`TLCSet`)),!0}),ji(`Any`,Lt),H(`RandomElement`,1,e=>Em(Ti(e,0,`RandomElement`),n.getRandom()))],ng=(e,t)=>e.every(e=>Dr(e,t)),rg=Ln([!1,!0]),ig=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Hn(ig(e,t,r),ig(e,r,n))},ag=[`\\cup`,`\\cap`,`\\`],og=e=>typeof e==`object`&&e.kind===`MixedSet`,sg=e=>e.kind===`Interval`?L(e).elements:e.elements,cg=(e,t,n)=>{let r=sg(t);if(e!==`\\cup`){let t=e===`\\cap`;return Rn(r.filter(e=>Dr(e,n)===t))}if(r.length===0)return n;if(!ft(n))return Zt({kind:`SetOperation`,operator:e,left:t,right:n});let i=L(n).elements.filter(e=>!Dr(e,t));return Rn([...r,...i])},lg=[ji(`TRUE`,!0),ji(`FALSE`,!1),ji(`BOOLEAN`,rg),ji(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Pi(`=`,Fn),Pi(`#`,(e,t)=>!Fn(e,t)),H(`~`,1,e=>!Ci(e,0,`~`)),H(`<=>`,2,e=>Ci(e,0,`<=>`)===Ci(e,1,`<=>`)),H(`/\\`,2,e=>Ci(e,0,`/\\`)&&Ci(e,1,`/\\`)),H(`\\/`,2,e=>Ci(e,0,`\\/`)||Ci(e,1,`\\/`)),H(`=>`,2,e=>!Ci(e,0,`=>`)||Ci(e,1,`=>`)),H(`\\in`,2,e=>Dr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!Dr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=wi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&I(t.base)?ng(L(t.base).elements,n.base):ng(L(t).elements,n)}),...ag.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(ft(n)&&ft(r)&&!og(n)&&!og(r)){if(e===`\\cup`&&R(n))return r;let t=e===`\\cup`?Hn:e===`\\cap`?Vn:Bn;return Er(()=>t(L(n),L(r)),()=>cg(e,n,r))}return ft(n)?cg(e,n,r):e!==`\\`&&ft(r)?cg(e,r,n):Zt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=wi(e,0,`UNION`),n=yn(t)?t.elements.filter(yn):[];if(!yn(t)||n.length!==t.elements.length)return Zt({kind:`Union`,base:t});if(og(t)||n.some(og)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Dr(t,e)||e.elements.push(t)})),Rn(e.elements)}return n.length===0?zn:ig(n.map(L),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!P(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Rr(t)})],ug=Ki(`Integers`,`Neg`,`IntValue`,1),dg=e=>{let t=Ki(e,`DotDot`,`IntervalValue`,2);return[qi(e,`+`,`Plus`,(e,t)=>e+t),qi(e,`-`,`Minus`,(e,t)=>e-t),qi(e,`*`,`Times`,(e,t)=>e*t),qi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new S(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new S(`0^0 is undefined.`);return e**t}),qi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new S(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Fi(r))throw Ii(`${t} \\div ${n}`);return r}),qi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new S(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Gi(V(e,0,`..`),t),high:Gi(V(e,1,`..`),t)}))]},fg=dg(`Naturals`),pg=dg(`Integers`),mg=e=>{let t=fg.indexOf(e);return t===-1?void 0:pg[t]},hg=[ji(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...fg,Yi(`<`,(e,t)=>e<t),Yi(`>`,(e,t)=>e>t),Yi(`<=`,(e,t)=>e<=t),Yi(`>=`,(e,t)=>e>=t,`>`)],gg=[ji(`Int`,{kind:`InfiniteSet`,name:`Int`}),...pg,Yi(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Gi(V(e,0,`-`),ug);if(Fi(-t))throw Ii(`-${t}`);return-t})],_g=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},vg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:_g(e,t,n)},yg=(e,t,n)=>typeof e==`string`?At(e.slice(t,n)):$n(e.slice(t,n)),bg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,xg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Sg=(e,t)=>{let n=qd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Wi(e,t):e}):t},Cg=e=>Sg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>vg(e,0,bg(``,`Len`)).length),H(`\\o`,2,e=>{let t=vg(e,0,xg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=_g(e,1,xg(`t \\o s`,`sequence`));return $n([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${xg(`t \\o s`,`string`)}\n${z(n)}`);return At(t+n)}),H(`Append`,2,t=>$n([..._g(t,0,xg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=_g(e,0,bg(``,`Head`));if(t.length===0)throw new S(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=vg(e,0,bg(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return yg(t,1)}),H(`SubSeq`,3,e=>{let t=vg(e,0,bg(`first `,`SubSeq`)),n=Si(e,1,`SubSeq`),r=Si(e,2,`SubSeq`);if(n>r)return yg(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new S(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return yg(t,n-1,r)}),Mi(`SelectSeq`,2,e=>{let t=Ai(e,1,`SelectSeq`);return $n(_g(e,0,bg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),wg=e=>Sg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(N(t))return xr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${pt(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!N(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new S(`Attempted to compute cardinality of the value\n${z(n)}`);return yr(n,e)})]),Tg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Eg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:hg};case`Integers`:return{extends:[`Naturals`],operators:gg};case`Sequences`:return{extends:[],operators:Cg(n.version)};case`FiniteSets`:return{extends:[],operators:wg(n.version)};case`TLC`:return{extends:[],operators:Sg(`TLC`,tg(t,n))};case`Randomization`:return{extends:[],operators:kh(n)};case`_Possible`:return{extends:[],operators:Wh(t,n)};case`Json`:return{extends:[],operators:xh(r)};case`Bags`:return{extends:[],operators:eh(i)};case`TLCExt`:return{extends:[],operators:Uh(t,n)};default:return}},Dg=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}])),Og={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]}},kg=(e,t)=>{let n=Og[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Ag=`$subexpression`,jg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Mg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Mg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of vi(e)){let e=Mg(r,t,n);if(e)return e}},Ng=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Pg=(e,t)=>{let n=e.location,r=Ng(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 jg(`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 jg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Ag,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Ag,args:e.args,location:n,resolution:Da},location:n}},Fg=(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:Da})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Da}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Da};return Pg({...t,params:[...t.params,...r]},a)},Ig=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw jg(r,i);ka.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw jg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Zo(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw jg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Pa(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw jg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&Mg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw jg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||to(t.operand,1)!==0)throw jg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=ao(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[to(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw jg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=to(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw jg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw jg(`Unexpected subexpression selector`,i);let s=r?r.sets:oo(n),c=s?.[to(t.operand,s.length)];if(!c)throw jg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return Fg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw jg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Fg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw jg(`Subexpression selection failed`,i);return Pg(a,o.current)},Lg=(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 no(e,t,n)},Rg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||vi(e).some(Rg),zg=(e,t,n,r=!1)=>{if(!Rg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=es(e,e=>zg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Bg(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)=>zg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:es(e,e=>zg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Lg(a.name,[],void 0,t):a.kind===`Apply`?Lg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Ig(o,t,a,r);return c!==a&&Oa.add(c),c},Bg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:zg(e.expression,t,n,!0)}))}),Vg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Hg=(e,t)=>Bg(e,Vg(t.definitions),()=>!1),Ug=(e,t)=>{let n=Vg([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>zg(e,n,i),o=e=>i(e)||!n(e),s=e=>zg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Bg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Bg(e,n,o):$o(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Rg(e.body))||e.assumptions.some(e=>Rg(e.expression))?{...p,definitions:e.definitions.map(e=>$o(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Wg=(e,t)=>`${e}${t}`,Gg=(e,t,n)=>`${e}${t}${n}`,Kg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},qg=(e,t,n)=>`${e},${t},${n}`,Jg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Yg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Xg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Zg=(e,t,n,r)=>({...Jg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Qg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,$g=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,e_=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,{...Zg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),t_=Zg(`$Set`,0,[2],[1]),n_=Zg(`$Junction`,0,[3],[1]),r_=Zg(`$Choose`,0,[2],[1]),i_=Zg(`$Function`,0,[3],[1]),a_=Zg(`$FcnApply`,0,[2,2],[1,1]),o_=Zg(`$RcdSelect`,0,[2,0],[1,1]),s_=Zg(`'`,2,[1],[0]),c_=Zg(`ENABLED`,1,[2],[0]),l_=Zg(`[]`,3,[3],[0]),u_=Zg(`$SquareAct`,2,[2,1],[0,0]),d_=Zg(`$WF`,3,[1,2],[0,0]),f_=Zg(`$TemporalExists`,3,[3],[0]),p_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),m_=e=>e.map(e=>({name:e,arity:0})),h_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),g_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),__=e=>e.kind!==`Let`&&e.kind!==`Label`,v_=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=e_.get(t)??Dg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Jg(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(Gg(e,n,t))}),t.data.constraints.forEach((e,t)=>Yg(r.constraints,t,e)),Xg(r.argConstraints,Wg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Xg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Qg(e,n))throw new u(`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 u(`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 a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(qg(t,n,r)),s=Jg(Math.max(e.level,...t.filter((t,n)=>$g(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{$g(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Yg(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Yg(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Yg(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Yg(s.constraints,t,Qg(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Yg(s.constraints,e,Qg(r,a)))}))}),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator)?.operator;n&&Yg(s.constraints,t.param,Qg(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Xg(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Xg(s.argConstraints,Wg(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Xg(s.argConstraints,Wg(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator);n&&Xg(s.argConstraints,Wg(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Kg(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Gg(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(Gg(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Gg(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,m_(e.params),e.body,t);return{data:n,operator:n}}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{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Jg();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=p_(n,m_(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw h_(`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 h_(`Action used where only temporal formula or state predicate allowed`,e);g_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&__(n)&&n.kind!==r)throw h_(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=>{let t=v(e,n);t.constraints.forEach((e,t)=>Yg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Xg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof u)||t.sany?t:h_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Jg();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(n_,n)}case`Prime`:case`Unchanged`:return s(s_,[e.expression],t);case`Enabled`:return s(c_,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(l_,[n])}case`If`:return s(n_,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(n_,[...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=s(n_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw h_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?f_:n_,[e.body],t,[],e.names);case`Choose`:return s(r_,[e.body],t,e.set?[e.set]:[],Ga(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(t_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(t_,[e.predicate],t,[e.bound.set],Ga(e.bound.pattern));case`SetMap`:return s(t_,[e.expression],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`FunctionConstruction`:return s(i_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`Record`:return s(i_,e.fields.map(e=>e.value),t);case`RecordSet`:return s(t_,e.fields.map(e=>e.value),t);case`Except`:return s(t_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(a_,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(t_,e.args,t)}]);case`Bracket`:return Jg();case`FieldAccess`:return i(o_,[a(e.record,t),{data:Jg()}]);case`BoxAction`:case`AngleAction`:return s(u_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(d_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Jg()}},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 vi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,p_(t,m_(e.names))),i;default:return es(e,(e,n)=>(a(e,r,p_(t,m_(n))),e)),i}},_=(e,t,n,r)=>{let i=p_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Jg(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(Wg(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(Gg(e.name,n,t.name))).map(e=>qg(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(Kg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Kg(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,{...Jg(),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:a}},y_=(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`?y_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Jg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Yg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Xg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},b_=(e,t,n,r)=>{let i=v_(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`?y_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(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:g(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=Wo([...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`?y_(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 p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},x_=(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=v_({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=>Yg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Yg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Xg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Kg(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)&&Yg(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(y_(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=g(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);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.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;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(Wg(e.name,i));a!==void 0&&x_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=Kg(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=x_(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 p([...r.values()])}},C_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],w_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),T_=new Map(Vd.flatMap(e=>e.map(t=>[t,e[0]]))),E_=e=>T_.get(e)??e,D_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},O_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(D_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},k_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),A_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:E_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:E_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},j_=(e,t)=>{let n=[];for(let r=t;;){let t=A_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},M_=e=>({line:e.line,column:e.column}),N_=(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===`.`)continue;else if(a.text===`EXTENDS`){let n=j_(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},P_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,F_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},I_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&P_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&P_(e[n+1],e[n+2])?n+=P_(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=>F_[e])}"`:r.text)}return t},L_=e=>e[2]?.text,R_=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},z_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>z_(e.modules,t)).find(Boolean),B_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(Gd.has(i)?t?.(i):void 0)??Kd.get(i)??t?.(i)??Vp(e,i),s=o===void 0?[]:Ce(o),c=R_(s),l=c.get(L_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Up(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>z_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},V_=(e,t)=>{let n=B_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=j_(t,e+1);r.push({location:M_(t[e]),apply:e=>i.forEach(t=>e.put(k_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:M_(u),apply:t=>t.put(k_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&j_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),w_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(M_(u)),r.push({location:M_(u),apply:e=>e.put(k_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(k_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=E_(e.name);r.push({location:e.location,apply:n=>n.put(k_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(k_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(k_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Na(e.location,t.location)?-1:+!!Na(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=O_();i.set(e??``,s),Bd.toReversed().forEach(e=>s.put(k_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},H_=(e,t,n)=>V_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),U_=(e,t)=>{let n=V_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},W_=(e,t)=>H_(e,t,`variable`),G_=(e,t,n)=>{let r=B_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Hd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=N_(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;I_(s(void 0)).forEach((e,t)=>{t===3&&Wd.forEach(a),a(e)});let x=u(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??L_(r(void 0).tokens);throw m(n,e)}I_(s(n)).forEach(a)}}C_.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),Ud.forEach(a),[...i]},K_=t=>{switch(t.kind){case`Number`:try{return mt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Vt(t.name);case`Set`:return Ln(t.elements.map(K_))}},q_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],J_=(e,t)=>{try{return Up(e)}catch(n){if(!(n instanceof u))throw n;let r=hp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Y_=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),X_=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},Z_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Q_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Z_(e),$_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Da},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),ev=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&nn(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},tv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||vi(e).some(e=>tv(e,t)),nv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ls(e),n.get(e)??n.size)),n},rv=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),iv=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw cl(e);if(e.kind===`Number`&&!_u(e.value))throw ll(e);iv(e.kind===`Let`?[...vi(e),...rv(e.instances??[])]:vi(e))}),av=(e,t)=>{let n=Up(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(lg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Dm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,ee=[],te=[],S=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=S_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,w=/* @__PURE__ */ new Map,T=e=>{let n=c.get(e);if(n)return n;let r=Eg(e,t.print,l,t.files,s);if(!r)return;Tg.get(e)?.forEach(T);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>T(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Dg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:kg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{if(Gd.has(e)&&t.loadModule?.(e)!==void 0)return;let n=T(e),r=Tg.get(e)??[];return n&&S(e,r),n&&r.includes(`Integers`)&&T(`Integers`),n},D=e=>(iv([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...rv(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??Od.get(e)??Vp(t.source,e);if(r===void 0)throw m(e,n);let i=J_(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return D(i)},le=e=>{let t=te.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...te.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];te.push(e.name),ee.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:C,levelChecks:a});if(ee.pop(),te.pop(),i.length>0)throw p(i,!1,void 0,C);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&X_(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw Y_(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,n)=>{let i=d.get(e);if(i)return S(e,x.get(e)??[]),i;let a=le(ce(e,n));return(Nm(l.version).has(e)?Eg(e,t.print,l,t.files,s):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(s.set(t.key,e),r.delete(t.key))}),d.set(e,a.linked),x.set(e,a.closure),S(e,a.closure),a.linked},de=(e,t,n,s,c)=>{let l=c?void 0:E(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=q_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Uo(Hg(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=xs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Jo(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=re(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:re});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&w.set(r,n),r})},fe=(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}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.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:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Da})),he=(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:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(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:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=q_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ie.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>tv(f(e),p),h=d.map(t=>{let n=ge(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=xs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:Da}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Da}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.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}:$_(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=O(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=zd(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...lg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Ro,errors:[],warnings:[]},p=[d],m=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||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);Q_(n.kind)===Q_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Z_(n.kind)} of '${t}' conflicts with \nits ${Z_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Z_(e.kind)} of '${t}' conflicts with \nits ${Z_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,x=[],ee=[...s.constants],te=s.variables.map(e=>e.name),S=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){m(n);return}let r=t??ue(e,s.name);ee.push(...r.constants.filter(e=>ee.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),x.push(r)});let ne=new Map(l),re=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:D(e),arity:Pa(e),params:Fa(e),kind:zo(s,e)?`Theorem`:`Definition`,range:e.location.range}),T=ee.length===0&&te.length===0,D=e=>s===n?e.name:`${e.name}@${a.id}`,ce=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Na(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:E(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=q_(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:ce,facts:v,reports:p,warnings:a.warnings}),ge=e=>[...re.filter(t=>Na(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Na(t.location,e)).map(e=>[e.name,se(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),xe=e=>{let t=le(),n=t.get(e.name),r=n&&X_(e,n.module);if(n&&!r)throw Y_(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:ge(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,O(s),T,le().get(e.module));ce.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))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Na(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Ug(Ts(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Go(Se,O(Se))),Se.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!T);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Na(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:te,variableLocations:S,visible:l,exported:h,modules:y,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=ie.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>b_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(te),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>w.get(l.get(e)?.key??e)},we,C)),b.push(Ce),Ce},xe=le(n).linked;C.length>0&&!t.isSanyReported&&t.print(h(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=K_(e.value);Pn(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(K_),K_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,ev(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${H_(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=mg(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:nv(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=v_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>_l(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${ba(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let j=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Re=U_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||q_(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},ov={kind:`Boolean`,value:!0},sv={kind:`Boolean`,value:!1},cv=e=>e?ov:sv,lv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,uv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,dv=(e,t)=>({kind:e,body:t}),fv=(e,t,n)=>({kind:e,operands:[t,n]}),pv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?pv(e,t.operands).operands:[t])}),mv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return mv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,mv(t)),0)}},hv=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return hv(e.body);case`And`:case`Or`:return e.operands.some(hv)}},gv=/* @__PURE__ */ new WeakMap,_v={count:0},vv=e=>{let t=gv.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${_v.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(vv).join(`,`)})`;default:return`${e.kind}(${vv(e.body)})`}})();return gv.set(e,n),n},yv=(e,t)=>e===t||vv(e)===vv(t),bv=(e,t)=>{let n=vv(t);return e.some(e=>e===t||vv(e)===n)},xv=e=>e===`And`?`Or`:`And`,Sv=(e,t)=>{switch(e.kind){case`Boolean`:return t?cv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?dv(`Not`,e):e;case`Not`:return Sv(e.body,!t);case`And`:case`Or`:return pv(t?xv(e.kind):e.kind,e.operands.map(e=>Sv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return dv(n,Sv(e.body,t))}}},Cv=e=>{switch(e.kind){case`Boolean`:return cv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return pv(xv(e.kind),e.operands.map(Cv));case`Always`:return dv(`Eventually`,Cv(e.body));case`Eventually`:return dv(`Always`,Cv(e.body));default:return dv(`Not`,e)}},wv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=wv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return cv(t)}return n.length===0?cv(!t):n.length===1?n[0]:pv(e.kind,n)}case`Not`:{let t=wv(e.body);return t.kind===`Boolean`?cv(!t.value):dv(`Not`,t)}case`Always`:case`Eventually`:{let t=wv(e.body);return dv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Tv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Ev=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Ev(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>pv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Ev(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Tv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:pv(`Or`,t);n.push(dv(`Always`,dv(`Eventually`,e)))}return pv(`Or`,n)}case`Not`:return lv(e.body)?e:Ev(Cv(e.body));default:return e}},Dv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Dv(e.operands[0]):pv(e.kind,e.operands.map(Dv));case`Not`:return e.body.kind===`Not`?Dv(e.body.body):dv(`Not`,Dv(e.body));case`Always`:case`Eventually`:case`Next`:return dv(e.kind,Dv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ov(e.operands[0]);let t=Math.floor(e.operands.length/2);return fv(e.kind,Ov(pv(e.kind,e.operands.slice(0,t))),Ov(pv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return dv(e.kind,Ov(e.body));default:return e}},kv=(e,t)=>{e.kind===`Eventually`&&!bv(t,e)&&t.push(e),`body`in e&&kv(e.body,t),`operands`in e&&e.operands.forEach(e=>kv(e,t))},Av=e=>{let t=e.filter(uv),n=e.flatMap(e=>e.kind===`Not`&&uv(e.body)?[e.body]:[]);return!t.some(e=>bv(n,e))},jv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,dv(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Mv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:dv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Nv=(e,t,n)=>e.flatMap(e=>{let r=Mv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Pv=e=>[...new Set(e.map(vv))].sort().join(`|`),Fv=(e,t)=>{let n=new Set(t.map(Pv));return[...e.filter(e=>!n.has(Pv(e))),...t]},Iv=e=>{let t=jv(e),n=Nv(t,`Always`,`And`),r=Nv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Mv(t,`Eventually`,`Or`);if(n&&!(bv(e,n.first)||bv(e,n.second)))return Fv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(bv(e,t.first)||bv(e,t.second))&&!bv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Av(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Mv(t[e],`Always`,`And`);n&&(bv(t,n.first)||t.push(n.first),bv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)bv(t,e.first)&&bv(t,e.second)&&!bv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Av(t)?[]:i(t)};return a(e)},Lv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>mv(e)<=1)}),Rv=e=>{let t=Iv([e]).map(Lv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Pv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Iv(n)){let n=Pv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Lv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},zv=(e,t)=>!bv(e,t)||bv(e,t.body),Bv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&mv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Tv(e);if(n){let e=mv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(hv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Vv=(e,t)=>{let n=e.findIndex(e=>yv(e,t));return n===-1?(e.push(t),e.length-1):n},Hv=e=>{let t=Ev(wv(Sv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Dv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Bv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:pv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:yv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ov(e.formula),n=[];t&&kv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Vv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Vv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Vv(i,e))}));return{tableau:t&&Rv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Uv=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),Wv=()=>n(new x,e.error),Gv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kv=/* @__PURE__ */ new WeakMap,qv=/* @__PURE__ */ new WeakSet,Jv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Yv=(e,t)=>new y(`TLC cannot handle the temporal formula ${el(e)}${t===void 0?``:`:\n${t}`}`),Xv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ul(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Xv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Xv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=_l(e,n);if(t)return Zv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return es(e,(e,a)=>(i.value=Math.max(i.value,Xv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Gv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Zv=(e,t)=>{let n=Kv.get(e);if(n!==void 0)return n;Kv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Xv(e.body,void 0,t),...r.map(e=>Xv(e.set,void 0,t)));return Kv.set(e,i),i},Qv=(t,r)=>{try{return Al(t,r)}catch(t){if(!(t instanceof y))throw t;if(!ba(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},$v=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>$v(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,el(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,ey(e,t,n));if(e.kind===`Identifier`){let r=B(e)?ul(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:_l(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Zv(a,n)>0){if(i.has(a))throw Wv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Jv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Xv(e,t,n)===3)){let t=tu(e,c),r=B(e)?void 0:_l(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,pu(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Xv(e.set,t,n)===0),u=l?Qv(e.bounds,c):void 0;if(l&&u){let n=[];if(jl(e.bounds,u,t,t=>(n.push(...s(e.body,t,el(e.body))),!1)),n.length===0)throw Uv();return n}return[{expression:e,scope:t,name:o}]},ey=(e,t,n)=>{let r=hu(e.definitions,Jv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&qv.add(e.binding);return r},ty=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),ny=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Xv(e,t,n):i;if(a===0){let r=W(e,Jv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${tl(e)}`);return cv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw Wv();a.depth++;let o=f(e,t);a.depth--;let s=mv(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Jv(n,t),s=B(e)||_l(i,n)===void 0?ul(t,i):void 0;if(s?.kind===`Thunk`&&qv.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?nu(i,a):$l(i,n);if(l?.kind!==`Closure`)throw Yv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&_l(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,pu(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof x||n&&!r;throw!(t instanceof y)||i?t:Yv(e)}},l=(e,t)=>{let r=Xv(e,t,n);if(!e.bounds.every(e=>Xv(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw Yv(e)}let a=[],o=e.kind===`Forall`;try{Ml(e.bounds,Jv(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof x)throw n;if(r<=2)return i(e,t,r);throw Yv(e,o&&!ba(n)?n.message:void 0)}return a.length===0?cv(o):u(e,t,pv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=mv(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=Xv(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,ey(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?dv(`Always`,fv(`Or`,dv(`Not`,f(n[0],t)),dv(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,dv(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,fv(`Or`,dv(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,pv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&Xv(e.condition,t,n)===0){let r=W(e.condition,Jv(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,fv(`Or`,fv(`And`,i,f(e.consequent,t)),fv(`And`,dv(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return dv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=ty(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=dv(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?dv(`Always`,dv(`Eventually`,fv(`Or`,i,a))):fv(`Or`,dv(`Eventually`,dv(`Always`,i)),dv(`Always`,dv(`Eventually`,a)))}default:throw Yv(e)}};return f(e,t)},ry=(e,t,n,r,i)=>{let a=e=>ry(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?gl(W(e.expression,a),`a temporal property predicate`):Uc(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&gl(W(e.unchanged,a),`a subscript`)?!1:gl(W(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ry(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},iy=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>iy(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return ry(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ay=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return ay(e.body);case`And`:case`Or`:return e.operands.some(ay);default:return!1}},oy=e=>e.promises.some(e=>ay(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),sy=(e,t)=>e.every((e,n)=>an(e,t[n])),cy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),ly=e=>({data:e(1024),length:0,create:e}),uy=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},dy=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},fy=e=>new Int32Array(e).fill(-1),py=(e,t)=>(e.edgeStarts[t]??-1)!==-1,my=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},hy=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,gy=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),_y=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},vy=2**53-1,yy=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>ny(e.expression,e.scope,n)),a=e.map(e=>dv(`Not`,ny(e.expression,e.scope,n))),o=a.length===1?a[0]:pv(`Or`,a),s=i.length===0?o:pv(`And`,[...i,o]),c=Hv(s);if(c.length===0)throw Uv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=vv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:ly(e=>new Int32Array(e)),edgeActions:ly(e=>new Uint8Array(e)),stateResults:ly(e=>new Uint8Array(e)),initial:[],firstNodes:ly(fy),lastNodes:ly(fy),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),d={multiplier:1},f=!Ou(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>ry(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!ry(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!ry(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},te=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),S=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=dy(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n)=>{let r=gy(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),dy(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],dy(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?uy(e.firstNodes,t,[r]):e.nextSiblings[a]=r,uy(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;uy(e.edgeTargets,a,n),r.forEach((t,n)=>uy(e.edgeActions,(a+n)*o,t)),uy(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&sy(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&te(e)){e.errorNode=a;return}let o=S(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=S(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of _y(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return cy(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)gy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{py(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)py(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of my(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}py(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},w=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>py(e,t)),c=[],l=t=>{let n=my(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&zv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=vy;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=vy,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>hy(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>my(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=cy(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&hy(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(my(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=my(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:oy(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of my(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};my(e,l).forEach((t,r)=>{py(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(S(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=w(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!iy(a[i].body,t,r,0,n)).map(e=>e.name))]}},by=`UnnamedAction`,xy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Sy=e=>{let t=e.range??xy;return er([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Cy=e=>{let t=[[`name`,e.name],[`location`,Sy(e.location)]];return e.parameters.length===0?er(t):er([...t,[`context`,er(e.parameters)],[`parameters`,$n(e.parameters.map(e=>e[0]))]])},wy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Ty=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ey=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Dy=e=>e.kind===`Apply`?e.args:[],Oy=(e,t,n)=>{let r=Ey(e);if(r===void 0)return;if(B(e)){let e=ul(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=$l(r,n);return i?.kind===`Closure`?i:void 0},ky=(e,t)=>{try{return W(e,Ty(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},Ay=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&xl(e,t)&&ky(e.body,t),jy=(e,t)=>{let n=_l(e.name,t);return n?.body===e.body&&Ay(n,t)},My=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=ul(t,e.name);return n?.kind===`Thunk`?n:void 0},Ny=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ul(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Py=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Fy=(e,t,n,r,i)=>{let a=Dy(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>Xv(e,n,i)!==0)?o():Py(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,Ty(i,n))]),expression:t,scope:n}],o)},Iy=(e,t,n,r,i)=>{let a=()=>({name:n?.name??by,location:e.location,parameters:Ny(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Iy(e.body,hu(e.definitions,Ty(r,t)),n,r,i);case`Label`:return Iy(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Iy(e,t,n,r,i));case`Exists`:return Py(()=>{let o=[];return Ml(e.bounds,Ty(r,t),t=>(o.push(...Iy(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(Ey(e)??``),s=Oy(e,t,r);if(o)return Fy(o,e,t,s,r);if(!s)return[a()];let c=Dy(e),l=B(e)?s.name:r.instanceNames.get(Ey(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return jy(s,r)||c.some(e=>Xv(e,t,r)!==0)?u():Py(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,Ty(r,t))},parent:e}),s.scope);return Iy(s.body,e,{...s,name:l},r,i)},u)},Ly=(e,t,n,r,i)=>{let a=(e,t)=>Ly(e,t,n,r,i);if(e.kind===`Let`){a(e.body,hu(e.definitions,Ty(n,t)));return}let o=My(e,t);if(o){a(o.expression,o.scope);return}let s=Oy(e,t,n);if(s&&jy(s,n))return;if(s&&s.params.length===0){if(Xv(s.body,s.scope,n)===1){r.inits.push(wy(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,pu(s,e.args,Ty(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(wy(by,e));return}let c=Xv(e,t,n);c<=1?r.inits.push(wy(by,e)):c===3&&r.temporals.push(wy(by,e))},Ry=(e,t,n,r,i)=>{let a=(t,n)=>Ry(e,t,n,r,i);if(t.kind===`Let`){a(t.body,hu(t.definitions,Ty(r,n)));return}let o=My(t,n);if(o){a(o.expression,o.scope);return}let s=Oy(t,n,r);if(s&&jy(s,r))return;if(s&&s.params.length===Dy(t).length){a(s.body,t.kind===`Apply`?pu(s,t.args,Ty(r,n)):s.scope);return}if(t.kind===`Forall`&&Py(()=>(Ml(t.bounds,Ty(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(wy(e,a)):Xv(a,n,r)<2?i.invariants.push(wy(e,a)):i.impliedTemporals.push(wy(e,t));return}let c=Xv(t,n,r);c<=1?i.impliedInits.push(wy(e,t)):c===3&&i.impliedTemporals.push(wy(e,t))},zy=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`&&!Ay(n,t)?n:void 0},By=e=>er([[`name`,e.name],[`location`,Sy(e.location)]]),Vy=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:zy(e.specification,t);a&&(Ly(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Iy(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:$l(e.init,t);o?.kind===`Closure`&&r.inits.push(wy(e.init??``,o.body));let s=e.next===void 0?void 0:$l(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Iy(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=zy(e,t);n&&r.invariants.push(wy(e,n.body))}),e.properties.forEach(e=>{let n=zy(e,t);n&&Ry(e,n.body,void 0,t,r)}),r},Hy=(e,t,n)=>Vy(e,t,n).inits,Uy=(e,t,n)=>Vy(e,t,n).actions,Wy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,Gy=(e,t)=>`${e.name===by?`Action`:e.name}${t===`1.7.4`?``:Wy(e)} ${g(e.location.range??xy)}`,Ky=e=>`${e.name}${Wy(e)}`,qy=(e,t,n,r)=>{let i=Vy(e,t,r),a=e=>Ln(e.map(Cy)),o=e=>Ln(e.flatMap(e=>{let n=zy(e,t);return n?[By(n)]:[]}));return er([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Ln(t.variables.map((e,t)=>er([[`name`,e],[`location`,Sy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Jy=`paired12`,Yy=(e,t=16)=>e<=t*.75?t:Yy(e,t*2),Xy=(e,t)=>{let n=Yy(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Zy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Qy=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),$y=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),eb=e=>$y(e).replaceAll(`
|
|
1773
|
-
`,`\\n`),
|
|
1772
|
+
`]]),Nm=(e=`master`)=>e===`1.7.4`?Mm:jm,Pm=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),Fm=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Im=e=>P(e)?Ar(e):void 0,Lm=(e,t,n)=>{let r=V(e,t,n),i=Im(r);if(!i)throw Pm(n,`a function with a finite domain`,r);return i},Rm=(e,t,n)=>{let r=V(e,t,n),i=Im(r);if(!i)throw Fm(t===0?`first`:`second`,n,`bag`,r);return i},zm=(e,t)=>{if(!N(e)||!I(e))throw t();return L(e).elements},Bm=e=>e.range.every(e=>typeof e==`number`&&e>0),Vm=(e,t)=>{let n=e.domain.findIndex(e=>nn(e,t));return n===-1?void 0:e.range[n]},Hm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Um=Hm(`BagDiff`,`tlc2.value.impl.Value`,2),Wm=Hm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Gm=Hm(`BagUnion`,`tlc2.value.impl.Value`,1),Km=Hm(`BagOfAll`,`tlc2.value.impl.Value`,2),qm=Hm(`BagCup`,`tlc2.value.impl.Value`,2),Jm=Hm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Ym=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Vi(e)}`;throw Ui(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Xm=(e,t,n)=>{let r=Ym(e,n)+Ym(t,n);if(Fi(r))throw Ii(`${e}+${t}`);return r},Zm=(e,t,n,r)=>{let i=Vm(n,e.domain[t]),a=Ym(e.range[t],r);return i===void 0?a:a-Ym(i,r)|0},Qm=(e,t)=>Un(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>nn(e[0],r));a?a[1]=Xm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),$m=Ut([],[]),eh=e=>[ji(`EmptyBag`,$m),H(`IsABag`,1,e=>{let t=Im(V(e,0,`IsABag`));return t!==void 0&&Bm(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return Lm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Pm(`BagCardinality`,`a bag`,t);return Xm(e,n,Jm)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Vm(Lm(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Fm(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Vm(Lm(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Fm(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Rm(e,t,`(+)`);if(!Bm(n))throw Fm(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return Qm(t,qm)}),H(`\\ominus`,2,e=>{let t=Rm(e,0,`(-)`),n=Rm(e,1,`(-)`);return Un(t.domain.flatMap((e,r)=>{let i=Zm(t,r,n,Um);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=zm(t,()=>Pm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??$m;let r=n.map(e=>{let n=Im(e);if(!n)throw new S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return Qm(r,Gm)}),H(`\\sqsubseteq`,2,e=>{let t=Lm(e,0,`\\sqsubseteq`),n=Lm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Zm(t,r,n,Wm)<=0)}),Mi(`BagOfAll`,2,e=>{let t=Ai(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Im(n);if(!r)throw Fm(`second`,`BagOfAll`,`function with a finite domain`,n);return Qm(r.domain.map((e,n)=>Ut([t.call([e])],[r.range[n]])),Km)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!P(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Ar(n),i=Ln(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 ${z(r)}, which is not in its domain`);return Ln(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Ut(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Rr(Lm(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=zm(t,()=>Pm(`BagToSet`,`a function with a finite domain`,t));return Ut([...n],n.map(()=>1))})],th=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,nh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,rh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,ih=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,ah=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,oh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,sh=e=>{if(!P(e))return!1;let t=Ar(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},ch=(e,t)=>Ui(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Vi(t)}`),lh=(e,t)=>Ui(e,`Cannot cast tlc2.value.impl.${Vi(t)} to tlc2.value.impl.StringValue`),uh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),dh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw ch(t,e);return`[${L(e).elements.map(e=>ph(e,t)).join(`,`)}]`},fh=(e,t)=>{let n=Ar(e),r=Cr(n);return r?`[${r.map(e=>ph(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${uh(typeof e==`string`?e:z(e))}:${ph(n.range[r],t)}`).join(`,`)}}`},ph=(e,t)=>typeof e==`string`?uh(e):typeof e==`object`?e.kind===`ModelValue`?uh(e.name):N(e)?dh(e,t):fh(e,t):String(e),mh=e=>{if(N(e))return dh(e,th);if(!P(e)||sh(e))throw ch(th,e);return fh(e,th)},hh=e=>{if(!P(e))throw ch(nh,e);return fh(e,nh)},gh=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},_h=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return At(e);if(Array.isArray(e))return $n(e.map(e=>_h(e,t)));if(typeof e==`object`&&e)return er(Object.entries(e).map(([e,n])=>[At(e),_h(n,t)]));throw Ui(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},vh=(e,t)=>{if(e.trim()===``)return _h(null,t);try{return _h(JSON.parse(e,(e,t,n)=>typeof t==`number`?gh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ui(t,e.message):e}},yh=(e,t)=>{if(typeof e!=`string`)throw lh(t,e);return e},bh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ui(n,`${t} (No such file or directory)`);return r},xh=e=>[Ni(`ToJson`,1,e=>At(ph(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ni(`ToJsonArray`,1,e=>At(mh(V(e,0,`ToJsonArray`)))),Ni(`ToJsonObject`,1,e=>At(hh(V(e,0,`ToJsonObject`)))),Ni(`JsonSerialize`,2,t=>{let n=yh(V(t,0,`JsonSerialize`),rh),r=V(t,1,`JsonSerialize`);if(!Cr(r)&&!sh(r))throw new S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,ph(r,rh)),!0}),Ni(`ndJsonSerialize`,2,t=>{let n=yh(V(t,0,`ndJsonSerialize`),ih),r=V(t,1,`ndJsonSerialize`),i=Cr(r);if(!i)throw new S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${ph(e,ih)}\n`).join(``)),!0}),Ni(`JsonDeserialize`,1,t=>{let n=yh(V(t,0,`JsonDeserialize`),ah);return vh(bh(e,n,ah),ah)}),Ni(`ndJsonDeserialize`,1,t=>{let n=yh(V(t,0,`ndJsonDeserialize`),oh);return $n(bh(e,n,oh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>vh(e,oh)))})],Sh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Ch=1e6,wh=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Th=(e,t,n)=>{if(typeof e!=`number`||e<0)throw wh(t,n,`nonnegative integer`,z(e));return e},Eh=(e,t,n,r)=>{if(!N(e)||!I(e))throw wh(t,n,r,z(e));return L(e).elements},Dh=(e,t,n,r)=>Ln(Array.from({length:t},()=>Ln(e.filter(()=>r.nextDouble()<n)))),Oh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Th(V(e,0,n),`first`,n),i=Th(V(e,1,n),`second`,n),a=Eh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw wh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw wh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Dh(a,r,a.length===0?0:i/a.length,t.getRandom())},kh=e=>[Ni(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw wh(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Ui(Sh,String(n));let r=V(t,1,`RandomSubset`);if(!N(r)||!R(r)&&!I(r))throw wh(`second`,`RandomSubset`,`a finite set`,z(r));let i=Cm(r,e.version);if(i&&i.reduce((e,t)=>e*L(t).elements.length,1)>Ch)throw Ui(Sh,`Attempted to construct a set with too many elements (>${Ch}).`);return Ln(wm(n,r,e.getRandom(),e.version))}),Ni(`RandomSetOfSubsets`,3,t=>Oh(t,e)),Ni(`TestRandomSetOfSubsets`,3,t=>$n(Array.from({length:5},()=>L(Oh(t,e)).elements.length)))],Ah=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,jh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Ah})`,Mh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Ah}) throws java.io.IOException`,Nh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Ah})`,Ph=()=>er([[`action`,Ln([])],[`state`,Ln([])]]),Fh=()=>er([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Ih=e=>er([[`name`,e??`UnnamedAction`],[`location`,Fh()]]),Lh=(e,t,n)=>{let r=e.map((e,t)=>$n([t+1,er(Object.entries(e))])),i=r.slice(1).map((e,n)=>$n([r[n],t[n],e])),a=n?[$n([r[r.length-1],n.action,r[n.start]])]:[];return er([[`action`,Ln([...i,...a])],[`state`,Ln(r)]])},Rh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return km(e).get(t)},zh=(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)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),z(r));else throw new S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},Bh=e=>e.every(e=>e!==void 0),Vh=(e,t)=>er(t.variables.map((t,n)=>[t,e[n]])),Hh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!B(e)){if(t.variableIndex.has(r))return!0;let e=_l(r,t);if(e&&!n.has(e)&&(n.add(e),Hh(e.body,t,n)))return!0}return vi(e).some(e=>Hh(e,t,n))},Uh=(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[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=nn(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),Xi(`AssertError`,2,e=>{let n=Ai(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ui(jh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Zi(e,0,`AssertError`)();try{Zi(e,1,`AssertError`)()}catch(e){if(e instanceof y)return Ca(e.message,t.isTool)===r;throw e}return!1}),Ni(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Rh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...Mi(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Rh(t,r)??V(n,3,`TLCGetAndSet`),a=Ai(n,1,`TLCGetAndSet`);return zh(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ni(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Bh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ui(Mh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return $n(t.getBehavior(r).map(e=>Vh(e,n.environment)))}),Ni(`CounterExample`,0,()=>t.counterExample??Ph()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!P(t)||!nn(Rr(t),Ln([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=L(Ir(t,`state`)).elements.map(e=>Cr(e)??[]);return $n(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new S(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Vt(t)}),Xi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),Xi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Bh(r))throw Ui(Nh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||gl(Zi(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Xi(`TLCCache`,2,(e,t)=>{let r=Ai(e,0,`TLCCache`),a=oi(Zi(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Hh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,sm([V(e,0,`TLCFP`)])))),Ni(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?_l(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},Wh=(e,t)=>[Ni(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ni(`_Counts`,0,()=>Om(t)),Ni(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(Om(t),!0)),!1)}),Ni(`_PrintCounts`,0,()=>(e(z(Om(t),!0)),!0))],Gh=e=>String(e).padStart(2,`0`),Kh=e=>`${e.getUTCFullYear()}.${Gh(e.getUTCMonth()+1)}.${Gh(e.getUTCDate())}.${Gh(e.getUTCHours())}${Gh(e.getUTCMinutes())}${Gh(e.getUTCSeconds())}`,qh=e=>Un([...e].map(([e,t])=>[e,$n([t])])),Jh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Yh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Xh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Zh=(e,t,n)=>{if(e.version===`1.7.4`?!Yh.has(t)||!e.isStarted&&Xh.has(t):!e.isStarted&&Jh.has(t))throw new S(`TLCGet(${t}) was undefined.`);let r=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 r;case`stats`:return er([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return er([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return er([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,At(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,At(Kh(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Ih(void 0);case`all`:return qh(e.registers);case`all:named`:return qh(km(e))}if(t.startsWith(`s:`)){let n=km(e).get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return At(e.properties.get(t.slice(2))??t);throw new S(`TLCGet(${t}) was undefined.`)},Qh=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return Zh(e,t,n?.state)},$h=e=>e.length===0?[[]]:e.flatMap((t,n)=>$h([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),eg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&L(e).elements.forEach(eg),e.kind===`Function`&&e.range.forEach(eg))},tg=(t,n)=>[H(`Print`,2,e=>(t(`${dt(z(V(e,0,`Print`),!0,!0))} ${dt(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(dt(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${dt(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>Un([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=ki(e,0,`@@`),n=ki(e,1,`@@`);return Wn([..._t(t),..._t(n)])}),H(`ToString`,1,e=>At(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return eg(t),t}),H(`Permutations`,1,e=>{let t=Di(e,0,`Permutations`);return Ln($h(t).map(e=>Un(t.map((t,n)=>[t,e[n]]))))}),Mi(`SortSeq`,2,e=>{let t=Ai(e,1,`SortSeq`);return $n(Oi(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?Wi({...Ni(`TLCGet`,1,(e,t)=>Qh(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Wi(Xi(`TLCGet`,1,(e,t)=>Qh(n,Zi(e,0,`TLCGet`)(),t)),`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)`),Ni(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return zh(n,t,r,V(e,1,`TLCSet`)),!0}),ji(`Any`,Lt),H(`RandomElement`,1,e=>Em(Ti(e,0,`RandomElement`),n.getRandom()))],ng=(e,t)=>e.every(e=>Dr(e,t)),rg=Ln([!1,!0]),ig=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Hn(ig(e,t,r),ig(e,r,n))},ag=[`\\cup`,`\\cap`,`\\`],og=e=>typeof e==`object`&&e.kind===`MixedSet`,sg=e=>e.kind===`Interval`?L(e).elements:e.elements,cg=(e,t,n)=>{let r=sg(t);if(e!==`\\cup`){let t=e===`\\cap`;return Rn(r.filter(e=>Dr(e,n)===t))}if(r.length===0)return n;if(!ft(n))return Zt({kind:`SetOperation`,operator:e,left:t,right:n});let i=L(n).elements.filter(e=>!Dr(e,t));return Rn([...r,...i])},lg=[ji(`TRUE`,!0),ji(`FALSE`,!1),ji(`BOOLEAN`,rg),ji(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Pi(`=`,Fn),Pi(`#`,(e,t)=>!Fn(e,t)),H(`~`,1,e=>!Ci(e,0,`~`)),H(`<=>`,2,e=>Ci(e,0,`<=>`)===Ci(e,1,`<=>`)),H(`/\\`,2,e=>Ci(e,0,`/\\`)&&Ci(e,1,`/\\`)),H(`\\/`,2,e=>Ci(e,0,`\\/`)||Ci(e,1,`\\/`)),H(`=>`,2,e=>!Ci(e,0,`=>`)||Ci(e,1,`=>`)),H(`\\in`,2,e=>Dr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!Dr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=wi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&I(t.base)?ng(L(t.base).elements,n.base):ng(L(t).elements,n)}),...ag.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(ft(n)&&ft(r)&&!og(n)&&!og(r)){if(e===`\\cup`&&R(n))return r;let t=e===`\\cup`?Hn:e===`\\cap`?Vn:Bn;return Er(()=>t(L(n),L(r)),()=>cg(e,n,r))}return ft(n)?cg(e,n,r):e!==`\\`&&ft(r)?cg(e,r,n):Zt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=wi(e,0,`UNION`),n=yn(t)?t.elements.filter(yn):[];if(!yn(t)||n.length!==t.elements.length)return Zt({kind:`Union`,base:t});if(og(t)||n.some(og)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Dr(t,e)||e.elements.push(t)})),Rn(e.elements)}return n.length===0?zn:ig(n.map(L),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!P(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Rr(t)})],ug=Ki(`Integers`,`Neg`,`IntValue`,1),dg=e=>{let t=Ki(e,`DotDot`,`IntervalValue`,2);return[qi(e,`+`,`Plus`,(e,t)=>e+t),qi(e,`-`,`Minus`,(e,t)=>e-t),qi(e,`*`,`Times`,(e,t)=>e*t),qi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new S(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new S(`0^0 is undefined.`);return e**t}),qi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new S(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Fi(r))throw Ii(`${t} \\div ${n}`);return r}),qi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new S(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Gi(V(e,0,`..`),t),high:Gi(V(e,1,`..`),t)}))]},fg=dg(`Naturals`),pg=dg(`Integers`),mg=e=>{let t=fg.indexOf(e);return t===-1?void 0:pg[t]},hg=[ji(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...fg,Yi(`<`,(e,t)=>e<t),Yi(`>`,(e,t)=>e>t),Yi(`<=`,(e,t)=>e<=t),Yi(`>=`,(e,t)=>e>=t,`>`)],gg=[ji(`Int`,{kind:`InfiniteSet`,name:`Int`}),...pg,Yi(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Gi(V(e,0,`-`),ug);if(Fi(-t))throw Ii(`-${t}`);return-t})],_g=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},vg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:_g(e,t,n)},yg=(e,t,n)=>typeof e==`string`?At(e.slice(t,n)):$n(e.slice(t,n)),bg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,xg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Sg=(e,t)=>{let n=qd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Wi(e,t):e}):t},Cg=e=>Sg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>vg(e,0,bg(``,`Len`)).length),H(`\\o`,2,e=>{let t=vg(e,0,xg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=_g(e,1,xg(`t \\o s`,`sequence`));return $n([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${xg(`t \\o s`,`string`)}\n${z(n)}`);return At(t+n)}),H(`Append`,2,t=>$n([..._g(t,0,xg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=_g(e,0,bg(``,`Head`));if(t.length===0)throw new S(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=vg(e,0,bg(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return yg(t,1)}),H(`SubSeq`,3,e=>{let t=vg(e,0,bg(`first `,`SubSeq`)),n=Si(e,1,`SubSeq`),r=Si(e,2,`SubSeq`);if(n>r)return yg(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new S(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return yg(t,n-1,r)}),Mi(`SelectSeq`,2,e=>{let t=Ai(e,1,`SelectSeq`);return $n(_g(e,0,bg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),wg=e=>Sg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(N(t))return xr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${pt(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!N(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new S(`Attempted to compute cardinality of the value\n${z(n)}`);return yr(n,e)})]),Tg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Eg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:hg};case`Integers`:return{extends:[`Naturals`],operators:gg};case`Sequences`:return{extends:[],operators:Cg(n.version)};case`FiniteSets`:return{extends:[],operators:wg(n.version)};case`TLC`:return{extends:[],operators:Sg(`TLC`,tg(t,n))};case`Randomization`:return{extends:[],operators:kh(n)};case`_Possible`:return{extends:[],operators:Wh(t,n)};case`Json`:return{extends:[],operators:xh(r)};case`Bags`:return{extends:[],operators:eh(i)};case`TLCExt`:return{extends:[],operators:Uh(t,n)};default:return}},Dg=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}])),Og={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]}},kg=(e,t)=>{let n=Og[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Ag=`$subexpression`,jg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Mg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Mg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of vi(e)){let e=Mg(r,t,n);if(e)return e}},Ng=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Pg=(e,t)=>{let n=e.location,r=Ng(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 jg(`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 jg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Ag,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Ag,args:e.args,location:n,resolution:Da},location:n}},Fg=(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:Da})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Da}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Da};return Pg({...t,params:[...t.params,...r]},a)},Ig=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw jg(r,i);ka.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw jg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Zo(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw jg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Pa(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw jg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&Mg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw jg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||to(t.operand,1)!==0)throw jg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=ao(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[to(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw jg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=to(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw jg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw jg(`Unexpected subexpression selector`,i);let s=r?r.sets:oo(n),c=s?.[to(t.operand,s.length)];if(!c)throw jg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return Fg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw jg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Fg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw jg(`Subexpression selection failed`,i);return Pg(a,o.current)},Lg=(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 no(e,t,n)},Rg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||vi(e).some(Rg),zg=(e,t,n,r=!1)=>{if(!Rg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=es(e,e=>zg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Bg(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)=>zg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:es(e,e=>zg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Lg(a.name,[],void 0,t):a.kind===`Apply`?Lg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Ig(o,t,a,r);return c!==a&&Oa.add(c),c},Bg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:zg(e.expression,t,n,!0)}))}),Vg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Hg=(e,t)=>Bg(e,Vg(t.definitions),()=>!1),Ug=(e,t)=>{let n=Vg([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>zg(e,n,i),o=e=>i(e)||!n(e),s=e=>zg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Bg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Bg(e,n,o):$o(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Rg(e.body))||e.assumptions.some(e=>Rg(e.expression))?{...p,definitions:e.definitions.map(e=>$o(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Wg=(e,t)=>`${e}${t}`,Gg=(e,t,n)=>`${e}${t}${n}`,Kg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},qg=(e,t,n)=>`${e},${t},${n}`,Jg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Yg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Xg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Zg=(e,t,n,r)=>({...Jg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Qg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,$g=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,e_=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,{...Zg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),t_=Zg(`$Set`,0,[2],[1]),n_=Zg(`$Junction`,0,[3],[1]),r_=Zg(`$Choose`,0,[2],[1]),i_=Zg(`$Function`,0,[3],[1]),a_=Zg(`$FcnApply`,0,[2,2],[1,1]),o_=Zg(`$RcdSelect`,0,[2,0],[1,1]),s_=Zg(`'`,2,[1],[0]),c_=Zg(`ENABLED`,1,[2],[0]),l_=Zg(`[]`,3,[3],[0]),u_=Zg(`$SquareAct`,2,[2,1],[0,0]),d_=Zg(`$WF`,3,[1,2],[0,0]),f_=Zg(`$TemporalExists`,3,[3],[0]),p_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),m_=e=>e.map(e=>({name:e,arity:0})),h_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),g_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),__=e=>e.kind!==`Let`&&e.kind!==`Label`,v_=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=e_.get(t)??Dg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Jg(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(Gg(e,n,t))}),t.data.constraints.forEach((e,t)=>Yg(r.constraints,t,e)),Xg(r.argConstraints,Wg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Xg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Qg(e,n))throw new u(`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 u(`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 a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(qg(t,n,r)),s=Jg(Math.max(e.level,...t.filter((t,n)=>$g(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{$g(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Yg(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Yg(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Yg(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Yg(s.constraints,t,Qg(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Yg(s.constraints,e,Qg(r,a)))}))}),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator)?.operator;n&&Yg(s.constraints,t.param,Qg(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Xg(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Xg(s.argConstraints,Wg(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Xg(s.argConstraints,Wg(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator);n&&Xg(s.argConstraints,Wg(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Kg(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Kg(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Gg(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(Gg(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Gg(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,m_(e.params),e.body,t);return{data:n,operator:n}}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{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Jg();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=p_(n,m_(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw h_(`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 h_(`Action used where only temporal formula or state predicate allowed`,e);g_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&__(n)&&n.kind!==r)throw h_(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=>{let t=v(e,n);t.constraints.forEach((e,t)=>Yg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Xg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof u)||t.sany?t:h_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Jg();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(n_,n)}case`Prime`:case`Unchanged`:return s(s_,[e.expression],t);case`Enabled`:return s(c_,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(l_,[n])}case`If`:return s(n_,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(n_,[...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=s(n_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw h_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?f_:n_,[e.body],t,[],e.names);case`Choose`:return s(r_,[e.body],t,e.set?[e.set]:[],Ga(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(t_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(t_,[e.predicate],t,[e.bound.set],Ga(e.bound.pattern));case`SetMap`:return s(t_,[e.expression],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`FunctionConstruction`:return s(i_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`Record`:return s(i_,e.fields.map(e=>e.value),t);case`RecordSet`:return s(t_,e.fields.map(e=>e.value),t);case`Except`:return s(t_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(a_,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(t_,e.args,t)}]);case`Bracket`:return Jg();case`FieldAccess`:return i(o_,[a(e.record,t),{data:Jg()}]);case`BoxAction`:case`AngleAction`:return s(u_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(d_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Jg()}},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 vi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,p_(t,m_(e.names))),i;default:return es(e,(e,n)=>(a(e,r,p_(t,m_(n))),e)),i}},_=(e,t,n,r)=>{let i=p_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Jg(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(Wg(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(Gg(e.name,n,t.name))).map(e=>qg(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(Kg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Kg(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,{...Jg(),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:a}},y_=(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`?y_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Jg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Yg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Xg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},b_=(e,t,n,r)=>{let i=v_(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`?y_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(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:g(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=Wo([...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`?y_(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 p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},x_=(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=v_({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=>Yg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Yg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Xg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Kg(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)&&Yg(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(y_(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=g(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);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.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;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(Wg(e.name,i));a!==void 0&&x_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=Kg(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=x_(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 p([...r.values()])}},C_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],w_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),T_=new Map(Vd.flatMap(e=>e.map(t=>[t,e[0]]))),E_=e=>T_.get(e)??e,D_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},O_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(D_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},k_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),A_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:E_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:E_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},j_=(e,t)=>{let n=[];for(let r=t;;){let t=A_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},M_=e=>({line:e.line,column:e.column}),N_=(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===`.`)continue;else if(a.text===`EXTENDS`){let n=j_(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},P_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,F_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},I_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&P_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&P_(e[n+1],e[n+2])?n+=P_(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=>F_[e])}"`:r.text)}return t},L_=e=>e[2]?.text,R_=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},z_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>z_(e.modules,t)).find(Boolean),B_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(Gd.has(i)?t?.(i):void 0)??Kd.get(i)??t?.(i)??Vp(e,i),s=o===void 0?[]:Ce(o),c=R_(s),l=c.get(L_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Up(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>z_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},V_=(e,t)=>{let n=B_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=j_(t,e+1);r.push({location:M_(t[e]),apply:e=>i.forEach(t=>e.put(k_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:M_(u),apply:t=>t.put(k_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&j_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),w_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(M_(u)),r.push({location:M_(u),apply:e=>e.put(k_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(k_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=E_(e.name);r.push({location:e.location,apply:n=>n.put(k_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(k_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(k_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Na(e.location,t.location)?-1:+!!Na(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=O_();i.set(e??``,s),Bd.toReversed().forEach(e=>s.put(k_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},H_=(e,t,n)=>V_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),U_=(e,t)=>{let n=V_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},W_=(e,t)=>H_(e,t,`variable`),G_=(e,t,n)=>{let r=B_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Hd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=N_(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;I_(s(void 0)).forEach((e,t)=>{t===3&&Wd.forEach(a),a(e)});let x=u(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??L_(r(void 0).tokens);throw m(n,e)}I_(s(n)).forEach(a)}}C_.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),Ud.forEach(a),[...i]},K_=t=>{switch(t.kind){case`Number`:try{return mt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Vt(t.name);case`Set`:return Ln(t.elements.map(K_))}},q_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],J_=(e,t)=>{try{return Up(e)}catch(n){if(!(n instanceof u))throw n;let r=hp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Y_=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),X_=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},Z_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Q_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Z_(e),$_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Da},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),ev=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&nn(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},tv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||vi(e).some(e=>tv(e,t)),nv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ls(e),n.get(e)??n.size)),n},rv=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),iv=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw cl(e);if(e.kind===`Number`&&!_u(e.value))throw ll(e);iv(e.kind===`Let`?[...vi(e),...rv(e.instances??[])]:vi(e))}),av=(e,t)=>{let n=Up(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(lg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Dm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,ee=[],te=[],S=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=S_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,w=/* @__PURE__ */ new Map,T=e=>{let n=c.get(e);if(n)return n;let r=Eg(e,t.print,l,t.files,s);if(!r)return;Tg.get(e)?.forEach(T);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>T(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Dg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:kg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{if(Gd.has(e)&&t.loadModule?.(e)!==void 0)return;let n=T(e),r=Tg.get(e)??[];return n&&S(e,r),n&&r.includes(`Integers`)&&T(`Integers`),n},D=e=>(iv([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...rv(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??Od.get(e)??Vp(t.source,e);if(r===void 0)throw m(e,n);let i=J_(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return D(i)},le=e=>{let t=te.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...te.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];te.push(e.name),ee.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:C,levelChecks:a});if(ee.pop(),te.pop(),i.length>0)throw p(i,!1,void 0,C);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&X_(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw Y_(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,n)=>{let i=d.get(e);if(i)return S(e,x.get(e)??[]),i;let a=le(ce(e,n));return(Nm(l.version).has(e)?Eg(e,t.print,l,t.files,s):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(s.set(t.key,e),r.delete(t.key))}),d.set(e,a.linked),x.set(e,a.closure),S(e,a.closure),a.linked},de=(e,t,n,s,c)=>{let l=c?void 0:E(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=q_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Uo(Hg(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=xs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Jo(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=re(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:re});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&w.set(r,n),r})},fe=(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}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.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:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Da})),he=(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:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(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:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=q_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ie.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>tv(f(e),p),h=d.map(t=>{let n=ge(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=xs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:Da}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Da}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.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}:$_(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=O(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=zd(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...lg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Ro,errors:[],warnings:[]},p=[d],m=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||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);Q_(n.kind)===Q_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Z_(n.kind)} of '${t}' conflicts with \nits ${Z_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Z_(e.kind)} of '${t}' conflicts with \nits ${Z_(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,x=[],ee=[...s.constants],te=s.variables.map(e=>e.name),S=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){m(n);return}let r=t??ue(e,s.name);ee.push(...r.constants.filter(e=>ee.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),x.push(r)});let ne=new Map(l),re=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:D(e),arity:Pa(e),params:Fa(e),kind:zo(s,e)?`Theorem`:`Definition`,range:e.location.range}),T=ee.length===0&&te.length===0,D=e=>s===n?e.name:`${e.name}@${a.id}`,ce=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Na(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:E(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=q_(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:ce,facts:v,reports:p,warnings:a.warnings}),ge=e=>[...re.filter(t=>Na(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Na(t.location,e)).map(e=>[e.name,se(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),xe=e=>{let t=le(),n=t.get(e.name),r=n&&X_(e,n.module);if(n&&!r)throw Y_(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:ge(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,O(s),T,le().get(e.module));ce.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))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Na(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Ug(Ts(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Go(Se,O(Se))),Se.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!T);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Na(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:te,variableLocations:S,visible:l,exported:h,modules:y,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=ie.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>b_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(te),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>w.get(l.get(e)?.key??e)},we,C)),b.push(Ce),Ce},xe=le(n).linked;C.length>0&&!t.isSanyReported&&t.print(h(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=K_(e.value);Pn(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(K_),K_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,ev(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${H_(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=mg(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:nv(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=v_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>_l(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${ba(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let j=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Re=U_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||q_(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},ov={kind:`Boolean`,value:!0},sv={kind:`Boolean`,value:!1},cv=e=>e?ov:sv,lv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,uv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,dv=(e,t)=>({kind:e,body:t}),fv=(e,t,n)=>({kind:e,operands:[t,n]}),pv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?pv(e,t.operands).operands:[t])}),mv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return mv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,mv(t)),0)}},hv=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return hv(e.body);case`And`:case`Or`:return e.operands.some(hv)}},gv=/* @__PURE__ */ new WeakMap,_v={count:0},vv=e=>{let t=gv.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${_v.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(vv).join(`,`)})`;default:return`${e.kind}(${vv(e.body)})`}})();return gv.set(e,n),n},yv=(e,t)=>e===t||vv(e)===vv(t),bv=(e,t)=>{let n=vv(t);return e.some(e=>e===t||vv(e)===n)},xv=e=>e===`And`?`Or`:`And`,Sv=(e,t)=>{switch(e.kind){case`Boolean`:return t?cv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?dv(`Not`,e):e;case`Not`:return Sv(e.body,!t);case`And`:case`Or`:return pv(t?xv(e.kind):e.kind,e.operands.map(e=>Sv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return dv(n,Sv(e.body,t))}}},Cv=e=>{switch(e.kind){case`Boolean`:return cv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return pv(xv(e.kind),e.operands.map(Cv));case`Always`:return dv(`Eventually`,Cv(e.body));case`Eventually`:return dv(`Always`,Cv(e.body));default:return dv(`Not`,e)}},wv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=wv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return cv(t)}return n.length===0?cv(!t):n.length===1?n[0]:pv(e.kind,n)}case`Not`:{let t=wv(e.body);return t.kind===`Boolean`?cv(!t.value):dv(`Not`,t)}case`Always`:case`Eventually`:{let t=wv(e.body);return dv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Tv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Ev=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Ev(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>pv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Ev(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Tv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:pv(`Or`,t);n.push(dv(`Always`,dv(`Eventually`,e)))}return pv(`Or`,n)}case`Not`:return lv(e.body)?e:Ev(Cv(e.body));default:return e}},Dv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Dv(e.operands[0]):pv(e.kind,e.operands.map(Dv));case`Not`:return e.body.kind===`Not`?Dv(e.body.body):dv(`Not`,Dv(e.body));case`Always`:case`Eventually`:case`Next`:return dv(e.kind,Dv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ov(e.operands[0]);let t=Math.floor(e.operands.length/2);return fv(e.kind,Ov(pv(e.kind,e.operands.slice(0,t))),Ov(pv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return dv(e.kind,Ov(e.body));default:return e}},kv=(e,t)=>{e.kind===`Eventually`&&!bv(t,e)&&t.push(e),`body`in e&&kv(e.body,t),`operands`in e&&e.operands.forEach(e=>kv(e,t))},Av=e=>{let t=e.filter(uv),n=e.flatMap(e=>e.kind===`Not`&&uv(e.body)?[e.body]:[]);return!t.some(e=>bv(n,e))},jv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,dv(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Mv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:dv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Nv=(e,t,n)=>e.flatMap(e=>{let r=Mv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Pv=e=>[...new Set(e.map(vv))].sort().join(`|`),Fv=(e,t)=>{let n=new Set(t.map(Pv));return[...e.filter(e=>!n.has(Pv(e))),...t]},Iv=e=>{let t=jv(e),n=Nv(t,`Always`,`And`),r=Nv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Mv(t,`Eventually`,`Or`);if(n&&!(bv(e,n.first)||bv(e,n.second)))return Fv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(bv(e,t.first)||bv(e,t.second))&&!bv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Av(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Mv(t[e],`Always`,`And`);n&&(bv(t,n.first)||t.push(n.first),bv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)bv(t,e.first)&&bv(t,e.second)&&!bv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Av(t)?[]:i(t)};return a(e)},Lv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>mv(e)<=1)}),Rv=e=>{let t=Iv([e]).map(Lv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Pv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Iv(n)){let n=Pv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Lv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},zv=(e,t)=>!bv(e,t)||bv(e,t.body),Bv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&mv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Tv(e);if(n){let e=mv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(hv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Vv=(e,t)=>{let n=e.findIndex(e=>yv(e,t));return n===-1?(e.push(t),e.length-1):n},Hv=e=>{let t=Ev(wv(Sv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Dv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Bv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:pv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:yv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ov(e.formula),n=[];t&&kv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Vv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Vv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Vv(i,e))}));return{tableau:t&&Rv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Uv=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),Wv=()=>n(new x,e.error),Gv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kv=/* @__PURE__ */ new WeakMap,qv=/* @__PURE__ */ new WeakSet,Jv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Yv=(e,t)=>new y(`TLC cannot handle the temporal formula ${el(e)}${t===void 0?``:`:\n${t}`}`),Xv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ul(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Xv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Xv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=_l(e,n);if(t)return Zv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return es(e,(e,a)=>(i.value=Math.max(i.value,Xv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Gv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Zv=(e,t)=>{let n=Kv.get(e);if(n!==void 0)return n;Kv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Xv(e.body,void 0,t),...r.map(e=>Xv(e.set,void 0,t)));return Kv.set(e,i),i},Qv=(t,r)=>{try{return Al(t,r)}catch(t){if(!(t instanceof y))throw t;if(!ba(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},$v=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>$v(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,el(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,ey(e,t,n));if(e.kind===`Identifier`){let r=B(e)?ul(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:_l(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Zv(a,n)>0){if(i.has(a))throw Wv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=Jv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Xv(e,t,n)===3)){let t=tu(e,c),r=B(e)?void 0:_l(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,pu(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Xv(e.set,t,n)===0),u=l?Qv(e.bounds,c):void 0;if(l&&u){let n=[];if(jl(e.bounds,u,t,t=>(n.push(...s(e.body,t,el(e.body))),!1)),n.length===0)throw Uv();return n}return[{expression:e,scope:t,name:o}]},ey=(e,t,n)=>{let r=hu(e.definitions,Jv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&qv.add(e.binding);return r},ty=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),ny=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Xv(e,t,n):i;if(a===0){let r=W(e,Jv(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${tl(e)}`);return cv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw Wv();a.depth++;let o=f(e,t);a.depth--;let s=mv(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Jv(n,t),s=B(e)||_l(i,n)===void 0?ul(t,i):void 0;if(s?.kind===`Thunk`&&qv.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?nu(i,a):$l(i,n);if(l?.kind!==`Closure`)throw Yv(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&_l(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,pu(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof x||n&&!r;throw!(t instanceof y)||i?t:Yv(e)}},l=(e,t)=>{let r=Xv(e,t,n);if(!e.bounds.every(e=>Xv(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw Yv(e)}let a=[],o=e.kind===`Forall`;try{Ml(e.bounds,Jv(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof x)throw n;if(r<=2)return i(e,t,r);throw Yv(e,o&&!ba(n)?n.message:void 0)}return a.length===0?cv(o):u(e,t,pv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=mv(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=Xv(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,ey(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?dv(`Always`,fv(`Or`,dv(`Not`,f(n[0],t)),dv(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,dv(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,fv(`Or`,dv(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,pv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&Xv(e.condition,t,n)===0){let r=W(e.condition,Jv(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,fv(`Or`,fv(`And`,i,f(e.consequent,t)),fv(`And`,dv(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return dv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=ty(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=dv(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?dv(`Always`,dv(`Eventually`,fv(`Or`,i,a))):fv(`Or`,dv(`Eventually`,dv(`Always`,i)),dv(`Always`,dv(`Eventually`,a)))}default:throw Yv(e)}};return f(e,t)},ry=(e,t,n,r,i)=>{let a=e=>ry(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?gl(W(e.expression,a),`a temporal property predicate`):Uc(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&gl(W(e.unchanged,a),`a subscript`)?!1:gl(W(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ry(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},iy=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>iy(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return ry(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ay=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return ay(e.body);case`And`:case`Or`:return e.operands.some(ay);default:return!1}},oy=e=>e.promises.some(e=>ay(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),sy=(e,t)=>e.every((e,n)=>an(e,t[n])),cy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),ly=e=>({data:e(1024),length:0,create:e}),uy=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},dy=e=>new Int32Array(e).fill(-1),fy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,py=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},my=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,hy=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),gy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},_y=2**53-1,vy=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>ny(e.expression,e.scope,n)),a=e.map(e=>dv(`Not`,ny(e.expression,e.scope,n))),o=a.length===1?a[0]:pv(`Or`,a),s=i.length===0?o:pv(`And`,[...i,o]),c=Hv(s);if(c.length===0)throw Uv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=vv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:ly(e=>new Int32Array(e)),edgeActions:ly(e=>new Uint8Array(e)),stateResults:ly(e=>new Uint8Array(e)),initial:[],firstNodes:ly(dy),lastNodes:ly(dy),nextSiblings:[],isDone:[],errorNode:void 0})),d={multiplier:1},f=!Ou(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>ry(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!ry(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!ry(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},te=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),S=(e,t,n)=>e.solution.tableau?gy(e,t).find(t=>e.nodeTableaux[t]===n):t,ne=(e,t,n)=>{let r=hy(e,t,n),i=e.lastNodes.data[t]??-1;return i===-1?uy(e.firstNodes,t,[r]):e.nextSiblings[i]=r,uy(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;uy(e.edgeTargets,a,n),r.forEach((t,n)=>uy(e.edgeActions,(a+n)*o,t)),uy(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&sy(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&te(e)){e.errorNode=a;return}let o=S(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=S(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of gy(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return cy(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)hy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{fy(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)fy(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of py(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}fy(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},w=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>fy(e,t)),c=[],l=t=>{let n=py(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&zv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=_y;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=_y,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>my(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>py(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=cy(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&my(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(py(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=py(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:oy(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of py(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};py(e,l).forEach((t,r)=>{fy(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(S(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=w(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!iy(a[i].body,t,r,0,n)).map(e=>e.name))]}},yy=`UnnamedAction`,by={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},xy=e=>{let t=e.range??by;return er([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Sy=e=>{let t=[[`name`,e.name],[`location`,xy(e.location)]];return e.parameters.length===0?er(t):er([...t,[`context`,er(e.parameters)],[`parameters`,$n(e.parameters.map(e=>e[0]))]])},Cy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),wy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ty=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Ey=e=>e.kind===`Apply`?e.args:[],Dy=(e,t,n)=>{let r=Ty(e);if(r===void 0)return;if(B(e)){let e=ul(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=$l(r,n);return i?.kind===`Closure`?i:void 0},Oy=(e,t)=>{try{return W(e,wy(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},ky=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&xl(e,t)&&Oy(e.body,t),Ay=(e,t)=>{let n=_l(e.name,t);return n?.body===e.body&&ky(n,t)},jy=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=ul(t,e.name);return n?.kind===`Thunk`?n:void 0},My=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ul(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Ny=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Py=(e,t,n,r,i)=>{let a=Ey(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>Xv(e,n,i)!==0)?o():Ny(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,wy(i,n))]),expression:t,scope:n}],o)},Fy=(e,t,n,r,i)=>{let a=()=>({name:n?.name??yy,location:e.location,parameters:My(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Fy(e.body,hu(e.definitions,wy(r,t)),n,r,i);case`Label`:return Fy(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Fy(e,t,n,r,i));case`Exists`:return Ny(()=>{let o=[];return Ml(e.bounds,wy(r,t),t=>(o.push(...Fy(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(Ty(e)??``),s=Dy(e,t,r);if(o)return Py(o,e,t,s,r);if(!s)return[a()];let c=Ey(e),l=B(e)?s.name:r.instanceNames.get(Ty(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return Ay(s,r)||c.some(e=>Xv(e,t,r)!==0)?u():Ny(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,wy(r,t))},parent:e}),s.scope);return Fy(s.body,e,{...s,name:l},r,i)},u)},Iy=(e,t,n,r,i)=>{let a=(e,t)=>Iy(e,t,n,r,i);if(e.kind===`Let`){a(e.body,hu(e.definitions,wy(n,t)));return}let o=jy(e,t);if(o){a(o.expression,o.scope);return}let s=Dy(e,t,n);if(s&&Ay(s,n))return;if(s&&s.params.length===0){if(Xv(s.body,s.scope,n)===1){r.inits.push(Cy(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,pu(s,e.args,wy(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(Cy(yy,e));return}let c=Xv(e,t,n);c<=1?r.inits.push(Cy(yy,e)):c===3&&r.temporals.push(Cy(yy,e))},Ly=(e,t,n,r,i)=>{let a=(t,n)=>Ly(e,t,n,r,i);if(t.kind===`Let`){a(t.body,hu(t.definitions,wy(r,n)));return}let o=jy(t,n);if(o){a(o.expression,o.scope);return}let s=Dy(t,n,r);if(s&&Ay(s,r))return;if(s&&s.params.length===Ey(t).length){a(s.body,t.kind===`Apply`?pu(s,t.args,wy(r,n)):s.scope);return}if(t.kind===`Forall`&&Ny(()=>(Ml(t.bounds,wy(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Cy(e,a)):Xv(a,n,r)<2?i.invariants.push(Cy(e,a)):i.impliedTemporals.push(Cy(e,t));return}let c=Xv(t,n,r);c<=1?i.impliedInits.push(Cy(e,t)):c===3&&i.impliedTemporals.push(Cy(e,t))},Ry=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`&&!ky(n,t)?n:void 0},zy=e=>er([[`name`,e.name],[`location`,xy(e.location)]]),By=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Ry(e.specification,t);a&&(Iy(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Fy(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:$l(e.init,t);o?.kind===`Closure`&&r.inits.push(Cy(e.init??``,o.body));let s=e.next===void 0?void 0:$l(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Fy(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Ry(e,t);n&&r.invariants.push(Cy(e,n.body))}),e.properties.forEach(e=>{let n=Ry(e,t);n&&Ly(e,n.body,void 0,t,r)}),r},Vy=(e,t,n)=>By(e,t,n).inits,Hy=(e,t,n)=>By(e,t,n).actions,Uy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,Wy=(e,t)=>`${e.name===yy?`Action`:e.name}${t===`1.7.4`?``:Uy(e)} ${g(e.location.range??by)}`,Gy=e=>`${e.name}${Uy(e)}`,Ky=(e,t,n,r)=>{let i=By(e,t,r),a=e=>Ln(e.map(Sy)),o=e=>Ln(e.flatMap(e=>{let n=Ry(e,t);return n?[zy(n)]:[]}));return er([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Ln(t.variables.map((e,t)=>er([[`name`,e],[`location`,xy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},qy=`paired12`,Jy=(e,t=16)=>e<=t*.75?t:Jy(e,t*2),Yy=(e,t)=>{let n=Jy(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Xy=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Zy=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Qy=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),$y=e=>Qy(e).replaceAll(`
|
|
1773
|
+
`,`\\n`),eb=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},tb=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
|
|
1774
1774
|
`,r?``:`node [shape=box,style=rounded]
|
|
1775
|
-
`,e.colorize?`edge [colorscheme="${
|
|
1775
|
+
`,e.colorize?`edge [colorscheme="${qy}"]\n`:``,`nodesep=0.35;
|
|
1776
1776
|
`,`subgraph cluster_graph {
|
|
1777
1777
|
`,`color="white";
|
|
1778
1778
|
`],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=e=>{let t=a.get(e.level)??/* @__PURE__ */ new Set;a.set(e.level,t.add(e.fingerprint))},c=e=>{if(!e)return 1;let t=o.get(e.name)??o.size+2;return o.set(e.name,t),t},l=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
|
|
1779
|
-
`,`node [ labeljust="l",colorscheme="${
|
|
1780
|
-
`,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${
|
|
1779
|
+
`,`node [ labeljust="l",colorscheme="${qy}",style=filled,shape=record ]\n`,...Yy([...o.keys()],Zy).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...Yy([...a],e=>e[0]).map(e=>`{rank = same; ${Yy([...e[1]],Xy).map(e=>`${e};`).join(``)}}\n`),`}
|
|
1780
|
+
`,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${$y(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?Qy(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${$y(n.getText())}"`;i.push(`${n.fingerprint} [label="${$y(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},nb=(e,t,n)=>e.dot?tb(e,t,n):eb(e,t),rb=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),ib=(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},ab=t=>n(new y(`${s}${t}`),e.error),ob=e=>{let t=Ar(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!F(e)||!F(i))throw ab(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},sb=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(sb);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},cb=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,lb=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw ab(`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(!N(a)||!I(a))throw ab(`The symmetry operator must specify a set of functions.`);let o=L(a).elements;if(!o.every(P))throw ab(`The symmetry values must be function records.`);let s=o.map(ob),c=r.body.kind===`Apply`?r.body.args:[],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=sb(cb(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ua.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;s.forEach(e=>{e.size>0&&d.set(rb(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=ib(n,e),r=rb(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=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(!cb(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=>F(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},ub=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=pb(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(pb(e[r],t));return a}},db=(e,t)=>{let n=[],r=[];for(let i of e){let e=pb(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(zt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(zt(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},fb=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,pb=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=fb(e);if(n===0||n>64)return mb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=mb(e,t),a=i!==e&&an(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},mb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=db(e.elements,t);return n?Ht(n):e}if(n===`Function`||n===`LazyFunction`&&I(e.domain)){let n=Ar(e),r=ub(n.domain,t),i=ub(n.range,t)??n.range;if(r){let e=Un(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ut(n.domain,e.range):e}return i===n.range?n:Ut(n.domain,i)}if(n===`Interval`||!N(e)||!I(e))return e;let r=L(e),i=ub(r.elements,t);return i?Ln(i):r},hb=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},gb=(e,t,n)=>e.images[t]??=pb(e.images[0],n.permutations[t-1]),_b=(e,t,n,r)=>{let i=hb(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=zt(gb(i,t,r),gb(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},vb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?_b(i,t,n,r):0;if(o!==0)return o<0}return!1},yb=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>vb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?gb(hb(e,t),r,t):e)},bb=(e,t)=>e*((t-e)/2**64),xb=e=>e.includes(`.`)?e:`${e}.0`,Sb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return xb(String(e));let[n,r]=e.toExponential().split(`e`);return`${xb(n)}E${r.replace(`+`,``)}`},Cb=e=>e!==void 0&&e>=`0`&&e<=`9`,wb=e=>{if(e===0)return`0.0`;let t=Sb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Cb(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;Cb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Cb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Cb(t[n.next])&&Number(t[n.next])>=5&&(n.result=Tb(n.result));Cb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Tb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Tb(r)}.`:n===`9`?`${Tb(r)}0`:`${r}${Number(n)+1}`},Eb=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},Db=(e,t,n)=>{if(bb(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},Ob=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={count:0},o=n.find(t=>(a.count+=e[t],a.count>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}).`},kb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),Ab={line:0,column:0},jb=`Failed to recover the initial state from its fingerprint.`,Mb=`Failed to recover the next state from its fingerprint.`,Nb=e=>({kind:`Identifier`,name:e,location:Ab}),Pb=/* @__PURE__ */ new Set([`name`,`property`]),Fb=(e,t,n)=>{let r=_l(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Pb.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},Ib=(e,t,n)=>{if(xl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Nb(e),ax(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},Lb=(e,t,n)=>{let r=Fb(e,t,n);if(Ib(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},Rb=(e,t,n)=>{let r=n.constants.has(t)?void 0:Fb(e,t,n),i=r?Ib(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},zb=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Bb=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Yl(e.startupDefinitions,r),t.invariants.forEach(e=>{Rb(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Vb=(t,r)=>{let i=v_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>_l(e,r)});return t.flatMap(t=>{let a=Rb(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
|
|
1781
1781
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1782
1782
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1783
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Pb(t),scope:void 0}]})},Ub=(e,t)=>{if(!P(e))return;let n=Ar(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Wb=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Wb(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=_l(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Wb(n.body,t)}return[e]},Gb=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Xv(r,e.scope,t)>0)return!1;let i=W(r,ox(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},Kb=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Rb(t,e,r),Pb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=Ib(`name`,t.specification,r),c=Lb(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if($v(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Gb(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&Xv(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${el(c.expression)}`),e.error);let l=Xv(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:jb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},qb=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=zb(`property`,e,t);if(!i)return;Xv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;$v(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Gb(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`&&Xv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?_l(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=Xv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Jb=(e,t,n)=>t.flatMap(t=>zb(e,t,n)?[{name:t,expression:Pb(t),scope:void 0}]:[]),Yb=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Xb=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Rb(`possible`,n,t);let i=Pb(n);if(Xv(i,void 0,t)===3)throw new v(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Zb=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Qb=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=_l(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},$b=(e,t)=>e.flatMap(e=>Wb(e.expression,t).map(n=>{let r=e.scope===void 0?wd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Zb(n,r,t),predicate:Qb(e.expression,t)}})),ex=(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},tx=/[\u0100-\uffff]/,nx=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),rx=e=>e.kind===`String`?tx.test(e.value):e.kind===`Set`&&e.elements.some(rx),ix=e=>e.kind===`String`&&tx.test(e.value)||e.kind===`Apply`&&nx.has(e.operator)||vi(e).some(ix),ax=(e,t)=>e.constants.some(e=>rx(e.value)||(e.args??[]).some(rx))||[...t.definitions.values()].some(e=>ix(e.body)||e.kind===`Function`&&e.bounds.some(e=>ix(e.set))),ox=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),sx=(e,t,n)=>gl(W(e,t),n),cx=(e,t,n=lx)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},lx=(e,t)=>{let n=e.kind===`Identifier`?_l(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?$c(i):tl(r)}`},ux=(e,t)=>cx(e.expression,t,(n,r)=>(cx(e.predicate,t),lx(n,r))),dx=()=>{},fx=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=sx(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),px=(e,t,n)=>{try{return sx(e,ox(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},mx=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=px(n.expression,t,`an assumption`);if(e)return{name:el(n.expression),trace:[],message:e.message}}},hx=(t,r,i,a)=>{let o=Hb(t.invariants,r),c=Kb(t,r),l=qb(t,r,a),u=$b([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?ma:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=$b(Jb(`constraint`,t.constraints,r),r),m=Jb(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Ib(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Ib(`periodic`,t.periodic,r);let h=Xb(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:ub(t.symmetry,r,t.substitutions);t.view!==void 0&&Ib(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Pb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:jb};return{...e,unchanged:t}}),x=e=>Xv(e.expression,void 0,r)>=2,ee=h.filter(e=>!x(e)),te=h.filter(x),S=r.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ne.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ne.indices},ie=(e,t)=>W(e,ox(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:bb(e,g,t);return sm(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=ax(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=Yb(e.name,r),n=t?` at ${$c(t)}`:``;return{name:e.name,code:ua.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${n} 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:dt(z(Om(S),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=um(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:bb(e,g,re());return _===void 0?t:[ie(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(ex(a,t,i))return!1;try{let e=ox(r,t,void 0,a.scope),n=a.membership;return i&&n?!kr(t[n.variable],i[n.variable],W(n.set,e)):!ux(a,e)}catch(t){throw i?Sx(n(t,e.safetyEvaluationFailure),ua.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>cx(n,ox(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>cx(e.predicate,ox(n,t,void 0,e.scope)))&&m.every(r=>cx(r.expression,ox(n,e,t,r.scope))))||r())||d.every(e=>cx(e.predicate,ox(n,t,void 0,e.scope))))&&b.every(r=>cx(r.box,ox(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>ex(n,e,t)||ux(n,ox(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!cx(t.expression,ox(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!cx(n.action,ox(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${el(n.box)}`)&&!sx(n.unchanged,ox(r,e,t,n.scope),`a subscript`)}catch(e){throw Sx(gx(e),ua.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>cx(n.expression,ox(r,e,t),e=>`${s}${lx(e,r)}`)),trackStatePossible:ee.length===0?dx:e=>fx(ee,S,ox(r,e,void 0)),trackActionPossible:te.length===0?dx:(e,t)=>fx(te,S,ox(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=_l(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=px(Pb(e),r,`a postcondition`);if(!t)continue;let n=Yb(e,r),i=n?` at ${$c(n)}`:``;return t.message===void 0?{name:e,code:ua.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:ua.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},gx=e=>e instanceof S?n(e,e.exitCode):e,_x=/* @__PURE__ */ Error(`The replay stopped`),vx=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),yx=t=>{let n=ya(t.message);return n&&!n.isEvalException&&vx.has(n.code)?e.configParseError:oe(t)},bx=t=>{let n=t.cause;return n instanceof y?bx(n):t instanceof S?t.exitCode:e.specEvaluationFailure},xx=/* @__PURE__ */ new WeakMap,Sx=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return xx.set(i,{code:t,headline:r,inner:e}),i},Cx=s.slice(0,s.indexOf(`
|
|
1784
|
-
`)),wx=`${s}tlc2.tool.EvalException: `,Tx=`${s}util.Assert$TLCRuntimeException: `,Ex=o(`tlc2.tool.EvalException`),Dx=e=>ba(e)?wx:Tx,Ox=e=>{try{return e()}catch(e){throw e instanceof y?ba(e)?new y(`${Ex}${e.message}`):ya(e.message)?e:new y(`${s}${e.message}`):e}},kx=[wx,Tx,s,Ex],Ax=(e,t)=>{let n=xx.get(e);if(n)return`${n.headline}\n${Ax(n.inner,t)}`;let r=e.message,i=kx.find(e=>r.startsWith(e))??``;return`${i}${Ca(r.slice(i.length),t)}`},jx=(e,t)=>{let n=xx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Ax(e,!0)};if(t&&ba(e))return{code:ya(r)?.code??ua.general,message:r,toolMessage:r};let i=t&&!r.startsWith(Cx)?s:``;return{code:ua.general,message:`${i}${r}`,toolMessage:`${i}${Ax(e,!0)}`}},Mx=e=>{let t=e.dump&&rb(e.dump,e.writeFile,e.version);try{return Px(e,t)}catch(e){throw c(e)?Nx():e}finally{t?.close()}},Nx=()=>n(new x,e.error),Px=(t,i)=>{let o=typeof t.config==`string`?at(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};Dt(G_(t.source,o,t.loadModule)),kt(t.version);let p=av(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});Vb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>qy(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),te=Array.from({length:32},()=>0),re={newStates:0},ie=()=>Math.min(re.newStates,31),C=()=>te.map((e,t)=>t===ie()?e+1:e),ae=()=>g?[...te]:C(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),w=(e,t=[...te])=>({...e,violationOutDegrees:t}),T=()=>({...b(`success`),outDegrees:[...te],fingerprintDistance:Ob(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=hx(o,m,()=>W_(t.source,t.loadModule),t.onProgress),D=()=>mx(p.assumptions,m);if(!E){h.isStarted=!0;let e=D();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),T())}let ce=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?Cy(t):Ih(e.action)},fe=(e,t)=>{ce&&(h.counterExample=Lh(e.map(ue),e.slice(1).map(de),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=E.spec,he=E.getFingerprintState,O={value:void 0},ge=()=>O.value??=Uy(o,m,p.instanceActions),_e=e=>{let t=Uu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=Xr(e).find(e=>Yr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Yr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(en)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if($s(Hy(o,m,p.instanceActions),r,i=>{if(Bb(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),_x}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();ec(ge(),n,t,(o,s)=>{if(!E.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,N?{name:s.name,signature:Ky(s)}:void 0),n}))throw _x})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let k=a(()=>Ox(()=>yy(E.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Kc(me.next,t,m,e=>{if(je(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=E.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=_i(),Me=e=>Object.fromEntries(E.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Rb(`alias`,e,m).body,i=W(Pb(e),ox(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return Ub(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:Ca(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=ge(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>qc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&Gy(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Gc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=qc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Xe(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||Du(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(Mb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ze(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,Mb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof S?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:bx(t):n.isInitial?yx(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new x:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...jx(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof S)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=ge(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Vt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return w({...f,failure:f.failure&&{...f.failure,code:ua.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&Gy(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,Nb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(Nb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Hr(t,Zr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Yr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!an(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},it=e=>e===-1?[]:[...it(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...it(M.index),e]:it(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>hi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>hi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=E.satisfiesConstraints(e);if(r&&(E.trackStatePossible(e),Ye(t),e.forEach(en)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=E.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=E.satisfiesConstraints(t.state,o);d&&E.trackStatePossible(t.state);let p=d&&E.satisfiesActionConstraints(o,t.state);p&&(E.trackActionPossible(o,t.state),Ye(s),t.state.forEach(en));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:Ky(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),re.newStates++),m===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return w(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,Ab(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=E.findViolatedActionProperty(o,t.state);if(_)return w(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},lt={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let ut=D();if(ut)return b(`assumption-violation`,ut);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Wc(me.init,m,e=>{Bb(h.initialStates,t.onProgress);try{lt.result=st(e)}catch(t){let n=f(xe);lt.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return lt.result!==void 0},me.scope)}catch(e){if(e instanceof ne){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Vt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(lt.result)return lt.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let dt=me.next;if(dt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let N=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),ft=(e,t)=>{if(!N)return Kc(dt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+Kc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},P=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},F=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return P(e,t)}},pt=(e,t)=>{let n=f(()=>F(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},mt=e=>Ge(Nx(),He(e)),ht=(e,t,n)=>{if(c(e))return mt(t);let r=pt(t,n);return Ge(gx(e),Ab(He(t),r.lines),{isNextState:!0,...r.result})},gt=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=ft(a,(e,n)=>{try{lt.result=ct(t,e,r,l,n)}catch(n){if(c(n))return lt.result=mt(t),!0;let i=g?f(()=>Se(t)):pt(t,r);if(g&&n instanceof y&&!xx.has(n))return lt.result=Ge(new y(`${Dx(n)}${n.message}`,n),Ab({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Yr(e)!==void 0)&&n instanceof y?jx(ba(n)?new y(`${Ex}${n.message}`):n,!0):void 0;lt.result=Ge(n,Ab(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return lt.result!==void 0});M.isExpanding=!1;let d=lt.result;if(d?.violation&&!g){let e=f(()=>F(t,r));return{...d,violation:Ab(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:P(t,r)}}}),i=e.violation?{...e,violation:Ab(e.violation,n.lines)}:e,a=w(i,n.result.isFailed?ae():C());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${ba(i)?Ex:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},_t=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:ua.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=_l(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:ua.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${$c(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},vt=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&Gy(d.result,t.version),warning:p?_t():void 0},()=>c===l?de(o[o.length-1]):d.result?Cy(d.result):Ih(ze(u,c)?.action))},yt=k!==void 0&&t.livenessCheck!==`final`,bt=performance.now(),xt={at:bt+3e3,size:1,time:0},St=e=>{let n=performance.now();if(!((e-xt.size)/xt.size>.1)||xt.time>(n-bt)*.2||(xt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),xt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{lt.result=gt(e,n)}catch(t){lt.result=t instanceof ee?Ke(e,t):ht(t,e,n)}if(lt.result)return lt.result;if(te[ie()]++,re.newStates=0,(yt||t.onProgress)&&performance.now()>=xt.at){xt.at=performance.now()+6e4;let n=yt?St(e+1):void 0;if(k&&n)return vt(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let Ct=k?.findViolation();if(k&&Ct)return vt(k,Ct);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return T()},Fx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Ix=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ii(e[t]),1540483477);t[0]=Fx(n)||1,t[1]=Fx(r)},Lx=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},Rx=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},zx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Bx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Rx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Vx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Hx=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Rx(t,n);return{slots:t,used:e.used}},Ux=[void 0,`lambda`,`tuple`,`record`],Wx=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Lr(e.domain);return t?(r(7),r(Ux.indexOf(Kt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Ux.indexOf(Kt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Gx=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Vt(t.strings[n[r.index++]]);if(e===5)return Ht(i(n[r.index++]));let a=Ux[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Zn({kind:`Interval`,low:e,high:e+t-1});return Gt(Ut(o,i(t)),a)}let o=n[r.index++],s=i(o);return Gt(Ut(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Be as $,hp as A,Ca as B,Mm as C,Up as D,Vp as E,qc as F,_i as G,Ta as H,ua as I,jt as J,hi as K,da as L,el as M,Du as N,Gp as O,Gc as P,Ye as Q,pa as R,W_ as S,Nm as T,ya as U,Ea as V,vi as W,kt as X,Dt as Y,at as Z,xb as _,o as _t,Hx as a,v as at,H_ as b,Ix as c,ae as ct,mx as d,d as dt,xe as et,Bb as f,u as ft,Ob as g,oe as gt,Db as h,s as ht,zx as i,w as it,Vd as j,Wp as k,Mx as l,f as lt,Tb as m,ie as mt,Wx as n,T as nt,Bx as o,l as ot,Vb as p,C as pt,z as q,Lx as r,se as rt,Vx as s,y as st,Gx as t,Ce as tt,hx as u,re as ut,kb as v,e as vt,jm as w,G_ as x,av as y,n as yt,Sa as z};
|
|
1783
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Nb(t),scope:void 0}]})},Hb=(e,t)=>{if(!P(e))return;let n=Ar(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Ub=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Ub(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=_l(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Ub(n.body,t)}return[e]},Wb=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Xv(r,e.scope,t)>0)return!1;let i=W(r,ax(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},Gb=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Lb(t,e,r),Nb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=Fb(`name`,t.specification,r),c=Ib(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if($v(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Wb(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&Xv(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${el(c.expression)}`),e.error);let l=Xv(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:Ab},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Kb=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Rb(`property`,e,t);if(!i)return;Xv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;$v(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Wb(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`&&Xv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?_l(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=Xv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},qb=(e,t,n)=>t.flatMap(t=>Rb(e,t,n)?[{name:t,expression:Nb(t),scope:void 0}]:[]),Jb=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Yb=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Lb(`possible`,n,t);let i=Nb(n);if(Xv(i,void 0,t)===3)throw new v(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Xb=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Zb=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=_l(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Qb=(e,t)=>e.flatMap(e=>Ub(e.expression,t).map(n=>{let r=e.scope===void 0?wd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Xb(n,r,t),predicate:Zb(e.expression,t)}})),$b=(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},ex=/[\u0100-\uffff]/,tx=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),nx=e=>e.kind===`String`?ex.test(e.value):e.kind===`Set`&&e.elements.some(nx),rx=e=>e.kind===`String`&&ex.test(e.value)||e.kind===`Apply`&&tx.has(e.operator)||vi(e).some(rx),ix=(e,t)=>e.constants.some(e=>nx(e.value)||(e.args??[]).some(nx))||[...t.definitions.values()].some(e=>rx(e.body)||e.kind===`Function`&&e.bounds.some(e=>rx(e.set))),ax=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ox=(e,t,n)=>gl(W(e,t),n),sx=(e,t,n=cx)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},cx=(e,t)=>{let n=e.kind===`Identifier`?_l(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?$c(i):tl(r)}`},lx=(e,t)=>sx(e.expression,t,(n,r)=>(sx(e.predicate,t),cx(n,r))),ux=()=>{},dx=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ox(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),fx=(e,t,n)=>{try{return ox(e,ax(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},px=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=fx(n.expression,t,`an assumption`);if(e)return{name:el(n.expression),trace:[],message:e.message}}},mx=(t,r,i,a)=>{let o=Vb(t.invariants,r),c=Gb(t,r),l=Kb(t,r,a),u=Qb([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?ma:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=Qb(qb(`constraint`,t.constraints,r),r),m=qb(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Fb(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Fb(`periodic`,t.periodic,r);let h=Yb(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:lb(t.symmetry,r,t.substitutions);t.view!==void 0&&Fb(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Nb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Ab};return{...e,unchanged:t}}),x=e=>Xv(e.expression,void 0,r)>=2,ee=h.filter(e=>!x(e)),te=h.filter(x),S=r.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ne.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ne.indices},ie=(e,t)=>W(e,ax(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:yb(e,g,t);return sm(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=ix(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=Jb(e.name,r),n=t?` at ${$c(t)}`:``;return{name:e.name,code:ua.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${n} 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:dt(z(Om(S),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=um(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:yb(e,g,re());return _===void 0?t:[ie(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if($b(a,t,i))return!1;try{let e=ax(r,t,void 0,a.scope),n=a.membership;return i&&n?!kr(t[n.variable],i[n.variable],W(n.set,e)):!lx(a,e)}catch(t){throw i?xx(n(t,e.safetyEvaluationFailure),ua.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>sx(n,ax(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>sx(e.predicate,ax(n,t,void 0,e.scope)))&&m.every(r=>sx(r.expression,ax(n,e,t,r.scope))))||r())||d.every(e=>sx(e.predicate,ax(n,t,void 0,e.scope))))&&b.every(r=>sx(r.box,ax(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>$b(n,e,t)||lx(n,ax(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!sx(t.expression,ax(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!sx(n.action,ax(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${el(n.box)}`)&&!ox(n.unchanged,ax(r,e,t,n.scope),`a subscript`)}catch(e){throw xx(hx(e),ua.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>sx(n.expression,ax(r,e,t),e=>`${s}${cx(e,r)}`)),trackStatePossible:ee.length===0?ux:e=>dx(ee,S,ax(r,e,void 0)),trackActionPossible:te.length===0?ux:(e,t)=>dx(te,S,ax(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=_l(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=fx(Nb(e),r,`a postcondition`);if(!t)continue;let n=Jb(e,r),i=n?` at ${$c(n)}`:``;return t.message===void 0?{name:e,code:ua.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:ua.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},hx=e=>e instanceof S?n(e,e.exitCode):e,gx=/* @__PURE__ */ Error(`The replay stopped`),_x=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),vx=t=>{let n=ya(t.message);return n&&!n.isEvalException&&_x.has(n.code)?e.configParseError:oe(t)},yx=t=>{let n=t.cause;return n instanceof y?yx(n):t instanceof S?t.exitCode:e.specEvaluationFailure},bx=/* @__PURE__ */ new WeakMap,xx=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return bx.set(i,{code:t,headline:r,inner:e}),i},Sx=s.slice(0,s.indexOf(`
|
|
1784
|
+
`)),Cx=`${s}tlc2.tool.EvalException: `,wx=`${s}util.Assert$TLCRuntimeException: `,Tx=o(`tlc2.tool.EvalException`),Ex=e=>ba(e)?Cx:wx,Dx=e=>{try{return e()}catch(e){throw e instanceof y?ba(e)?new y(`${Tx}${e.message}`):ya(e.message)?e:new y(`${s}${e.message}`):e}},Ox=[Cx,wx,s,Tx],kx=(e,t)=>{let n=bx.get(e);if(n)return`${n.headline}\n${kx(n.inner,t)}`;let r=e.message,i=Ox.find(e=>r.startsWith(e))??``;return`${i}${Ca(r.slice(i.length),t)}`},Ax=(e,t)=>{let n=bx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:kx(e,!0)};if(t&&ba(e))return{code:ya(r)?.code??ua.general,message:r,toolMessage:r};let i=t&&!r.startsWith(Sx)?s:``;return{code:ua.general,message:`${i}${r}`,toolMessage:`${i}${kx(e,!0)}`}},jx=e=>{let t=e.dump&&nb(e.dump,e.writeFile,e.version);try{return Nx(e,t)}catch(e){throw c(e)?Mx():e}finally{t?.close()}},Mx=()=>n(new x,e.error),Nx=(t,i)=>{let o=typeof t.config==`string`?at(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};Dt(G_(t.source,o,t.loadModule)),kt(t.version);let p=av(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});Bb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>Ky(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),te=Array.from({length:32},()=>0),re={newStates:0},ie=()=>Math.min(re.newStates,31),C=()=>te.map((e,t)=>t===ie()?e+1:e),ae=()=>g?[...te]:C(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),w=(e,t=[...te])=>({...e,violationOutDegrees:t}),T=()=>({...b(`success`),outDegrees:[...te],fingerprintDistance:Db(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=mx(o,m,()=>W_(t.source,t.loadModule),t.onProgress),D=()=>px(p.assumptions,m);if(!E){h.isStarted=!0;let e=D();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),T())}let ce=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?Sy(t):Ih(e.action)},fe=(e,t)=>{ce&&(h.counterExample=Lh(e.map(ue),e.slice(1).map(de),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=E.spec,he=E.getFingerprintState,O={value:void 0},ge=()=>O.value??=Hy(o,m,p.instanceActions),_e=e=>{let t=Uu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=Xr(e).find(e=>Yr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Yr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(en)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if($s(Vy(o,m,p.instanceActions),r,i=>{if(zb(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),gx}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();ec(ge(),n,t,(o,s)=>{if(!E.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,N?{name:s.name,signature:Gy(s)}:void 0),n}))throw gx})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let k=a(()=>Dx(()=>vy(E.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Kc(me.next,t,m,e=>{if(je(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=E.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=_i(),Me=e=>Object.fromEntries(E.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Lb(`alias`,e,m).body,i=W(Nb(e),ax(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return Hb(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:Ca(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=ge(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>qc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&Wy(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Gc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=qc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Xe(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||Du(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(jb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ze(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,jb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof S?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:yx(t):n.isInitial?vx(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new x:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...Ax(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof S)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=ge(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Vt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return w({...f,failure:f.failure&&{...f.failure,code:ua.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&Wy(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,Mb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(Mb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Hr(t,Zr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Yr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!an(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},it=e=>e===-1?[]:[...it(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...it(M.index),e]:it(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>hi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>hi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=E.satisfiesConstraints(e);if(r&&(E.trackStatePossible(e),Ye(t),e.forEach(en)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=E.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=E.satisfiesConstraints(t.state,o);d&&E.trackStatePossible(t.state);let p=d&&E.satisfiesActionConstraints(o,t.state);p&&(E.trackActionPossible(o,t.state),Ye(s),t.state.forEach(en));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:Gy(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),re.newStates++),m===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return w(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,kb(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=E.findViolatedActionProperty(o,t.state);if(_)return w(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},lt={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let ut=D();if(ut)return b(`assumption-violation`,ut);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Wc(me.init,m,e=>{zb(h.initialStates,t.onProgress);try{lt.result=st(e)}catch(t){let n=f(xe);lt.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return lt.result!==void 0},me.scope)}catch(e){if(e instanceof ne){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Vt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(lt.result)return lt.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let dt=me.next;if(dt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let N=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),ft=(e,t)=>{if(!N)return Kc(dt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+Kc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},P=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},F=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return P(e,t)}},pt=(e,t)=>{let n=f(()=>F(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},mt=e=>Ge(Mx(),He(e)),ht=(e,t,n)=>{if(c(e))return mt(t);let r=pt(t,n);return Ge(hx(e),kb(He(t),r.lines),{isNextState:!0,...r.result})},gt=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=ft(a,(e,n)=>{try{lt.result=ct(t,e,r,l,n)}catch(n){if(c(n))return lt.result=mt(t),!0;let i=g?f(()=>Se(t)):pt(t,r);if(g&&n instanceof y&&!bx.has(n))return lt.result=Ge(new y(`${Ex(n)}${n.message}`,n),kb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Yr(e)!==void 0)&&n instanceof y?Ax(ba(n)?new y(`${Tx}${n.message}`):n,!0):void 0;lt.result=Ge(n,kb(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return lt.result!==void 0});M.isExpanding=!1;let d=lt.result;if(d?.violation&&!g){let e=f(()=>F(t,r));return{...d,violation:kb(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:P(t,r)}}}),i=e.violation?{...e,violation:kb(e.violation,n.lines)}:e,a=w(i,n.result.isFailed?ae():C());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${ba(i)?Tx:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},_t=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:ua.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=_l(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:ua.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${$c(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},vt=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&Wy(d.result,t.version),warning:p?_t():void 0},()=>c===l?de(o[o.length-1]):d.result?Sy(d.result):Ih(ze(u,c)?.action))},yt=k!==void 0&&t.livenessCheck!==`final`,bt=performance.now(),xt={at:bt+3e3,size:1,time:0},St=e=>{let n=performance.now();if(!((e-xt.size)/xt.size>.1)||xt.time>(n-bt)*.2||(xt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),xt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{lt.result=gt(e,n)}catch(t){lt.result=t instanceof ee?Ke(e,t):ht(t,e,n)}if(lt.result)return lt.result;if(te[ie()]++,re.newStates=0,(yt||t.onProgress)&&performance.now()>=xt.at){xt.at=performance.now()+6e4;let n=yt?St(e+1):void 0;if(k&&n)return vt(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let Ct=k?.findViolation();if(k&&Ct)return vt(k,Ct);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return T()},Px=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Fx=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ii(e[t]),1540483477);t[0]=Px(n)||1,t[1]=Px(r)},Ix=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},Lx=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},Rx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),zx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Lx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Bx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Vx=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Lx(t,n);return{slots:t,used:e.used}},Hx=[void 0,`lambda`,`tuple`,`record`],Ux=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Lr(e.domain);return t?(r(7),r(Hx.indexOf(Kt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Hx.indexOf(Kt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Wx=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Vt(t.strings[n[r.index++]]);if(e===5)return Ht(i(n[r.index++]));let a=Hx[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Zn({kind:`Interval`,low:e,high:e+t-1});return Gt(Ut(o,i(t)),a)}let o=n[r.index++],s=i(o);return Gt(Ut(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Be as $,hp as A,Ca as B,Mm as C,Up as D,Vp as E,qc as F,_i as G,Ta as H,ua as I,jt as J,hi as K,da as L,el as M,Du as N,Gp as O,Gc as P,Ye as Q,pa as R,W_ as S,Nm as T,ya as U,Ea as V,vi as W,kt as X,Dt as Y,at as Z,bb as _,o as _t,Vx as a,v as at,H_ as b,Fx as c,ae as ct,px as d,d as dt,xe as et,zb as f,u as ft,Db as g,oe as gt,Eb as h,s as ht,Rx as i,w as it,Vd as j,Wp as k,jx as l,f as lt,wb as m,ie as mt,Ux as n,T as nt,zx as o,l as ot,Bb as p,C as pt,z as q,Ix as r,se as rt,Bx as s,y as st,Wx as t,Ce as tt,mx as u,re as ut,Ob as v,e as vt,jm as w,G_ as x,av as y,n as yt,Sa as z};
|