tla-ts 0.0.9-dev.2813db5 → 0.0.9-dev.4ce0657

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.
Files changed (48) hide show
  1. package/README.md +21 -0
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +15 -15
  5. package/dist/deciders.js +48 -48
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +1 -0
  8. package/dist/index.d.ts +1 -0
  9. package/dist/index.js +1 -1
  10. package/dist/prove.cjs +16 -16
  11. package/dist/prove.js +20 -20
  12. package/dist/run.cjs +28 -28
  13. package/dist/run.js +31 -31
  14. package/dist/tlapm.cjs +2 -2
  15. package/dist/tlapm.js +1 -1
  16. package/dist/transfer.cjs +18 -18
  17. package/dist/transfer.js +26 -26
  18. package/dist/worker.cjs +4 -4
  19. package/dist/worker.js +4 -4
  20. package/package.json +3 -1
  21. package/src/check.ts +44 -31
  22. package/src/cli/options.ts +1 -1
  23. package/src/cli/tlc.ts +17 -8
  24. package/src/cli/typescript.ts +26 -0
  25. package/src/environment.ts +4 -0
  26. package/src/errors.ts +15 -0
  27. package/src/evaluate.ts +65 -10
  28. package/src/instances.ts +67 -6
  29. package/src/liveness-checker.ts +6 -3
  30. package/src/liveness.ts +7 -3
  31. package/src/prover/smt/solver/solver.ts +31 -27
  32. package/src/successors.ts +3 -3
  33. package/src/typescript/actions.ts +494 -0
  34. package/src/typescript/collections.ts +615 -0
  35. package/src/typescript/compile.ts +70 -0
  36. package/src/typescript/context.ts +106 -0
  37. package/src/typescript/emit.ts +122 -0
  38. package/src/typescript/expressions.ts +508 -0
  39. package/src/typescript/formula.ts +160 -0
  40. package/src/typescript/functions.ts +295 -0
  41. package/src/typescript/model.ts +164 -0
  42. package/src/typescript/names.ts +116 -0
  43. package/src/typescript/program.ts +51 -0
  44. package/src/typescript/properties.ts +141 -0
  45. package/src/typescript/scope.ts +117 -0
  46. package/src/typescript/steps.ts +175 -0
  47. package/src/typescript/types.ts +178 -0
  48. package/src/values.ts +11 -9
package/dist/transfer.cjs CHANGED
@@ -83,11 +83,11 @@ _TEPosition ==
83
83
  THEN _TETraceLength
84
84
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
85
85
 
86
- =============================================================================`,Ne=/* @__PURE__ */ new Map([[`Reals`,Ae],[`RealTime`,je],[`Toolbox`,Me]]),Pe={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Fe=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Ie=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Le=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Re=e=>{let t=t=>{let n=h(e,t,Fe);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=h(e,t,Ie);if(e.startsWith(`..`,n)&&Ie(e[n+2]))return{kind:`Constant`,first:t,last:h(e,n+2,Ie)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Ie(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:h(e,t+1,Ie)-1,children:[]};if(Le(n))return{kind:`Constant`,first:t,last:h(e,t,Le)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},D=e=>{let t=e.length===0?void 0:Re(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Pe[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let ee=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),te=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return ee===void 0||te===void 0?void 0:`${ee}${s.divider}\n${o}${s.dividerPad}${te}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},ze=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,O=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Be=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),k=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),A=e=>typeof e==`object`&&e.kind===`ModelValue`,Ve=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),He=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:O(e)?`set`:`function`,Ue=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,We={isUsed:!1},Ge=(e,t)=>(We.isUsed=!0,e.writtenKeys=t,e),Ke=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[$n(e.domain,t)]]),qe=(e,t,n)=>Ge(kn(e,t),n),Je=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Je);e.writtenKeys=void 0,e.range.forEach(Je)}},Ye=e=>e.every(e=>typeof e==`string`),Xe=(e,t)=>e.length>0&&t.length>0&&Ye(e)!==Ye(t),Ze=(e,t)=>{We.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Xe(n,r)?Zt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=ht(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:ht(t,n);if(r!==0)return r}return 0},Qe=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=ht(n[e],r[e]);if(t!==0)return t}return 0},$e=e=>A(e)?e.type:void 0,et=(t,n,r)=>{let i=$e(t),a=$e(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(A(t)&&A(n)){if(i===void 0||a===void 0||i===a)return;throw new e._(`Attempted to ${o} the differently-typed model values ${I(t)} and ${I(n)}`)}throw i===void 0?new e._(`Attempted to ${o} the typed model value ${I(n)} and the non-model value\n${I(t)}`):new e._(`Attempted to ${o}${r?``:` the`} typed model value ${I(t)} and non-model value\n${I(n)}`)},tt={ranks:Object.create(null),size:0},nt=e=>{tt.ranks=Object.create(null),tt.size=0,gt.clear();for(let t of e)at(t)},rt={is174:!1},it=e=>{rt.is174=e===`1.7.4`},at=e=>(tt.ranks[e]===void 0&&(tt.ranks[e]=tt.size++),e),ot=()=>tt.size,st=e=>Object.keys(tt.ranks).find(t=>tt.ranks[t]===e),ct=e=>tt.ranks[at(e)],lt=(e,t)=>{if(e===t)return 0;let n=tt.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},ut=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),dt=(e,t)=>(ut(e)||ut(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),ft=(t,n,r)=>{if(!ut(t))throw new e._(`Attempted to ${r} the set ${I(M(t)?N(t):t,!0)} with the value:\n${I(n,!0)}`);if(!ut(n))throw new e._(`Attempted to compare overridden value ${I(t,!0)} with non-overridden value:\n${I(n,!0)}`);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e._(`Attempted to compare ${I(t,!0)} with the value\n${I(n,!0)}`)},pt={kind:`InfiniteSet`,name:`Any`},mt=t=>{throw new e._(`Attempted to compare ANY with the value\n${I(t)}`)},ht=(t,n)=>{if(t===n)return We.isUsed&&Je(t),t===pt?mt(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return Ze(t,n);if(r===`Set`&&i===`Set`)return Qe(t,n);if(r===`Interval`&&i===`Interval`){let e=Math.max(0,t.high-t.low+1),r=Math.max(0,n.high-n.low+1);return e!==r||e===0?e-r:t.low-n.low}if(r===`ModelValue`&&i===`ModelValue`)return t.type!==void 0&&n.type!==void 0&&et(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return et(t,n,!1),r===`ModelValue`?-1:1;if(t===pt||n===pt)return mt(t===pt?n:t);if(O(t)&&O(n)&&dt(t,n))return ft(t,n,`compare`);let a=O(t);if(a!==O(n))throw new e._(`Attempted to compare ${He(t)} ${I(t)} with ${He(n)} ${I(n)}`);return a?Qe(N(t),N(n)):Ze(F(t),F(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return lt(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(et(t,n,!1),A(t))return-1;if(A(n))return 1;throw new e._(`Attempted to compare ${He(t)} ${I(t)} with ${He(n)} ${I(n)}`)},gt=/* @__PURE__ */ new Map,_t=e=>{let t=gt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:ct(e),hash:yr(br(xr(e),109)),fingerprint:Ar(jr(e)^60)};return gt.set(e,n),n},vt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),yt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),bt={isPresent:!1},xt=(e,t)=>(t===`lambda`&&(bt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),St=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ct=e=>xt(e,`lambda`),wt=e=>ze(e)&&e.isCached===!0,Tt={isPresent:!1},Et=e=>(Tt.isPresent=!0,e),Dt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Ot=e=>{Tt.isPresent&&typeof e==`object`&&ze(e)&&Dt.has(e.kind)&&(e.isCached=!0)},kt=e=>{(bt.isPresent||Tt.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(kt),e.range.forEach(kt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(kt):O(e)&&M(e)&&(Ot(e),N(e).elements.forEach(kt))))},At=(e,t)=>{if(Ot(e),e===t)return We.isUsed&&Je(e),e!==pt||mt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&et(e,t,!0),ht(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return Ze(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Qe(e,t)===0;if(A(e)||A(t))return et(e,t,!0),A(e)&&A(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return At(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=P(e.domain),r=P(t.domain);if(n||r)return n===r;let i=P(e.range),a=P(t.range);return i||a?i===a:At(e.domain,t.domain)&&At(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(P(e))return P(t);if(P(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&At(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return P(e)?P(t):!P(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>At(e,t.factors[n]));let n=O(e)&&O(t)&&!(M(e)&&M(t));if(n&&dt(e,t))return ft(e,t,`check equality of`)===0;if(n){if(!ut(e)){let n=N(e);if(!ut(t))return Qe(n,N(t))===0}return Ir(e)===Ir(t)}return ht(e,t)===0},jt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):Ir(n)===Ir(r);return n},Mt=jt(!1),Nt=jt(!0),Pt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Ft=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=kr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Nt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Nt(i[e],n))return i[e]}return n.kind===`Set`?Pt(n.elements,t):(Pt(n.domain,t),Pt(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},It=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Lt=e=>{if(!k(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:It(t.domain)}},Rt=e=>{if(!k(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},zt=(e,t)=>(et(t,e,!1),1),Bt=(e,t)=>(et(t,e,!0),!1),Vt=(e,t)=>(e.type!==void 0&&et(e,t,!1),A(t)?e.rank-t.rank:-1),Ht=(e,t)=>(e.type!==void 0&&et(e,t,!0),A(t)&&e.name===t.name),Ut={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Wt=(e,t,n)=>{let r=Ut[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${I(e)} with ${r.other}:\n${I(t)}`},Gt=(t,n,r)=>{let i=Lt(r);if(!i){if(A(r))return zt(r,n);throw new e._(`Attempted to compare the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Kt(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Kt(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e._(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${I(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Kt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Zt(e[n],t[n]);if(r!==0)return r}return 0},qt=(t,n)=>{let r=F(t);if(t.kind===`Function`&&er(r)!==void 0){let e=k(n)?er(n):void 0;return e?r.range.length-e.length||Kt(r.range,e):Gt({...r,low:1},t,n)}if(St(t)===`record`){let i=Rt(n);if(!i){if(A(n))return zt(n,t);throw new e._(`Attempted to compare record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length-i.domain.length||Kt(r.domain,i.domain)||Kt(r.range,i.range)}return Gt({...r,low:It(r.domain)},t,n)},Jt=(e,t)=>ut(e)||ut(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Yt=(e,t)=>{let n=Ve(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},Xt=(t,n)=>{if(Jt(t,n))return ht(t,n);if(!Ve(t))return Xt(N(t),n);if(!O(n)){if(A(n))return zt(n,t);throw new e._(`Attempted to compare the set ${I(t)} with the value:\n${I(n)}`)}let r=Yt(t,n);return r.elements.length-r.otherElements.length||Kt(r.elements,r.otherElements)},Zt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return ht(t,n);if(A(n))return zt(n,t);throw new e._(Wt(t,n,!1))}return t.kind===`ModelValue`?Vt(t,n):k(t)?qt(t,n):Xt(t,n)},Qt=(e,t)=>e.every((e,n)=>nn(e,t[n])),$t=(t,n,r)=>{let i=Lt(r);if(!i){if(A(r))return Bt(r,n);throw new e._(`Attempted to check equality of the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&Qt(t.range,i.range);let a=t.low??i.low;return a===void 0?Qt(t.domain,i.domain)&&Qt(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e._(`Attempted to compare an integer with non-integer:\n${I(t)}.`);return t===a+n})&&Qt(t.range,i.range)},en=(t,n)=>{let r=F(t);if(t.kind===`Function`&&er(r)!==void 0){let e=k(n)?er(n):void 0;return e?r.range.length===e.length&&Qt(r.range,e):$t({...r,low:1},t,n)}if(St(t)===`record`){let i=Rt(n);if(!i){if(A(n))return Bt(n,t);throw new e._(`Attempted to check equality of record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length===i.domain.length&&Qt(r.domain,i.domain)&&Qt(r.range,i.range)}return $t({...r,low:It(r.domain)},t,n)},tn=(t,n)=>{if(Jt(t,n))return At(t,n);if(!Ve(t))return tn(N(t),n);if(!O(n)){if(A(n))return Bt(n,t);throw new e._(`Attempted to check equality of the set ${I(t)} with the value:\n${I(n)}`)}let r=Yt(t,n);return r.elements.length===r.otherElements.length&&Qt(r.elements,r.otherElements)},nn=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(A(n))return Bt(n,t);throw new e._(Wt(t,n,!0))}return t.kind===`ModelValue`?Ht(t,n):k(t)?en(t,n):tn(t,n)},rn=e=>{let t=[];for(let n of e){let e=on(n,t);e.isFound||t.splice(e.index,0,n)}return t},an=(e,t)=>{let n=nr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},on=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=an(e,()=>Zt(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},sn=(e,t)=>t.some(t=>an(t,()=>nn(t,e))),cn=/* @__PURE__ */ new WeakSet,ln=e=>{typeof e==`object`&&(e.kind===`Set`&&(cn.add(e),e.elements.forEach(ln)),e.kind===`Function`&&(e.domain.forEach(ln),e.range.forEach(ln)))},un=(e,t)=>rr(At,nn,e,t),dn=e=>{for(let t=1;t<e.length;t++)if(ht(e[t-1],e[t])>=0)return!1;return!0},fn=e=>{for(let t=1;t<e.length;t++)Ot(e[t]);if(e.length<2||dn(e))return vt(e);let t=[...e].sort(ht),n=[t[0]];for(let e=1;e<t.length;e++)ht(n[n.length-1],t[e])!==0&&n.push(t[e]);return vt(n)},pn=e=>rr(fn,e=>({kind:`MixedSet`,elements:e}),e,void 0),mn=vt([]),hn=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&ht(r[a],t)<0;)a++;a<r.length&&ht(r[a],t)===0||i.push(t)}return i.length===n.length?e:vt(i)},gn=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&ht(r[a],t)<0;)a++;a<r.length&&ht(r[a],t)===0&&i.push(t)}return i.length===n.length?e:vt(i)},_n=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=ht(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=vt(i);if(e.hash!==0&&e.hash!==wr){let t=e.hash,n=0;for(;n<a.length;n++){let e=kr(a[n]);if(e===wr)break;t=t+Sr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Mr(a[e])|0;c.fingerprint=t}return c},vn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>ht(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&ht(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return yt(n,r)},yn=e=>{let t=vn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Ge(t,e.map(e=>e[0]))},bn=[],xn=[],Sn=/* @__PURE__ */ new WeakMap,Cn=e=>{let t=bn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return bn[e]=n,n},wn=e=>{if(Xn(e),e.low===1&&e.high>=1)return Cn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Tn=e=>e.length>0&&(e===bn[e.length]||Sn.has(e)),En=e=>{let t=N(e).elements;return Tn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Dn=e=>{let t=xn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return xn[e]=n,n},j=e=>xt(yt(Cn(e.length),e),`tuple`),On=e=>xt(vn(e),`record`),kn=(e,t)=>xt(yt(e,t),`record`),An=e=>O(e)&&!ut(e),jn=(e,t=!1)=>`UNION(${I(e.base,t)})`,Mn=(t,n=e=>N(e).elements)=>{if(!An(t.base))throw new e._(`Attempted to enumerate the nonenumerable set:\n${jn(t)}`);return n(t.base)},Nn=(t,n,r)=>{if(An(t))return t;throw new e._(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${I(t)}\nwhen enumerating:\n${jn(r)}`)},M=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return M(e.base);case`FunctionSet`:return M(e.domain)&&M(e.range)||Pn(e.domain)===!0||Pn(e)===!0;case`RecordSet`:return e.sets.every(M)||Pn(e)===!0;case`ProductSet`:return e.factors.every(M)||Pn(e)===!0;case`Union`:return M(e.base)&&Un(e.base).every(M);case`SetOperation`:return e.operator===`\\cup`?M(e.left)&&M(e.right):e.operator===`\\cap`?M(e.left)||M(e.right):M(e.left);default:return!1}},Pn=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Pn(e.domain);return t===void 0?void 0:!t&&Pn(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Pn(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return M(e)?N(e).elements.length===0:void 0;default:return}},Fn=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},In=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Ln=e=>{if(typeof e!=`object`||e.kind!==`Subset`||ut(e.base))return;let t=N(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:In(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return vt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},Rn=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(vt(r.map(t=>e[t])));while(In(r,e.length))}return t},zn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(ut(o))throw new e._(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Bn=(t,n=e=>N(e).elements)=>{if(typeof t!=`object`)throw new e._(`Expected a set but found ${I(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return rn(t.elements);case`Interval`:{let e=wn(t);return e!==bn[e.length]&&Sn.set(e,t),e}case`Subset`:{if(Xn(t.base)===0)return Rn([]);if(!O(t.base))throw new e._(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${D(I(t.base))}`);let n=N(t.base).elements;if(n.length>30)throw new e._(Yn(t));return Rn(n)}case`FunctionSet`:{if(!rt.is174&&P(t))return[];if(ut(t.domain))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(t.domain)}\ncannot be enumerated.`);let r=En(t.domain);if((r.length>0||rt.is174)&&ut(t.range))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${I(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Fn(r.map(()=>i)).map(e=>yt(r,e))}case`RecordSet`:{if(!rt.is174&&P(t))return[];let e=zn(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${I(e)}`);return Fn(e).map(e=>On(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!rt.is174&&P(t))return[];let e=zn(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${I(e)}`);return Fn(e).map(j)}case`FilteredSet`:if(!O(t.base)||ut(t.base))throw new e._(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(t.base)}\nis not enumerable`);return N(t.base).elements.filter(t.test);case`Union`:{let e=Mn(t).flatMap((e,n)=>N(Nn(e,n,t)).elements);return N(pn(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!An(t.left)||!An(t.right)))throw new e._(`Attempted to enumerate S \\cup T when S:\n${I(t.left)}\nand T:\n${I(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!An(t.left)&&!An(t.right))throw new e._(`Attempted to enumerate S \\cap T when neither S:\n${I(t.left)}\nnor T:\n${I(t.right)}\nis enumerable`);if(t.operator===`\\`&&!An(t.left))throw new e._(`Attempted to enumerate S \\ T when S:\n${I(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return rr(e=>_n(N(e.left),N(e.right)).elements,e=>rn(Vn(e)),t,t);let n=t.operator===`\\`||An(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return N(r).elements.filter(e=>ir(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to enumerate the non-enumerable set ${I(t)}`);default:throw new e._(`Expected a set but found ${I(t)}`)}},N=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return vt(Bn(e));let t=typeof e==`object`&&ze(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=nr.sets;n?.push(e);let r=Bn(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?vt(r):fn(r);return t&&(t.enumerated=i),i},Vn=e=>[...N(e.left).elements,...N(e.right).elements],Hn=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?rr(e=>N(e).elements,e=>rn(an(e,()=>Vn(e))),e,e):N(e).elements,Un=e=>{if(typeof e!=`object`||wt(e))return N(e).elements;let t=nr.sets;t?.push(e);let n=qn(e);return t?.pop(),n},Wn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Gn=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Gn);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Gn)&&e.range.every(Gn);case`SetOperation`:return e.operator!==`\\cup`&&Gn(e.left)&&Gn(e.right);case`FilteredSet`:return Gn(e.base);case`ProductSet`:return e.factors.every(Gn);default:return!1}},Kn=e=>typeof e!=`object`||wt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Kn(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Kn(e.left)||Kn(e.right):Wn(e)?.some(Kn)??!1,qn=e=>{if(e.kind===`Union`)return Mn(e,Un).flatMap((t,n)=>Un(Nn(t,n,e)));if(e.kind===`FilteredSet`&&!ut(e.base))return Un(e.base).filter(e.test);if(Wn(e)?.some(Kn))return Bn(e,Un);if(e.kind!==`SetOperation`)return N(e).elements;if(e.operator===`\\cup`)return!An(e.left)||!An(e.right)?N(e).elements:[...Un(e.left),...Un(e.right)];let t=e.operator===`\\`||An(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return An(n)?Un(n).filter(t=>ir(t,r)===(e.operator===`\\cap`)):N(e).elements},P=t=>{if(typeof t!=`object`||!O(t))throw new e._(`Shouldn't call isEmpty() on value ${I(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e._(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(P);case`RecordSet`:return t.sets.some(P);case`FunctionSet`:return!P(t.domain)&&P(t.range);case`Union`:return Mn(t).every((e,n)=>P(Nn(e,n,t)));default:return N(t).elements.length===0}},Jn=(t,n,r)=>t.reduce((t,i)=>{let a=t*Xn(i,n);if(a>2147483647)throw new e._(r());return a},1),Yn=e=>`Overflow when computing the number of elements in:\n${I(e)}`,Xn=(t,n)=>{if(typeof t!=`object`)throw new e._(`Attempted to compute the number of elements in the ${He(t)} ${I(t)}.`);switch(t.kind){case`ModelValue`:throw new e._(`Attempted to compute the number of elements in the model value ${I(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Xn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e._(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to compute the number of elements in the overridden value ${I(t)}.`);case`Subset`:{let r=Xn(t.base,n);if(r>=31)throw new e._(Yn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(P(t.domain))return 1;if(P(t.range))return 0;if(Xn(t.range,n)===1)return 1}let r=Xn(t.domain,n),i=Xn(t.range,n);if(i<=1)return r===0?1:i;let a={value:1};for(let n=0;n<r;n++)if(a.value*=i,a.value>2147483647)throw new e._(Yn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&P(t)?0:Jn(t.sets,n,()=>Yn(t));case`ProductSet`:return n!==`1.7.4`&&P(t)?0:Jn(t.factors,n,()=>`Overflow when computing the number of elements in ${I(t)}`);default:return Ot(t),N(t).elements.length}},Zn=e=>`Attempted to check if the set ${I(e)}is finite.`,Qn=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e._(`Attempted to check if the ${He(t)} ${I(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e._(`Attempted to check if the function:\n${I(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Qn(t.base)&&P(t.base);case`Subset`:return Qn(t.base);case`FunctionSet`:{let e=Qn(t.domain);if(e&&P(t.domain))return!0;let n=Qn(t.range);return n&&P(t.range)?!0:n&&(e||Xn(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n={isAllFinite:!0};for(let t of e)if(!Qn(t))n.isAllFinite=!1;else if(P(t))return!0;return n.isAllFinite}case`Union`:if(!An(t.base))throw new e._(`Attempted to check if the nonenumerable set:\n${jn(t)}\nis a finite set.`);return N(t.base).elements.every(Qn);case`SetOperation`:if(t.operator===`\\cup`)return Qn(t.left)&&Qn(t.right);if(t.operator===`\\cap`){if(!Qn(t.left)&&!Qn(t.right))throw new e._(Zn(t));return!0}if(Qn(t.left))return!0;if(!Qn(t.right))throw new e._(Zn(t));return!1;case`FilteredSet`:if(!Qn(t.base))throw new e._(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(t.base)}\nis finite.`);return!0}},$n=(e,t,n=ht)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},er=e=>{if(typeof e!=`object`||!k(e))return;let t=F(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},tr=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!k(t))return`${n} ${He(t)} ${I(t)}`;let r=St(t);return r===`record`?`Attempted to check if element:\n${I(e)}\nis in the record:\n${I(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${I(t)}`},nr={sets:void 0},rr=(t,n,r,i)=>{let a=nr.sets,o=nr.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e._))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},ir=(e,t)=>{let n=nr.sets;if(n===void 0)return sr(e,t);n.push(t);let r=sr(e,t);return n.pop(),r},ar=(e,t)=>$n(t.elements,e)!==-1,or=(e,t)=>cn.has(t)?on(e,t.elements).isFound:sn(e,t.elements),sr=(t,n)=>{if(!O(n))throw new e._(tr(t,n));switch(n.kind){case`Set`:return Ot(t),rr(ar,or,t,n);case`MixedSet`:return sn(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&!A(t))throw new e._(`Attempted to check if the value:\n${I(t)}\nis in the integer interval ${I(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(A(t))return!1;if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e._(`Attempted to check if the value:\n${I(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!O(t)||ut(t))throw new e._(`Attempted to check if the non-enumerable value\n${D(I(t))}\nis element of\n${D(I(n))}`);return N(t).elements.every(e=>ir(e,n.base));case`FunctionSet`:{if(!k(t)){if(A(t))return!1;throw new e._(`Attempted to check if \n${I(t)}\nwhich is not a TLC function value, is in the set of functions:\n${D(I(n))}`)}let r=F(t),i=It(r.domain);return(i===void 0?un(n.domain,vt(r.domain)):un({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>ir(e,n.range))}case`RecordSet`:{let r=k(t)?F(t):void 0;if(!r||!Ye(r.domain)){if(A(t))return!1;throw new e._(`Attempted to check if non-record\n${I(t)}\nis in the set of records:\n${I(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=$n(r.domain,e);return i!==-1&&ir(r.range[i],n.sets[t])})}case`ProductSet`:{let r=k(t)?er(t):void 0;if(r===void 0){if(k(t)&&F(t).domain.every(e=>typeof e==`number`)||A(t))return!1;throw new e._(`Attempted to check if non-tuple\n${I(t)}\nis in the set of tuples:\n${I(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>ir(e,n.factors[t]))}case`FilteredSet`:return ir(t,n.base)&&n.test(t);case`Union`:if(!An(n.base))throw new e._(`Attempted to check if:\n ${I(t)}\nis an element of the non-enumerable set:\n ${jn(n)}`);return N(n.base).elements.some(e=>ir(t,e));case`SetOperation`:return n.operator===`\\cup`?ir(t,n.left)||ir(t,n.right):ir(t,n.left)&&ir(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=er(t);if(r===void 0){if(A(t))return!1;throw new e._(`Attempted to check if the value:\n${D(I(t))}\nis an element of ${D(I(n))}.`)}return r.every(e=>ir(e,n.base))}default:throw new e._(tr(t,n))}},cr=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?ir(e,n):e.range.every((e,r)=>cr(e,t.range[r],n.range)),F=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;M(t.domain)||Xn(t.domain);let e=En(t.domain);return t.enumerated=xt(yt(e,e.map(e=>t.apply(e))),St(t)),t.enumerated}throw new e._(`Expected a function but found ${I(t)}`)},lr=(e,t,n)=>{let r=D(I(e)),i=D(I(t)),a=n===`1.7.4`;switch(St(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},ur=(e,t)=>{if(!rt.is174)return lr(e,t);let n=D(I(t));return St(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},dr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},fr=t=>new e._(`Attempted to apply function with integer domain to the non-integer argument ${D(I(t))}`),pr=(e,t,n)=>{throw rt.is174||e.length<32?e.forEach(e=>nn(e,t)):$n(e,t,Zt),n},mr=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=St(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e._(r(t,n));if(o===void 0&&!rt.is174&&Tn(i))throw fr(n)}let a=dr(i,n);return a===-1?rr($n,pr,i,n):a},hr=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!ir(n,t.domain))throw new e._(St(t)===`lambda`?lr(t,n):`Attempted to apply a function to ${I(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e._(`Attempted to apply ${I(t)}, which is not a function`);let i=r??lr,a=mr(t,n,i);if(a===-1)throw new e._(i(t,n));return t.range[a]},gr=e=>Tn(e)?Sn.get(e)??Dn(e.length):void 0,_r=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e).domain;return gr(t)??vt(t)},vr=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!M(t.domain))){if(!ir(n,t.domain))return t;let e=r(t.apply(n));return xt({kind:`LazyFunction`,domain:t.domain,apply:r=>un(n,r)?e:t.apply(r),source:t.source},St(t))}if(!k(t))throw new e._(`Attempted to apply EXCEPT construct to the value ${D(I(t))}.`);let a=F(t),o=mr(a,n,ur);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=xt(yt(a.domain,s),St(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==wr){let e=kr(l);if(e!==wr){let t=kr(a.domain[o]);u.hash=c===l?a.hash:a.hash-Cr(t,kr(c))+Cr(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Nr(e,c)+Nr(e,l)|0}return u},yr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},br=(e,t)=>Math.imul(e^t,16777619),xr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return yr(t)},Sr=e=>yr(e+2654435769|0),Cr=(e,t)=>yr(Math.imul(e,668265261)+t|0),wr=795548749,Tr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=kr(t[e]);if(r===wr)return wr;n=n+Sr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=kr(e.domain[n]),i=kr(e.range[n]);if(r===wr||i===wr)return wr;t=t+Cr(r,i)|0}return t},Er=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e._(`TLC has found a state in which the value of a variable contains ${I(t)}`);if(O(t)){N(t).elements.forEach(Er);return}let n=F(t);n.domain.forEach(Er),n.range.forEach(Er)},Dr=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{kr(t)===wr&&Er(t);return}catch(t){if(!(t instanceof e._))throw t;return t}},Or=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},kr=e=>typeof e==`number`?yr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?xr(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Tr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?M(e.domain)?kr(F(e)):wr:M(e)?kr(N(e)):wr,Ar=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},jr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ar(t)},Mr=e=>Ar(Fr(e)+2135587861|0),Nr=(e,t)=>Ar(Math.imul(Fr(e),374761393)+Fr(t)|0),Pr=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Mr(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Nr(e.domain[n],e.range[n])|0;return t},Fr=e=>typeof e==`number`?Ar(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?jr(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Pr(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Fr(F(e)):M(e)?Fr(N(e)):jr(Ir(e)),Ir=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Lr(e),Lr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Ir(t.base)}>`;if(t.kind===`FilteredSet`&&!M(t))throw new e._(`Attempted to compare the non-enumerable set ${I(t)} with another value`);if(O(t))return M(t)?`{${N(t).elements.map(Ir).join(`,`)}}`:`<${t.kind} ${I(t)}>`;let n=F(t);return`(${n.domain.map((e,t)=>`${Ir(e)}:${Ir(n.range[t])}`).join(`,`)})`},Rr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,zr=e=>e.reduce((e,t)=>e===0?0:e*Xn(t),1),Br=e=>{if(e.kind===`Subset`)return Xn(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`&&M(e.domain)&&Xn(e.domain)===0)return vt([yt([],[])]);let t=e.kind===`FunctionSet`?Xn(e.range)**Xn(e.domain):zr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?mn:t<=1999?N(e):void 0},Vr=(t,n)=>{if(n)return Br(t);if(M(t))try{return Br(t)}catch(t){if(t instanceof e._)return;throw t}},Hr=(e,t)=>{let n=e=>I(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return jn(e,t)}},Ur=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Wr=t=>{if(M(t.domain))try{return F(t)}catch(t){if(t instanceof e._)return;throw t}},I=(e,t=!1,n=!1)=>{let r=e=>I(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Rr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(N(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Vr(e,t);return n?r(n):Hr(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Wr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${I(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&rt.is174&&St(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&St(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:St(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ur(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Ke(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Gr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${D(I(n))}\n`).join(``)},Kr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),qr=(t,n)=>Kr.has(t)?new e._(n):new e.C(n),Jr=(t,n,r,i)=>new e.C(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${I(i)}`),Yr=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||Yr(r))throw qr(n,`${n} expects a value as argument ${t+1}`);return r},Xr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`number`)throw qr(n,`${n} expects an integer but received ${I(r)}`);return r},Zr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw qr(n,`${n} expects a boolean but received ${I(r)}`);return r},Qr=(e,t,n)=>{let r=L(e,t,n);if(!O(r))throw qr(n,`${n} expects a set but received ${I(r)}`);return r},$r=(e,t,n)=>{let r=Qr(e,t,n);if(!M(r))throw qr(n,`${n} cannot enumerate the non-enumerable set ${I(r)}`);return r},ei=(e,t,n)=>N($r(e,t,n)).elements,ti=(e,t,n)=>{let r=L(e,t,n),i=er(r);if(!i)throw qr(n,`${n} expects a sequence but received ${I(r)}`);return i},ni=(e,t,n)=>{let r=L(e,t,n);if(!k(r))throw qr(n,`${n} expects a function but received ${I(r)}`);return F(r)},ri=(e,t,n)=>{let r=e[t];if(r===void 0||!Yr(r))throw qr(n,`${n} expects an operator as argument ${t+1}`);return r},ii=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),R=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ai=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),si=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ci=e=>e>2147483647||e<-2147483648,li=t=>new e.C(`Overflow when computing ${t}`),ui={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},di={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},fi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},pi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},mi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return di[e.operator];if(e.kind!==`Function`)return ui[e.kind];let t=St(e);return t===void 0?`FcnRcdValue`:pi[t]},hi=e=>fi[mi(e)],gi=(t,n)=>new e._(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),_i=(t,n)=>{let r=r=>(...i)=>{let a=nr.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e._&&(t.isLazy===!0||!(r instanceof e.C))?(nr.sets&&(nr.sets.length=a),gi(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},vi=(e,t)=>{if(typeof e!=`number`)throw gi(t,`Cannot cast tlc2.value.impl.${mi(e)} to tlc2.value.impl.IntValue`);return e},yi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,bi=(e,t,n,r)=>{let i=yi(e,n,`IntValue`,2);return si(t,(e,n)=>{let a=vi(e,i),o=vi(n,i),s=r(a,o);if(ci(s))throw li(`${a}${t}${o}`);return s})},xi=(t,n,r)=>{if(typeof t!=`number`)throw new e.C(`The ${n} argument of ${r} should be an integer, but instead it is:\n${I(t)}`);return t},Si=(e,t,n=e)=>si(e,(e,r)=>t(xi(e,`first`,n),xi(r,`second`,n))),Ci=(e,t,n)=>({...oi(e,t,n),isLazy:!0}),wi=(e,t,n)=>{let r=ri(e,t,n);return()=>r.call([])},Ti=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ei=()=>({bool:fu,condition:(e,t)=>{if(typeof e!=`boolean`)throw Yl(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Xl(t,n,e);return e},apply:hr,expectFunction:lu,tuple:j,set:pn,record:kn,writtenRecord:qe,equal:At,enumerate:yu,unassigned:(e,t)=>{throw ru(e,t)},primeOutsideAction:e=>{throw au(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:uu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>su(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Di={value:void 0},Oi={isAllowed:void 0},ki=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Ai=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ji=e=>`local${e.counter++}`,Mi=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),ke(e).forEach(e=>Mi(e,t)),t),Ni=(e,t,n)=>{let r=Ai(e,V(t,e.environment)),i=Mi(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Ai(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Pi=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>ji(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Ri(e,t.set,s)}, ${Ai(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=ji(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Ri(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=ji(e),a=ji(e),o=ji(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Fi=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Ri(e,r[0],n)}, "the left side of =>") ? bool(${Ri(e,r[1],n)}, "the right side of =>") : true)`;if(E(t))return Ni(e,t,n);let i=Uu(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ni(e,t,n);if(i.name===`DOMAIN`)return`${Ai(e,$l(t))}(${Ri(e,r[0],n)})`;if(i.name===`TLCEval`)return Ni(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Ai(e,eu(t,i))}(${Ri(e,r[0],n)}, ${Ri(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&gd(r[0],a))return`${Ai(e,i.evaluateUnary)}(${Ri(e,r[0],n)})`;let o=r.length===2&&gd(r[0],a)&&gd(r[1],a);return i.evaluateBinary&&o?`${Ai(e,i.evaluateBinary)}(${Ri(e,r[0],n)}, ${Ri(e,r[1],n)})`:Ni(e,t,n)},Ii=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(E(e))return!1;let r=ed(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Ii(e.expression,t,n);case`FieldAccess`:return Ii(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Ii(e,t,n));default:return!1}},Li=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Li(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Li);default:return!1}},Ri=(e,t,n)=>{let r=(t,r=n)=>Ri(e,t,r);switch(t.kind){case`Number`:return Ue(t.value)?String(t.value):Ni(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(E(t))return Ni(e,t,n);let i=ed(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Ai(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Ai(e,i.value):Ni(e,t,n)}case`Apply`:return Fi(e,t,n);case`And`:case`Or`:{let n=Ai(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Ai(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Td(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Ii(t.function,n,e.environment)?r(t.function):Li(t.function)?r(t.function,i):Ni(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Ai(e,t)}))`,o=Ql(e.environment.runtime.version),s=o?`, ${Ai(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Ai(e,Zl(t))}(${r(t.record)})`;case`Record`:{let i=kd(t.fields);if(Ad(i))return Ni(e,t,n);let a=Ai(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Ai(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Ai(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Pi(e,t,n):Ni(e,t,n);default:return Ni(e,t,n)}},zi=(e,t)=>{if(!Ti.has(e.kind)||(Oi.isAllowed??=ki(),!Oi.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ri(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
87
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Di.value??=Ei();let o=Di.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Bi={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},Vi={none:0,error:1,warning:3,state:4},Hi={0:``,1:`Error: `,3:`Warning: `,4:`State `},Ui=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===Vi.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
88
- (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${Hi[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},Wi=`The configuration file did not specify the initial state predicate.
86
+ =============================================================================`,Ne=/* @__PURE__ */ new Map([[`Reals`,Ae],[`RealTime`,je],[`Toolbox`,Me]]),Pe={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Fe=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Ie=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Le=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Re=e=>{let t=t=>{let n=h(e,t,Fe);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=h(e,t,Ie);if(e.startsWith(`..`,n)&&Ie(e[n+2]))return{kind:`Constant`,first:t,last:h(e,n+2,Ie)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Ie(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:h(e,t+1,Ie)-1,children:[]};if(Le(n))return{kind:`Constant`,first:t,last:h(e,t,Le)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},D=e=>{let t=e.length===0?void 0:Re(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Pe[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let ee=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),te=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return ee===void 0||te===void 0?void 0:`${ee}${s.divider}\n${o}${s.dividerPad}${te}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},ze=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,O=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Be=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),k=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),A=e=>typeof e==`object`&&e.kind===`ModelValue`,Ve=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),He=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:O(e)?`set`:`function`,Ue=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,We={isUsed:!1},Ge=(e,t)=>(We.isUsed=!0,e.writtenKeys=t,e),Ke=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[er(e.domain,t)]]),qe=(e,t,n)=>Ge(An(e,t),n),Je=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Je);e.writtenKeys=void 0,e.range.forEach(Je)}},Ye=e=>e.every(e=>typeof e==`string`),Xe=(e,t)=>e.length>0&&t.length>0&&Ye(e)!==Ye(t),Ze=(e,t)=>{We.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Xe(n,r)?Zt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=ht(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:ht(t,n);if(r!==0)return r}return 0},Qe=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=ht(n[e],r[e]);if(t!==0)return t}return 0},$e=e=>A(e)?e.type:void 0,et=(t,n,r)=>{let i=$e(t),a=$e(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(A(t)&&A(n)){if(i===void 0||a===void 0||i===a)return;throw new e._(`Attempted to ${o} the differently-typed model values ${I(t)} and ${I(n)}`)}throw i===void 0?new e._(`Attempted to ${o} the typed model value ${I(n)} and the non-model value\n${I(t)}`):new e._(`Attempted to ${o}${r?``:` the`} typed model value ${I(t)} and non-model value\n${I(n)}`)},tt={ranks:Object.create(null),size:0},nt=e=>{tt.ranks=Object.create(null),tt.size=0,gt.clear();for(let t of e)at(t)},rt={is174:!1},it=e=>{rt.is174=e===`1.7.4`},at=e=>(tt.ranks[e]===void 0&&(tt.ranks[e]=tt.size++),e),ot=()=>tt.size,st=e=>Object.keys(tt.ranks).find(t=>tt.ranks[t]===e),ct=e=>tt.ranks[at(e)],lt=(e,t)=>{if(e===t)return 0;let n=tt.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},ut=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),dt=(e,t)=>(ut(e)||ut(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),ft=(t,n,r)=>{if(!ut(t))throw new e._(`Attempted to ${r} the set ${I(M(t)?N(t):t,!0)} with the value:\n${I(n,!0)}`);if(!ut(n))throw new e._(`Attempted to compare overridden value ${I(t,!0)} with non-overridden value:\n${I(n,!0)}`);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e._(`Attempted to compare ${I(t,!0)} with the value\n${I(n,!0)}`)},pt={kind:`InfiniteSet`,name:`Any`},mt=t=>{throw new e._(`Attempted to compare ANY with the value\n${I(t)}`)},ht=(t,n)=>{if(t===n)return We.isUsed&&Je(t),t===pt?mt(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return Ze(t,n);if(r===`Set`&&i===`Set`)return Qe(t,n);if(r===`Interval`&&i===`Interval`){let e=Math.max(0,t.high-t.low+1),r=Math.max(0,n.high-n.low+1);return e!==r||e===0?e-r:t.low-n.low}if(r===`ModelValue`&&i===`ModelValue`)return t.type!==void 0&&n.type!==void 0&&et(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return et(t,n,!1),r===`ModelValue`?-1:1;if(t===pt||n===pt)return mt(t===pt?n:t);if(O(t)&&O(n)&&dt(t,n))return ft(t,n,`compare`);let a=O(t);if(a!==O(n))throw new e._(`Attempted to compare ${He(t)} ${I(t)} with ${He(n)} ${I(n)}`);return a?Qe(N(t),N(n)):Ze(F(t),F(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return lt(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(et(t,n,!1),A(t))return-1;if(A(n))return 1;throw new e._(`Attempted to compare ${He(t)} ${I(t)} with ${He(n)} ${I(n)}`)},gt=/* @__PURE__ */ new Map,_t=e=>{let t=gt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:ct(e),hash:br(xr(Sr(e),109)),fingerprint:jr(Mr(e)^60)};return gt.set(e,n),n},vt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),yt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),bt={isPresent:!1},xt=(e,t)=>(t===`lambda`&&(bt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),St=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ct=e=>xt(e,`lambda`),wt=e=>ze(e)&&e.isCached===!0,Tt={isPresent:!1},Et=e=>(Tt.isPresent=!0,e),Dt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Ot=e=>{Tt.isPresent&&typeof e==`object`&&ze(e)&&Dt.has(e.kind)&&(e.isCached=!0)},kt=e=>{(bt.isPresent||Tt.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(kt),e.range.forEach(kt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(kt):O(e)&&M(e)&&(Ot(e),N(e).elements.forEach(kt))))},At=(e,t)=>{if(Ot(e),e===t)return We.isUsed&&Je(e),e!==pt||mt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&et(e,t,!0),ht(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Ze(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Qe(e,t)===0;if(A(e)||A(t))return et(e,t,!0),A(e)&&A(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return At(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=P(e.domain),r=P(t.domain);if(n||r)return n===r;let i=P(e.range),a=P(t.range);return i||a?i===a:At(e.domain,t.domain)&&At(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(P(e))return P(t);if(P(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&At(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return P(e)?P(t):!P(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>At(e,t.factors[n]));let n=O(e)&&O(t)&&!(M(e)&&M(t));if(n&&dt(e,t))return ft(e,t,`check equality of`)===0;if(n){if(!ut(e)){let n=N(e);if(!ut(t))return Qe(n,N(t))===0}return Lr(e)===Lr(t)}return ht(e,t)===0},jt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):Lr(n)===Lr(r);return n},Mt=jt(!1),Nt=jt(!0),Pt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Ft=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Ar(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Nt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Nt(i[e],n))return i[e]}return n.kind===`Set`?Pt(n.elements,t):(Pt(n.domain,t),Pt(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},It=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Lt=e=>{if(!k(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:It(t.domain)}},Rt=e=>{if(!k(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},zt=(e,t)=>(et(t,e,!1),1),Bt=(e,t)=>(et(t,e,!0),!1),Vt=(e,t)=>(e.type!==void 0&&et(e,t,!1),A(t)?e.rank-t.rank:-1),Ht=(e,t)=>(e.type!==void 0&&et(e,t,!0),A(t)&&e.name===t.name),Ut={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Wt=(e,t,n)=>{let r=Ut[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${I(e)} with ${r.other}:\n${I(t)}`},Gt=(t,n,r)=>{let i=Lt(r);if(!i){if(A(r))return zt(r,n);throw new e._(`Attempted to compare the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Kt(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Kt(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e._(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${I(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Kt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Zt(e[n],t[n]);if(r!==0)return r}return 0},qt=(t,n)=>{let r=F(t);if(t.kind===`Function`&&tr(r)!==void 0){let e=k(n)?tr(n):void 0;return e?r.range.length-e.length||Kt(r.range,e):Gt({...r,low:1},t,n)}if(St(t)===`record`){let i=Rt(n);if(!i){if(A(n))return zt(n,t);throw new e._(`Attempted to compare record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length-i.domain.length||Kt(r.domain,i.domain)||Kt(r.range,i.range)}return Gt({...r,low:It(r.domain)},t,n)},Jt=(e,t)=>ut(e)||ut(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Yt=(e,t)=>{let n=Ve(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},Xt=(t,n)=>{if(Jt(t,n))return ht(t,n);if(!Ve(t))return Xt(N(t),n);if(!O(n)){if(A(n))return zt(n,t);throw new e._(`Attempted to compare the set ${I(t)} with the value:\n${I(n)}`)}let r=Yt(t,n);return r.elements.length-r.otherElements.length||Kt(r.elements,r.otherElements)},Zt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return ht(t,n);if(A(n))return zt(n,t);throw new e._(Wt(t,n,!1))}return t.kind===`ModelValue`?Vt(t,n):k(t)?qt(t,n):Xt(t,n)},Qt=(e,t)=>e.every((e,n)=>nn(e,t[n])),$t=(t,n,r)=>{let i=Lt(r);if(!i){if(A(r))return Bt(r,n);throw new e._(`Attempted to check equality of the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&Qt(t.range,i.range);let a=t.low??i.low;return a===void 0?Qt(t.domain,i.domain)&&Qt(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e._(`Attempted to compare an integer with non-integer:\n${I(t)}.`);return t===a+n})&&Qt(t.range,i.range)},en=(t,n)=>{let r=F(t);if(t.kind===`Function`&&tr(r)!==void 0){let e=k(n)?tr(n):void 0;return e?r.range.length===e.length&&Qt(r.range,e):$t({...r,low:1},t,n)}if(St(t)===`record`){let i=Rt(n);if(!i){if(A(n))return Bt(n,t);throw new e._(`Attempted to check equality of record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length===i.domain.length&&Qt(r.domain,i.domain)&&Qt(r.range,i.range)}return $t({...r,low:It(r.domain)},t,n)},tn=(t,n)=>{if(Jt(t,n))return At(t,n);if(!Ve(t))return tn(N(t),n);if(!O(n)){if(A(n))return Bt(n,t);throw new e._(`Attempted to check equality of the set ${I(t)} with the value:\n${I(n)}`)}let r=Yt(t,n);return r.elements.length===r.otherElements.length&&Qt(r.elements,r.otherElements)},nn=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(A(n))return Bt(n,t);throw new e._(Wt(t,n,!0))}return t.kind===`ModelValue`?Ht(t,n):k(t)?en(t,n):tn(t,n)},rn=e=>{let t=[];for(let n of e){let e=on(n,t);e.isFound||t.splice(e.index,0,n)}return t},an=(e,t)=>{let n=rr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},on=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=an(e,()=>Zt(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},sn=(e,t)=>t.some(t=>an(t,()=>nn(t,e))),cn=/* @__PURE__ */ new WeakSet,ln=e=>{typeof e==`object`&&(e.kind===`Set`&&(cn.add(e),e.elements.forEach(ln)),e.kind===`Function`&&(e.domain.forEach(ln),e.range.forEach(ln)))},un=(e,t)=>ir(At,nn,e,t),dn=e=>{for(let t=1;t<e.length;t++)if(ht(e[t-1],e[t])>=0)return!1;return!0},fn=e=>{for(let t=1;t<e.length;t++)Ot(e[t]);if(e.length<2||dn(e))return vt(e);let t=[...e].sort(ht),n=[t[0]];for(let e=1;e<t.length;e++)ht(n[n.length-1],t[e])!==0&&n.push(t[e]);return vt(n)},pn=e=>ir(fn,e=>({kind:`MixedSet`,elements:e}),e,void 0),mn=vt([]),hn=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&ht(r[a],t)<0;)a++;a<r.length&&ht(r[a],t)===0||i.push(t)}return i.length===n.length?e:vt(i)},gn=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&ht(r[a],t)<0;)a++;a<r.length&&ht(r[a],t)===0&&i.push(t)}return i.length===n.length?e:vt(i)},_n=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=ht(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=vt(i);if(e.hash!==0&&e.hash!==Tr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Ar(a[n]);if(e===Tr)break;t=t+Cr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Nr(a[e])|0;c.fingerprint=t}return c},vn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>ht(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&ht(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return yt(n,r)},yn=e=>{let t=vn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Ge(t,e.map(e=>e[0]))},bn=[],xn=/* @__PURE__ */ new Map,Sn=[],Cn=/* @__PURE__ */ new WeakMap,wn=e=>{let t=bn[e]??xn.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?xn.set(e,new WeakRef(n)):bn[e]=n,n},Tn=e=>{if(Zn(e),e.low===1&&e.high>=1)return wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},En=e=>e.length>0&&(e===bn[e.length]||e===xn.get(e.length)?.deref()||Cn.has(e)),Dn=e=>{let t=N(e).elements;return En(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},On=e=>{let t=Sn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Sn[e]=n,n},j=e=>xt(yt(wn(e.length),e),`tuple`),kn=e=>xt(vn(e),`record`),An=(e,t)=>xt(yt(e,t),`record`),jn=e=>O(e)&&!ut(e),Mn=(e,t=!1)=>`UNION(${I(e.base,t)})`,Nn=(t,n=e=>N(e).elements)=>{if(!jn(t.base))throw new e._(`Attempted to enumerate the nonenumerable set:\n${Mn(t)}`);return n(t.base)},Pn=(t,n,r)=>{if(jn(t))return t;throw new e._(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${I(t)}\nwhen enumerating:\n${Mn(r)}`)},M=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return M(e.base);case`FunctionSet`:return M(e.domain)&&M(e.range)||Fn(e.domain)===!0||Fn(e)===!0;case`RecordSet`:return e.sets.every(M)||Fn(e)===!0;case`ProductSet`:return e.factors.every(M)||Fn(e)===!0;case`Union`:return M(e.base)&&Wn(e.base).every(M);case`SetOperation`:return e.operator===`\\cup`?M(e.left)&&M(e.right):e.operator===`\\cap`?M(e.left)||M(e.right):M(e.left);default:return!1}},Fn=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Fn(e.domain);return t===void 0?void 0:!t&&Fn(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Fn(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return M(e)?N(e).elements.length===0:void 0;default:return}},In=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Ln=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Rn=e=>{if(typeof e!=`object`||e.kind!==`Subset`||ut(e.base))return;let t=N(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Ln(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return vt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},zn=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(vt(r.map(t=>e[t])));while(Ln(r,e.length))}return t},Bn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(ut(o))throw new e._(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Vn=(t,n=e=>N(e).elements)=>{if(typeof t!=`object`)throw new e._(`Expected a set but found ${I(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return rn(t.elements);case`Interval`:{let e=Tn(t);return e!==bn[e.length]&&Cn.set(e,t),e}case`Subset`:{if(Zn(t.base)===0)return zn([]);if(!O(t.base))throw new e._(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${D(I(t.base))}`);let n=N(t.base).elements;if(n.length>30)throw new e._(Xn(t));return zn(n)}case`FunctionSet`:{if(!rt.is174&&P(t))return[];if(ut(t.domain))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(t.domain)}\ncannot be enumerated.`);let r=Dn(t.domain);if((r.length>0||rt.is174)&&ut(t.range))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${I(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return In(r.map(()=>i)).map(e=>yt(r,e))}case`RecordSet`:{if(!rt.is174&&P(t))return[];let e=Bn(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${I(e)}`);return In(e).map(e=>kn(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!rt.is174&&P(t))return[];let e=Bn(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${I(e)}`);return In(e).map(j)}case`FilteredSet`:if(!O(t.base)||ut(t.base))throw new e._(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(t.base)}\nis not enumerable`);return N(t.base).elements.filter(t.test);case`Union`:{let e=Nn(t).flatMap((e,n)=>N(Pn(e,n,t)).elements);return N(pn(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!jn(t.left)||!jn(t.right)))throw new e._(`Attempted to enumerate S \\cup T when S:\n${I(t.left)}\nand T:\n${I(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!jn(t.left)&&!jn(t.right))throw new e._(`Attempted to enumerate S \\cap T when neither S:\n${I(t.left)}\nnor T:\n${I(t.right)}\nis enumerable`);if(t.operator===`\\`&&!jn(t.left))throw new e._(`Attempted to enumerate S \\ T when S:\n${I(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return ir(e=>_n(N(e.left),N(e.right)).elements,e=>rn(Hn(e)),t,t);let n=t.operator===`\\`||jn(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return N(r).elements.filter(e=>ar(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to enumerate the non-enumerable set ${I(t)}`);default:throw new e._(`Expected a set but found ${I(t)}`)}},N=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return vt(Vn(e));let t=typeof e==`object`&&ze(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=rr.sets;n?.push(e);let r=Vn(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?vt(r):fn(r);return t&&(t.enumerated=i),i},Hn=e=>[...N(e.left).elements,...N(e.right).elements],Un=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?ir(e=>N(e).elements,e=>rn(an(e,()=>Hn(e))),e,e):N(e).elements,Wn=e=>{if(typeof e!=`object`||wt(e))return N(e).elements;let t=rr.sets;t?.push(e);let n=Jn(e);return t?.pop(),n},Gn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Kn=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Kn);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Kn)&&e.range.every(Kn);case`SetOperation`:return e.operator!==`\\cup`&&Kn(e.left)&&Kn(e.right);case`FilteredSet`:return Kn(e.base);case`ProductSet`:return e.factors.every(Kn);default:return!1}},qn=e=>typeof e!=`object`||wt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?qn(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||qn(e.left)||qn(e.right):Gn(e)?.some(qn)??!1,Jn=e=>{if(e.kind===`Union`)return Nn(e,Wn).flatMap((t,n)=>Wn(Pn(t,n,e)));if(e.kind===`FilteredSet`&&!ut(e.base))return Wn(e.base).filter(e.test);if(Gn(e)?.some(qn))return Vn(e,Wn);if(e.kind!==`SetOperation`)return N(e).elements;if(e.operator===`\\cup`)return!jn(e.left)||!jn(e.right)?N(e).elements:[...Wn(e.left),...Wn(e.right)];let t=e.operator===`\\`||jn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return jn(n)?Wn(n).filter(t=>ar(t,r)===(e.operator===`\\cap`)):N(e).elements},P=t=>{if(typeof t!=`object`||!O(t))throw new e._(`Shouldn't call isEmpty() on value ${I(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e._(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(P);case`RecordSet`:return t.sets.some(P);case`FunctionSet`:return!P(t.domain)&&P(t.range);case`Union`:return Nn(t).every((e,n)=>P(Pn(e,n,t)));default:return N(t).elements.length===0}},Yn=(t,n,r)=>t.reduce((t,i)=>{let a=t*Zn(i,n);if(a>2147483647)throw new e._(r());return a},1),Xn=e=>`Overflow when computing the number of elements in:\n${I(e)}`,Zn=(t,n)=>{if(typeof t!=`object`)throw new e._(`Attempted to compute the number of elements in the ${He(t)} ${I(t)}.`);switch(t.kind){case`ModelValue`:throw new e._(`Attempted to compute the number of elements in the model value ${I(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Zn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e._(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to compute the number of elements in the overridden value ${I(t)}.`);case`Subset`:{let r=Zn(t.base,n);if(r>=31)throw new e._(Xn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(P(t.domain))return 1;if(P(t.range))return 0;if(Zn(t.range,n)===1)return 1}let r=Zn(t.domain,n),i=Zn(t.range,n);if(i<=1)return r===0?1:i;let a={value:1};for(let n=0;n<r;n++)if(a.value*=i,a.value>2147483647)throw new e._(Xn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&P(t)?0:Yn(t.sets,n,()=>Xn(t));case`ProductSet`:return n!==`1.7.4`&&P(t)?0:Yn(t.factors,n,()=>`Overflow when computing the number of elements in ${I(t)}`);default:return Ot(t),N(t).elements.length}},Qn=e=>`Attempted to check if the set ${I(e)}is finite.`,$n=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e._(`Attempted to check if the ${He(t)} ${I(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e._(`Attempted to check if the function:\n${I(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return $n(t.base)&&P(t.base);case`Subset`:return $n(t.base);case`FunctionSet`:{let e=$n(t.domain);if(e&&P(t.domain))return!0;let n=$n(t.range);return n&&P(t.range)?!0:n&&(e||Zn(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n={isAllFinite:!0};for(let t of e)if(!$n(t))n.isAllFinite=!1;else if(P(t))return!0;return n.isAllFinite}case`Union`:if(!jn(t.base))throw new e._(`Attempted to check if the nonenumerable set:\n${Mn(t)}\nis a finite set.`);return N(t.base).elements.every($n);case`SetOperation`:if(t.operator===`\\cup`)return $n(t.left)&&$n(t.right);if(t.operator===`\\cap`){if(!$n(t.left)&&!$n(t.right))throw new e._(Qn(t));return!0}if($n(t.left))return!0;if(!$n(t.right))throw new e._(Qn(t));return!1;case`FilteredSet`:if(!$n(t.base))throw new e._(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(t.base)}\nis finite.`);return!0}},er=(e,t,n=ht)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},tr=e=>{if(typeof e!=`object`||!k(e))return;let t=F(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},nr=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!k(t))return`${n} ${He(t)} ${I(t)}`;let r=St(t);return r===`record`?`Attempted to check if element:\n${I(e)}\nis in the record:\n${I(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${I(t)}`},rr={sets:void 0},ir=(t,n,r,i)=>{let a=rr.sets,o=rr.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e._))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},ar=(e,t)=>{let n=rr.sets;if(n===void 0)return cr(e,t);n.push(t);let r=cr(e,t);return n.pop(),r},or=(e,t)=>er(t.elements,e)!==-1,sr=(e,t)=>cn.has(t)?on(e,t.elements).isFound:sn(e,t.elements),cr=(t,n)=>{if(!O(n))throw new e._(nr(t,n));switch(n.kind){case`Set`:return Ot(t),ir(or,sr,t,n);case`MixedSet`:return sn(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&!A(t))throw new e._(`Attempted to check if the value:\n${I(t)}\nis in the integer interval ${I(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(A(t))return!1;if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e._(`Attempted to check if the value:\n${I(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!O(t)||ut(t))throw new e._(`Attempted to check if the non-enumerable value\n${D(I(t))}\nis element of\n${D(I(n))}`);return N(t).elements.every(e=>ar(e,n.base));case`FunctionSet`:{if(!k(t)){if(A(t))return!1;throw new e._(`Attempted to check if \n${I(t)}\nwhich is not a TLC function value, is in the set of functions:\n${D(I(n))}`)}let r=F(t),i=It(r.domain);return(i===void 0?un(n.domain,vt(r.domain)):un({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>ar(e,n.range))}case`RecordSet`:{let r=k(t)?F(t):void 0;if(!r||!Ye(r.domain)){if(A(t))return!1;throw new e._(`Attempted to check if non-record\n${I(t)}\nis in the set of records:\n${I(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=er(r.domain,e);return i!==-1&&ar(r.range[i],n.sets[t])})}case`ProductSet`:{let r=k(t)?tr(t):void 0;if(r===void 0){if(k(t)&&F(t).domain.every(e=>typeof e==`number`)||A(t))return!1;throw new e._(`Attempted to check if non-tuple\n${I(t)}\nis in the set of tuples:\n${I(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>ar(e,n.factors[t]))}case`FilteredSet`:return ar(t,n.base)&&n.test(t);case`Union`:if(!jn(n.base))throw new e._(`Attempted to check if:\n ${I(t)}\nis an element of the non-enumerable set:\n ${Mn(n)}`);return N(n.base).elements.some(e=>ar(t,e));case`SetOperation`:return n.operator===`\\cup`?ar(t,n.left)||ar(t,n.right):ar(t,n.left)&&ar(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=tr(t);if(r===void 0){if(A(t))return!1;throw new e._(`Attempted to check if the value:\n${D(I(t))}\nis an element of ${D(I(n))}.`)}return r.every(e=>ar(e,n.base))}default:throw new e._(nr(t,n))}},lr=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?ar(e,n):e.range.every((e,r)=>lr(e,t.range[r],n.range)),F=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;M(t.domain)||Zn(t.domain);let e=Dn(t.domain);return t.enumerated=xt(yt(e,e.map(e=>t.apply(e))),St(t)),t.enumerated}throw new e._(`Expected a function but found ${I(t)}`)},ur=(e,t,n)=>{let r=D(I(e)),i=D(I(t)),a=n===`1.7.4`;switch(St(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},dr=(e,t)=>{if(!rt.is174)return ur(e,t);let n=D(I(t));return St(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},fr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},pr=t=>new e._(`Attempted to apply function with integer domain to the non-integer argument ${D(I(t))}`),mr=(e,t,n)=>{throw rt.is174||e.length<32?e.forEach(e=>nn(e,t)):er(e,t,Zt),n},hr=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=St(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e._(r(t,n));if(o===void 0&&!rt.is174&&En(i))throw pr(n)}let a=fr(i,n);return a===-1?ir(er,mr,i,n):a},gr=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!ar(n,t.domain))throw new e._(St(t)===`lambda`?ur(t,n):`Attempted to apply a function to ${I(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e._(`Attempted to apply ${I(t)}, which is not a function`);let i=r??ur,a=hr(t,n,i);if(a===-1)throw new e._(i(t,n));return t.range[a]},_r=e=>En(e)?Cn.get(e)??On(e.length):void 0,vr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e).domain;return _r(t)??vt(t)},yr=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!M(t.domain))){if(!ar(n,t.domain))return t;let e=r(t.apply(n));return xt({kind:`LazyFunction`,domain:t.domain,apply:r=>un(n,r)?e:t.apply(r),source:t.source},St(t))}if(!k(t))throw new e._(`Attempted to apply EXCEPT construct to the value ${D(I(t))}.`);let a=F(t),o=hr(a,n,dr);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=xt(yt(a.domain,s),St(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==Tr){let e=Ar(l);if(e!==Tr){let t=Ar(a.domain[o]);u.hash=c===l?a.hash:a.hash-wr(t,Ar(c))+wr(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Pr(e,c)+Pr(e,l)|0}return u},br=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},xr=(e,t)=>Math.imul(e^t,16777619),Sr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return br(t)},Cr=e=>br(e+2654435769|0),wr=(e,t)=>br(Math.imul(e,668265261)+t|0),Tr=795548749,Er=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Ar(t[e]);if(r===Tr)return Tr;n=n+Cr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Ar(e.domain[n]),i=Ar(e.range[n]);if(r===Tr||i===Tr)return Tr;t=t+wr(r,i)|0}return t},Dr=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e._(`TLC has found a state in which the value of a variable contains ${I(t)}`);if(O(t)){N(t).elements.forEach(Dr);return}let n=F(t);n.domain.forEach(Dr),n.range.forEach(Dr)},Or=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Ar(t)===Tr&&Dr(t);return}catch(t){if(!(t instanceof e._))throw t;return t}},kr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Ar=e=>typeof e==`number`?br(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Sr(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Er(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?M(e.domain)?Ar(F(e)):Tr:M(e)?Ar(N(e)):Tr,jr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Mr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return jr(t)},Nr=e=>jr(Ir(e)+2135587861|0),Pr=(e,t)=>jr(Math.imul(Ir(e),374761393)+Ir(t)|0),Fr=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Nr(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Pr(e.domain[n],e.range[n])|0;return t},Ir=e=>typeof e==`number`?jr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Mr(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Fr(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Ir(F(e)):M(e)?Ir(N(e)):Mr(Lr(e)),Lr=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Rr(e),Rr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Lr(t.base)}>`;if(t.kind===`FilteredSet`&&!M(t))throw new e._(`Attempted to compare the non-enumerable set ${I(t)} with another value`);if(O(t))return M(t)?`{${N(t).elements.map(Lr).join(`,`)}}`:`<${t.kind} ${I(t)}>`;let n=F(t);return`(${n.domain.map((e,t)=>`${Lr(e)}:${Lr(n.range[t])}`).join(`,`)})`},zr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Br=e=>e.reduce((e,t)=>e===0?0:e*Zn(t),1),Vr=e=>{if(e.kind===`Subset`)return Zn(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`&&M(e.domain)&&Zn(e.domain)===0)return vt([yt([],[])]);let t=e.kind===`FunctionSet`?Zn(e.range)**Zn(e.domain):Br(e.kind===`RecordSet`?e.sets:e.factors);return t===0?mn:t<=1999?N(e):void 0},Hr=(t,n)=>{if(n)return Vr(t);if(M(t))try{return Vr(t)}catch(t){if(t instanceof e._)return;throw t}},Ur=(e,t)=>{let n=e=>I(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Mn(e,t)}},Wr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Gr=t=>{if(M(t.domain))try{return F(t)}catch(t){if(t instanceof e._)return;throw t}},I=(e,t=!1,n=!1)=>{let r=e=>I(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return zr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(N(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Hr(e,t);return n?r(n):Ur(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Gr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${I(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&rt.is174&&St(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&St(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:St(e)===`record`||i.domain.every(e=>typeof e==`string`&&Wr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Ke(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Kr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${D(I(n))}\n`).join(``)},qr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Jr=(t,n)=>qr.has(t)?new e._(n):new e.C(n),Yr=(t,n,r,i)=>new e.C(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${I(i)}`),Xr=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||Xr(r))throw Jr(n,`${n} expects a value as argument ${t+1}`);return r},Zr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`number`)throw Jr(n,`${n} expects an integer but received ${I(r)}`);return r},Qr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw Jr(n,`${n} expects a boolean but received ${I(r)}`);return r},$r=(e,t,n)=>{let r=L(e,t,n);if(!O(r))throw Jr(n,`${n} expects a set but received ${I(r)}`);return r},ei=(e,t,n)=>{let r=$r(e,t,n);if(!M(r))throw Jr(n,`${n} cannot enumerate the non-enumerable set ${I(r)}`);return r},ti=(e,t,n)=>N(ei(e,t,n)).elements,ni=(e,t,n)=>{let r=L(e,t,n),i=tr(r);if(!i)throw Jr(n,`${n} expects a sequence but received ${I(r)}`);return i},ri=(e,t,n)=>{let r=L(e,t,n);if(!k(r))throw Jr(n,`${n} expects a function but received ${I(r)}`);return F(r)},ii=(e,t,n)=>{let r=e[t];if(r===void 0||!Xr(r))throw Jr(n,`${n} expects an operator as argument ${t+1}`);return r},ai=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),R=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),si=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ci=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),li=e=>e>2147483647||e<-2147483648,ui=t=>new e.C(`Overflow when computing ${t}`),di={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},fi={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},pi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},mi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},hi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return fi[e.operator];if(e.kind!==`Function`)return di[e.kind];let t=St(e);return t===void 0?`FcnRcdValue`:mi[t]},gi=e=>pi[hi(e)],_i=(t,n)=>new e._(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),vi=(t,n)=>{let r=r=>(...i)=>{let a=rr.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e._&&(t.isLazy===!0||!(r instanceof e.C))?(rr.sets&&(rr.sets.length=a),_i(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},yi=(e,t)=>{if(typeof e!=`number`)throw _i(t,`Cannot cast tlc2.value.impl.${hi(e)} to tlc2.value.impl.IntValue`);return e},bi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,xi=(e,t,n,r)=>{let i=bi(e,n,`IntValue`,2);return ci(t,(e,n)=>{let a=yi(e,i),o=yi(n,i),s=r(a,o);if(li(s))throw ui(`${a}${t}${o}`);return s})},Si=(t,n,r)=>{if(typeof t!=`number`)throw new e.C(`The ${n} argument of ${r} should be an integer, but instead it is:\n${I(t)}`);return t},Ci=(e,t,n=e)=>ci(e,(e,r)=>t(Si(e,`first`,n),Si(r,`second`,n))),wi=(e,t,n)=>({...si(e,t,n),isLazy:!0}),Ti=(e,t,n)=>{let r=ii(e,t,n);return()=>r.call([])},Ei=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Di=()=>({bool:hu,condition:(e,t)=>{if(typeof e!=`boolean`)throw Ql(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw $l(t,n,e);return e},apply:gr,expectFunction:fu,tuple:j,set:pn,record:An,writtenRecord:qe,equal:At,enumerate:Su,unassigned:(e,t)=>{throw ou(e,t)},primeOutsideAction:e=>{throw cu(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:pu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>uu(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Oi={value:void 0},ki={isAllowed:void 0},Ai=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},ji=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Mi=e=>`local${e.counter++}`,Ni=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),ke(e).forEach(e=>Ni(e,t)),t),Pi=(e,t,n)=>{let r=ji(e,V(t,e.environment)),i=Ni(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=ji(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Fi=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>Mi(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${zi(e,t.set,s)}, ${ji(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Mi(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${zi(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Mi(e),a=Mi(e),o=Mi(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Ii=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${zi(e,r[0],n)}, "the left side of =>") ? bool(${zi(e,r[1],n)}, "the right side of =>") : true)`;if(E(t))return Pi(e,t,n);let i=Ku(t.operator,e.environment);if(i?.kind!==`Builtin`)return Pi(e,t,n);if(i.name===`DOMAIN`)return`${ji(e,nu(t))}(${zi(e,r[0],n)})`;if(i.name===`TLCEval`)return Pi(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ji(e,ru(t,i))}(${zi(e,r[0],n)}, ${zi(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&xd(r[0],a))return`${ji(e,i.evaluateUnary)}(${zi(e,r[0],n)})`;let o=r.length===2&&xd(r[0],a)&&xd(r[1],a);return i.evaluateBinary&&o?`${ji(e,i.evaluateBinary)}(${zi(e,r[0],n)}, ${zi(e,r[1],n)})`:Pi(e,t,n)},Li=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(E(e))return!1;let r=rd(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Li(e.expression,t,n);case`FieldAccess`:return Li(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Li(e,t,n));default:return!1}},Ri=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Ri(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Ri);default:return!1}},zi=(e,t,n)=>{let r=(t,r=n)=>zi(e,t,r);switch(t.kind){case`Number`:return Ue(t.value)?String(t.value):Pi(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(E(t))return Pi(e,t,n);let i=rd(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ji(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ji(e,i.value):Pi(e,t,n)}case`Apply`:return Ii(e,t,n);case`And`:case`Or`:{let n=ji(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${ji(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Ad(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Li(t.function,n,e.environment)?r(t.function):Ri(t.function)?r(t.function,i):Pi(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ji(e,t)}))`,o=tu(e.environment.runtime.version),s=o?`, ${ji(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${ji(e,eu(t))}(${r(t.record)})`;case`Record`:{let i=Ld(t.fields);if(Rd(i))return Pi(e,t,n);let a=ji(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${ji(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=ji(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Fi(e,t,n):Pi(e,t,n);default:return Pi(e,t,n)}},Bi=(e,t)=>{if(!Ei.has(e.kind)||(ki.isAllowed??=Ai(),!ki.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=zi(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
87
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Oi.value??=Di();let o=Oi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Vi={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},Hi={none:0,error:1,warning:3,state:4},Ui={0:``,1:`Error: `,3:`Warning: `,4:`State `},Wi=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===Hi.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
88
+ (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${Ui[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},Gi=`The configuration file did not specify the initial state predicate.
89
89
  Can also be caused by trying to run TLC on a specification from
90
- a module imported with a parameterized INSTANCE statement.`,Gi=[[1005,e.u,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
90
+ a module imported with a parameterized INSTANCE statement.`,Ki=[[1005,e.u,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
91
91
  %1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
92
92
  %1%,
93
93
  but it produced the following error:
@@ -110,7 +110,7 @@ element is not a bag:
110
110
  %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
111
111
  on the right-hand side of a <- after already appearing on the
112
112
  left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
113
- is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Wi,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
113
+ is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Gi,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
114
114
  %1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
115
115
  %1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
116
116
  but instead found %3%.
@@ -128,15 +128,15 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
128
128
  Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
129
129
  It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
130
130
  %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
131
- `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],Ki={value:void 0},qi=()=>Ki.value??=Gi.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),Ji=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,Yi=e=>Ji.test(e)?void 0:qi().find(t=>t.pattern.test(e))?.message,Xi=t=>t instanceof e.C||Yi(t.message)?.isEvalException===!0,Zi=/* @__PURE__ */ new Map([[1e3,`
131
+ `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],qi={value:void 0},Ji=()=>qi.value??=Ki.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),Yi=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,Xi=e=>Yi.test(e)?void 0:Ji().find(t=>t.pattern.test(e))?.message,Zi=t=>t instanceof e.C||Xi(t.message)?.isEvalException===!0,Qi=/* @__PURE__ */ new Map([[1e3,`
132
132
  : `],[2105,`failed.
133
133
  `],[2154,`but it produced the following error:
134
134
  `],[2213,`:
135
- `],[2281,` - specifically: `]]),Qi=(e,t,n)=>{let r=n?Zi.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${$i(t.slice(a),n)}`},$i=(e,t)=>{let n=t?Yi(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Vi.none} @!@!@\n${Qi(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ea=e=>String(e).padStart(2,`0`),ta=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${ea(r%24)}h`:e>36e5?`${ea(r%24)}h ${ea(n)}min`:e>6e4?`${ea(n)}min ${ea(t)}s`:`${ea(t)}s`},na=e=>`${e.getFullYear()}-${ea(e.getMonth()+1)}-${ea(e.getDate())} ${ea(e.getHours())}:${ea(e.getMinutes())}:${ea(e.getSeconds())}`,ra=/* @__PURE__ */ new WeakMap,ia=(t,n,r)=>{if(!(t instanceof e._))return t;let i=e.K(new e._(`${r}\n${t.message}`,t),e.V(t));return ra.set(i,{code:n,headline:r,inner:t}),i},aa=e=>ra.has(e),oa=e.P.slice(0,e.P.indexOf(`
136
- `)),sa=`${e.P}tlc2.tool.EvalException: `,ca=`${e.P}util.Assert$TLCRuntimeException: `,la=e=>Xi(e)?sa:ca,ua=t=>{try{return t()}catch(t){throw t instanceof e._?Xi(t)?new e._(`${e.N}${t.message}`):Yi(t.message)?t:new e._(`${e.P}${t.message}`):t}},da=[sa,ca,e.P,e.N],fa=(e,t)=>{let n=ra.get(e);if(n)return`${n.headline}\n${fa(n.inner,t)}`;let r=e.message,i=da.find(e=>r.startsWith(e))??``;return`${i}${$i(r.slice(i.length),t)}`},pa=(t,n)=>{let r=ra.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:fa(t,!0)};if(n&&Xi(t))return{code:Yi(i)?.code??Bi.general,message:i,toolMessage:i};let a=n&&!i.startsWith(oa)?e.P:``;return{code:Bi.general,message:`${a}${i}`,toolMessage:`${a}${fa(t,!0)}`}},ma={kind:`Local`},ha=/* @__PURE__ */ new WeakSet,ga=/* @__PURE__ */ new WeakMap,_a=/* @__PURE__ */ new WeakMap,va=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ya=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ba=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,xa=e=>e.kind===`Operator`?e.params.length:0,Sa=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ca=e=>e.name.includes(`!`),wa=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ta=(e,t,n)=>{let r=t.bindings.get(e);return r&&ba(r.position,t.location)&&(!n||ba(r.position,n.start))?r:void 0},Ea=(t,n)=>t!==void 0&&n!==void 0&&e.z(t)===e.z(n),Da=(t,n,r,i)=>{if(n===void 0)return!0;if(Ea(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.z(a),s=n.range&&e.z(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},Oa=(e,t,n,r)=>Da(t,wa(e,t)??Ta(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,ka=(e,t,n)=>{Da(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Aa=(e,t,n,r)=>t.reduce((e,t,i)=>Oa(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),ja=(e,t,n)=>t.reduce((e,t)=>Oa(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ma=e=>e.kind===`Name`?[e.name]:e.names,Na=e=>e.flatMap(e=>Ma(e.pattern)),Pa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ba(n.location,t.location))?n:void 0},Fa=(e,t)=>{let n=Pa(e,t);return n?{key:t.getKey(n),arity:xa(n),params:Sa(n),kind:`Definition`}:t.imported.get(e)},Ia=(e,t,n)=>wa(t,e)??Fa(e,n),La=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ra=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:La(e.location,e.spelling??t)},za=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ba(e.location,e.args[0].location)?`prefix`:`postfix`}},Ba=e=>!/^[\p{L}\d_]/u.test(e),Va=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Ha=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Ua=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Wa=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Ua(e.name,[],void 0):Ua(e.operator,e.args,e.argumentCounts),Ga=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ka=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Na(e.bounds),body:e.body,sets:Ga(e.bounds)};case`SetMap`:return{names:Na(e.bounds),body:e.expression,sets:Ga(e.bounds)};case`SetFilter`:return{names:Ma(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ma(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},qa=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Ja=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Ya=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Xa=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Xa(e.body,t):ke(e).reduce((e,n)=>e??Xa(n,t),void 0)},Za=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Za(i,t,n||Ya(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Xa(e.set,t):Xa(e,t)},Qa=e=>e.kind===`Label`?Qa(e.body):e,$a=e=>typeof e==`number`?`argument selector ${e}`:e,eo=`within the scope of a declaration
137
- from outside that declaration's scope.`,to=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.z(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&Qa(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:Za(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?Xa(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Ya(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${eo}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=$a(t.operand);if(u.isSufficesOpen){if(Ha(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=Qa(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Ia(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=Ka(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:qa(e);if(!l)return;let f=Ha(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Ha(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Ya(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${eo}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},no=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.z(t.location.range),message:r}),!0)},ro=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.z(i),o=t.params.filter((i,a)=>{let o=wa(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.z(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},io=(e,t,n,r)=>{if(!Ja(e))return!1;let i=Wa(e),a=i[0],o=i.length>1&&a.kind===`Name`?wa(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&to(e,i,o,t,n,r),o!==void 0},ao=(t,n,r,i)=>{let a=t.location;if(go(t,r,i))return;let o=_a.get(t);if(o!==void 0)return o;if(va(n))return t.kind===`Apply`?t.args.length:0;let s=wa(r,n);if(s?.isNonFact){i.errors.push({location:e.z(Ra(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(io(t,r,i,!1)||Va(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=ma),s)return s.arity;let c=Fa(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,_a.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(wa(r,l)!==void 0||Fa(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.z(t.kind===`Apply`&&u===`-.`?La(a,`-`):Ra(t,n));if(!Ba(n)||Va(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=za(t);f&&a.range&&i.errors.push({location:e.z(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},oo=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>Aa(e,Ma(t.pattern),t.pattern.ranges,n),t)),so=(e,t)=>e.kind===`Identifier`&&e.name===t&&E(e)||ke(e).some(e=>so(e,t)),co=(e,t)=>{e.kind===`FunctionConstruction`&&so(e.body,t)&&(e.isRecursive=!0),ke(e).forEach(e=>co(e,t))},lo=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Na(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.z(s),message:t})},l=t.kind===`Function`?oo(t.bounds,n,a):ja(n,t.params,a),u=wa(l,o)??Ta(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(z(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),co(t.body,o),t.isSelfReferential=so(t.body,o)):z(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:Da(o,wa(n,o)??Ta(o,a,s),{kind:`Definition`,arity:xa(t),range:s},a)},uo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(wa(e,t.name)?.isPending)return e;let n={name:t.name,arity:xa(t),params:Sa(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>So(t,e,n),e)};return s(e.reduce((e,t)=>{let a=va(t.name)?e:s(e,e=>!ba(t.location,e.location)),o={name:t.name,arity:xa(t),kind:`Definition`,range:t.location.range,parent:a};if(Ca(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||va(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return lo(t,a,u,i)?{...o,params:Sa(t)}:a},a),()=>!0)},fo=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:wa(t,r)??Ta(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},po=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=fo(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.z(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},mo=(t,n,r)=>{if(po(t,n,r))return;let i=t.operator,a=Ia(i,n,r),o=ao(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.z(t.argumentsRange??Ra(t,i)),message:`The operator ${i} requires ${o-(fo(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>ho(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.z(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=ao(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else z(e,n,r);return!0}if(e.kind===`Lambda`){z(e,n,r);let s=e.params.length===o;return!s&&ha.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Ra(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return z(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Ia(u,n,r)?.params??[],f=ao(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Ra(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},ho=(e,t,n)=>{e.kind===`Identifier`?ao(e,e.name,t,n):z(e,t,n)},go=(e,t,n)=>{let r=ga.get(e);return r?(r.args.forEach(e=>ho(e,t,n)),n.errors.push(r.error),!0):!1},z=(t,n,r)=>{if(ha.has(t)&&!r.isGenerated){z(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>z(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(po(t,n,r))return;let i=t.name,a=ao(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.z(Ra(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:ao(t,t.operator,n,r);return;case`Apply`:mo(t,n,r);return;case`Lambda`:z(t.body,Aa(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:z(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&z(t.other,n,r);return;case`Let`:z(t.body,uo(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(t.body,oo(t.bounds,n,r),a(Na(t.bounds)));return;case`UnboundedQuantifier`:z(t.body,Aa(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&z(t.set,n,r),z(t.body,Aa(n,Ma(t.pattern),t.pattern.ranges,r),a(Ma(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:z(t.predicate,oo([t.bound],n,r),a(Ma(t.bound.pattern)));return;case`SetMap`:z(t.expression,oo(t.bounds,n,r),a(Na(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.z(i.location.range??La(i.location,i.name)),message:`Non-unique fields in constructor.`}),z(i.value,n,r)});return;case`Except`:z(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),z(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:z(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(no(t,r))return;z(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),ro(t,n,r);return;case`Subexpression`:if(go(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>ho(e,n,r)),io(t,n,r,!1)}},_o=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||po(t,n,r)||io(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&wa(n,i)?.isNonFact?r.errors.push({location:e.z(Ra(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||z(t,n,r)}),vo=(e,t,n)=>(e.set&&z(e.set,t,n),Oa(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),yo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:vo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?yo(t,e.scope,e.unit,!0):z(t,e.scope,e.unit),e),{scope:t,unit:n});return z(e.conclusion,i.scope,i.unit),i.scope},bo=(e,t,n)=>e.kind===`AssumeProve`?yo(e,t,n):(z(e,t,n),t),xo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&_o(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Co(t,e,r),t)},So=(e,t,n)=>{let r=ko(e,t,n);return e.name===void 0?r:Oa(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Co=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=bo(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return xo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return xo(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return _o(r.facts,t,n),o(t);case`Instance`:return o(So(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?So(t,e,i):uo([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),xo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(Aa(oo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Aa(oo(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...Na(r.bounds),...r.names]}),xo(e.proof,a(t),n),a(o)}default:return xo(e.proof,a(t),n),a(t)}},wo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:bo(e.statement,void 0,t);e.name!==void 0&&ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),xo(e.proof,n,t),r&&(r.isInProof=!1)},To={line:0,column:0},Eo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Do=(e,t)=>{let n=new Map([...ya,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Oo=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){z(r,o,a);return}let i=ao(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.O(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.z(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.z(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!wa(o,e.name)&&!Fa(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.z(i),message:`Substitution missing for symbol ${n.name} declared at ${e.z(o)} \nand instantiated in module ${r}.`})}),c},ko=(e,t,n)=>{let r=n.getInstance(e);return Oo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Oa(e,t,r,n),t)},Ao=(e,t,n,r)=>{let i=Do(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Oo(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:To}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},jo=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>ba(e.location,t.location)?-1:+!!ba(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.O)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Mo=(t,n)=>{let r=Do(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...ya,...n.bound].map(([e,t])=>[e,{...t,position:To}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>ka(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return jo([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Da(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);Eo(t,e)?z(e.body,void 0,i):lo(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:xa(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);ja(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>ka(t,e,i)),e.name!==void 0&&ka(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);z(e.expression,void 0,r),e.name!==void 0&&ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>wo(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>_o(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.z(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},No=/* @__PURE__ */ new WeakSet,Po=/* @__PURE__ */ new WeakSet,Fo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Vo(e,(e,r)=>Fo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&E(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&E(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Io=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Lo=/* @__PURE__ */ new WeakMap,Ro=e=>Lo.get(e)??e.name,zo=(e,t)=>(Ro(t)!==e.name&&Lo.set(e,Ro(t)),e),Bo=(e,t)=>zo(e.kind===`Function`?{...e,bounds:Io(e.bounds,e=>t(e,[])),body:t(e.body,Na(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Vo=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Bo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Io(e.bounds,n),body:t(e.body,Na(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Ma(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Ma(e.bound.pattern))};case`SetMap`:return{...e,bounds:Io(e.bounds,n),expression:t(e.expression,Na(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Ho=`LAMBDA`,Uo=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Vo(e,(e,n)=>(r.push(...Uo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Wo=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Go=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Ko=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},qo=(e,t)=>e.map(e=>({pattern:Ko(e.pattern,t),set:e.set})),Jo=(e,t)=>e.kind===`Function`?{...e,bounds:qo(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Yo=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>zo({...Jo(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:qo(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Ko(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Ko(e.bound.pattern,n),set:e.bound.set}};default:return e}},Xo=e=>`${e}@ENABLED`,Zo=(e,t)=>e.modes.get(t)??e,Qo=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!E(e)&&t.instantiation.variables.has(e.name),$o=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>$o(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Qo(e,t,n))return[e.name];let r=E(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?$o(r.body,t,/* @__PURE__ */ new Map):void 0},es=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Qo(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Xo(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:as(e.expression,Zo(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[as(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:as(e.subscript,Zo(t,`Primed`),n),location:r},as(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=$o(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Xo(r),location:e.location},location:e.location},as({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ts=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ma}),ns=(e,t)=>e.map(e=>ts(e.name,t)),rs=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...ns(t,r),...i.map(e=>ts(e,r))],location:r},location:r}},is=(e,t)=>e.instantiation.isParameterized(t)?ss(e,t):void 0,as=(t,n,r)=>{let i=e=>as(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!E(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:as(t.expression,Zo(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:as(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},Zo(n,`Enabled`),r)};let c=es(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name);if(e)return No.add(e),e;let r=is(n,t.name);if(r===void 0)return t;if(o.length===0)return{...t,name:r};let i=a.getDefinition(t.name);return i&&xa(i)>0?rs(r,o,xa(i),t.location):{kind:`Apply`,operator:r,args:ns(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Po.has(t),l=e=>(c&&Po.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Ho,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Ho,args:r,resolution:ma},location:t.location};if(s)throw new e.O(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=is(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...ns(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=is(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?rs(e,o,xa(r),t.location):{...t,operator:e}}let l=Wo(n),u=Vo(t,(e,t)=>t.length===0?i(e):as(e,n,Go(r,t,l)));return Yo(u,r,l)},os=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:ts(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ss=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Wo(e),o=Jo(Bo(i,(t,n)=>as(t,e,Go(/* @__PURE__ */ new Map,n,a))),a);return os(o,r.params,i.location)}):t},cs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Uo(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>is(i,e)??e,getQualifiedKey:t=>{let n=is(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>os(r,e.params,r.location)):t}}},ls=e=>e.kind===`Let`&&e.instances!==void 0||ke(e).some(ls),us=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Vo(e,e=>us(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ba(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},ds=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,fs=(e,t)=>e.definitions.some(e=>ls(e.body))||e.assumptions.some(e=>ls(e.expression))||e.theorems.some(e=>{let t=ds(e);return t!==void 0&&ls(t)})?{...e,definitions:e.definitions.map(e=>Bo(e,e=>us(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:us(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ds(e);return n===void 0?e:{...e,statement:us(n,t,[])}})}:e,ps=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}])),ms={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]}},hs=(e,t)=>{let n=ms[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},gs=(e,t)=>`${e}${t}`,_s=(e,t,n)=>`${e}${t}${n}`,vs=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},ys=(e,t,n)=>`${e},${t},${n}`,bs=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),xs=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ss=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Cs=(e,t,n,r)=>({...bs(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),ws=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ts=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Es=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,{...Cs(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Ds=Cs(`$Set`,0,[2],[1]),Os=Cs(`$Junction`,0,[3],[1]),ks=Cs(`$Choose`,0,[2],[1]),As=Cs(`$Function`,0,[3],[1]),js=Cs(`$FcnApply`,0,[2,2],[1,1]),Ms=Cs(`$RcdSelect`,0,[2,0],[1,1]),Ns=Cs(`'`,2,[1],[0]),Ps=Cs(`ENABLED`,1,[2],[0]),Fs=Cs(`[]`,3,[3],[0]),Is=Cs(`$SquareAct`,2,[2,1],[0,0]),Ls=Cs(`$WF`,3,[1,2],[0,0]),Rs=Cs(`$TemporalExists`,3,[3],[0]),zs=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Bs=e=>e.map(e=>({name:e,arity:0})),Vs=(t,n)=>n.location.range?e.L(`${t}.`,n.location.range):new e.O(`${t} at line ${n.location.line}, column ${n.location.column}`),Hs=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Us=e=>e.kind!==`Let`&&e.kind!==`Label`,Ws=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:h(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=h(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Es.get(e)??ps.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=bs(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(_s(e,n,t))}),t.data.constraints.forEach((e,t)=>xs(r.constraints,t,e)),Ss(r.argConstraints,gs(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ss(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>ws(t,r))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(ys(e,n,r)),c=bs(Math.max(t.level,...n.filter((e,n)=>Ts(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Ts(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>xs(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||xs(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>xs(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||xs(c.constraints,e,ws(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>xs(c.constraints,e,ws(r,a)))}))}),t.argParams.forEach(e=>{let t=vs(e),n=o(t.operator)?.operator;n&&xs(c.constraints,t.param,ws(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ss(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>Ss(c.argConstraints,gs(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Ss(c.argConstraints,gs(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=vs(e),n=o(t.operator);n&&Ss(c.argConstraints,gs(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(vs(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=vs(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(_s(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(_s(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(_s(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=ne(`LAMBDA`,Bs(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,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=bs();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=zs(n,Bs(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Vs(`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 Vs(`Action used where only temporal formula or state predicate allowed`,e);Hs.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Us(n)&&n.kind!==r)throw Vs(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=h(e,n);t.constraints.forEach((e,t)=>xs(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ss(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return ee(t,n)}catch(n){throw!(n instanceof e.O)||n.sany?n:Vs(n.message,t)}},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return bs();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Os,n)}case`Prime`:case`Unchanged`:return c(Ns,[e.expression],t);case`Enabled`:return c(Ps,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Fs,[n])}case`If`:return c(Os,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Os,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(Os,[e.body],t,e.bounds.map(e=>e.set),Na(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Vs(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Rs:Os,[e.body],t,[],e.names);case`Choose`:return c(ks,[e.body],t,e.set?[e.set]:[],Ma(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Ds,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Ds,[e.predicate],t,[e.bound.set],Ma(e.bound.pattern));case`SetMap`:return c(Ds,[e.expression],t,e.bounds.map(e=>e.set),Na(e.bounds));case`FunctionConstruction`:return c(As,[e.body],t,e.bounds.map(e=>e.set),Na(e.bounds));case`Record`:return c(As,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Ds,e.fields.map(e=>e.value),t);case`Except`:return c(Ds,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(js,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(Ds,e.args,t)}]);case`Bracket`:return bs();case`FieldAccess`:return a(Ms,[o(e.record,t),{data:bs()}]);case`BoxAction`:case`AngleAction`:return c(Is,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Ls,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return bs()}},te=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>te(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||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 ke(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,zs(t,Bs(e.names))),i;default:return Vo(e,(e,r)=>(a(e,n,zs(t,Bs(r))),e)),i}},ne=(e,t,n,r)=>{let i=zs(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=te(n,i),c={...bs(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(gs(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(_s(e.name,n,t.name))).map(e=>ys(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(vs(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=vs(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},h=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...bs(),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=ne(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:h,toOperand:o}},Gs=(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`?Gs(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=bs(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>xs(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ss(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Ks=(t,n,r,i)=>{let a=Ws(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Gs(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.z(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.z(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=jo([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?Gs(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.I(r)}})),...r],i);if(u.length>0)throw e.I(u,!1,void 0,i)},qs=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Js=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Ys=/* @__PURE__ */ new Set([...qs,...Js,`Enabled`]),Xs=/* @__PURE__ */ new Set([`~>`,`-+->`]),Zs=/* @__PURE__ */ new Set([...Xs,`\\cdot`]),Qs=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),$s=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),ec=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},tc=(e,t)=>Qs.has(e)||t.builtins.get(e)?.isStateLevel===!0,nc=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(qs.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Js.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Xs.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Ys.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Zs.has(e.operator))&&(r[0]|=1),Ys.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=ec(e);if(u!==void 0&&!E(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel)&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{tc(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),$s.has(u)&&(r[0]|=8),!a&&tc(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=32)}}ke(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},rc=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],ic=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},ac=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),oc=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=nc(rc(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=ic(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=ic(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!ac(t[e],l[e*r])))),p=ic(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},sc=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?cc(rc(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},cc=(e,t)=>{let n=t.facts.words,r=nc(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=sc(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}ac(e.callee,r[0])||(i[0]|=r[0]&14)}),i},lc=(e,t)=>!(sc(e,t)[0]&1),uc={any:2,repeated:4,streamed:8},dc=(e,t,n=`any`)=>(sc(e,t)[0]&uc[n])!==0,fc=(e,t)=>{let n=sc(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},pc=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},mc=(e,t)=>{let n=cc([e],t);return n[0]&16?void 0:pc(n)},hc=(e,t)=>!!(cc([e],t)[0]&1),gc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=nr.sets,a=i??[],o=a.length;nr.sets=a;try{return n()}catch(e){throw dd(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,nr.sets=i}},_c=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},vc=e=>!e.includes(void 0),yc=e=>e.variables.map(()=>void 0),bc=(e,t,n)=>{let r=[...e];return r[t]=n,r},xc=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Sc=e=>e.kind===`Identifier`?e.name:void 0,Cc=(e,t,n)=>{if(t.kind===`Label`)return Cc(e,t.body,n);let r=Sc(t);if(r===void 0)return;let i=ou(n,r);if(i?.kind===`Thunk`)return Cc(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Uu(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Cc(e,o.body,o.scope):void 0},wc=(e,t,n)=>{if(t.kind===`Prime`)return Cc(e,t.expression,n);if(t.kind===`Label`)return wc(e,t.body,n);let r=Sc(t);if(r===void 0)return;let i=ou(n,r);if(i?.kind===`Thunk`)return wc(e,i.expression,i.scope);if(i)return;let a=Uu(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?wc(e,a.body,a.scope):void 0},Tc=t=>{if(typeof t!=`boolean`)throw new e._(`TLC expected a boolean expression.`);return t},Ec=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Dc=(e,t,n)=>{t===void 0?vc(n)&&e.onState(n):vc(n)&&Ec(e)?kc(e,t,n):t.kind===`Predicate`?Ac(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?zc(e,t.expression,t.rest,t.scope,n):Oc(e,t,n)&&Dc(e,t.rest,n)},Oc=(e,t,n)=>{let r=e.environment,i=H(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return H(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?iu(t,r.runtime.version):t}})();return!At(i,a)},kc=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){zc(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Oc(e,r,n):!Tc(H(r.expression,_c(e,r.scope,n))))return}e.onState(n)},Ac=(t,n,r,i,a)=>gc(t,n,()=>{switch(n.kind){case`Let`:Ac(t,n.body,r,id(n.definitions,_c(t,i,a)),a);return;case`Label`:Ac(t,n.body,r,i,a);return;default:if(Lc.has(n.kind))throw new e._(`The state relation is not a boolean expression.`);gc(t,n,()=>Rc(t,n,r,i,a))}}),jc=(e,t,n,r)=>{Tc(t)&&Dc(e,n,r)},Mc=(e,t,n,r,i)=>{let a=_c(e,r,i);if(t.kind===`Identifier`){let o=ou(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ac(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ac(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Uu(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&lc(s,e.environment))){Ac(e,c.body,n,c.scope,i);return}jc(e,H(t,a),n,i);return}let o=Wu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ac(e,o.body,n,nd(o,t.args,a),i):jc(e,H(t,a),n,i)},Nc=(e,t,n,r,i)=>{let a=n[r];a===void 0?Dc(e,t,bc(n,r,i)):At(a,i)&&Dc(e,t,n)},Pc=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Fc=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?Cc(t,o,i):wc(t,o,i),l=_c(t,i,a);if(c===void 0){H(n,l)===!0&&Dc(t,r,a);return}let u=H(s,l),d=a[c];if(n.operator===`=`){Nc(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)H(n,l)===!0&&Dc(t,r,a);else{if(!An(f))throw new e._(`The right side of \\IN is not enumerable.`);for(let e of Un(f))Dc(t,r,bc(a,c,e))}},Ic=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Lc=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Rc=(t,n,r,i,a)=>{let o=_c(t,i,a);switch(n.kind){case`Identifier`:Mc(t,n,r,i,a);return;case`Apply`:if(Ic.has(n.operator)&&n.args.length===2){Fc(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(Tc(H(n.args[0],o))){Ac(t,n.args[1],r,i,a);return}Dc(t,r,a);return}Mc(t,n,r,i,a);return;case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Pc(`Predicate`,t,i,e),r);Ac(t,e[0],n,i,a);return}let o=e[e.length-1];Ac(t,xc(n,e.length-1),Pc(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>Ac(t,e,r,i,a));return}Ac(t,xc(n,e.length-1),r,i,a),Ac(t,e[e.length-1],r,i,a);return}case`Exists`:wu(n.bounds,o,e=>(Ac(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(wu(n.bounds,o,t=>(e.push(t),!1)),e.length===0){Dc(t,r,a);return}let i=e.slice(1).reduce((e,t)=>Pc(`Predicate`,n.body,t,e),r);Ac(t,n.body,i,e[0],a);return}case`If`:Ac(t,Tc(H(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>Tc(H(e.condition,o)))?.body??n.other;if(s===void 0)throw new e._(`TLC encountered a CASE with no conditions true.`);Ac(t,s,r,i,a);return}case`FunctionApplication`:{let e=ku(H(n.function,t.isInit?o:uu(o)));if(e){Ac(t,e.body,r,Au(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){zc(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){Ac(t,n.action,r,i,a),zc(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){Ac(t,n.action,Pc(`Changed`,n.subscript,i,r),i,a);return}}jc(t,H(n,o),r,a)},zc=(e,t,n,r,i)=>gc(e,t,()=>{let a=Cc(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Nc(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Dc(e,n,i);return}let s=o.reduceRight((e,t)=>Pc(`Unchanged`,t,r,e),n);zc(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ou(r,t.name);if(a?.kind===`Thunk`){zc(e,a.expression,n,a.scope,i);return}let o=a?void 0:Uu(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){zc(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});At(s,c)&&Dc(e,n,i)}),Bc=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Vc=/* @__PURE__ */ Error(`The replay found a successor`),Hc=(e,t,n,r)=>{let i=Bc(r,!1,n,()=>{throw Vc},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Pc(`Changed`,e.subscript,t,void 0);Ac(i,e.action,n,t,yc(r))}else Ac(i,e,void 0,t,yc(r));return!1}catch(e){if(e!==Vc)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Uc=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Bc(t,!0,void 0,n),o=i.reduceRight((e,t)=>Pc(`Predicate`,t.expression,t.scope,e),void 0);Ac(a,r.expression,o,r.scope,yc(t))},Wc=(e,t,n,r)=>{e.some(e=>Lc.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Bc(n,!1,t,e=>i.push(e));Ac(a,e.expression,void 0,e.scope,yc(n)),i.forEach(t=>r(t,e))})},Gc=/* @__PURE__ */ new WeakMap,Kc=/* @__PURE__ */ new WeakMap,qc=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Jc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Yc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Xc=(t,n)=>{let r=new e._(n);return t.isInit?r:e.K(r,e.W.error)},Zc=(e,t,n,r)=>{let i=Jl(n);return r&&Lc.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Yc(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},Qc=(e,t,n)=>{let r=hi(t),i=B(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Yc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
138
- `:``}${i}`},$c=(e,t,n)=>el(e,t,H(t,n)),el=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw Xc(e,Zc(e,n,t,r))},tl=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=md(n,r.environment))(r),nl=e=>e===`=`||e===`\\in`||e===`\\subseteq`,rl=(e,t,n)=>{let r=n?Gc:Kc,i=r.get(e);if(i)return i;let a=Pl(e,t,n);return r.set(e,a),a},il=(e,t)=>{if(t.constants.has(e))return;let n=pu(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},al=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return al(e.expression,t,!1,r);if(e.kind!==`Identifier`||E(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=il(e.name,t);if(a&&!r.has(a))return r.add(a),al(a.body,t,n,r)},ol=(e,t,n)=>al(e,t,!n),sl=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return sl(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=id(e.definitions,qc(r,t,n));return sl(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ou(t,e.name);if(a?.kind===`Thunk`)return sl(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=il(e.name,r.environment);if(s)return sl(s.body,void 0,n,r,i)},cl=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||E(e))||!t&&e.kind===`Prime`,ll=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ll(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=il(e.name,t);if(i)return n.add(e.name),ll(i.body,t,n)},ul=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),dl=(e,t,n)=>ul.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||nl(e.operator)&&(cl(e.args[0],n)||ol(e.args[0],t,n)!==void 0)||E(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,fl=/* @__PURE__ */ new Set,pl=(e,t)=>{if(E(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Vo(e,(e,i)=>{let a=r.isReadOnly?pl(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},ml=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||E(e)?void 0:pu(r,t);return i&&!n.has(i)&&(n.add(i),ml(i.body,t,n))?!0:ke(e).some(e=>ml(e,t,n))},hl=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=ol(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=ll(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return dl(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:rl(e,t,n)}},gl=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(mc(e,t)===void 0||ml(e,t,/* @__PURE__ */ new Set))return!0;let n=pl(e,fl);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},_l=(e,t,n)=>{let r=e.map(e=>hl(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Ec(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Il(u)){d??=qc(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=tl(a,e,n,d);if(!el(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=qc(t,n,u);let r=tl(i,s,e.expression,d);if(!el(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=qc(t,n,u);let r=tl(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Jc(u,e.index,r),d=void 0;else if(!At(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let t of e.indices){let e=(r??u)[t];if(e===void 0)r??=u.slice(),r[t]=n[t];else if(!At(e,n[t]))return}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},vl=e=>(t,n,r,i,a,o)=>{$c(t,e,qc(t,n,r))&&o(r,i)},yl=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=qc(r,i,a);if(a[l]!==void 0){$c(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!An(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Yc(r)}, the right side of \\IN is not enumerable.`;throw Xc(r,`${t}\n${B(e)}`)}let p=Un(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Jc(a,l,p[e]),o)}},bl=/* @__PURE__ */ new WeakMap,xl=e=>{let t=bl.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(xl),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return bl.set(e,n),n},Sl=(e,t)=>{let n=e.args[0],r=vl(e),i=(e,r,i)=>sl(n,r,i,e,!t)??-1,a=yl(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=H(e.args[1],qc(t,n,o));l(Jc(o,u,d),s)}},Cl=(e,t,n)=>{let r=B(e);return(i,a,o,s,c,l)=>{let u=qc(i,a,o),d=H(e.function,n?u:uu(u)),f=ku(d);if(f!==void 0){rl(f.body,t,n)(i,Au(f,e,u),o,s,c,l);return}if(!k(d))throw Xc(i,`In computing ${Yc(i)}, a non-function (${hi(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw Xc(i,`In computing ${Yc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},wl=(e,t)=>{if(ll(e,t))return _l([xl(e)],t,!1);if(e.kind===`Tuple`)return rl(xl(e),t,!1);let n=xl(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ou(i,e.name):void 0;l?.kind===`Thunk`?rl(xl(l.expression),t,!1)(r,l.scope,a,o,s,c):$c(r,n,qc(r,i,a))&&c(a,o)}},Tl=(e,t,n)=>{let r=e.operator,i=vl(e),a=E(e)?void 0:Uu(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=yd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=rl(a.body,t,n),o.body(e,i(qc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=qc(a,o,s),f=Wu(e,d);f?.kind===`Closure`?rl(f.body,t,n)(a,nd(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},El=(e,t,n)=>{let r=vl(e),i=E(e)?void 0:il(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ou(s,e.name);f?.kind===`Thunk`?rl(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=rl(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Dl=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||E(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!E(i))return;let a=al(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Ol=e=>e.kind===`And`?e.operands.flatMap(Ol):[e],kl=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&dl(e,t,!1),Al=e=>{let t=[];return(n,r,i)=>{let a=qc(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!el(n,i,tl(t,r,i,a)))return}}},jl=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Ol(e),r=n.findIndex(e=>!kl(e,t)||Dl(e,t)),i=r===-1?void 0:Dl(n[r],t);return i?{...i,before:r===0?void 0:Al(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>jl(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||E(e))return;let r=Uu(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=jl(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!E(o))return;let s=i.before,c=s&&yd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(qc(e,t,n)),n))}},Ml=(e,t,n)=>{let r=ou(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Nl=(e,t,n)=>{let r=e.map(e=>rl(e,t,n)),i=n?[]:e.map(e=>jl(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Ml(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Pl=(t,n,r)=>{let i=e=>rl(e,n,r);switch(t.kind){case`And`:return _l(t.operands,n,r);case`Or`:return Nl(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=_u(H(a.set,qc(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,su(i,t,u[n]),o,s,c,l)}}let o=r?void 0:gl(t,n);if(o){let e=_l(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=qc(r,i,a),d=t.bounds.map(e=>_u(H(e.set,u),e.set,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=su(n,o.names[t],e);if(t===d.length-1){let e=qc(r,i,a);if(!o.guards.every(t=>$c(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{wu(t.bounds,qc(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&mc(t,n)!==void 0&&!ml(t.body,n,/* @__PURE__ */ new Set)?pl(t,fl):void 0;return(n,r,i,o,s,c)=>{let l=[];wu(t.bounds,qc(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ou(r,e)?.kind===`Value`)){u.every(e=>$c(n,t.body,qc(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Il(i)?u.slice(r).every(e=>$c(n,t.body,qc(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=H(t.condition,qc(r,i,a));if(typeof l!=`boolean`)throw Xc(r,Qc(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=qc(r,i,a),u=e.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw Xc(r,`In computing ${Yc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${hi(t)}) was used as a guard condition of a CASE.\n${Jl(e.source)}`)})?.body??n;if(!u)throw Xc(r,`In computing ${Yc(r)}, TLC encountered a CASE with no conditions true.\n${B(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=od(t.definitions,n);return(n,i,a,o,s,c)=>e(n,id(t.definitions,qc(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e._(`UNCHANGED appears in an initial predicate at ${Kl(t)}`)}:wl(t.expression,n);case`AngleAction`:{let e=i(t.action),r=xl(t.subscript),a=(e,t,i)=>{try{return $c(e,r,qc(e,t,i))}catch(t){throw e.isEnabled?iu(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return i({kind:`Or`,operands:[t.action,xl(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return El(t,n,r);case`FunctionApplication`:return Cl(t,n,r);case`Apply`:{let e=t.args;if(nl(t.operator)){let i=ol(e[0],n,r);if(i!==void 0)return t.operator===`=`?_l([t],n,r):yl(t,()=>i);if(cl(e[0],r))return Sl(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=H(e[0],qc(n,r,i));(typeof c==`boolean`?c:fu(c,`the left side of => at ${Kl(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return Tl(t,n,r)}default:return vl(t)}},Fl=e=>e.variables.map(()=>void 0),Il=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ll=(t,n)=>{let r=n.state;if(!r||!Il(r))throw new e._(`ENABLED needs a complete state at ${Kl(t)}`);let i=n.environment;if(i.callStack)return Hc(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return rl(t,i,!1)(a,n.scope,Fl(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Rl=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};rl(t,n,!0)(a,i,Fl(n),void 0,!1,t=>{if(!a.isStopped){if(!Il(t))throw e.K(new e.v([...t]),e.W.error);a.isStopped=r(t)}})},zl=(e,t,n)=>{let r=[];return Rl(e,t,e=>(r.push(e),!1),n),r},Bl=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return rl(t,r,!1)(o,a,Fl(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!Il(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.y(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}s.successors++,o.isStopped=i({state:t,action:n})}}),s.successors},Vl=(e,t,n,r)=>{let i=[];return Bl(e,t,n,e=>(i.push(e),!1),r),i},Hl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Ul=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Wl=e=>Ul.has(e.kind)||e.kind===`Apply`&&Hl.has(e.operator),Gl=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&Be(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Kl=e=>`line ${e.location.line}, column ${e.location.column}`,ql=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,B=e=>{let t=e.location.range;return t?ql(t):Kl(e)},Jl=e=>e.kind===`Number`?e.text??String(e.value):B(e),Yl=(t,n)=>new e._(`A non-boolean expression (${hi(n)}) was used as the condition of an IF.\n${B(t)}`),Xl=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e._(`A non-boolean expression (${hi(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Jl(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e._(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${hi(r)}.\n${B({...t,location:{...t.location,range:{...i,end:a}}})}`)},Zl=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${I(e)}\n${B(t)}`,i=e=>`Attempted to apply function:\n${D(I(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!k(a))throw new e._(`Attempted to select field "${n}" from a non-record value ${D(I(a))}\n${B(t)}`);let o=St(a);if(o===`tuple`)throw fr(n);return hr(a,n,o===`record`?r:i)}},Ql=e=>e===`1.7.4`?(t,n)=>lr(t,n,e):void 0,$l=t=>n=>{if(!k(n))throw new e._(`Attempted to apply the operator DOMAIN to a non-function\n(${hi(n)})\n${B(t)}`);return _r(n)},eu=(t,n)=>(r,i)=>{if(!O(r)||ut(r))throw new e._(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${B(t)}`);return n.evaluate([r,i])},tu=t=>e.K(new e._(`TLC can't handle real numbers: ${t.text} at ${Kl(t)}`),e.W.configParseError),nu=t=>e.K(new e._(`TLC can't handle a number this big: ${t.text??t.value} at ${Kl(t)}`),e.W.error),ru=(t,n)=>new e.k(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${B(n)}`,t),iu=(t,n)=>t instanceof e.k&&n!==`1.7.4`?new e._(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,au=t=>new e._(`A primed expression appears outside an action at ${Kl(t)}`),ou=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},su=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),cu=(t,n,r)=>{if(n.kind===`Name`)return su(t,n.name,r);let i=er(r);if(!i||i.length!==n.names.length)throw new e._(`Cannot bind <<${n.names.join(`, `)}>> to ${I(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>su(e,t,i[n]),t)},lu=(t,n)=>{if(k(t))return t;throw new e._(`A non-function (${hi(t)}) was applied as a function.\n${B(n)}`)},uu=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},du=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),fu=(t,n)=>{if(typeof t!=`boolean`)throw new e._(`Expected ${n} to be a boolean but found ${I(t)}`);return t},pu=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),mu=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},hu=(t,n,r)=>{if(!O(t)||ut(t)){let i=I(t),a=r===`1.7.4`?void 0:mu(t,i);throw new e._(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Jl(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Jl(n)}\n${a}`)}},gu=(e,t,n)=>(hu(e,t,n),typeof e==`object`&&e.kind===`Interval`?wn(e):Ln(e)??Hn(e)),_u=(e,t,n)=>n===`1.7.4`?(hu(e,t,n),Ln(e)??Un(e)):gu(e,t,n),vu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Xn(e),e},yu=(e,t,n)=>vu(e)??_u(e,t,n),bu=(e,t,n)=>vu(e)??gu(e,t,n),xu=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Su=(e,t)=>e.map(e=>yu(H(e.set,t),e.set,t.environment.runtime.version)),Cu=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):xu(t[n],t=>i(n-1,cu(a,e[n].pattern,t)));return i(e.length-1,n)},wu=(e,t,n)=>Cu(e,Su(e,t),t.scope,n),Tu=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Eu=(e,t,n)=>{if(e.length===1)return cu(t,e[0].pattern,n);let r=er(n)??[];return e.reduce((e,t,n)=>cu(e,t.pattern,r[n]),t)},Du=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Ou=e=>Object.assign(e.value,{lambda:e}),ku=e=>Du(e)?e.lambda:void 0,Au=(t,n,r)=>{let i=t.value,a=n.args.map(e=>H(e,r)),o=a.length===1?a[0]:j(a),s=(e,t,r)=>`In applying the function\n${D(I(i))},\nthe ${e} is:\n${D(I(t))}${r}.\n${B(n.function)}`,c=t.bounds;if(c.length===1){if(!ir(o,i.domain))throw new e._(s(`first argument`,o,`which is not in its domain`));return Eu(c,t.scope,o)}let l=er(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e._(`Attempted to apply a function to an argument not in its domain.\n${B(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!ir(r,u[n]))throw new e._(s(i,r,`${t.pattern.kind===`Name`?``:`
139
- `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&er(r)?.length!==t.pattern.names.length)throw new e._(s(i,r,`which does not match its formal parameter`))}),Eu(c,t.scope,j(l.slice(0,c.length)))},ju=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:ql(n)}},Mu=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Nu=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},Pu=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Fu=(e,t)=>{let n=Tu(e.bounds,t),r=Nu(n,(n,r)=>H(e.body,du(t,Eu(e.bounds,su(void 0,e.name,r),n))),Mu(ju(e.bounds,e.body),e.bounds,n));return Ou({value:r,bounds:e.bounds,body:e.body,scope:su(void 0,e.name,r)}),e.bounds.length===1?Ct(r):r},Iu=(t,n)=>{if(typeof n!=`object`||St(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Be(n.domain))return n;try{let e=F(n);return yt(e.domain,e.range)}catch(t){if(t instanceof e._)return n;throw t}},Lu=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e._(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>Fu(t,e):md(Pu(t),n):md(t.body,n),Ru=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Lu(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(du(e,void 0)):e=>a[i]??r(du(e,void 0));return t.definitionEvaluators.set(e,o),o},zu=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Bu=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!lc(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>Iu(t,Lu(t,n)(a)));ln(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e._)&&!e.U(t))throw t}}),Vu=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=H(e.expression,du(t,e.scope));return n&&(!e.isStreamed||Gn(r))&&(e.cache=r),r},Hu=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Uu=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Uu(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Hu(r):t.builtins.get(e)},Wu=(e,t)=>E(e)?Gu(e.operator,t):Uu(e.operator,t.environment)??Gu(e.operator,t),Gu=(e,t)=>{let n=ou(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Uu(e,t.environment)},Ku=e=>e.kind===`Closure`?e.params.length:e.arity,qu=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:Gu(r,n);if(!i)throw new e._(`Expected an operator argument at ${Kl(t)}`);return i},Ju=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>su(e,n.name,t[r]),e.scope);return H(e.body,du(n,r))},Yu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Ku(e),call:n=>Ju(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Xu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Gu(e.name,t);return n!==void 0&&Ku(n)>0},Zu=(e,t)=>e.map(e=>Xu(e,t)?Yu(qu(e,t),t):H(e,t)),Qu=(t,n)=>new e._(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),$u=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),ed=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return ed(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},td=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ue(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=E(e)?void 0:ed(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ou(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:$u(e,t)}}return t=>$u(e,t)},nd=(e,t,n,r)=>{if(t.length!==e.params.length)throw Qu(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:qu(t[a],n)}:(r?.[a]??td(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},rd=(e,t,n,r)=>e.kind===`Closure`?H(e.body,du(n,nd(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(_d(t,n),n):e.evaluate(Zu(t,n),n),id=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),ad=(t,n,r)=>{let i=ou(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Vu(i,r);if(i?.kind===`Operator`){if(Ku(i.operator)===0)return Ju(i.operator,[],r);throw new e._(`Operator ${t} is used without arguments`)}let a=ed(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw ru(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Ru(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e._(`Unknown identifier ${t} at ${Kl(n)}`)},od=(e,t)=>({impure:new Set(e.filter(e=>dc(e,t))),streamed:new Set(e.filter(e=>dc(e,t,`streamed`)))}),sd=e=>[...e.facts.ids.keys()].some(t=>dc(t,e)),cd=e=>[...e.facts.ids.keys()].some(t=>dc(t,e,`repeated`)),ld=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,ud=(e,t,n,r)=>i=>{r.expressions.push(e);let a=nr.sets,o=nr.callStack,s=a??[],c=s.length;nr.sets=s,nr.callStack=r;try{let a=t(i),o=ld(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Wl(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Gl(e,r.values),a=i&&!ke(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!k(a)?void 0:a;throw dd(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,nr.sets=a,nr.callStack=o}},dd=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e._){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},fd=(t,n,r)=>{if(!(r instanceof e._))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},pd=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Md(e,t),i=t.callStack,a=i?ud(e,r,t,i):r;return t.evaluators.set(e,a),a},md=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=zi(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>md(e,t.environment)(t),hd=(e,t)=>{let n=e.name,r=E(e)?void 0:ed(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw ru(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n={reference:void 0};return r=>(n.reference??=Ru(e,t))(r)}return t=>ad(n,e,t)},gd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||E(e))return!0;let n=Uu(e.name,t);return n===void 0||Ku(n)===0},_d=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),vd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(_d(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&gd(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&gd(t[0],n)&&gd(t[1],n);if(i&&a){let e=V(t[0],n),r=V(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Zu(t,n),n)},yd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Qu(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:td(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:qu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},bd=(e,t,n)=>{let r=yd(e,t,n),i={body:void 0};return t=>(i.body??=md(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},xd=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=V(r[0],n),t=V(r[1],n);return n=>!fu(e(n),`the left side of =>`)||fu(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e._(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=E(t)?void 0:Uu(t.operator,n);if(i?.kind===`Closure`)return bd(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=V(r[0],n),i=$l(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=V(r[0],n);return Po.has(t)||hc(r[0],n)?e:t=>t.scope===void 0?i.evaluate([e(t)]):e(t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=V(r[0],n),a=V(r[1],n),o=eu(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return vd(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e._(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a=r.map(e=>td(e,n));return i=>{let o=Gu(t.operator,i);if(o)return rd(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e._(`${t.operator} is a function; apply it with brackets`):new e._(`Unknown operator ${t.operator} at ${Kl(t)}`)}},Sd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=V(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=V(a.set,t);return s=>xu(yu(o(s),a.set,t.runtime.version),t=>fu(i(du(s,su(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>V(e.set,t));return s=>{let c=a.map((e,n)=>yu(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?fu(i(du(s,a)),r)!==n:xu(c[t],n=>l(t-1,su(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>wu(o,e,t=>fu(i(du(e,t)),r)!==n)?!n:n},Cd=(e,t)=>{if(e.kind===`Tuple`)return j(e.names.map(e=>{let n=ou(t,e);return n?.kind===`Value`&&n.value}));let n=ou(t,e.name);return n?.kind===`Value`?n.value:void 0},wd=/* @__PURE__ */ new WeakSet,Td=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&wd.add(e)},Ed=(t,n)=>{let r=wd.has(t),i=V(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=V(o.set,n),l=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=En(e),a=yt(r,r.map(e=>i(du(t,su(t.scope,n,e)))));return Be(e)?a:Ct(a)}let n=[],r=a.map(e=>bu(H(e.set,t),e.set,t.environment.runtime.version));return Cu(a,r,t.scope,e=>{let r=a.length===1?Cd(o.pattern,e)??!1:j(a.map(t=>Cd(t.pattern,e)??!1));return n.push([r,i(du(t,e))]),!1}),vn(n)},u=ju(a,t.body),d=(e,n)=>{let r=n.scope,o=Ou({value:Nu(e,e=>i(du(n,Eu(a,r,e))),Mu(u,a,e)),bounds:a,body:t.body,scope:r});return a.length===1?Ct(o):o},f=n.callStack;return n=>{let i=s?c(n):Tu(a,n);if(t.isRecursive||r||n.isKeepLazy||!M(i))return d(i,n);if(!Be(i)){if(f)return d(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e._))throw t;return d(i,n)}}if(!f)return l(i,n);try{return l(i,n)}catch(e){throw fd(f,t,e),e}}},Dd=(e,t)=>{let n=wd.has(e);n&&Td(e.function);let r=V(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):j(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(du(i,su(i.scope,`@`,e))):vr(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(Bi.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${B(e.function)}`)}return n}},Od=(t,n)=>{if(t.kind===`SetFilter`){let e=V(t.predicate,n),r=V(t.bound.set,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:ql(a)},s=(e,t)=>n=>fu(e(du(t,cu(t.scope,i,n))),`a set filter predicate`),c=(e,n,r)=>({kind:`FilteredSet`,base:e,test:s(r,n),source:o,rebind:r=>c(e,{...n,environment:r},V(t.predicate,r))});return t=>{let n=r(t);return Be(n)?vt(N(n).elements.filter(s(e,t))):c(n,t,e)}}if(t.kind===`SetMap`){let e=V(t.expression,n);return n=>{let r=[];return wu(t.bounds,n,t=>(r.push(e(du(n,t))),!1)),pn(r)}}let r=t.set;if(!r)return()=>{throw new e._(`TLC cannot evaluate an unbounded CHOOSE at ${Kl(t)}`)};let i=V(t.body,n),a=V(r,n);return n=>{let o=a(n);if(!O(o)||ut(o))throw new e._(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${B(t)}`);let s={value:void 0},c=bu(o,r,n.environment.runtime.version);if(xu(c,e=>{let r=cu(n.scope,t.pattern,e);return fu(i(du(n,r)),`the body of CHOOSE`)?(s.value=Cd(t.pattern,r),!0):!1}),s.value===void 0)throw new e._(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${B(t)}`);return s.value}},kd=e=>[...e].sort((e,t)=>ht(e.name,t.name)),Ad=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),jd=(e,t)=>{let n=kd(e),r=Ad(n),i=n.map(e=>V(e.value,t));if(r)return e=>On(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>qe(a,i.map(t=>t(e)),o):e=>kn(a,i.map(t=>t(e)))},Md=(t,n)=>{let r=e=>V(e,n);switch(t.kind){case`Number`:{let e=t.value;return Ue(e)?()=>e:()=>{throw nu(t)}}case`Decimal`:return()=>{throw tu(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return hd(t,n);case`Apply`:return xd(t,n);case`Bracket`:return()=>{throw new e._(`A bracket without a function or subscript is not an expression at ${Kl(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e._(`An operator cannot be used as a value at ${Kl(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw Xl(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw Xl(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw au(t);return e({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let e=r({kind:`Prime`,expression:t.expression,location:t.location}),n=r(t.expression);return t=>At(e(t),n(t))}case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw Yl(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e._(`A non-boolean expression (${hi(n)}) was used as a condition of a CASE. ${Jl(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e._(`Attempted to evaluate a CASE with no conditions true.\n${B(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(du(n,id(t.definitions,n)))}case`Forall`:case`Exists`:return Sd(t,n);case`UnboundedQuantifier`:return()=>{throw new e._(`TLC cannot evaluate an unbounded quantifier at ${Kl(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Od(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>pn(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>j(e.map(e=>e(t)))}case`FunctionConstruction`:return Ed(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return jd(t.fields,n);case`RecordSet`:{let e=kd(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return Dd(t,n);case`ExceptAt`:return n=>{let r=ou(n.scope,`@`);if(r?.kind!==`Value`)throw new e._(`@ appears outside an EXCEPT at ${Kl(t)}`);return r.value};case`FunctionApplication`:{Td(t.function);let e=r(t.function),i=n=>lu(e(uu(n)),t),a=t.args.map(r),o=Ql(n.runtime.version);if(a.length===1){let e=a[0];return t=>hr(i(t),e(t),o)}return e=>hr(i(e),j(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Zl(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let e=r(t.action),n=r({kind:`Unchanged`,expression:t.subscript,location:t.location}),i=t.kind===`BoxAction`;return t=>i?fu(e(t),`an action`)||n(t):fu(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>Ll(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e._(`The subexpression reference at ${Kl(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e._(`TLC cannot evaluate a temporal formula in a state at ${Kl(t)}`)}}},Nd=`tlc2/value/impl/`,Pd={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Fd={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},Id=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},Ld=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Rd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],zd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Ld.get(e[3])}${`[]`.repeat(e[1].length)}`),Bd=(e,t)=>e[e[t].first].text,Vd=(e,t)=>Bd(e,t).replaceAll(`/`,`.`),Hd=t=>{let n=Id(t);if(n.readUint32()!==3405691582)throw new e.O(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===Pd.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Pd.integer?i.value=n.readInt32():t===Pd.float?n.readUint32():t===Pd.long||t===Pd.double?(n.readBytes(8),e++):t===Pd.class||t===Pd.string||t===Pd.methodType||t===Pd.module||t===Pd.package?i.first=n.readUint16():t===Pd.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Vd(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=zd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:Id(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Vd(r,d.readUint16())):[],p=Rd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=zd(i.slice(a+1))[0],ee=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${ee}`})}return{pool:r,methods:s}},Ud=(e,t)=>{let n=e[t],r=e[n.second];return{className:Bd(e,n.first),name:e[r.first].text}},Wd=(t,n,r,i)=>{let a=()=>new e.A(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===Pd.integer)return t.value;if(t.tag===Pd.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=Fd.iconstM1&&t<=Fd.iconst5)s.push(t-Fd.iconst0),e+=1;else if(t===Fd.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===Fd.sipush)s.push(r()<<16>>16),e+=3;else if(t===Fd.ldc)s.push(l(o[e+1])),e+=2;else if(t===Fd.ldcW)s.push(l(r())),e+=3;else if(t===Fd.dup){let t=c();s.push(t,t),e+=1}else if(t===Fd.getstatic){let t=Ud(n,r());if(t.className!==`${Nd}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===Fd.invokestatic){let t=Ud(n,r()),o=c();if(t.className!==`${Nd}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===Fd.new)s.push({className:Bd(n,r()),value:void 0}),e+=3;else if(t===Fd.invokespecial){let t=Ud(n,r()),o=c(),s=c();if(!(t.className===`${Nd}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===Fd.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},Gd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Hd(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Wd(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Kd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),qd=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Jd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Yd=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Xd=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Zd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Qd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
135
+ `],[2281,` - specifically: `]]),$i=(e,t,n)=>{let r=n?Qi.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${ea(t.slice(a),n)}`},ea=(e,t)=>{let n=t?Xi(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Hi.none} @!@!@\n${$i(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ta=e=>String(e).padStart(2,`0`),na=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${ta(r%24)}h`:e>36e5?`${ta(r%24)}h ${ta(n)}min`:e>6e4?`${ta(n)}min ${ta(t)}s`:`${ta(t)}s`},ra=e=>`${e.getFullYear()}-${ta(e.getMonth()+1)}-${ta(e.getDate())} ${ta(e.getHours())}:${ta(e.getMinutes())}:${ta(e.getSeconds())}`,ia=/* @__PURE__ */ new WeakMap,aa=(t,n,r)=>{if(!(t instanceof e._))return t;let i=e.q(new e._(`${r}\n${t.message}`,t),e.H(t));return ia.set(i,{code:n,headline:r,inner:t}),i},oa=e=>ia.has(e),sa=e.F.slice(0,e.F.indexOf(`
136
+ `)),ca=`${e.F}tlc2.tool.EvalException: `,la=`${e.F}util.Assert$TLCRuntimeException: `,ua=e=>Zi(e)?ca:la,da=t=>{try{return t()}catch(t){throw t instanceof e._?Zi(t)?new e._(`${e.P}${t.message}`):Xi(t.message)?t:new e._(`${e.F}${t.message}`):t}},fa=[ca,la,e.F,e.P],pa=(e,t)=>{let n=ia.get(e);if(n)return`${n.headline}\n${pa(n.inner,t)}`;let r=e.message,i=fa.find(e=>r.startsWith(e))??``;return`${i}${ea(r.slice(i.length),t)}`},ma=(t,n)=>{let r=ia.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:pa(t,!0)};if(n&&Zi(t))return{code:Xi(i)?.code??Vi.general,message:i,toolMessage:i};let a=n&&!i.startsWith(sa)?e.F:``;return{code:Vi.general,message:`${a}${i}`,toolMessage:`${a}${pa(t,!0)}`}},ha={kind:`Local`},ga=/* @__PURE__ */ new WeakSet,_a=/* @__PURE__ */ new WeakMap,va=/* @__PURE__ */ new WeakMap,ya=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ba=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),xa=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Sa=e=>e.kind===`Operator`?e.params.length:0,Ca=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],wa=e=>e.name.includes(`!`),Ta=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ea=(e,t,n)=>{let r=t.bindings.get(e);return r&&xa(r.position,t.location)&&(!n||xa(r.position,n.start))?r:void 0},Da=(t,n)=>t!==void 0&&n!==void 0&&e.B(t)===e.B(n),Oa=(t,n,r,i)=>{if(n===void 0)return!0;if(Da(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.B(a),s=n.range&&e.B(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},ka=(e,t,n,r)=>Oa(t,Ta(e,t)??Ea(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Aa=(e,t,n)=>{Oa(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},ja=(e,t,n,r)=>t.reduce((e,t,i)=>ka(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ma=(e,t,n)=>t.reduce((e,t)=>ka(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Na=e=>e.kind===`Name`?[e.name]:e.names,Pa=e=>e.flatMap(e=>Na(e.pattern)),Fa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||xa(n.location,t.location))?n:void 0},Ia=(e,t)=>{let n=Fa(e,t);return n?{key:t.getKey(n),arity:Sa(n),params:Ca(n),kind:`Definition`}:t.imported.get(e)},La=(e,t,n)=>Ta(t,e)??Ia(e,n),Ra=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),za=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Ra(e.location,e.spelling??t)},Ba=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return xa(e.location,e.args[0].location)?`prefix`:`postfix`}},Va=e=>!/^[\p{L}\d_]/u.test(e),Ha=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Ua=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Wa=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Ga=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Wa(e.name,[],void 0):Wa(e.operator,e.args,e.argumentCounts),Ka=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),qa=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Pa(e.bounds),body:e.body,sets:Ka(e.bounds)};case`SetMap`:return{names:Pa(e.bounds),body:e.expression,sets:Ka(e.bounds)};case`SetFilter`:return{names:Na(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Na(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Ja=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Ya=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Xa=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Za=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Za(e.body,t):ke(e).reduce((e,n)=>e??Za(n,t),void 0)},Qa=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Qa(i,t,n||Xa(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Za(e.set,t):Za(e,t)},$a=e=>e.kind===`Label`?$a(e.body):e,eo=e=>typeof e==`number`?`argument selector ${e}`:e,to=`within the scope of a declaration
137
+ from outside that declaration's scope.`,no=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.B(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&$a(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:Qa(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?Za(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Xa(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${to}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=eo(t.operand);if(u.isSufficesOpen){if(Ua(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=$a(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?La(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=qa(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Ja(e);if(!l)return;let f=Ua(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Ua(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Xa(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${to}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},ro=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.B(t.location.range),message:r}),!0)},io=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.B(i),o=t.params.filter((i,a)=>{let o=Ta(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.B(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},ao=(e,t,n,r)=>{if(!Ya(e))return!1;let i=Ga(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ta(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&no(e,i,o,t,n,r),o!==void 0},oo=(t,n,r,i)=>{let a=t.location;if(_o(t,r,i))return;let o=va.get(t);if(o!==void 0)return o;if(ya(n))return t.kind===`Apply`?t.args.length:0;let s=Ta(r,n);if(s?.isNonFact){i.errors.push({location:e.B(za(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(ao(t,r,i,!1)||Ha(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=ha),s)return s.arity;let c=Ia(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,va.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Ta(r,l)!==void 0||Ia(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.B(t.kind===`Apply`&&u===`-.`?Ra(a,`-`):za(t,n));if(!Va(n)||Ha(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Ba(t);f&&a.range&&i.errors.push({location:e.B(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},so=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>ja(e,Na(t.pattern),t.pattern.ranges,n),t)),co=(e,t)=>e.kind===`Identifier`&&e.name===t&&E(e)||ke(e).some(e=>co(e,t)),lo=(e,t)=>{e.kind===`FunctionConstruction`&&co(e.body,t)&&(e.isRecursive=!0),ke(e).forEach(e=>lo(e,t))},uo=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Pa(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.B(s),message:t})},l=t.kind===`Function`?so(t.bounds,n,a):Ma(n,t.params,a),u=Ta(l,o)??Ea(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(z(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),lo(t.body,o),t.isSelfReferential=co(t.body,o)):z(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:Oa(o,Ta(n,o)??Ea(o,a,s),{kind:`Definition`,arity:Sa(t),range:s},a)},fo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ta(e,t.name)?.isPending)return e;let n={name:t.name,arity:Sa(t),params:Ca(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Co(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ya(t.name)?e:s(e,e=>!xa(t.location,e.location)),o={name:t.name,arity:Sa(t),kind:`Definition`,range:t.location.range,parent:a};if(wa(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ya(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return uo(t,a,u,i)?{...o,params:Ca(t)}:a},a),()=>!0)},po=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ta(t,r)??Ea(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},mo=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=po(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.B(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},ho=(t,n,r)=>{if(mo(t,n,r))return;let i=t.operator,a=La(i,n,r),o=oo(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.B(t.argumentsRange??za(t,i)),message:`The operator ${i} requires ${o-(po(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>go(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.B(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=oo(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else z(e,n,r);return!0}if(e.kind===`Lambda`){z(e,n,r);let s=e.params.length===o;return!s&&ga.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??za(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return z(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=La(u,n,r)?.params??[],f=oo(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(za(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},go=(e,t,n)=>{e.kind===`Identifier`?oo(e,e.name,t,n):z(e,t,n)},_o=(e,t,n)=>{let r=_a.get(e);return r?(r.args.forEach(e=>go(e,t,n)),n.errors.push(r.error),!0):!1},z=(t,n,r)=>{if(ga.has(t)&&!r.isGenerated){z(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>z(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(mo(t,n,r))return;let i=t.name,a=oo(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.B(za(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:oo(t,t.operator,n,r);return;case`Apply`:ho(t,n,r);return;case`Lambda`:z(t.body,ja(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:z(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&z(t.other,n,r);return;case`Let`:z(t.body,fo(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(t.body,so(t.bounds,n,r),a(Pa(t.bounds)));return;case`UnboundedQuantifier`:z(t.body,ja(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&z(t.set,n,r),z(t.body,ja(n,Na(t.pattern),t.pattern.ranges,r),a(Na(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:z(t.predicate,so([t.bound],n,r),a(Na(t.bound.pattern)));return;case`SetMap`:z(t.expression,so(t.bounds,n,r),a(Pa(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.B(i.location.range??Ra(i.location,i.name)),message:`Non-unique fields in constructor.`}),z(i.value,n,r)});return;case`Except`:z(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),z(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:z(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(ro(t,r))return;z(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),io(t,n,r);return;case`Subexpression`:if(_o(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>go(e,n,r)),ao(t,n,r,!1)}},vo=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||mo(t,n,r)||ao(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Ta(n,i)?.isNonFact?r.errors.push({location:e.B(za(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||z(t,n,r)}),yo=(e,t,n)=>(e.set&&z(e.set,t,n),ka(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),bo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:yo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?bo(t,e.scope,e.unit,!0):z(t,e.scope,e.unit),e),{scope:t,unit:n});return z(e.conclusion,i.scope,i.unit),i.scope},xo=(e,t,n)=>e.kind===`AssumeProve`?bo(e,t,n):(z(e,t,n),t),So=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&vo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>wo(t,e,r),t)},Co=(e,t,n)=>{let r=Ao(e,t,n);return e.name===void 0?r:ka(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},wo=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=xo(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return So(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return So(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return vo(r.facts,t,n),o(t);case`Instance`:return o(Co(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Co(t,e,i):fo([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),So(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(ja(so(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=ja(so(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...Pa(r.bounds),...r.names]}),So(e.proof,a(t),n),a(o)}default:return So(e.proof,a(t),n),a(t)}},To=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:xo(e.statement,void 0,t);e.name!==void 0&&Aa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),So(e.proof,n,t),r&&(r.isInProof=!1)},Eo={line:0,column:0},Do=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Oo=(e,t)=>{let n=new Map([...ba,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},ko=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){z(r,o,a);return}let i=oo(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.O(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.B(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.B(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Ta(o,e.name)&&!Ia(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.B(i),message:`Substitution missing for symbol ${n.name} declared at ${e.B(o)} \nand instantiated in module ${r}.`})}),c},Ao=(e,t,n)=>{let r=n.getInstance(e);return ko(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>ka(e,t,r,n),t)},jo=(e,t,n,r)=>{let i=Oo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),ko(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:Eo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Mo=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>xa(e.location,t.location)?-1:+!!xa(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.O)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},No=(t,n)=>{let r=Oo(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...ba,...n.bound].map(([e,t])=>[e,{...t,position:Eo}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Aa(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Mo([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Oa(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);Do(t,e)?z(e.body,void 0,i):uo(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:Sa(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);Ma(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>Aa(t,e,i)),e.name!==void 0&&Aa(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);z(e.expression,void 0,r),e.name!==void 0&&Aa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>To(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>vo(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.B(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Po=/* @__PURE__ */ new WeakSet,Fo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Vo(e,(e,r)=>Fo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&E(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&E(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Io=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Lo=/* @__PURE__ */ new WeakMap,Ro=e=>Lo.get(e)??e.name,zo=(e,t)=>(Ro(t)!==e.name&&Lo.set(e,Ro(t)),e),Bo=(e,t)=>zo(e.kind===`Function`?{...e,bounds:Io(e.bounds,e=>t(e,[])),body:t(e.body,Pa(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Vo=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Bo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Io(e.bounds,n),body:t(e.body,Pa(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,Na(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,Na(e.bound.pattern))};case`SetMap`:return{...e,bounds:Io(e.bounds,n),expression:t(e.expression,Pa(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Ho=`LAMBDA`,Uo=e=>`${e}@SUBSTITUTION`,Wo=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Wo),Go=(e,t)=>{if(e.kind!==`Identifier`)return!Wo(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=E(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Wo(n.body)},Ko=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Vo(e,(e,n)=>(r.push(...Ko(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},qo=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Jo=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Yo=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Xo=(e,t)=>e.map(e=>({pattern:Yo(e.pattern,t),set:e.set})),Zo=(e,t)=>e.kind===`Function`?{...e,bounds:Xo(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Qo=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>zo({...Zo(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Xo(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Yo(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Yo(e.bound.pattern,n),set:e.bound.set}};default:return e}},$o=e=>`${e}@ENABLED`,es=(e,t)=>e.modes.get(t)??e,ts=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!E(e)&&t.instantiation.variables.has(e.name),ns=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ns(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(ts(e,t,n))return[e.name];let r=E(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ns(r.body,t,/* @__PURE__ */ new Map):void 0},rs=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ts(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:$o(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:cs(e.expression,es(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[cs(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:cs(e.subscript,es(t,`Primed`),n),location:r},cs(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ns(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:$o(r),location:e.location},location:e.location},cs({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},is=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ha}),as=(e,t)=>e.map(e=>is(e.name,t)),os=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...as(t,r),...i.map(e=>is(e,r))],location:r},location:r}},ss=(e,t)=>e.instantiation.isParameterized(t)?us(e,t):void 0,cs=(t,n,r)=>{let i=e=>cs(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!E(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:cs(t.expression,es(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:cs(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},es(n,`Enabled`),r)};let c=rs(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!Go(e,a)))return e;if(e&&r){let n=Uo(t.name);return r.set(n,e),is(n,t.location)}let i=ss(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&Sa(s)>0?os(i,o,Sa(s),t.location):{kind:`Apply`,operator:i,args:as(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Po.has(t),l=e=>(c&&Po.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Ho,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Ho,args:r,resolution:ha},location:t.location};if(s)throw new e.O(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=ss(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...as(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=ss(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?os(e,o,Sa(r),t.location):{...t,operator:e}}let l=qo(n),u=Vo(t,(e,t)=>t.length===0?i(e):cs(e,n,Jo(r,t,l)));return Qo(u,r,l)},ls=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:is(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},us=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=qo(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Zo(Bo(i,(e,t)=>cs(e,s,Jo(/* @__PURE__ */ new Map,t,a))),a);if(c.kind!==`Operator`||o.size===0)return ls(c,r.params,i.location);let l=[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location}));return ls({...c,body:{kind:`Let`,definitions:l,body:c.body,location:c.body.location}},r.params,i.location)}):t},ds=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Ko(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>ss(i,e)??e,getQualifiedKey:t=>{let n=ss(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ls(r,e.params,r.location)):t}}},fs=e=>e.kind===`Let`&&e.instances!==void 0||ke(e).some(fs),ps=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Vo(e,e=>ps(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>xa(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},ms=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,hs=(e,t)=>e.definitions.some(e=>fs(e.body))||e.assumptions.some(e=>fs(e.expression))||e.theorems.some(e=>{let t=ms(e);return t!==void 0&&fs(t)})?{...e,definitions:e.definitions.map(e=>Bo(e,e=>ps(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:ps(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ms(e);return n===void 0?e:{...e,statement:ps(n,t,[])}})}:e,gs=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}])),_s={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]}},vs=(e,t)=>{let n=_s[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},ys=(e,t)=>`${e}${t}`,bs=(e,t,n)=>`${e}${t}${n}`,xs=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Ss=(e,t,n)=>`${e},${t},${n}`,Cs=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),ws=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ts=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Es=(e,t,n,r)=>({...Cs(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Ds=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Os=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,ks=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,{...Es(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),As=Es(`$Set`,0,[2],[1]),js=Es(`$Junction`,0,[3],[1]),Ms=Es(`$Choose`,0,[2],[1]),Ns=Es(`$Function`,0,[3],[1]),Ps=Es(`$FcnApply`,0,[2,2],[1,1]),Fs=Es(`$RcdSelect`,0,[2,0],[1,1]),Is=Es(`'`,2,[1],[0]),Ls=Es(`ENABLED`,1,[2],[0]),Rs=Es(`[]`,3,[3],[0]),zs=Es(`$SquareAct`,2,[2,1],[0,0]),Bs=Es(`$WF`,3,[1,2],[0,0]),Vs=Es(`$TemporalExists`,3,[3],[0]),Hs=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Us=e=>e.map(e=>({name:e,arity:0})),Ws=(t,n)=>n.location.range?e.R(`${t}.`,n.location.range):new e.O(`${t} at line ${n.location.line}, column ${n.location.column}`),Gs=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Ks=e=>e.kind!==`Let`&&e.kind!==`Label`,qs=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:h(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=h(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=ks.get(e)??gs.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Cs(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(bs(e,n,t))}),t.data.constraints.forEach((e,t)=>ws(r.constraints,t,e)),Ts(r.argConstraints,ys(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ts(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>Ds(t,r))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(Ss(e,n,r)),c=Cs(Math.max(t.level,...n.filter((e,n)=>Os(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Os(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>ws(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||ws(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>ws(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||ws(c.constraints,e,Ds(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>ws(c.constraints,e,Ds(r,a)))}))}),t.argParams.forEach(e=>{let t=xs(e),n=o(t.operator)?.operator;n&&ws(c.constraints,t.param,Ds(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ts(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>Ts(c.argConstraints,ys(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Ts(c.argConstraints,ys(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=xs(e),n=o(t.operator);n&&Ts(c.argConstraints,ys(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(xs(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=xs(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(bs(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(bs(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(bs(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=ne(`LAMBDA`,Us(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,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=Cs();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Hs(n,Us(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Ws(`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 Ws(`Action used where only temporal formula or state predicate allowed`,e);Gs.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Ks(n)&&n.kind!==r)throw Ws(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=h(e,n);t.constraints.forEach((e,t)=>ws(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ts(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return ee(t,n)}catch(n){throw!(n instanceof e.O)||n.sany?n:Ws(n.message,t)}},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Cs();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(js,n)}case`Prime`:case`Unchanged`:return c(Is,[e.expression],t);case`Enabled`:return c(Ls,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Rs,[n])}case`If`:return c(js,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(js,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(js,[e.body],t,e.bounds.map(e=>e.set),Pa(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Ws(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Vs:js,[e.body],t,[],e.names);case`Choose`:return c(Ms,[e.body],t,e.set?[e.set]:[],Na(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(As,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(As,[e.predicate],t,[e.bound.set],Na(e.bound.pattern));case`SetMap`:return c(As,[e.expression],t,e.bounds.map(e=>e.set),Pa(e.bounds));case`FunctionConstruction`:return c(Ns,[e.body],t,e.bounds.map(e=>e.set),Pa(e.bounds));case`Record`:return c(Ns,e.fields.map(e=>e.value),t);case`RecordSet`:return c(As,e.fields.map(e=>e.value),t);case`Except`:return c(As,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Ps,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(As,e.args,t)}]);case`Bracket`:return Cs();case`FieldAccess`:return a(Fs,[o(e.record,t),{data:Cs()}]);case`BoxAction`:case`AngleAction`:return c(zs,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Bs,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Cs()}},te=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>te(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||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 ke(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Hs(t,Us(e.names))),i;default:return Vo(e,(e,r)=>(a(e,n,Hs(t,Us(r))),e)),i}},ne=(e,t,n,r)=>{let i=Hs(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=te(n,i),c={...Cs(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(ys(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(bs(e.name,n,t.name))).map(e=>Ss(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(xs(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=xs(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},h=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Cs(),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=ne(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:h,toOperand:o}},Js=(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`?Js(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Cs(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>ws(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ts(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Ys=(t,n,r,i)=>{let a=qs(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Js(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.B(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.B(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Mo([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?Js(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.L(r)}})),...r],i);if(u.length>0)throw e.L(u,!1,void 0,i)},Xs=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Zs=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Qs=/* @__PURE__ */ new Set([...Xs,...Zs,`Enabled`]),$s=/* @__PURE__ */ new Set([`~>`,`-+->`]),ec=/* @__PURE__ */ new Set([...$s,`\\cdot`]),tc=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),nc=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),rc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},ic=(e,t)=>tc.has(e)||t.builtins.get(e)?.isStateLevel===!0,ac=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Xs.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Zs.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&$s.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Qs.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&ec.has(e.operator))&&(r[0]|=1),Qs.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=rc(e);if(u!==void 0&&!E(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel)&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{ic(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),nc.has(u)&&(r[0]|=8),!a&&ic(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=32)}}ke(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},oc=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],sc=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},cc=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),lc=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=ac(oc(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=sc(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=sc(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!cc(t[e],l[e*r])))),p=sc(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},uc=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?dc(oc(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},dc=(e,t)=>{let n=t.facts.words,r=ac(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=uc(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}cc(e.callee,r[0])||(i[0]|=r[0]&14)}),i},fc=(e,t)=>!(uc(e,t)[0]&1),pc={any:2,repeated:4,streamed:8},mc=(e,t,n=`any`)=>(uc(e,t)[0]&pc[n])!==0,hc=(e,t)=>{let n=uc(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},gc=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},_c=(e,t)=>{let n=dc([e],t);return n[0]&16?void 0:gc(n)},vc=(e,t)=>!!(dc([e],t)[0]&1),yc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=rr.sets,a=i??[],o=a.length;rr.sets=a;try{return n()}catch(e){throw gd(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,rr.sets=i}},bc=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},xc=e=>!e.includes(void 0),Sc=e=>e.variables.map(()=>void 0),Cc=(e,t,n)=>{let r=[...e];return r[t]=n,r},wc=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Tc=e=>e.kind===`Identifier`?e.name:void 0,Ec=(e,t,n)=>{if(t.kind===`Label`)return Ec(e,t.body,n);let r=Tc(t);if(r===void 0)return;let i=lu(n,r);if(i?.kind===`Thunk`)return Ec(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Ku(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Ec(e,o.body,o.scope):void 0},Dc=(e,t,n)=>{if(t.kind===`Prime`)return Ec(e,t.expression,n);if(t.kind===`Label`)return Dc(e,t.body,n);let r=Tc(t);if(r===void 0)return;let i=lu(n,r);if(i?.kind===`Thunk`)return Dc(e,i.expression,i.scope);if(i)return;let a=Ku(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Dc(e,a.body,a.scope):void 0},Oc=t=>{if(typeof t!=`boolean`)throw new e._(`TLC expected a boolean expression.`);return t},kc=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Ac=(e,t,n)=>{t===void 0?xc(n)&&e.onState(n):xc(n)&&kc(e)?Mc(e,t,n):t.kind===`Predicate`?Nc(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Hc(e,t.expression,t.rest,t.scope,n):jc(e,t,n)&&Ac(e,t.rest,n)},jc=(e,t,n)=>{let r=e.environment,i=H(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return H(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?su(t,r.runtime.version):t}})();return!At(i,a)},Mc=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Hc(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!jc(e,r,n):!Oc(H(r.expression,bc(e,r.scope,n))))return}e.onState(n)},Nc=(t,n,r,i,a)=>yc(t,n,()=>{switch(n.kind){case`Let`:Nc(t,n.body,r,ld(n.definitions,bc(t,i,a)),a);return;case`Label`:Nc(t,n.body,r,i,a);return;default:if(Bc.has(n.kind))throw new e._(`The state relation is not a boolean expression.`);yc(t,n,()=>Vc(t,n,r,i,a))}}),Pc=(e,t,n,r)=>{Oc(t)&&Ac(e,n,r)},Fc=(e,t,n,r,i)=>{let a=bc(e,r,i);if(t.kind===`Identifier`){let o=lu(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Nc(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Nc(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Ku(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&fc(s,e.environment))){Nc(e,c.body,n,c.scope,i);return}Pc(e,H(t,a),n,i);return}let o=qu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Nc(e,o.body,n,ad(o,t.args,a),i):Pc(e,H(t,a),n,i)},Ic=(e,t,n,r,i)=>{let a=n[r];a===void 0?Ac(e,t,Cc(n,r,i)):At(a,i)&&Ac(e,t,n)},Lc=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Rc=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?Ec(t,o,i):Dc(t,o,i),l=bc(t,i,a);if(c===void 0){H(n,l)===!0&&Ac(t,r,a);return}let u=H(s,l),d=a[c];if(n.operator===`=`){Ic(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)H(n,l)===!0&&Ac(t,r,a);else{if(!jn(f))throw new e._(`The right side of \\IN is not enumerable.`);for(let e of Wn(f))Ac(t,r,Cc(a,c,e))}},zc=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Bc=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Vc=(t,n,r,i,a)=>{let o=bc(t,i,a);switch(n.kind){case`Identifier`:Fc(t,n,r,i,a);return;case`Apply`:if(zc.has(n.operator)&&n.args.length===2){Rc(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(Oc(H(n.args[0],o))){Nc(t,n.args[1],r,i,a);return}Ac(t,r,a);return}Fc(t,n,r,i,a);return;case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Lc(`Predicate`,t,i,e),r);Nc(t,e[0],n,i,a);return}let o=e[e.length-1];Nc(t,wc(n,e.length-1),Lc(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>Nc(t,e,r,i,a));return}Nc(t,wc(n,e.length-1),r,i,a),Nc(t,e[e.length-1],r,i,a);return}case`Exists`:Du(n.bounds,o,e=>(Nc(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(Du(n.bounds,o,t=>(e.push(t),!1)),e.length===0){Ac(t,r,a);return}let i=e.slice(1).reduce((e,t)=>Lc(`Predicate`,n.body,t,e),r);Nc(t,n.body,i,e[0],a);return}case`If`:Nc(t,Oc(H(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>Oc(H(e.condition,o)))?.body??n.other;if(s===void 0)throw new e._(`TLC encountered a CASE with no conditions true.`);Nc(t,s,r,i,a);return}case`FunctionApplication`:{let e=Mu(H(n.function,t.isInit?o:pu(o)));if(e){Nc(t,e.body,r,Nu(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){Hc(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){Nc(t,n.action,r,i,a),Hc(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){Nc(t,n.action,Lc(`Changed`,n.subscript,i,r),i,a);return}}Pc(t,H(n,o),r,a)},Hc=(e,t,n,r,i)=>yc(e,t,()=>{let a=Ec(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Ic(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Ac(e,n,i);return}let s=o.reduceRight((e,t)=>Lc(`Unchanged`,t,r,e),n);Hc(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=lu(r,t.name);if(a?.kind===`Thunk`){Hc(e,a.expression,n,a.scope,i);return}let o=a?void 0:Ku(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Hc(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});At(s,c)&&Ac(e,n,i)}),Uc=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Wc=/* @__PURE__ */ Error(`The replay found a successor`),Gc=(e,t,n,r)=>{let i=Uc(r,!1,n,()=>{throw Wc},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Lc(`Changed`,e.subscript,t,void 0);Nc(i,e.action,n,t,Sc(r))}else Nc(i,e,void 0,t,Sc(r));return!1}catch(e){if(e!==Wc)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Kc=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Uc(t,!0,void 0,n),o=i.reduceRight((e,t)=>Lc(`Predicate`,t.expression,t.scope,e),void 0);Nc(a,r.expression,o,r.scope,Sc(t))},qc=(e,t,n,r)=>{e.some(e=>Bc.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Uc(n,!1,t,e=>i.push(e));Nc(a,e.expression,void 0,e.scope,Sc(n)),i.forEach(t=>r(t,e))})},Jc=/* @__PURE__ */ new WeakMap,Yc=/* @__PURE__ */ new WeakMap,Xc=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Zc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Qc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,$c=(t,n)=>{let r=new e._(n);return t.isInit?r:e.q(r,e.G.error)},el=(e,t,n,r)=>{let i=Zl(n);return r&&Bc.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Qc(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},tl=(e,t,n)=>{let r=gi(t),i=B(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Qc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
138
+ `:``}${i}`},nl=(e,t,n)=>rl(e,t,H(t,n)),rl=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw $c(e,el(e,n,t,r))},il=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=yd(n,r.environment))(r),al=e=>e===`=`||e===`\\in`||e===`\\subseteq`,ol=(e,t,n)=>{let r=n?Jc:Yc,i=r.get(e);if(i)return i;let a=Ll(e,t,n);return r.set(e,a),a},sl=(e,t)=>{if(t.constants.has(e))return;let n=gu(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},cl=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return cl(e.expression,t,!1,r);if(e.kind!==`Identifier`||E(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=sl(e.name,t);if(a&&!r.has(a))return r.add(a),cl(a.body,t,n,r)},ll=(e,t,n)=>cl(e,t,!n),ul=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ul(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=ld(e.definitions,Xc(r,t,n));return ul(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=lu(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return ul(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=sl(e.name,r.environment);if(s)return ul(s.body,void 0,n,r,i)},dl=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||E(e))||!t&&e.kind===`Prime`,fl=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>fl(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=sl(e.name,t);if(i)return n.add(e.name),fl(i.body,t,n)},pl=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ml=(e,t,n)=>pl.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||al(e.operator)&&(dl(e.args[0],n)||ll(e.args[0],t,n)!==void 0)||E(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,hl=/* @__PURE__ */ new Set,gl=(e,t)=>{if(E(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Vo(e,(e,i)=>{let a=r.isReadOnly?gl(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},_l=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||E(e)?void 0:gu(r,t);return i&&!n.has(i)&&(n.add(i),_l(i.body,t,n))?!0:ke(e).some(e=>_l(e,t,n))},vl=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=ll(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=fl(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return ml(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ol(e,t,n)}},yl=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(_c(e,t)===void 0||_l(e,t,/* @__PURE__ */ new Set))return!0;let n=gl(e,hl);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},bl=(e,t,n)=>{let r=e.map(e=>vl(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=kc(t);for(let s=e;s<r.length;s++){if(s>0&&f&&zl(u)){d??=Xc(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=il(a,e,n,d);if(!rl(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Xc(t,n,u);let r=il(i,s,e.expression,d);if(!rl(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Xc(t,n,u);let r=il(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Zc(u,e.index,r),d=void 0;else if(!At(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let t of e.indices){let e=(r??u)[t];if(e===void 0)r??=u.slice(),r[t]=n[t];else if(!At(e,n[t]))return}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},xl=e=>(t,n,r,i,a,o)=>{nl(t,e,Xc(t,n,r))&&o(r,i)},Sl=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Xc(r,i,a);if(a[l]!==void 0){nl(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!jn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Qc(r)}, the right side of \\IN is not enumerable.`;throw $c(r,`${t}\n${B(e)}`)}let p=Wn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Zc(a,l,p[e]),o)}},Cl=/* @__PURE__ */ new WeakMap,wl=e=>{let t=Cl.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(wl),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Cl.set(e,n),n},Tl=(e,t)=>{let n=e.args[0],r=xl(e),i=(e,r,i)=>ul(n,r,i,e,!t)??-1,a=Sl(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=H(e.args[1],Xc(t,n,o));l(Zc(o,u,d),s)}},El=(e,t,n)=>{let r=B(e);return(i,a,o,s,c,l)=>{let u=Xc(i,a,o),d=H(e.function,n?u:pu(u)),f=Mu(d);if(f!==void 0){ol(f.body,t,n)(i,Nu(f,e,u),o,s,c,l);return}if(!k(d))throw $c(i,`In computing ${Qc(i)}, a non-function (${gi(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw $c(i,`In computing ${Qc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Dl=(e,t)=>{if(fl(e,t))return bl([wl(e)],t,!1);if(e.kind===`Tuple`)return ol(wl(e),t,!1);let n=wl(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?lu(i,e.name):void 0;l?.kind===`Thunk`&&!l.isReleased?ol(wl(l.expression),t,!1)(r,l.scope,a,o,s,c):nl(r,n,Xc(r,i,a))&&c(a,o)}},Ol=(e,t,n)=>{let r=e.operator,i=xl(e),a=E(e)?void 0:Ku(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=wd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=ol(a.body,t,n),o.body(e,i(Xc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Xc(a,o,s),f=qu(e,d);f?.kind===`Closure`?ol(f.body,t,n)(a,ad(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},kl=(e,t,n)=>{let r=xl(e),i=E(e)?void 0:sl(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=lu(s,e.name);f?.kind===`Thunk`&&!f.isReleased?ol(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=ol(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Al=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||E(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!E(i))return;let a=cl(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},jl=e=>e.kind===`And`?e.operands.flatMap(jl):[e],Ml=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&ml(e,t,!1),Nl=e=>{let t=[];return(n,r,i)=>{let a=Xc(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!rl(n,i,il(t,r,i,a)))return}}},Pl=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=jl(e),r=n.findIndex(e=>!Ml(e,t)||Al(e,t)),i=r===-1?void 0:Al(n[r],t);return i?{...i,before:r===0?void 0:Nl(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Pl(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||E(e))return;let r=Ku(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Pl(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!E(o))return;let s=i.before,c=s&&wd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Xc(e,t,n)),n))}},Fl=(e,t,n)=>{let r=lu(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Il=(e,t,n)=>{let r=e.map(e=>ol(e,t,n)),i=n?[]:e.map(e=>Pl(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Fl(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Ll=(t,n,r)=>{let i=e=>ol(e,n,r);switch(t.kind){case`And`:return bl(t.operands,n,r);case`Or`:return Il(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=bu(H(a.set,Xc(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,uu(i,t,u[n]),o,s,c,l)}}let o=r?void 0:yl(t,n);if(o){let e=bl(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=Xc(r,i,a),d=t.bounds.map(e=>bu(H(e.set,u),e.set,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=uu(n,o.names[t],e);if(t===d.length-1){let e=Xc(r,i,a);if(!o.guards.every(t=>nl(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{Du(t.bounds,Xc(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&_c(t,n)!==void 0&&!_l(t.body,n,/* @__PURE__ */ new Set)?gl(t,hl):void 0;return(n,r,i,o,s,c)=>{let l=[];Du(t.bounds,Xc(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>lu(r,e)?.kind===`Value`)){u.every(e=>nl(n,t.body,Xc(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&zl(i)?u.slice(r).every(e=>nl(n,t.body,Xc(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=H(t.condition,Xc(r,i,a));if(typeof l!=`boolean`)throw $c(r,tl(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=Xc(r,i,a),u=e.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw $c(r,`In computing ${Qc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${gi(t)}) was used as a guard condition of a CASE.\n${Zl(e.source)}`)})?.body??n;if(!u)throw $c(r,`In computing ${Qc(r)}, TLC encountered a CASE with no conditions true.\n${B(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=dd(t.definitions,n);return(n,i,a,o,s,c)=>e(n,ld(t.definitions,Xc(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e._(`UNCHANGED appears in an initial predicate at ${Yl(t)}`)}:Dl(t.expression,n);case`AngleAction`:{let e=i(t.action),r=wl(t.subscript),a=(e,t,i)=>{try{return nl(e,r,Xc(e,t,i))}catch(t){throw e.isEnabled?su(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return i({kind:`Or`,operands:[t.action,wl(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return kl(t,n,r);case`FunctionApplication`:return El(t,n,r);case`Apply`:{let e=t.args;if(al(t.operator)){let i=ll(e[0],n,r);if(i!==void 0)return t.operator===`=`?bl([t],n,r):Sl(t,()=>i);if(dl(e[0],r))return Tl(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=H(e[0],Xc(n,r,i));(typeof c==`boolean`?c:hu(c,`the left side of => at ${Yl(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return Ol(t,n,r)}default:return xl(t)}},Rl=e=>e.variables.map(()=>void 0),zl=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Bl=(t,n)=>{let r=n.state;if(!r||!zl(r))throw new e._(`ENABLED needs a complete state at ${Yl(t)}`);let i=n.environment;if(i.callStack)return Gc(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return ol(t,i,!1)(a,n.scope,Rl(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Vl=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};ol(t,n,!0)(a,i,Rl(n),void 0,!1,t=>{if(!a.isStopped){if(!zl(t))throw e.q(new e.v([...t]),e.G.error);a.isStopped=r(t)}})},Hl=(e,t,n)=>{let r=[];return Vl(e,t,e=>(r.push(e),!1),n),r},Ul=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return ol(t,r,!1)(o,a,Rl(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!zl(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.y(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}s.successors++,o.isStopped=i({state:t,action:n})}}),s.successors},Wl=(e,t,n,r)=>{let i=[];return Ul(e,t,n,e=>(i.push(e),!1),r),i},Gl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Kl=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),ql=e=>Kl.has(e.kind)||e.kind===`Apply`&&Gl.has(e.operator),Jl=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&Be(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Yl=e=>`line ${e.location.line}, column ${e.location.column}`,Xl=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,B=e=>{let t=e.location.range;return t?Xl(t):Yl(e)},Zl=e=>e.kind===`Number`?e.text??String(e.value):B(e),Ql=(t,n)=>new e._(`A non-boolean expression (${gi(n)}) was used as the condition of an IF.\n${B(t)}`),$l=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e._(`A non-boolean expression (${gi(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Zl(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e._(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${gi(r)}.\n${B({...t,location:{...t.location,range:{...i,end:a}}})}`)},eu=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${I(e)}\n${B(t)}`,i=e=>`Attempted to apply function:\n${D(I(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!k(a))throw new e._(`Attempted to select field "${n}" from a non-record value ${D(I(a))}\n${B(t)}`);let o=St(a);if(o===`tuple`)throw pr(n);return gr(a,n,o===`record`?r:i)}},tu=e=>e===`1.7.4`?(t,n)=>ur(t,n,e):void 0,nu=t=>n=>{if(!k(n))throw new e._(`Attempted to apply the operator DOMAIN to a non-function\n(${gi(n)})\n${B(t)}`);return vr(n)},ru=(t,n)=>(r,i)=>{if(!O(r)||ut(r))throw new e._(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${B(t)}`);return n.evaluate([r,i])},iu=t=>e.q(new e._(`TLC can't handle real numbers: ${t.text} at ${Yl(t)}`),e.G.configParseError),au=t=>e.q(new e._(`TLC can't handle a number this big: ${t.text??t.value} at ${Yl(t)}`),e.G.error),ou=(t,n)=>new e.A(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${B(n)}`,t),su=(t,n)=>t instanceof e.A&&n!==`1.7.4`?new e._(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,cu=t=>new e._(`A primed expression appears outside an action at ${Yl(t)}`),lu=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},uu=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),du=(t,n,r)=>{if(n.kind===`Name`)return uu(t,n.name,r);let i=tr(r);if(!i||i.length!==n.names.length)throw new e._(`Cannot bind <<${n.names.join(`, `)}>> to ${I(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>uu(e,t,i[n]),t)},fu=(t,n)=>{if(k(t))return t;throw new e._(`A non-function (${gi(t)}) was applied as a function.\n${B(n)}`)},pu=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},mu=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),hu=(t,n)=>{if(typeof t!=`boolean`)throw new e._(`Expected ${n} to be a boolean but found ${I(t)}`);return t},gu=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),_u=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},vu=(t,n,r)=>{if(!O(t)||ut(t)){let i=I(t),a=r===`1.7.4`?void 0:_u(t,i);throw new e._(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Zl(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Zl(n)}\n${a}`)}},yu=(e,t,n)=>(vu(e,t,n),typeof e==`object`&&e.kind===`Interval`?Tn(e):Rn(e)??Un(e)),bu=(e,t,n)=>n===`1.7.4`?(vu(e,t,n),Rn(e)??Wn(e)):yu(e,t,n),xu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Zn(e),e},Su=(e,t,n)=>xu(e)??bu(e,t,n),Cu=(e,t,n)=>xu(e)??yu(e,t,n),wu=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Tu=(e,t)=>e.map(e=>Su(H(e.set,t),e.set,t.environment.runtime.version)),Eu=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):wu(t[n],t=>i(n-1,du(a,e[n].pattern,t)));return i(e.length-1,n)},Du=(e,t,n)=>Eu(e,Tu(e,t),t.scope,n),Ou=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},ku=(e,t,n)=>{if(e.length===1)return du(t,e[0].pattern,n);let r=tr(n)??[];return e.reduce((e,t,n)=>du(e,t.pattern,r[n]),t)},Au=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,ju=e=>Object.assign(e.value,{lambda:e}),Mu=e=>Au(e)?e.lambda:void 0,Nu=(t,n,r)=>{let i=t.value,a=n.args.map(e=>H(e,r)),o=a.length===1?a[0]:j(a),s=(e,t,r)=>`In applying the function\n${D(I(i))},\nthe ${e} is:\n${D(I(t))}${r}.\n${B(n.function)}`,c=t.bounds;if(c.length===1){if(!ar(o,i.domain))throw new e._(s(`first argument`,o,`which is not in its domain`));return ku(c,t.scope,o)}let l=tr(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e._(`Attempted to apply a function to an argument not in its domain.\n${B(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!ar(r,u[n]))throw new e._(s(i,r,`${t.pattern.kind===`Name`?``:`
139
+ `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&tr(r)?.length!==t.pattern.names.length)throw new e._(s(i,r,`which does not match its formal parameter`))}),ku(c,t.scope,j(l.slice(0,c.length)))},Pu=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Xl(n)}},Fu=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Iu=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},Lu=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Ru=(e,t)=>{let n=Ou(e.bounds,t),r=Iu(n,(n,r)=>H(e.body,mu(t,ku(e.bounds,uu(void 0,e.name,r),n))),Fu(Pu(e.bounds,e.body),e.bounds,n));return ju({value:r,bounds:e.bounds,body:e.body,scope:uu(void 0,e.name,r)}),e.bounds.length===1?Ct(r):r},zu=(t,n)=>{if(typeof n!=`object`||St(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Be(n.domain))return n;try{let e=F(n);return yt(e.domain,e.range)}catch(t){if(t instanceof e._)return n;throw t}},Bu=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e._(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>Ru(t,e):yd(Lu(t),n):yd(t.body,n),Vu=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Bu(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(mu(e,void 0)):e=>a[i]??r(mu(e,void 0));return t.definitionEvaluators.set(e,o),o},Hu=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Uu=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!fc(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>zu(t,Bu(t,n)(a)));ln(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e._)&&!e.W(t))throw t}}),Wu=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(e.cache!==void 0&&(n||e.isReleased))return e.cache;let r=H(e.expression,mu(t,e.scope));return n&&(!e.isStreamed||Kn(r))&&(e.cache=r),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),r},Gu=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Ku=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Ku(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Gu(r):t.builtins.get(e)},qu=(e,t)=>E(e)?Ju(e.operator,t):Ku(e.operator,t.environment)??Ju(e.operator,t),Ju=(e,t)=>{let n=lu(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Ku(e,t.environment)},Yu=e=>e.kind===`Closure`?e.params.length:e.arity,Xu=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:Ju(r,n);if(!i)throw new e._(`Expected an operator argument at ${Yl(t)}`);return i},Zu=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>uu(e,n.name,t[r]),e.scope);return H(e.body,mu(n,r))},Qu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Yu(e),call:n=>Zu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},$u=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ju(e.name,t);return n!==void 0&&Yu(n)>0},ed=(e,t)=>e.map(e=>$u(e,t)?Qu(Xu(e,t),t):H(e,t)),td=(t,n)=>new e._(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),nd=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),rd=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return rd(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},id=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ue(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=E(e)?void 0:rd(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=lu(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:nd(e,t)}}return t=>nd(e,t)},ad=(e,t,n,r)=>{if(t.length!==e.params.length)throw td(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:Xu(t[a],n)}:(r?.[a]??id(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},od=(e,t,n,r)=>e.kind===`Closure`?H(e.body,mu(n,ad(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(Sd(t,n),n):e.evaluate(ed(t,n),n),sd=/* @__PURE__ */ new WeakMap,cd=e=>{let t=sd.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return sd.set(e,n),n},ld=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:cd(r),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),ud=(t,n,r)=>{let i=lu(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Wu(i,r);if(i?.kind===`Operator`){if(Yu(i.operator)===0)return Zu(i.operator,[],r);throw new e._(`Operator ${t} is used without arguments`)}let a=rd(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw ou(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Vu(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e._(`Unknown identifier ${t} at ${Yl(n)}`)},dd=(e,t)=>({impure:new Set(e.filter(e=>mc(e,t))),streamed:new Set(e.filter(e=>mc(e,t,`streamed`)))}),fd=e=>[...e.facts.ids.keys()].some(t=>mc(t,e)),pd=e=>[...e.facts.ids.keys()].some(t=>mc(t,e,`repeated`)),md=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,hd=(e,t,n,r)=>i=>{r.expressions.push(e);let a=rr.sets,o=rr.callStack,s=a??[],c=s.length;rr.sets=s,rr.callStack=r;try{let a=t(i),o=md(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&ql(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Jl(e,r.values),a=i&&!ke(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!k(a)?void 0:a;throw gd(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,rr.sets=a,rr.callStack=o}},gd=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e._){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},_d=(t,n,r)=>{if(!(r instanceof e._))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},vd=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Bd(e,t),i=t.callStack,a=i?hd(e,r,t,i):r;return t.evaluators.set(e,a),a},yd=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Bi(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>yd(e,t.environment)(t),bd=(e,t)=>{let n=e.name,r=E(e)?void 0:rd(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw ou(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n={reference:void 0};return r=>(n.reference??=Vu(e,t))(r)}return t=>ud(n,e,t)},xd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||E(e))return!0;let n=Ku(e.name,t);return n===void 0||Yu(n)===0},Sd=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Cd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Sd(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&xd(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&xd(t[0],n)&&xd(t[1],n);if(i&&a){let e=V(t[0],n),r=V(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(ed(t,n),n)},wd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw td(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:id(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:Xu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Td=(e,t,n)=>{let r=wd(e,t,n),i={body:void 0};return t=>(i.body??=yd(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Ed=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=V(r[0],n),t=V(r[1],n);return n=>!hu(e(n),`the left side of =>`)||hu(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e._(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=E(t)?void 0:Ku(t.operator,n);if(i?.kind===`Closure`)return Td(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=V(r[0],n),i=nu(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=V(r[0],n);return Po.has(t)||vc(r[0],n)?e:t=>t.scope===void 0?i.evaluate([e(t)]):e(t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=V(r[0],n),a=V(r[1],n),o=ru(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Cd(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e._(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a=r.map(e=>id(e,n));return i=>{let o=Ju(t.operator,i);if(o)return od(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e._(`${t.operator} is a function; apply it with brackets`):new e._(`Unknown operator ${t.operator} at ${Yl(t)}`)}},Dd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=V(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=V(a.set,t);return s=>wu(Su(o(s),a.set,t.runtime.version),t=>hu(i(mu(s,uu(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>V(e.set,t));return s=>{let c=a.map((e,n)=>Su(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?hu(i(mu(s,a)),r)!==n:wu(c[t],n=>l(t-1,uu(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Du(o,e,t=>hu(i(mu(e,t)),r)!==n)?!n:n},Od=(e,t)=>{if(e.kind===`Tuple`)return j(e.names.map(e=>{let n=lu(t,e);return n?.kind===`Value`&&n.value}));let n=lu(t,e.name);return n?.kind===`Value`?n.value:void 0},kd=/* @__PURE__ */ new WeakSet,Ad=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&kd.add(e)},jd=/* @__PURE__ */ new WeakMap,Md=e=>{if(jd.has(e))return jd.get(e);let t=/* @__PURE__ */ new Set,n=e=>e.kind!==`Subexpression`&&(e.kind===`Identifier`&&t.add(e.name),(e.kind===`Apply`||e.kind===`OperatorReference`)&&t.add(e.operator),e.kind===`ExceptAt`&&t.add(`@`),ke(e).every(n)),r=n(e)?[...t]:void 0;return jd.set(e,r),r},Nd=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=lu(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Pd=(t,n)=>{let r=kd.has(t),i=V(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=V(o.set,n),l=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=Dn(e),a=yt(r,r.map(e=>i(mu(t,uu(t.scope,n,e)))));return Be(e)?a:Ct(a)}let n=[],r=a.map(e=>Cu(H(e.set,t),e.set,t.environment.runtime.version));return Eu(a,r,t.scope,e=>{let r=a.length===1?Od(o.pattern,e)??!1:j(a.map(t=>Od(t.pattern,e)??!1));return n.push([r,i(mu(t,e))]),!1}),vn(n)},u=Pu(a,t.body),d=Md(t.body),f=(e,n)=>{let r=Nd(n.scope,d),o=mu(n,r),s=ju({value:Iu(e,e=>i(mu(o,ku(a,r,e))),Fu(u,a,e)),bounds:a,body:t.body,scope:r});return a.length===1?Ct(s):s},p=n.callStack;return n=>{let i=s?c(n):Ou(a,n);if(t.isRecursive||r||n.isKeepLazy||!M(i))return f(i,n);if(!Be(i)){if(p)return f(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e._))throw t;return f(i,n)}}if(!p)return l(i,n);try{return l(i,n)}catch(e){throw _d(p,t,e),e}}},Fd=(e,t)=>{let n=kd.has(e);n&&Ad(e.function);let r=V(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):j(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(mu(i,uu(i.scope,`@`,e))):yr(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(Vi.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${B(e.function)}`)}return n}},Id=(t,n)=>{if(t.kind===`SetFilter`){let e=V(t.predicate,n),r=V(t.bound.set,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:Xl(a)},s=(e,t)=>n=>hu(e(mu(t,du(t.scope,i,n))),`a set filter predicate`),c=(e,n,r)=>({kind:`FilteredSet`,base:e,test:s(r,n),source:o,rebind:r=>c(e,{...n,environment:r},V(t.predicate,r))});return t=>{let n=r(t);return Be(n)?vt(N(n).elements.filter(s(e,t))):c(n,t,e)}}if(t.kind===`SetMap`){let e=V(t.expression,n);return n=>{let r=[];return Du(t.bounds,n,t=>(r.push(e(mu(n,t))),!1)),pn(r)}}let r=t.set;if(!r)return()=>{throw new e._(`TLC cannot evaluate an unbounded CHOOSE at ${Yl(t)}`)};let i=V(t.body,n),a=V(r,n);return n=>{let o=a(n);if(!O(o)||ut(o))throw new e._(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${B(t)}`);let s={value:void 0},c=Cu(o,r,n.environment.runtime.version);if(wu(c,e=>{let r=du(n.scope,t.pattern,e);return hu(i(mu(n,r)),`the body of CHOOSE`)?(s.value=Od(t.pattern,r),!0):!1}),s.value===void 0)throw new e._(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${B(t)}`);return s.value}},Ld=e=>[...e].sort((e,t)=>ht(e.name,t.name)),Rd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),zd=(e,t)=>{let n=Ld(e),r=Rd(n),i=n.map(e=>V(e.value,t));if(r)return e=>kn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>qe(a,i.map(t=>t(e)),o):e=>An(a,i.map(t=>t(e)))},Bd=(t,n)=>{let r=e=>V(e,n);switch(t.kind){case`Number`:{let e=t.value;return Ue(e)?()=>e:()=>{throw au(t)}}case`Decimal`:return()=>{throw iu(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return bd(t,n);case`Apply`:return Ed(t,n);case`Bracket`:return()=>{throw new e._(`A bracket without a function or subscript is not an expression at ${Yl(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e._(`An operator cannot be used as a value at ${Yl(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw $l(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw $l(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw cu(t);return e({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let e=r({kind:`Prime`,expression:t.expression,location:t.location}),n=r(t.expression);return t=>At(e(t),n(t))}case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw Ql(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e._(`A non-boolean expression (${gi(n)}) was used as a condition of a CASE. ${Zl(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e._(`Attempted to evaluate a CASE with no conditions true.\n${B(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(mu(n,ld(t.definitions,n)))}case`Forall`:case`Exists`:return Dd(t,n);case`UnboundedQuantifier`:return()=>{throw new e._(`TLC cannot evaluate an unbounded quantifier at ${Yl(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Id(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>pn(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>j(e.map(e=>e(t)))}case`FunctionConstruction`:return Pd(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return zd(t.fields,n);case`RecordSet`:{let e=Ld(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return Fd(t,n);case`ExceptAt`:return n=>{let r=lu(n.scope,`@`);if(r?.kind!==`Value`)throw new e._(`@ appears outside an EXCEPT at ${Yl(t)}`);return r.value};case`FunctionApplication`:{Ad(t.function);let e=r(t.function),i=n=>fu(e(pu(n)),t),a=t.args.map(r),o=tu(n.runtime.version);if(a.length===1){let e=a[0];return t=>gr(i(t),e(t),o)}return e=>gr(i(e),j(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=eu(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let e=r(t.action),n=r({kind:`Unchanged`,expression:t.subscript,location:t.location}),i=t.kind===`BoxAction`;return t=>i?hu(e(t),`an action`)||n(t):hu(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>Bl(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e._(`The subexpression reference at ${Yl(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e._(`TLC cannot evaluate a temporal formula in a state at ${Yl(t)}`)}}},Vd=`tlc2/value/impl/`,Hd={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Ud={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},Wd=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},Gd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Kd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],qd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Gd.get(e[3])}${`[]`.repeat(e[1].length)}`),Jd=(e,t)=>e[e[t].first].text,Yd=(e,t)=>Jd(e,t).replaceAll(`/`,`.`),Xd=t=>{let n=Wd(t);if(n.readUint32()!==3405691582)throw new e.O(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===Hd.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Hd.integer?i.value=n.readInt32():t===Hd.float?n.readUint32():t===Hd.long||t===Hd.double?(n.readBytes(8),e++):t===Hd.class||t===Hd.string||t===Hd.methodType||t===Hd.module||t===Hd.package?i.first=n.readUint16():t===Hd.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Yd(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=qd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:Wd(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Yd(r,d.readUint16())):[],p=Kd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=qd(i.slice(a+1))[0],ee=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${ee}`})}return{pool:r,methods:s}},Zd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Jd(e,n.first),name:e[r.first].text}},Qd=(t,n,r,i)=>{let a=()=>new e.j(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===Hd.integer)return t.value;if(t.tag===Hd.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=Ud.iconstM1&&t<=Ud.iconst5)s.push(t-Ud.iconst0),e+=1;else if(t===Ud.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===Ud.sipush)s.push(r()<<16>>16),e+=3;else if(t===Ud.ldc)s.push(l(o[e+1])),e+=2;else if(t===Ud.ldcW)s.push(l(r())),e+=3;else if(t===Ud.dup){let t=c();s.push(t,t),e+=1}else if(t===Ud.getstatic){let t=Zd(n,r());if(t.className!==`${Vd}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===Ud.invokestatic){let t=Zd(n,r()),o=c();if(t.className!==`${Vd}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===Ud.new)s.push({className:Jd(n,r()),value:void 0}),e+=3;else if(t===Ud.invokespecial){let t=Zd(n,r()),o=c(),s=c();if(!(t.className===`${Vd}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===Ud.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},$d=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Xd(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Qd(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},ef=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),tf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],nf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),rf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),af=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),of=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),sf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
140
140
  Nat == { }
141
141
  a+b == {a, b}
142
142
  a-b == CHOOSE n : b + n = a
@@ -452,9 +452,9 @@ _CheckName(name) ==
452
452
  => (PrintT(counts) /\\ FALSE)
453
453
  _PrintCounts == PrintT(_Counts)
454
454
  =============================================================================
455
- `]]),$d=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),ef=v(`EOF`),tf=v(`IDENTIFIER`),nf=v(`DEFBREAK`),rf=(e,t)=>Array.from({length:v(t)-v(e)+1},(t,n)=>v(e)+n),af=new Set(rf(`op_57`,`op_119`)),of=new Set(rf(`op_1`,`op_119`)),sf=new Set(rf(`op_57`,`op_70`)),cf=/* @__PURE__ */ new Set([...rf(`ACTION`,`EXCEPT`),v(`EXTENDS`),...rf(`IF`,`SF`),v(`STATE`),...rf(`THEN`,`WITH`),v(`US`),...rf(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),lf=new Map([...U(`postfix`,160,160,!0,`[`),...U(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...U(`prefix`,120,120,!1,`-.`),...U(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...U(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...U(`prefix`,40,40,!0,`\\lnot`),...U(`nfix`,100,130,!0,`\\times`),...U(`infix`,140,140,!1,`^`,`^^`),...U(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...U(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...U(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...U(`infix`,100,110,!0,`|`,`||`,`%%`),...U(`infix`,100,110,!1,`%`),...U(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...U(`infix`,90,140,!1,`\\wr`),...U(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...U(`infix`,90,130,!1,`!!`),...U(`infix`,90,90,!1,`...`,`..`),...U(`infix`,80,80,!0,`\\intersect`,`\\union`),...U(`infix`,80,80,!1,`\\`),...U(`infix`,70,70,!1,`<:`,`:>`),...U(`infix`,60,60,!0,`@@`),...U(`infix`,50,140,!0,`\\cdot`),...U(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...U(`infix`,30,30,!0,`\\land`,`\\lor`),...U(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...U(`infix`,10,10,!1,`=>`)]),uf=new Map([...lf,...qd.flatMap(e=>e.slice(1).map(t=>[t,lf.get(e[0])]))]),df=uf.get(`[`),ff={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},pf=e=>({type:`tokens`,kinds:new Set(e)}),mf=e=>typeof e==`string`?e.startsWith(`<`)?pf([v(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(mf)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),hf=e=>(...t)=>({type:e,body:W(...t)}),K=hf(`zeroOrMore`),gf=hf(`oneOrMore`),q=hf(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),_f=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),vf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=_f(e,n);return n},yf=(...e)=>{let t=e.map(v);return e=>t.includes(vf(e,1).kind)},bf=(e,t=vf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},xf=e=>{let t=vf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Sf=e=>yf(`CASESEP`)(e)&&bf(e),Cf=e=>{let t=vf(e,1);cf.has(t.kind)&&(t.kind=tf)},wf=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Tf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Ef=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Df=e=>e.operatorStacks[e.operatorStacks.length-1],Of=(e,t)=>e.low>t.high,kf=(e,t)=>e.high<t.low,Af=e=>e.fix===`prefix`?e:uf.get(`${e.name}.`),jf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===df?Tf(`FcnAppl`,[n,...r.node.heirs]):Tf(`PostfixExpr`,[n,r.node]),operator:void 0})},Mf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Tf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Tf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Nf=e=>{let t=Df(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return jf(t,n),Nf(e);if(i.operator!==void 0){let t=Af(r.operator);return t!==void 0&&Of(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${wf(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${wf(e,a.node.first,a.node.last)} and expression at location ${wf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return kf(a.operator,r.operator)?void 0:Of(a.operator,r.operator)?(Mf(t,a.operator),Nf(e)):`Precedence conflict between ops ${a.operator.name} in block ${wf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Af(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(kf(s,r.operator))return;if(!Of(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${wf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Mf(t,s),Nf(e);let c=wf(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===ff?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Pf=e=>J(t=>{let n=Df(t),r=Ef(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Nf(t)}),Ff=Pf(()=>!1),If=Pf(()=>!0),Lf=J(e=>{e.lastOperator=uf.get(e.token.image)}),Rf=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},zf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Rf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Bf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!bf(e,n.first.beginColumn))return n;let t=Bf(e,n);if(t!==void 0)return t}},Vf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(v),n=(e,...t)=>t.some(t=>e.kind===v(t)),r=e=>e!==void 0&&af.has(e.kind),i=e.token,a=_f(e,i);i.next=void 0;let o=_f(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===tf&&(e=e.next)}else if(e.kind===tf){let t=e.next;!r(t)||sf.has(t.kind)||of.has(t.kind)&&t.next?.kind!==tf||(e=t.next?.kind===v(`SUBSTITUTE`)?i:of.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==nf&&(e.next={kind:nf,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=_f(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Hf=e=>{let t=vf(e,1);if(t.kind===v(`LAB`)){let n=1;for(;n!==0;)if(t=_f(e,t),t.kind===v(`LAB`)&&n++,t.kind===v(`RAB`)&&n--,t.kind===ef)return!1;return _f(e,t).kind===v(`IN`)}if(t.kind!==tf)return!1;for(t=_f(e,t);t.kind===v(`COMMA`);){if(t=_f(e,t),t.kind!==tf)return!1;t=_f(e,t)}return t.kind===v(`IN`)},Uf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Wf=e=>e.proofLevels.at(-1)??-1,Gf=e=>{let t=vf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:yf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Wf(e)>=0&&Uf(t)>Wf(e):yf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Kf=(e,t)=>{let n=Uf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},qf=e=>J(t=>Kf(t,t.token)?void 0:`${wf(t,t.token)}: ${e}`),Jf=pf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(v)),Yf=pf([...Jf.kinds,v(`op_76`)]),Xf=pf(of),Zf=pf(sf),Qf=pf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(v)),$f=()=>K(X({expansion:[G(Jf,`<op_77>`)],semantic:bf}),G(`PrefixOp`,`InfixOp`),If),ep=()=>G(W(X({expansion:[`OpenStart`],semantic:bf}),`OpenExpression`,Ff),W(X({semantic:bf}),`ExtendableExpr`)),tp=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),np=()=>G(W(X({semantic:e=>yf(`ASSUME`,`BOXASSUME`)(e)||vf(e,2).kind===v(`COLONCOLON`)&&[v(`ASSUME`),v(`BOXASSUME`)].includes(vf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),rp=()=>[`JuncItem`,K(X({semantic:xf}),`JuncItem`)],ip=e=>J(t=>{t.expecting=e,Cf(t)}),ap=e=>J(t=>{t.isTerminalProof=e}),op=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Vf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),sp={CompilationUnit:Z(void 0,[J(Vf),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),ip(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,ip(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,ip(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(Vf)),W(X({semantic:e=>yf(`USE`)(e)&&vf(e,2).kind!==v(`ONLY`)||yf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(op(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),op(`Expression`,X({expansion:[`<IDENTIFIER>`,Zf]}),`PostfixLHS`,`Expression`),op(`Expression`,X({expansion:[`<IDENTIFIER>`,Xf]}),`InfixLHS`,`Expression`),op(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),op(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[Yf,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,Xf,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,Zf]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,ip(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[Jf,Lf]),NonExpPrefixOp:Z(void 0,[Yf,Lf]),InfixOp:Z(`Infix Op`,[Xf,Lf]),PostfixOp:Z(void 0,[Zf,Lf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Vf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),np(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),np(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=Ef(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${wf(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(Vf),G(W(X({amount:3}),X({semantic:yf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Gf}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>yf(`BY`)(e)||vf(e,2).kind===v(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>vf(e,2).kind!==v(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,ap(!0),q(`<ONLY>`)),W(`<USE>`,ap(!1),q(`<ONLY>`)),W(`<HIDE>`,ap(!1))),Y("an expression, `MODULE' or `DEF'"),q(tp(),K(`<COMMA>`,Y(`MODULE or expression`),tp(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),tp(),K(`<COMMA>`,Y(`MODULE or expression`),tp(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),Qf,qf(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Gf}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),Qf,qf(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:yf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:yf(`INSTANCE`)}),`Instantiation`),W(X({semantic:yf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Gf}),J(e=>{let t=Ef(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${wf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),gf(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:yf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(Yf,Xf,Zf),pf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(v))],semantic:bf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${wf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:bf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:Hf}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),gf(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=Ef(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,K(`<COMMA>`,`QuantBound`)),gf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Hf}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>vf(e,2).kind===v(`MAPTO`)&&cf.has(vf(e,1).kind)}),J(e=>{vf(e,1).kind=tf}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=Tf(`FcnAppl`,t.heirs),e.lastOperator=df})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,gf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Cf),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===v(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>Sf(e)&&vf(e,2).kind!==v(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Sf}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[gf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=vf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...rp()),W(X({expansion:[`<AND>`]}),...rp())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Bf(t,e.heirs[1]);return n&&`Item at ${wf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${wf(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),$f(),ep()],(e,t)=>{let n=Df(t);n.push({node:e.heirs[0],operator:ff});let r=Nf(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Ff,K(G(W(X({expansion:[`PostfixOp`],semantic:bf}),`PostfixOp`,If),W(X({expansion:[`<DOT>`],semantic:bf}),`<DOT>`,J(Cf),X({semantic:bf}),`Identifier`,J(e=>{let t=Df(e);t[t.length-1].operator!==void 0&&jf(t,t.length),t[t.length-1]={node:Tf(`RecordComponent`,[t[t.length-1].node,Ef(e,2),Ef(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:bf}),Y(`function argument`),`SBracketCases`,Pf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:bf}),`InfixOp`,If,$f(),ep()),W(X({expansion:[`<COLONCOLON>`],semantic:bf}),`<COLONCOLON>`,J(e=>{let t=Df(e);if(!zf(t[t.length-1].node))return`\`::' at ${wf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Df(e),n=Ef(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!kf(r,e.lastOperator)){let t=Ef(e,3);return`Removing label at ${wf(e,t.first,t.last)} would change expression parsing.`}t.push({node:Tf(`Label`,[Ef(e,3),Ef(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:bf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:bf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>Wf(e)<0&&e.proofLevels.length<=1?`${wf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${wf(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Rf(e.heirs)===void 0?e.heirs.length===1?Tf(`GeneralId`,e.heirs):void 0:Tf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>vf(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>vf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${wf(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},cp=/* @__PURE__ */ new Map,lp=e=>{let t=cp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=lp(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,lp(sp[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return cp.set(e,n),n},up=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},dp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=_f(e,e.scanPosition)),e.scanPosition=_f(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},fp=(e,t)=>{if(t.type===`tokens`)return dp(e,t.kinds);if(t.type===`call`)return fp(e,sp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||up(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=fp(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||up(e,t.semantic)?fp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=fp(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=fp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},pp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=fp(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},mp=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||lp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!lp(a).hasSemanticStart?lp(a).first.has(vf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):pp(e,i,a)&&(o===void 0||o(e))}),hp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,fp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=_f(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===ef){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=_f(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ee(e.token.image)}" `},gp=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??hp(e)}\n\nResidual stack trace follows:\n${r}`,!1},_p=(e,t)=>{let n=_f(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,gp(e))},vp=(e,t)=>{let n=sp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:vf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!yp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return gp(e,i);let a=r.node??(r.heirs.length===0?void 0:Tf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},yp=(e,t)=>{if(t.type===`tokens`)return _p(e,t.kinds);if(t.type===`call`)return vp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||gp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||gp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||yp(e,t));if(t.type===`choice`){let n=mp(e,t.alternatives);return n===-1?gp(e):yp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!yp(e,t.body))return!1;if(t.type===`optional`)return mp(e,[t.body])===-1||yp(e,t.body);for(;mp(e,[t.body])===0;)if(!yp(e,t.body))return!1;return!0},bp=e=>{let t=we(e),n={kind:ef,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=yp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},xp={low:15,high:15},Sp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Cp=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),wp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Tp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Ep=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Dp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Op=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),kp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...wp]),Ap=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),jp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Mp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Np=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Pp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Fp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Ip=/* @__PURE__ */ new Set([``,`*`,`-`]),Lp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Rp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),zp=/* @__PURE__ */ new Set([`NEW`,...Rp.keys()]),Bp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Vp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Hp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Up=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Cp.has(e.operator):wp.has(e.operator)),Wp=e=>Cp.has(e)||wp.has(e)||e===`-.`,Gp=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},Kp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
456
- `)}\n`},qp=(t,n,r=se(t))=>{let i=n===`tlapm`,a=i?r:r.map(re),o={index:0,offsideColumns:[]},c={},l=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>l[l.length-1].has(e),m=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],te=[],ne=[],h=(e,t=o.index-1)=>{let n=e===t?ne[e]:void 0;if(n)return n;let r=a[t];ee[e]??=m(a[e]),te[t]??={line:r.line,column:r.endColumn};let i={module:f[0].name,start:ee[e],end:te[t]};return e===t&&(ne[e]=i),i},g=(e,t)=>(e.location.range=h(t),e),ie=(e=0)=>a[Math.min(o.index+e,a.length-1)],_=(e=0)=>{let t=ie(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ae=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),oe={index:0},ce=e=>{let t=a.slice(oe.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},le=e=>i&&(e.kind===`Keyword`||Hp.has(e.text)),ue=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},v=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Fp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):le(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,y=(t,n=ie(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.O(`${t} at line ${n.line}, column ${n.column}`,void 0,de(t,n,o,r))},de=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ce(ue(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${v(r)}`,...ue(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},fe=(e,t=ie())=>y(e,t,t),pe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!le(e),b=(e,t=0)=>{let n=_(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=_();if(e.kind===`End`)throw y(`Unexpected end of expression`);return o.index++,e},S=e=>b(e)?(o.index++,!0):!1,C=e=>{if(!b(e))throw fe(`Expected ${JSON.stringify(e)} but found ${ae(_())}`);return x()},me=()=>{let e=_();if(e.kind!==`Identifier`)throw fe(`Expected an identifier but found ${ae(e)}`);if(le(e))throw fe(`Unexpected keyword ${e.text}`);return o.index++,e.text},he=()=>{let e=o.index;return{name:me(),range:h(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=_();return e.kind!==`String`&&(Ep.has(e.text)||Cp.has(e.text)||wp.has(e.text)||e.text===`'`)?(o.index++,e.text):me()},ve={isUsed:!1},ye=()=>_().kind===`Identifier`||!pe(_())?me():(ve.isUsed=!0,x().text),w=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},be=()=>{if(b(`<<`)){let e={value:1};for(;_(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;_(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},xe=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;_(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return _(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},Se=()=>{if(!S(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(T(he));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>T(()=>{let e=T(Se);C(`\\in`);let t=O();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=_();if(e.kind===`Identifier`){let t=o.index,n=[x().text];for(;b(`!`)&&_(1).kind===`Identifier`;)x(),n.push(me());return g({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(b(`<<`)||b(`(`))return Re();throw fe(`Expected a subscript but found ${ae(e)}`)},Te=e=>{let t=_(1),n=_(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&b(`==`,wp.has(n.text)?3:4))},Ee=e=>{let t=_(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&jp.has(t.text)||Te(e)},De=()=>{let e=_(),t=e.kind===`Operator`&&(Cp.has(e.text)||Tp.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Tp.has(e.text)||kp.has(e.text)&&e.text!==`'`&&!wp.has(e.text)||Op.has(e.text)&&_(-1).text===`(`&&_(-1).line===e.line&&_(-1).endColumn+1===e.column&&_(1).text===`)`&&_(1).line===e.line&&_(1).column===e.endColumn+1)&&Ee(e))throw y(`incomplete expression`,e);if(t)return o.index++,g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&kp.has(e.text)&&Ee(e)){o.index++;let t=m(e);if(wp.has(e.text))return g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return g({kind:`Lambda`,params:[n.name],body:Gp(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(b(`LAMBDA`)){let t=o.index;x();let n=ge(T(he));C(`:`);let r=O();return g({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return O()},Oe={range:void 0},ke=()=>w(()=>{let e=o.index;C(`(`);let t=T(De);return C(`)`),Oe.range=h(e),t}),E=()=>{let e=x();o.offsideColumns.push(e.column);let t=[O()];for(;ie().text===e.text&&ie().column===e.column;)o.index++,t.push(O());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},Ae=e=>w(()=>{let t=m(e),n=_().kind===`Identifier`,r=b(`|->`,1)&&(n||pe(_()));if(r||n&&b(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=m(_()),i=e();return n.range=h(t),C(r?`|->`:`:`),{name:i,value:O(),location:n}},a=[i(()=>n?me():x().text),...S(`,`)?T(()=>i(me)):[]];return C(`]`),{kind:e,fields:a,location:t}}if(be()){let e=Ce();C(`|->`);let n=O();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=O();if(S(`->`)){let e=O();return C(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(S(`EXCEPT`)){let e=T(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!pe(_()))throw fe(`Expected a field name but found ${ae(_())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:T(()=>O())}),C(`]`);return C(`=`),{path:e,value:O()}});return C(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!b(`]_`)){let e=[a];for(;S(`,`);)e.push(O());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:a,subscript:we(),location:t}}),je=()=>{let e=o.index,t=g(ze(),e),n=m(x());return g({kind:`Apply`,operator:`\\in`,args:[t,O()],location:n},e)},Me=e=>w(()=>{let t=m(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(_(1).text===`\\in`||b(`<<`))){let e=o.index,n=Se();C(`\\in`);let r=O();if(S(`:`)){let e=O();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=_().kind===`Identifier`&&b(`\\in`,1)?je():O();if(S(`:`)){let e=Ce();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(O());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ne=e=>{let t=m(e),n=w(()=>b(`>>`)||b(`>>_`)?[]:T(()=>O()));if(S(`>>_`)){if(n.length!==1)throw y(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Pe=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return C(`:`),{kind:n,bounds:e,body:O(),location:t}}let i=ge(T(he));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:O(),isTemporal:r,location:t}},Fe=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:O(),location:m(e)};let n=O();C(`->`),t.push({condition:n,body:O()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Ie=()=>{let e=_(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Ap.has(e.text)||e.kind===`Operator`&&(Cp.has(e.text)||wp.has(e.text)||Tp.has(e.text)))},Le=()=>{let e=x();if(e.kind===`Number`)return{kind:`Operand`,operand:s(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:b(`(`)?ke():[]}},Re=e=>{let t=o.index,n=x(),r=m(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(me);return C(`:`),{kind:`Lambda`,params:e,body:O(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw y(`incomplete expression`,n);return{kind:`Number`,value:s(n.text),text:n.text,location:r}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:r};if(n.kind===`String`)return{kind:`String`,value:n.text,location:r};let a=n.kind===`Step`&&et(n);if(a&&Ze()<0&&Xe.length<=1)throw y(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw y(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let s=a?tt(n)??n.text:n.text;if(xe()){let t=ge(S(`(`)?T(he):[]);t.names.length>0&&C(`)`),C(`::`);let a=O();if(!i&&e!==void 0&&c.last!==void 0&&Up(a)&&e.high>=c.last.low)throw y(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=b(`(`);if(s===`@`&&!l&&!Ie())return{kind:`ExceptAt`,location:r};let u=l?ke():[],d=[l?Oe.range:void 0];if(!Ie())return l?{kind:`Apply`,operator:s,args:u,argumentsRange:Oe.range,location:r}:{kind:`Identifier`,name:s,location:r};let f=[{kind:`Name`,name:s,args:u}],p=[h(t,t)];for(;Ie();)x(),p.push(h(o.index,o.index)),Oe.range=void 0,f.push(Le()),d.push(Oe.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),ee=m.join(`!`),te=f.flatMap(e=>`args`in e?e.args:[]),ne=f.map(e=>`args`in e?e.args.length:0),g=d.at(-1)??h(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:te.length===0?{kind:`Identifier`,name:ee,selectorRanges:p,location:r}:{kind:`Apply`,operator:ee,args:te,...ne.slice(0,-1).some(e=>e>0)&&{argumentCounts:ne},argumentsRange:g,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&Wp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:ke(),location:r};if(n.kind===`Operator`&&Wp(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=w(()=>O());return C(`)`),e}case`[`:return Ae(n);case`{`:return Me(n);case`<<`:return Ne(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Pe(n);case`IF`:{let e=O();C(`THEN`);let t=O();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:O(),location:r}}case`CASE`:return Fe(n);case`LET`:{let e=[],t=[];for(l.push(/* @__PURE__ */ new Set);!S(`IN`);){if(i&&b(`RECURSIVE`))throw y(`Unexpected keyword RECURSIVE`,ce(ie()));if(S(`RECURSIVE`)){qe();continue}let n=A(!1);n.kind===`Instance`?t.push(n):e.push(n)}l.pop();let n=O();return t.length===0?{kind:`Let`,definitions:e,body:n,location:r}:{kind:`Let`,definitions:e,instances:t,body:n,location:r}}case`CHOOSE`:{let e=Se(),t=S(`\\in`)?O():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:O(),location:r}}case`WF_`:case`SF_`:{let e=we(),t=w(()=>{C(`(`);let e=O();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw fe(`Unexpected ${ae(n)}`,n)},D=(e,t,n)=>{c.last=c.preceding={low:t,high:n};let r=O(n+1),a=_(),o=a.text===`'`||wp.has(a.text)?xp.high:Cp.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw y(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},ze=()=>{let e=c.preceding;c.preceding=void 0;let t=_(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return E();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[D(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[D(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:D(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:D(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:D(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:D(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[i?O(9):D(t,10,13)],location:n}}return Re(e)},O=(e=0)=>{let t=o.index,n=ze(),r={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=_();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){x(),c.last=xp,r.left=g({kind:`Prime`,expression:r.left,location:i},t);continue}if(wp.has(n.text)&&e<=15){x(),c.last=xp,r.left=g({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=w(()=>T(()=>O()));w(()=>C(`]`)),c.last=Sp,r.left=g({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&pe(_(1))){x();let e=x().text;r.left=g({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=Cp.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw y(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw y(`Precedence conflict between ${n.text} and -`,_());c.last=c.preceding=a;let s=O(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[h(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,s],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,s],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,s]}:{kind:`Product`,factors:[l,s],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,s],location:i};r.left=g(r.left,t),r.previous={...a,text:n.text}}return r.left},Be=()=>{if(!S(`(`))return[];let e=Ke();return C(`)`),e},k=()=>{let e=m(_()),t=O(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},A=e=>{let t=o.index;return g(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=_(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...k(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&_(1).kind===`Operator`&&Cp.has(_(1).text)&&_(2).kind===`Identifier`&&b(`==`,3)){let e=he(),t=x().text,n=he();return C(`==`),r(t,[Ve(e),Ve(n)])}let i=t.kind!==`String`&&Ep.has(t.text),a=t.kind===`Identifier`&&wp.has(_(1).text)&&b(`==`,2);if(i||a){let e=i?t.text:_(1).text;i&&x();let n=he();return a&&x(),C(`==`),r(e,[Ve(n)])}let s=me();if(S(`[`)){let t=w(()=>Ce());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:O(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=Be();return C(`==`),b(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:h(c)}:r(s,l)},Ue=(e,t,n,r)=>{let i=o.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:S(`WITH`)?T(()=>{let e=o.index,t=_e(),n=h(e);return C(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:h(i)}},We=()=>{let e=o.index;return g(Ge(),e)},Ge=()=>{let e=m(_());if(b(`_`)&&_(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(_().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!S(`(`))return{name:t,arity:0,location:e};let n=T(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},Ke=()=>T(We),qe=()=>{let e=Ke();return e.forEach(e=>l[l.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=_(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Bp.has(e.text)&&t.value++,e.kind===`Operator`&&Vp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=_(),t=_(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,Je(1)):t.kind===`Operator`&&wp.has(t.text)?b(`==`,2):t.kind===`Operator`&&Cp.has(t.text)?_(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&Ep.has(e.text)&&t.kind===`Identifier`&&b(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!Ip.has($e(e)),tt=e=>{let t=$e(e);if(Ip.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return Np.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},it=e=>!u.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),at=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Hp.has(e.name)&&!it(e.name):!1,ot=()=>{let e=_();return e.kind===`Step`?et(e):e.kind===`Keyword`?Lp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},st=()=>{let e=o.index,t=_();return t.kind===`Operator`&&!Dp.has(t.text)&&Wp(t.text)?(o.index++,g({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):S(`MODULE`)?g({kind:`ModuleFact`,name:me(),location:m(t)},e):O()},ct=e=>d[d.length-1]?.add(e),lt=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},ut=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),dt=()=>{let e=o.index,t=_(),n=T(()=>{let e=_();if((e.kind!==`Identifier`||le(e))&&e.kind!==`Operator`)throw fe(`Expected a definition name but found ${ae(e)}`,e);return o.index++,e.text},`!`),r=m(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},ft=()=>{if(i)return T(dt);let e=T(st),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ut(e.name)):void 0;if(t)throw y(`DEF clause entry should describe a defined operator`,t.location);return e},pt=()=>({facts:ot()?T(st):[],defs:S(`DEF`)||S(`DEFS`)?ft():[]}),mt=()=>{let t=o.index,r=x(),i=r.text===`USE`&&S(`ONLY`),a=h(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...pt(),keyword:a,location:m(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!at(e)):[];if(c.length>0)throw e.I(c.map(n=>({location:e.z(n.location.range??h(t)),message:`The only expression allowed as a fact in a HIDE is
457
- the name of a theorem, assumption, or step.`})));return g(s,t)},ht=()=>{let e=o.index,t=m(_()),n=S(`NEW`),r=_().kind===`Keyword`?Rp.get(_().text):void 0;if(!n&&r===void 0)throw fe(`Expected a declaration but found ${ae(_())}`);if(r!==void 0&&x(),r===`Variable`){let n=he();return ct(n.name),g({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=We();ct(i.name);let a=(r??`Constant`)===`Constant`&&b(`\\in`);if(a&&i.arity>0)throw y(`declared symbol with arguments before \\in`);return a&&x(),g({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?O():void 0,nameRange:i.location.range,location:t},e)},gt=()=>{let e=o.index,t=m(C(`ASSUME`)),n=T(()=>b(`ASSUME`)?lt(gt):_().kind===`Keyword`&&zp.has(_().text)?ht():O());return C(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:O(),location:t},e)},_t=e=>{let t={value:0};for(;_(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return _(t.value).kind===`Identifier`&&b(e,t.value+1)},vt=(e,t)=>{e.forEach(ct),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ct))},yt=()=>{let e=_();if(b(`USE`)||b(`HIDE`))return mt();if(b(`INSTANCE`)){let t=o.index;return g(Ue(void 0,[],!1,m(e)),t)}if(b(`DEFINE`)||Ye()){let t=o.index;S(`DEFINE`);let n=[A(!1)];for(;Ye();)n.push(A(!1));let r={kind:`Define`,definitions:n,location:m(e)};return g(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:O()};if(S(`TAKE`)){let e=be(),t=ge(e?[]:T(he)),n=e?Ce():[];return vt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:T(()=>O())};if(S(`PICK`)){let e=_t(`:`),t=ge(e?T(he):[]),n=e?[]:Ce();return vt(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:O()}}return S(`CASE`)?{kind:`Case`,expression:O()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?gt():O()}},bt=e=>{let t=_();if(t.kind!==`Step`)throw fe(`Expected a step number but found ${ae(t)}`,t);if(!rt(t))throw y(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw y(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:tt(t),token:t.text,location:m(t)}},xt=()=>{let e=o.index,t=bt(b(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=S(`QED`)?{kind:`Qed`}:yt(),a=h(e),s=h(n),c=nt(_());if(c&&!Pp.has(i.kind))throw y(`Proof of a step that does not take a proof`);let l=c?Ct():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ct),g({...t,body:i,head:a,statement:s,proof:l},e)},St=()=>{let e=m(_());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=h(o.index-1);return{kind:`By`,isOnly:S(`ONLY`),...pt(),keyword:t,location:e}}let t=_(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=h(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[xt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(xt());return{kind:`Steps`,level:Ze(),steps:n,location:e}},Ct=()=>{let e=o.index;Xe.push(-1);let t=lt(St);return Xe.pop(),g(t,e)},wt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Tt=e=>{let t=o.index,n=x(),r=_().kind===`Identifier`&&b(`==`,1)?me():void 0;r!==void 0&&(u.add(r),x());let i=lt(()=>({statement:b(`ASSUME`)?gt():O(),proof:nt(_())?Ct():void 0})),a=i.statement,s=g({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&wt(e,g({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Et=()=>{let e=o.index,t=x(),n=_().kind===`Identifier`&&b(`==`,1)?me():void 0;return n!==void 0&&(u.add(n),x()),g({name:n,expression:O(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Dt=()=>{let e=m(C(`----`));C(`MODULE`);let t=ye();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),l.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&T(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(h(e))});;){let t=o.index;oe.index=t;let r=_();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),l.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=Dt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(x()),r=Ke();n.constants.push(...r),e.range=h(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(x()),r=T(()=>{let e=o.index,t=m(_());return g({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=h(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Et();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&wt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(b(`USE`)&&b(`ONLY`,1))throw fe(`Expected a module unit but found ${ae(r)}`);let e=mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Ot(n,g(Ue(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Ot(n,g(Ue(void 0,[],!0,m(r)),t));continue}Ot(n,g(He(!0),t));continue}r.kind===`Keyword`&&Mp.has(r.text)?Tt(n):Ot(n,A(!1))}}},Ot=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},kt=Dt(),At=ve.isUsed?bp(t):void 0;if(At!==void 0)throw new e.O(At);return kt},Jp=e=>qp(e,`tlc`),Yp=(e,t)=>qp(e,`tlc`,t),Xp=e=>qp(e,`tlapm`),Zp=e=>qp(e,`sany`),Qp=10454148508367108822n,$p=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Qp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),em=Int32Array.from($p,e=>Number(BigInt.asIntN(32,e>>32n))),tm=Int32Array.from($p,e=>Number(BigInt.asIntN(32,e))),nm=Number(BigInt.asIntN(32,Qp>>32n)),rm=Number(BigInt.asIntN(32,Qp));let im=nm,am=rm;const om=e=>{let t=(e^am)&255;am=(am>>>8|im<<24)^tm[t],im=im>>>8^em[t]},sm=(()=>{let e=[em],t=[tm];for(let n=1;n<4;n++){let r=e[n-1],i=t[n-1],a=/* @__PURE__ */ new Int32Array(256),o=/* @__PURE__ */ new Int32Array(256);for(let e=0;e<256;e++){let t=i[e]&255;o[e]=(i[e]>>>8|r[e]<<24)^tm[t],a[e]=r[e]>>>8^em[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),cm=sm.highs[0],lm=sm.highs[1],um=sm.highs[2],dm=sm.highs[3],fm=sm.lows[0],pm=sm.lows[1],mm=sm.lows[2],hm=sm.lows[3],gm=e=>{let t=am^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;am=im^hm[n]^mm[r]^pm[i]^fm[a],im=dm[n]^um[r]^lm[i]^cm[a]},_m=e=>{if(typeof e==`boolean`)return om(0),om(e?116:102),2;if(typeof e==`number`)return om(1),gm(e),5;if(typeof e==`string`){om(3),gm(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)gm(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)om(e.charCodeAt(n));return 5+e.length}return om(21),gm(ct(e.name)+1),5},vm=e=>{if(typeof e!=`object`||A(e))_m(e);else if(k(e)){let t=F(e);om(9),gm(t.domain.length);for(let e=0;e<t.domain.length;e++)vm(t.domain[e]),vm(t.range[e])}else{let t=N(e).elements;om(5),gm(t.length);for(let e of t)vm(e)}},ym=e=>{let t={high:im,low:am};im=nm,am=rm;for(let t of e)vm(t);let n=BigInt(im>>>0)<<32n|BigInt(am>>>0);return im=t.high,am=t.low,n},bm=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=im,a=am;return e.forEach((e,n)=>{im=nm,am=rm;for(let n of t)vm(e[n]);r[2*n]=am,r[2*n+1]=im}),im=i,am=a,n},xm=25214903917n,Sm=(1n<<48n)-1n,Cm=2147483647,wm=e=>{let t={value:(BigInt.asUintN(64,e)^xm)&Sm},n=e=>(t.value=t.value*xm+11n&Sm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^xm)&Sm},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=Cm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Tm=[],Em=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Dm=()=>{for(let e=1277011;Tm.length<1341;e++)Em(e)&&Tm.push(e);return Tm},Om=e=>{let t=Dm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},km=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},Am=e=>{for(let t=Math.max(e,9);;t++){let e=km(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},jm=(e,t,n)=>{if(t<=0)return[];let r=Am(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Om(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Mm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Cm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Nm=(1n<<63n)-1n-24n,Pm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Nm*BigInt(n)+i)%t;return r<0n?r+t:r})},Fm=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Im=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=En(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>yt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>On(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:j}}},Lm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Rm=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?Mm:jm;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Lm(t,r)?void 0:Im(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Cm)?Pm(e,t,n):i(e,Number(t),n)).map(e=>a.create(Fm(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},zm=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e._(`RandomElement of the empty set`);return r},Bm=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...En(t.domain)];return yt(e,e.map(()=>Bm(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return On(t.names.map((e,r)=>[e,Bm(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return j(t.factors.map(e=>Bm(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e._(`RandomElement of the empty set`);return t.low+i}return zm(N(t).elements,n)},Vm=(e,t=0n)=>{let n=wm(t),r={random:wm(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>On([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:ym,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Hm=e=>vn([...e.possibleCounts].map(([e,t])=>[e,t])),Um=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Hm(e)]]),Wm=`----------------------------- MODULE Bags --------------------------------
455
+ `]]),cf=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),lf=v(`EOF`),uf=v(`IDENTIFIER`),df=v(`DEFBREAK`),ff=(e,t)=>Array.from({length:v(t)-v(e)+1},(t,n)=>v(e)+n),pf=new Set(ff(`op_57`,`op_119`)),mf=new Set(ff(`op_1`,`op_119`)),hf=new Set(ff(`op_57`,`op_70`)),gf=/* @__PURE__ */ new Set([...ff(`ACTION`,`EXCEPT`),v(`EXTENDS`),...ff(`IF`,`SF`),v(`STATE`),...ff(`THEN`,`WITH`),v(`US`),...ff(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),_f=new Map([...U(`postfix`,160,160,!0,`[`),...U(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...U(`prefix`,120,120,!1,`-.`),...U(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...U(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...U(`prefix`,40,40,!0,`\\lnot`),...U(`nfix`,100,130,!0,`\\times`),...U(`infix`,140,140,!1,`^`,`^^`),...U(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...U(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...U(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...U(`infix`,100,110,!0,`|`,`||`,`%%`),...U(`infix`,100,110,!1,`%`),...U(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...U(`infix`,90,140,!1,`\\wr`),...U(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...U(`infix`,90,130,!1,`!!`),...U(`infix`,90,90,!1,`...`,`..`),...U(`infix`,80,80,!0,`\\intersect`,`\\union`),...U(`infix`,80,80,!1,`\\`),...U(`infix`,70,70,!1,`<:`,`:>`),...U(`infix`,60,60,!0,`@@`),...U(`infix`,50,140,!0,`\\cdot`),...U(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...U(`infix`,30,30,!0,`\\land`,`\\lor`),...U(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...U(`infix`,10,10,!1,`=>`)]),vf=new Map([..._f,...tf.flatMap(e=>e.slice(1).map(t=>[t,_f.get(e[0])]))]),yf=vf.get(`[`),bf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},xf=e=>({type:`tokens`,kinds:new Set(e)}),Sf=e=>typeof e==`string`?e.startsWith(`<`)?xf([v(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(Sf)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),Cf=e=>(...t)=>({type:e,body:W(...t)}),K=Cf(`zeroOrMore`),wf=Cf(`oneOrMore`),q=Cf(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),Tf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Ef=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Tf(e,n);return n},Df=(...e)=>{let t=e.map(v);return e=>t.includes(Ef(e,1).kind)},Of=(e,t=Ef(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},kf=e=>{let t=Ef(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Af=e=>Df(`CASESEP`)(e)&&Of(e),jf=e=>{let t=Ef(e,1);gf.has(t.kind)&&(t.kind=uf)},Mf=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Nf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Pf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Ff=e=>e.operatorStacks[e.operatorStacks.length-1],If=(e,t)=>e.low>t.high,Lf=(e,t)=>e.high<t.low,Rf=e=>e.fix===`prefix`?e:vf.get(`${e.name}.`),zf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===yf?Nf(`FcnAppl`,[n,...r.node.heirs]):Nf(`PostfixExpr`,[n,r.node]),operator:void 0})},Bf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Nf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Nf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Vf=e=>{let t=Ff(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return zf(t,n),Vf(e);if(i.operator!==void 0){let t=Rf(r.operator);return t!==void 0&&If(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Mf(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Mf(e,a.node.first,a.node.last)} and expression at location ${Mf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Lf(a.operator,r.operator)?void 0:If(a.operator,r.operator)?(Bf(t,a.operator),Vf(e)):`Precedence conflict between ops ${a.operator.name} in block ${Mf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Rf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Lf(s,r.operator))return;if(!If(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Mf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Bf(t,s),Vf(e);let c=Mf(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===bf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Hf=e=>J(t=>{let n=Ff(t),r=Pf(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Vf(t)}),Uf=Hf(()=>!1),Wf=Hf(()=>!0),Gf=J(e=>{e.lastOperator=vf.get(e.token.image)}),Kf=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},qf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Kf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Jf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Of(e,n.first.beginColumn))return n;let t=Jf(e,n);if(t!==void 0)return t}},Yf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(v),n=(e,...t)=>t.some(t=>e.kind===v(t)),r=e=>e!==void 0&&pf.has(e.kind),i=e.token,a=Tf(e,i);i.next=void 0;let o=Tf(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===uf&&(e=e.next)}else if(e.kind===uf){let t=e.next;!r(t)||hf.has(t.kind)||mf.has(t.kind)&&t.next?.kind!==uf||(e=t.next?.kind===v(`SUBSTITUTE`)?i:mf.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==df&&(e.next={kind:df,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Tf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Xf=e=>{let t=Ef(e,1);if(t.kind===v(`LAB`)){let n=1;for(;n!==0;)if(t=Tf(e,t),t.kind===v(`LAB`)&&n++,t.kind===v(`RAB`)&&n--,t.kind===lf)return!1;return Tf(e,t).kind===v(`IN`)}if(t.kind!==uf)return!1;for(t=Tf(e,t);t.kind===v(`COMMA`);){if(t=Tf(e,t),t.kind!==uf)return!1;t=Tf(e,t)}return t.kind===v(`IN`)},Zf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Qf=e=>e.proofLevels.at(-1)??-1,$f=e=>{let t=Ef(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Df(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Qf(e)>=0&&Zf(t)>Qf(e):Df(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},ep=(e,t)=>{let n=Zf(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},tp=e=>J(t=>ep(t,t.token)?void 0:`${Mf(t,t.token)}: ${e}`),np=xf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(v)),rp=xf([...np.kinds,v(`op_76`)]),ip=xf(mf),ap=xf(hf),op=xf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(v)),sp=()=>K(X({expansion:[G(np,`<op_77>`)],semantic:Of}),G(`PrefixOp`,`InfixOp`),Wf),cp=()=>G(W(X({expansion:[`OpenStart`],semantic:Of}),`OpenExpression`,Uf),W(X({semantic:Of}),`ExtendableExpr`)),lp=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),up=()=>G(W(X({semantic:e=>Df(`ASSUME`,`BOXASSUME`)(e)||Ef(e,2).kind===v(`COLONCOLON`)&&[v(`ASSUME`),v(`BOXASSUME`)].includes(Ef(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),dp=()=>[`JuncItem`,K(X({semantic:kf}),`JuncItem`)],fp=e=>J(t=>{t.expecting=e,jf(t)}),pp=e=>J(t=>{t.isTerminalProof=e}),mp=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Yf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),hp={CompilationUnit:Z(void 0,[J(Yf),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),fp(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,fp(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,fp(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(Yf)),W(X({semantic:e=>Df(`USE`)(e)&&Ef(e,2).kind!==v(`ONLY`)||Df(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(mp(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),mp(`Expression`,X({expansion:[`<IDENTIFIER>`,ap]}),`PostfixLHS`,`Expression`),mp(`Expression`,X({expansion:[`<IDENTIFIER>`,ip]}),`InfixLHS`,`Expression`),mp(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),mp(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[rp,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,ip,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,ap]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,fp(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[np,Gf]),NonExpPrefixOp:Z(void 0,[rp,Gf]),InfixOp:Z(`Infix Op`,[ip,Gf]),PostfixOp:Z(void 0,[ap,Gf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Yf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),up(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),up(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=Pf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Mf(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(Yf),G(W(X({amount:3}),X({semantic:Df(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:$f}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Df(`BY`)(e)||Ef(e,2).kind===v(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>Ef(e,2).kind!==v(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,pp(!0),q(`<ONLY>`)),W(`<USE>`,pp(!1),q(`<ONLY>`)),W(`<HIDE>`,pp(!1))),Y("an expression, `MODULE' or `DEF'"),q(lp(),K(`<COMMA>`,Y(`MODULE or expression`),lp(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),lp(),K(`<COMMA>`,Y(`MODULE or expression`),lp(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),op,tp(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:$f}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),op,tp(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Df(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Df(`INSTANCE`)}),`Instantiation`),W(X({semantic:Df(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:$f}),J(e=>{let t=Pf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Mf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),wf(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:Df(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(rp,ip,ap),xf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(v))],semantic:Of}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Mf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Of}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:Xf}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),wf(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=Pf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,K(`<COMMA>`,`QuantBound`)),wf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Xf}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>Ef(e,2).kind===v(`MAPTO`)&&gf.has(Ef(e,1).kind)}),J(e=>{Ef(e,1).kind=uf}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=Nf(`FcnAppl`,t.heirs),e.lastOperator=yf})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,wf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(jf),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===v(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>Af(e)&&Ef(e,2).kind!==v(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Af}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[wf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=Ef(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...dp()),W(X({expansion:[`<AND>`]}),...dp())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Jf(t,e.heirs[1]);return n&&`Item at ${Mf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Mf(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),sp(),cp()],(e,t)=>{let n=Ff(t);n.push({node:e.heirs[0],operator:bf});let r=Vf(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Uf,K(G(W(X({expansion:[`PostfixOp`],semantic:Of}),`PostfixOp`,Wf),W(X({expansion:[`<DOT>`],semantic:Of}),`<DOT>`,J(jf),X({semantic:Of}),`Identifier`,J(e=>{let t=Ff(e);t[t.length-1].operator!==void 0&&zf(t,t.length),t[t.length-1]={node:Nf(`RecordComponent`,[t[t.length-1].node,Pf(e,2),Pf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Of}),Y(`function argument`),`SBracketCases`,Hf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Of}),`InfixOp`,Wf,sp(),cp()),W(X({expansion:[`<COLONCOLON>`],semantic:Of}),`<COLONCOLON>`,J(e=>{let t=Ff(e);if(!qf(t[t.length-1].node))return`\`::' at ${Mf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Ff(e),n=Pf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Lf(r,e.lastOperator)){let t=Pf(e,3);return`Removing label at ${Mf(e,t.first,t.last)} would change expression parsing.`}t.push({node:Nf(`Label`,[Pf(e,3),Pf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Of}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Of}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>Qf(e)<0&&e.proofLevels.length<=1?`${Mf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Mf(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Kf(e.heirs)===void 0?e.heirs.length===1?Nf(`GeneralId`,e.heirs):void 0:Nf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>Ef(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>Ef(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Mf(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},gp=/* @__PURE__ */ new Map,_p=e=>{let t=gp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=_p(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,_p(hp[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return gp.set(e,n),n},vp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},yp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Tf(e,e.scanPosition)),e.scanPosition=Tf(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},bp=(e,t)=>{if(t.type===`tokens`)return yp(e,t.kinds);if(t.type===`call`)return bp(e,hp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||vp(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=bp(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||vp(e,t.semantic)?bp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=bp(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=bp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},xp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=bp(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},Sp=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||_p(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!_p(a).hasSemanticStart?_p(a).first.has(Ef(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):xp(e,i,a)&&(o===void 0||o(e))}),Cp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,bp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Tf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===lf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Tf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ee(e.token.image)}" `},wp=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??Cp(e)}\n\nResidual stack trace follows:\n${r}`,!1},Tp=(e,t)=>{let n=Tf(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,wp(e))},Ep=(e,t)=>{let n=hp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Ef(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Dp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return wp(e,i);let a=r.node??(r.heirs.length===0?void 0:Nf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Dp=(e,t)=>{if(t.type===`tokens`)return Tp(e,t.kinds);if(t.type===`call`)return Ep(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||wp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||wp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Dp(e,t));if(t.type===`choice`){let n=Sp(e,t.alternatives);return n===-1?wp(e):Dp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Dp(e,t.body))return!1;if(t.type===`optional`)return Sp(e,[t.body])===-1||Dp(e,t.body);for(;Sp(e,[t.body])===0;)if(!Dp(e,t.body))return!1;return!0},Op=e=>{let t=we(e),n={kind:lf,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Dp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},kp={low:15,high:15},Ap={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),jp=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),Mp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Np=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Pp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Fp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Ip=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Lp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Mp]),Rp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),zp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Bp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Vp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Hp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Up=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Wp=/* @__PURE__ */ new Set([``,`*`,`-`]),Gp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Kp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),qp=/* @__PURE__ */ new Set([`NEW`,...Kp.keys()]),Jp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Yp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Xp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Zp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?jp.has(e.operator):Mp.has(e.operator)),Qp=e=>jp.has(e)||Mp.has(e)||e===`-.`,$p=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},em=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
456
+ `)}\n`},tm=(t,n,r=se(t))=>{let i=n===`tlapm`,a=i?r:r.map(re),o={index:0,offsideColumns:[]},c={},l=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>l[l.length-1].has(e),m=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],te=[],ne=[],h=(e,t=o.index-1)=>{let n=e===t?ne[e]:void 0;if(n)return n;let r=a[t];ee[e]??=m(a[e]),te[t]??={line:r.line,column:r.endColumn};let i={module:f[0].name,start:ee[e],end:te[t]};return e===t&&(ne[e]=i),i},g=(e,t)=>(e.location.range=h(t),e),ie=(e=0)=>a[Math.min(o.index+e,a.length-1)],_=(e=0)=>{let t=ie(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ae=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),oe={index:0},ce=e=>{let t=a.slice(oe.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},le=e=>i&&(e.kind===`Keyword`||Xp.has(e.text)),ue=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},v=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Up.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):le(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,y=(t,n=ie(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.O(`${t} at line ${n.line}, column ${n.column}`,void 0,de(t,n,o,r))},de=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ce(ue(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${v(r)}`,...ue(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},fe=(e,t=ie())=>y(e,t,t),pe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!le(e),b=(e,t=0)=>{let n=_(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=_();if(e.kind===`End`)throw y(`Unexpected end of expression`);return o.index++,e},S=e=>b(e)?(o.index++,!0):!1,C=e=>{if(!b(e))throw fe(`Expected ${JSON.stringify(e)} but found ${ae(_())}`);return x()},me=()=>{let e=_();if(e.kind!==`Identifier`)throw fe(`Expected an identifier but found ${ae(e)}`);if(le(e))throw fe(`Unexpected keyword ${e.text}`);return o.index++,e.text},he=()=>{let e=o.index;return{name:me(),range:h(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=_();return e.kind!==`String`&&(Pp.has(e.text)||jp.has(e.text)||Mp.has(e.text)||e.text===`'`)?(o.index++,e.text):me()},ve={isUsed:!1},ye=()=>_().kind===`Identifier`||!pe(_())?me():(ve.isUsed=!0,x().text),w=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},be=()=>{if(b(`<<`)){let e={value:1};for(;_(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;_(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},xe=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;_(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return _(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},Se=()=>{if(!S(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(T(he));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>T(()=>{let e=T(Se);C(`\\in`);let t=O();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=_();if(e.kind===`Identifier`){let t=o.index,n=[x().text];for(;b(`!`)&&_(1).kind===`Identifier`;)x(),n.push(me());return g({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(b(`<<`)||b(`(`))return Re();throw fe(`Expected a subscript but found ${ae(e)}`)},Te=e=>{let t=_(1),n=_(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&b(`==`,Mp.has(n.text)?3:4))},Ee=e=>{let t=_(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&zp.has(t.text)||Te(e)},De=()=>{let e=_(),t=e.kind===`Operator`&&(jp.has(e.text)||Np.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Np.has(e.text)||Lp.has(e.text)&&e.text!==`'`&&!Mp.has(e.text)||Ip.has(e.text)&&_(-1).text===`(`&&_(-1).line===e.line&&_(-1).endColumn+1===e.column&&_(1).text===`)`&&_(1).line===e.line&&_(1).column===e.endColumn+1)&&Ee(e))throw y(`incomplete expression`,e);if(t)return o.index++,g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&Lp.has(e.text)&&Ee(e)){o.index++;let t=m(e);if(Mp.has(e.text))return g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return g({kind:`Lambda`,params:[n.name],body:$p(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(b(`LAMBDA`)){let t=o.index;x();let n=ge(T(he));C(`:`);let r=O();return g({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return O()},Oe={range:void 0},ke=()=>w(()=>{let e=o.index;C(`(`);let t=T(De);return C(`)`),Oe.range=h(e),t}),E=()=>{let e=x();o.offsideColumns.push(e.column);let t=[O()];for(;ie().text===e.text&&ie().column===e.column;)o.index++,t.push(O());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},Ae=e=>w(()=>{let t=m(e),n=_().kind===`Identifier`,r=b(`|->`,1)&&(n||pe(_()));if(r||n&&b(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=m(_()),i=e();return n.range=h(t),C(r?`|->`:`:`),{name:i,value:O(),location:n}},a=[i(()=>n?me():x().text),...S(`,`)?T(()=>i(me)):[]];return C(`]`),{kind:e,fields:a,location:t}}if(be()){let e=Ce();C(`|->`);let n=O();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=O();if(S(`->`)){let e=O();return C(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(S(`EXCEPT`)){let e=T(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!pe(_()))throw fe(`Expected a field name but found ${ae(_())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:T(()=>O())}),C(`]`);return C(`=`),{path:e,value:O()}});return C(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!b(`]_`)){let e=[a];for(;S(`,`);)e.push(O());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:a,subscript:we(),location:t}}),je=()=>{let e=o.index,t=g(ze(),e),n=m(x());return g({kind:`Apply`,operator:`\\in`,args:[t,O()],location:n},e)},Me=e=>w(()=>{let t=m(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(_(1).text===`\\in`||b(`<<`))){let e=o.index,n=Se();C(`\\in`);let r=O();if(S(`:`)){let e=O();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=_().kind===`Identifier`&&b(`\\in`,1)?je():O();if(S(`:`)){let e=Ce();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(O());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ne=e=>{let t=m(e),n=w(()=>b(`>>`)||b(`>>_`)?[]:T(()=>O()));if(S(`>>_`)){if(n.length!==1)throw y(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Pe=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return C(`:`),{kind:n,bounds:e,body:O(),location:t}}let i=ge(T(he));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:O(),isTemporal:r,location:t}},Fe=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:O(),location:m(e)};let n=O();C(`->`),t.push({condition:n,body:O()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Ie=()=>{let e=_(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Rp.has(e.text)||e.kind===`Operator`&&(jp.has(e.text)||Mp.has(e.text)||Np.has(e.text)))},Le=()=>{let e=x();if(e.kind===`Number`)return{kind:`Operand`,operand:s(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:b(`(`)?ke():[]}},Re=e=>{let t=o.index,n=x(),r=m(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(me);return C(`:`),{kind:`Lambda`,params:e,body:O(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw y(`incomplete expression`,n);return{kind:`Number`,value:s(n.text),text:n.text,location:r}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:r};if(n.kind===`String`)return{kind:`String`,value:n.text,location:r};let a=n.kind===`Step`&&et(n);if(a&&Ze()<0&&Xe.length<=1)throw y(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw y(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let s=a?tt(n)??n.text:n.text;if(xe()){let t=ge(S(`(`)?T(he):[]);t.names.length>0&&C(`)`),C(`::`);let a=O();if(!i&&e!==void 0&&c.last!==void 0&&Zp(a)&&e.high>=c.last.low)throw y(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=b(`(`);if(s===`@`&&!l&&!Ie())return{kind:`ExceptAt`,location:r};let u=l?ke():[],d=[l?Oe.range:void 0];if(!Ie())return l?{kind:`Apply`,operator:s,args:u,argumentsRange:Oe.range,location:r}:{kind:`Identifier`,name:s,location:r};let f=[{kind:`Name`,name:s,args:u}],p=[h(t,t)];for(;Ie();)x(),p.push(h(o.index,o.index)),Oe.range=void 0,f.push(Le()),d.push(Oe.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),ee=m.join(`!`),te=f.flatMap(e=>`args`in e?e.args:[]),ne=f.map(e=>`args`in e?e.args.length:0),g=d.at(-1)??h(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:te.length===0?{kind:`Identifier`,name:ee,selectorRanges:p,location:r}:{kind:`Apply`,operator:ee,args:te,...ne.slice(0,-1).some(e=>e>0)&&{argumentCounts:ne},argumentsRange:g,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&Qp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:ke(),location:r};if(n.kind===`Operator`&&Qp(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=w(()=>O());return C(`)`),e}case`[`:return Ae(n);case`{`:return Me(n);case`<<`:return Ne(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Pe(n);case`IF`:{let e=O();C(`THEN`);let t=O();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:O(),location:r}}case`CASE`:return Fe(n);case`LET`:{let e=[],t=[];for(l.push(/* @__PURE__ */ new Set);!S(`IN`);){if(i&&b(`RECURSIVE`))throw y(`Unexpected keyword RECURSIVE`,ce(ie()));if(S(`RECURSIVE`)){qe();continue}let n=A(!1);n.kind===`Instance`?t.push(n):e.push(n)}l.pop();let n=O();return t.length===0?{kind:`Let`,definitions:e,body:n,location:r}:{kind:`Let`,definitions:e,instances:t,body:n,location:r}}case`CHOOSE`:{let e=Se(),t=S(`\\in`)?O():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:O(),location:r}}case`WF_`:case`SF_`:{let e=we(),t=w(()=>{C(`(`);let e=O();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw fe(`Unexpected ${ae(n)}`,n)},D=(e,t,n)=>{c.last=c.preceding={low:t,high:n};let r=O(n+1),a=_(),o=a.text===`'`||Mp.has(a.text)?kp.high:jp.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw y(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},ze=()=>{let e=c.preceding;c.preceding=void 0;let t=_(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return E();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[D(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[D(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:D(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:D(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:D(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:D(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[i?O(9):D(t,10,13)],location:n}}return Re(e)},O=(e=0)=>{let t=o.index,n=ze(),r={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=_();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){x(),c.last=kp,r.left=g({kind:`Prime`,expression:r.left,location:i},t);continue}if(Mp.has(n.text)&&e<=15){x(),c.last=kp,r.left=g({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=w(()=>T(()=>O()));w(()=>C(`]`)),c.last=Ap,r.left=g({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&pe(_(1))){x();let e=x().text;r.left=g({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=jp.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw y(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw y(`Precedence conflict between ${n.text} and -`,_());c.last=c.preceding=a;let s=O(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[h(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,s],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,s],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,s]}:{kind:`Product`,factors:[l,s],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,s],location:i};r.left=g(r.left,t),r.previous={...a,text:n.text}}return r.left},Be=()=>{if(!S(`(`))return[];let e=Ke();return C(`)`),e},k=()=>{let e=m(_()),t=O(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},A=e=>{let t=o.index;return g(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=_(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...k(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&_(1).kind===`Operator`&&jp.has(_(1).text)&&_(2).kind===`Identifier`&&b(`==`,3)){let e=he(),t=x().text,n=he();return C(`==`),r(t,[Ve(e),Ve(n)])}let i=t.kind!==`String`&&Pp.has(t.text),a=t.kind===`Identifier`&&Mp.has(_(1).text)&&b(`==`,2);if(i||a){let e=i?t.text:_(1).text;i&&x();let n=he();return a&&x(),C(`==`),r(e,[Ve(n)])}let s=me();if(S(`[`)){let t=w(()=>Ce());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:O(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=Be();return C(`==`),b(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:h(c)}:r(s,l)},Ue=(e,t,n,r)=>{let i=o.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:S(`WITH`)?T(()=>{let e=o.index,t=_e(),n=h(e);return C(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:h(i)}},We=()=>{let e=o.index;return g(Ge(),e)},Ge=()=>{let e=m(_());if(b(`_`)&&_(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(_().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!S(`(`))return{name:t,arity:0,location:e};let n=T(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},Ke=()=>T(We),qe=()=>{let e=Ke();return e.forEach(e=>l[l.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=_(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Jp.has(e.text)&&t.value++,e.kind===`Operator`&&Yp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=_(),t=_(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,Je(1)):t.kind===`Operator`&&Mp.has(t.text)?b(`==`,2):t.kind===`Operator`&&jp.has(t.text)?_(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&Pp.has(e.text)&&t.kind===`Identifier`&&b(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!Wp.has($e(e)),tt=e=>{let t=$e(e);if(Wp.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return Vp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},it=e=>!u.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),at=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Xp.has(e.name)&&!it(e.name):!1,ot=()=>{let e=_();return e.kind===`Step`?et(e):e.kind===`Keyword`?Gp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},st=()=>{let e=o.index,t=_();return t.kind===`Operator`&&!Fp.has(t.text)&&Qp(t.text)?(o.index++,g({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):S(`MODULE`)?g({kind:`ModuleFact`,name:me(),location:m(t)},e):O()},ct=e=>d[d.length-1]?.add(e),lt=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},ut=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),dt=()=>{let e=o.index,t=_(),n=T(()=>{let e=_();if((e.kind!==`Identifier`||le(e))&&e.kind!==`Operator`)throw fe(`Expected a definition name but found ${ae(e)}`,e);return o.index++,e.text},`!`),r=m(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},ft=()=>{if(i)return T(dt);let e=T(st),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ut(e.name)):void 0;if(t)throw y(`DEF clause entry should describe a defined operator`,t.location);return e},pt=()=>({facts:ot()?T(st):[],defs:S(`DEF`)||S(`DEFS`)?ft():[]}),mt=()=>{let t=o.index,r=x(),i=r.text===`USE`&&S(`ONLY`),a=h(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...pt(),keyword:a,location:m(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!at(e)):[];if(c.length>0)throw e.L(c.map(n=>({location:e.B(n.location.range??h(t)),message:`The only expression allowed as a fact in a HIDE is
457
+ the name of a theorem, assumption, or step.`})));return g(s,t)},ht=()=>{let e=o.index,t=m(_()),n=S(`NEW`),r=_().kind===`Keyword`?Kp.get(_().text):void 0;if(!n&&r===void 0)throw fe(`Expected a declaration but found ${ae(_())}`);if(r!==void 0&&x(),r===`Variable`){let n=he();return ct(n.name),g({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=We();ct(i.name);let a=(r??`Constant`)===`Constant`&&b(`\\in`);if(a&&i.arity>0)throw y(`declared symbol with arguments before \\in`);return a&&x(),g({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?O():void 0,nameRange:i.location.range,location:t},e)},gt=()=>{let e=o.index,t=m(C(`ASSUME`)),n=T(()=>b(`ASSUME`)?lt(gt):_().kind===`Keyword`&&qp.has(_().text)?ht():O());return C(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:O(),location:t},e)},_t=e=>{let t={value:0};for(;_(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return _(t.value).kind===`Identifier`&&b(e,t.value+1)},vt=(e,t)=>{e.forEach(ct),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ct))},yt=()=>{let e=_();if(b(`USE`)||b(`HIDE`))return mt();if(b(`INSTANCE`)){let t=o.index;return g(Ue(void 0,[],!1,m(e)),t)}if(b(`DEFINE`)||Ye()){let t=o.index;S(`DEFINE`);let n=[A(!1)];for(;Ye();)n.push(A(!1));let r={kind:`Define`,definitions:n,location:m(e)};return g(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:O()};if(S(`TAKE`)){let e=be(),t=ge(e?[]:T(he)),n=e?Ce():[];return vt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:T(()=>O())};if(S(`PICK`)){let e=_t(`:`),t=ge(e?T(he):[]),n=e?[]:Ce();return vt(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:O()}}return S(`CASE`)?{kind:`Case`,expression:O()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?gt():O()}},bt=e=>{let t=_();if(t.kind!==`Step`)throw fe(`Expected a step number but found ${ae(t)}`,t);if(!rt(t))throw y(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw y(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:tt(t),token:t.text,location:m(t)}},xt=()=>{let e=o.index,t=bt(b(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=S(`QED`)?{kind:`Qed`}:yt(),a=h(e),s=h(n),c=nt(_());if(c&&!Hp.has(i.kind))throw y(`Proof of a step that does not take a proof`);let l=c?Ct():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ct),g({...t,body:i,head:a,statement:s,proof:l},e)},St=()=>{let e=m(_());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=h(o.index-1);return{kind:`By`,isOnly:S(`ONLY`),...pt(),keyword:t,location:e}}let t=_(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=h(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[xt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(xt());return{kind:`Steps`,level:Ze(),steps:n,location:e}},Ct=()=>{let e=o.index;Xe.push(-1);let t=lt(St);return Xe.pop(),g(t,e)},wt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Tt=e=>{let t=o.index,n=x(),r=_().kind===`Identifier`&&b(`==`,1)?me():void 0;r!==void 0&&(u.add(r),x());let i=lt(()=>({statement:b(`ASSUME`)?gt():O(),proof:nt(_())?Ct():void 0})),a=i.statement,s=g({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&wt(e,g({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Et=()=>{let e=o.index,t=x(),n=_().kind===`Identifier`&&b(`==`,1)?me():void 0;return n!==void 0&&(u.add(n),x()),g({name:n,expression:O(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Dt=()=>{let e=m(C(`----`));C(`MODULE`);let t=ye();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),l.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&T(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(h(e))});;){let t=o.index;oe.index=t;let r=_();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),l.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=Dt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(x()),r=Ke();n.constants.push(...r),e.range=h(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(x()),r=T(()=>{let e=o.index,t=m(_());return g({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=h(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Et();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&wt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(b(`USE`)&&b(`ONLY`,1))throw fe(`Expected a module unit but found ${ae(r)}`);let e=mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Ot(n,g(Ue(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Ot(n,g(Ue(void 0,[],!0,m(r)),t));continue}Ot(n,g(He(!0),t));continue}r.kind===`Keyword`&&Bp.has(r.text)?Tt(n):Ot(n,A(!1))}}},Ot=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},kt=Dt(),At=ve.isUsed?Op(t):void 0;if(At!==void 0)throw new e.O(At);return kt},nm=e=>tm(e,`tlc`),rm=(e,t)=>tm(e,`tlc`,t),im=e=>tm(e,`tlapm`),am=e=>tm(e,`sany`),om=10454148508367108822n,sm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:om);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),cm=Int32Array.from(sm,e=>Number(BigInt.asIntN(32,e>>32n))),lm=Int32Array.from(sm,e=>Number(BigInt.asIntN(32,e))),um=Number(BigInt.asIntN(32,om>>32n)),dm=Number(BigInt.asIntN(32,om));let fm=um,pm=dm;const mm=e=>{let t=(e^pm)&255;pm=(pm>>>8|fm<<24)^lm[t],fm=fm>>>8^cm[t]},hm=(()=>{let e=[cm],t=[lm];for(let n=1;n<4;n++){let r=e[n-1],i=t[n-1],a=/* @__PURE__ */ new Int32Array(256),o=/* @__PURE__ */ new Int32Array(256);for(let e=0;e<256;e++){let t=i[e]&255;o[e]=(i[e]>>>8|r[e]<<24)^lm[t],a[e]=r[e]>>>8^cm[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),gm=hm.highs[0],_m=hm.highs[1],vm=hm.highs[2],ym=hm.highs[3],bm=hm.lows[0],xm=hm.lows[1],Sm=hm.lows[2],Cm=hm.lows[3],wm=e=>{let t=pm^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;pm=fm^Cm[n]^Sm[r]^xm[i]^bm[a],fm=ym[n]^vm[r]^_m[i]^gm[a]},Tm=e=>{if(typeof e==`boolean`)return mm(0),mm(e?116:102),2;if(typeof e==`number`)return mm(1),wm(e),5;if(typeof e==`string`){mm(3),wm(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)wm(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)mm(e.charCodeAt(n));return 5+e.length}return mm(21),wm(ct(e.name)+1),5},Em=e=>{if(typeof e!=`object`||A(e))Tm(e);else if(k(e)){let t=F(e);mm(9),wm(t.domain.length);for(let e=0;e<t.domain.length;e++)Em(t.domain[e]),Em(t.range[e])}else{let t=N(e).elements;mm(5),wm(t.length);for(let e of t)Em(e)}},Dm=e=>{let t={high:fm,low:pm};fm=um,pm=dm;for(let t of e)Em(t);let n=BigInt(fm>>>0)<<32n|BigInt(pm>>>0);return fm=t.high,pm=t.low,n},Om=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=fm,a=pm;return e.forEach((e,n)=>{fm=um,pm=dm;for(let n of t)Em(e[n]);r[2*n]=pm,r[2*n+1]=fm}),fm=i,pm=a,n},km=25214903917n,Am=(1n<<48n)-1n,jm=2147483647,Mm=e=>{let t={value:(BigInt.asUintN(64,e)^km)&Am},n=e=>(t.value=t.value*km+11n&Am,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^km)&Am},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=jm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Nm=[],Pm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Fm=()=>{for(let e=1277011;Nm.length<1341;e++)Pm(e)&&Nm.push(e);return Nm},Im=e=>{let t=Fm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Lm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},Rm=e=>{for(let t=Math.max(e,9);;t++){let e=Lm(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},zm=(e,t,n)=>{if(t<=0)return[];let r=Rm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Im(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Bm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:jm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Vm=(1n<<63n)-1n-24n,Hm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Vm*BigInt(n)+i)%t;return r<0n?r+t:r})},Um=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Wm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Dn(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>yt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>kn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:j}}},Gm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Km=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?Bm:zm;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Gm(t,r)?void 0:Wm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(jm)?Hm(e,t,n):i(e,Number(t),n)).map(e=>a.create(Um(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},qm=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e._(`RandomElement of the empty set`);return r},Jm=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Dn(t.domain)];return yt(e,e.map(()=>Jm(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return kn(t.names.map((e,r)=>[e,Jm(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return j(t.factors.map(e=>Jm(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e._(`RandomElement of the empty set`);return t.low+i}return qm(N(t).elements,n)},Ym=(e,t=0n)=>{let n=Mm(t),r={random:Mm(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>kn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Dm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Xm=e=>vn([...e.possibleCounts].map(([e,t])=>[e,t])),Zm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Xm(e)]]),Qm=`----------------------------- MODULE Bags --------------------------------
458
458
  (**************************************************************************)
459
459
  (* A bag, also called a multiset, is a set that can contain multiple *)
460
460
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -607,7 +607,7 @@ CopiesIn(e, B) ==
607
607
  7 Dec 98 : Corrected error found by Stephan Merz.
608
608
  6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
609
609
  5 Dec 98 : Initial version.
610
- `,Gm=/* @__PURE__ */ new Map([[`Bags`,Wm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
610
+ `,$m=/* @__PURE__ */ new Map([[`Bags`,Qm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
611
611
  (***************************************************************************)
612
612
  (* The two definitions in this standard module are overridden by TLC in *)
613
613
  (* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
@@ -1667,7 +1667,7 @@ _TLCTrace ==
1667
1667
  /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1668
1668
 
1669
1669
  =============================================================================
1670
- `]]),Km=new Map([...[...Gm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Wm.replace(`
1670
+ `]]),eh=new Map([...[...$m].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Qm.replace(`
1671
1671
  LOCAL INSTANCE Naturals
1672
1672
  `,`
1673
1673
  EXTENDS TLC
@@ -1759,7 +1759,7 @@ _TEPosition ==
1759
1759
  ELSE TLCGet("level") + 1
1760
1760
 
1761
1761
  =============================================================================
1762
- `]]),qm=(e=`master`)=>e===`1.7.4`?Km:Gm,Jm=(t,n,r)=>new e.C(`Applying ${t} to the following value,\nwhich is not ${n}:\n${I(r)}`),Ym=e=>k(e)?F(e):void 0,Xm=(e,t,n)=>{let r=L(e,t,n),i=Ym(r);if(!i)throw Jm(n,`a function with a finite domain`,r);return i},Zm=(e,t,n)=>{let r=L(e,t,n),i=Ym(r);if(!i)throw Jr(t===0?`first`:`second`,n,`bag`,r);return i},Qm=(e,t)=>{if(!O(e)||!M(e))throw t();return N(e).elements},$m=e=>e.range.every(e=>typeof e==`number`&&e>0),eh=(e,t)=>{let n=e.domain.findIndex(e=>At(e,t));return n===-1?void 0:e.range[n]},th=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,nh=th(`BagDiff`,`tlc2.value.impl.Value`,2),rh=th(`SqSubseteq`,`tlc2.value.IBoolValue`,2),ih=th(`BagUnion`,`tlc2.value.impl.Value`,1),ah=th(`BagOfAll`,`tlc2.value.impl.Value`,2),oh=th(`BagCup`,`tlc2.value.impl.Value`,2),sh=th(`BagCardinality`,`tlc2.value.impl.IntValue`,1),ch=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${mi(e)}`;throw gi(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')`)},lh=(e,t,n)=>{let r=ch(e,n)+ch(t,n);if(ci(r))throw li(`${e}+${t}`);return r},uh=(e,t,n,r)=>{let i=eh(n,e.domain[t]),a=ch(e.range[t],r);return i===void 0?a:a-ch(i,r)|0},dh=(e,t)=>vn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>At(e[0],r));a?a[1]=lh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),fh=yt([],[]),ph=t=>[ii(`EmptyBag`,fh),R(`IsABag`,1,e=>{let t=Ym(L(e,0,`IsABag`));return t!==void 0&&$m(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return Xm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Jm(`BagCardinality`,`a bag`,t);return lh(e,n,sh)},0)}),R(`BagIn`,2,e=>{let t=L(e,1,`BagIn`),n=eh(Xm(e,1,`BagIn`),L(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Jr(`second`,`BagIn`,`bag`,t);return n>0}),R(`CopiesIn`,2,e=>{let t=L(e,1,`CopiesIn`),n=eh(Xm(e,1,`CopiesIn`),L(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Jr(`second`,`CopiesIn`,`bag`,t);return n}),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Zm(e,t,`(+)`);if(!$m(n))throw Jr(t===0?`first`:`second`,`(+)`,`bag`,L(e,t,`(+)`));return n});return dh(t,oh)}),R(`\\ominus`,2,e=>{let t=Zm(e,0,`(-)`),n=Zm(e,1,`(-)`);return vn(t.domain.flatMap((e,r)=>{let i=uh(t,r,n,nh);return i>0?[[e,i]]:[]}))}),R(`BagUnion`,1,t=>{let n=L(t,0,`BagUnion`),r=Qm(n,()=>Jm(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??fh;let i=r.map(t=>{let r=Ym(t);if(!r)throw new e.C(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(n)}`);return r});return dh(i,ih)}),R(`\\sqsubseteq`,2,e=>{let t=Xm(e,0,`\\sqsubseteq`),n=Xm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>uh(t,r,n,rh)<=0)}),ai(`BagOfAll`,2,t=>{let n=ri(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.C(`The first argument of BagOfAll should be an operator, but instead it is:\n${I(n.literalBody)}`);let r=L(t,1,`BagOfAll`),i=Ym(r);if(!i)throw Jr(`second`,`BagOfAll`,`function with a finite domain`,r);return dh(i.domain.map((e,t)=>yt([n.call([e])],[i.range[t]])),ah)}),R(`SubBag`,1,n=>{let r=L(n,0,`SubBag`);if(!k(r))throw new e._(`DOMAIN expects a function but received ${I(r)}`);let i=F(r),a=fn(i.range).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e._(`Attempted to apply a function to ${I(i)}, which is not in its domain`);return fn(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>yt(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>_r(Xm(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=Qm(t,()=>Jm(`BagToSet`,`a function with a finite domain`,t));return yt([...n],n.map(()=>1))})],mh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,hh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,gh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,_h=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,vh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,yh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,bh=e=>{if(!k(e))return!1;let t=F(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},xh=(e,t)=>gi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${mi(t)}`),Sh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ch=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw xh(t,e);return`[${N(e).elements.map(e=>Th(e,t)).join(`,`)}]`},wh=(e,t)=>{let n=F(e),r=er(n);return r?`[${r.map(e=>Th(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Sh(typeof e==`string`?e:I(e))}:${Th(n.range[r],t)}`).join(`,`)}}`},Th=(e,t)=>typeof e==`string`?Sh(e):typeof e==`object`?e.kind===`ModelValue`?Sh(e.name):O(e)?Ch(e,t):wh(e,t):String(e),Eh=e=>{if(O(e))return Ch(e,mh);if(!k(e)||bh(e))throw xh(mh,e);return wh(e,mh)},Dh=e=>{if(!k(e))throw xh(hh,e);return wh(e,hh)},Oh=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))},kh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return at(e);if(Array.isArray(e))return j(e.map(e=>kh(e,t)));if(typeof e==`object`&&e)return On(Object.entries(e).map(([e,n])=>[at(e),kh(n,t)]));throw gi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Ah=(e,t)=>{if(e.trim()===``)return kh(null,t);try{return kh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Oh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?gi(t,e.message):e}},jh=(e,t)=>{if(typeof e!=`string`)throw gi(t,`Cannot cast tlc2.value.impl.${mi(e)} to tlc2.value.impl.StringValue`);return e},Mh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw gi(n,`${t} (No such file or directory)`);return r},Nh=e=>[oi(`ToJson`,1,e=>at(Th(L(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),oi(`ToJsonArray`,1,e=>at(Eh(L(e,0,`ToJsonArray`)))),oi(`ToJsonObject`,1,e=>at(Dh(L(e,0,`ToJsonObject`)))),oi(`JsonSerialize`,2,t=>{let n=jh(L(t,0,`JsonSerialize`),gh),r=L(t,1,`JsonSerialize`);if(!er(r)&&!bh(r))throw Jr(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,Th(r,gh)),!0}),oi(`ndJsonSerialize`,2,t=>{let n=jh(L(t,0,`ndJsonSerialize`),_h),r=L(t,1,`ndJsonSerialize`),i=er(r);if(!i)throw Jr(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${Th(e,_h)}\n`).join(``)),!0}),oi(`JsonDeserialize`,1,t=>{let n=jh(L(t,0,`JsonDeserialize`),vh);return Ah(Mh(e,n,vh),vh)}),oi(`ndJsonDeserialize`,1,t=>{let n=jh(L(t,0,`ndJsonDeserialize`),yh);return j(Mh(e,n,yh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Ah(e,yh)))})],Ph=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Fh=1e6,Ih=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Jr(t,n,`nonnegative integer`,e);return e},Lh=(e,t,n,r)=>fn(Array.from({length:t},()=>fn(e.filter(()=>r.nextDouble()<n)))),Rh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Ih(L(e,0,n),`first`,n),i=Ih(L(e,1,n),`second`,n),a=L(e,2,n);if(!O(a)||!M(a))throw Jr(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw Jr(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Jr(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Lh(o,r,o.length===0?0:i/o.length,t.getRandom())},zh=e=>[oi(`RandomSubset`,2,t=>{let n=L(t,0,`RandomSubset`);if(typeof n!=`number`)throw Jr(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw gi(Ph,String(n));let r=L(t,1,`RandomSubset`);if(!O(r)||!P(r)&&!M(r))throw Jr(`second`,`RandomSubset`,`a finite set`,r);let i=Lm(r,e.version);if(i&&i.reduce((e,t)=>e*N(t).elements.length,1)>Fh)throw gi(Ph,`Attempted to construct a set with too many elements (>${Fh}).`);return fn(Rm(n,r,e.getRandom(),e.version))}),oi(`RandomSetOfSubsets`,3,t=>Rh(t,e)),oi(`TestRandomSetOfSubsets`,3,t=>j(Array.from({length:5},()=>N(Rh(t,e)).elements.length)))],Bh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Vh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Bh})`,Hh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Bh}) throws java.io.IOException`,Uh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Bh})`,Wh=e=>On([[`name`,e??`UnnamedAction`],[`location`,On([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Gh=(e,t,n)=>{let r=e.map((e,t)=>j([t+1,On(Object.entries(e))])),i=r.slice(1).map((e,n)=>j([r[n],t[n],e])),a=n?[j([r[r.length-1],n.action,r[n.start]])]:[];return On([[`action`,fn([...i,...a])],[`state`,fn(r)]])},Kh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Um(e).get(t)},qh=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),I(i));else throw new e.C(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(r)}`)},Jh=e=>e.every(e=>e!==void 0),Yh=(e,t)=>On(t.variables.map((t,n)=>[t,e[n]])),Xh=(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&&!E(e)){if(t.variableIndex.has(r))return!0;let e=pu(r,t);if(e&&!n.has(e)&&(n.add(e),Xh(e.body,t,n)))return!0}return ke(e).some(e=>Xh(e,t,n))},Zh=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[R(`AssertEq`,2,e=>{let n=L(e,0,`AssertEq`),r=L(e,1,`AssertEq`),i=At(n,r);return i||(t(I(`Assertion failed`,!0)),t(I(n,!0)),t(I(r,!0))),i}),Ci(`AssertError`,2,t=>{let r=ri(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw gi(Vh,`In computing AssertError, a non-string expression (line ${r.location.line}, col ${r.location.column}) was used as the err of an AssertError(err, exp).`);let i=wi(t,0,`AssertError`)();try{wi(t,1,`AssertError`)()}catch(t){if(t instanceof e._)return $i(t.message,n.isTool)===i;throw t}return!1}),oi(`TLCGetOrDefault`,2,e=>{let t=L(e,0,`TLCGetOrDefault`);return Kh(n,t)??L(e,1,`TLCGetOrDefault`)}),{...ai(`TLCGetAndSet`,4,e=>{let r=L(e,0,`TLCGetAndSet`),i=Kh(n,r)??L(e,3,`TLCGetAndSet`),a=ri(e,1,`TLCGetAndSet`);return qh(n,t,r,a.call([i,L(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},oi(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!Jh(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw gi(Hh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return j(n.getBehavior(r).map(e=>Yh(e,t.environment)))}),oi(`CounterExample`,0,()=>n.counterExample??On([[`action`,fn([])],[`state`,fn([])]])),R(`ToTrace`,1,t=>{let n=L(t,0,`ToTrace`);if(!k(n)||!At(_r(n),fn([`action`,`state`])))throw new e._(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(n)}`);let r=N(hr(n,`state`)).elements.map(e=>er(e)??[]);return j(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),R(`TLCModelValue`,1,t=>{let n=L(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.C(`The argument of ModelValue should be a string, but instead it is:\n${I(n)}`);return _t(n)}),Ci(`TLCDefer`,1,()=>!0),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),Ci(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!Jh(i))throw gi(Uh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||fu(wi(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.A(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Ci(`TLCCache`,2,(e,t)=>{let n=ri(e,0,`TLCCache`),i=Ir(wi(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Xh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?a(t.state):r,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(i);if(l!==void 0)return l;let u=n.call([]);return c.set(i,u),u}),R(`TLCFP`,1,e=>Number(BigInt.asIntN(32,ym([L(e,0,`TLCFP`)])))),oi(`TLCEvalDefinition`,1,(t,n)=>{let r=L(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?pu(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.C(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.C(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return H({kind:`Identifier`,name:r,location:i.location},n)})]},Qh=(e,t)=>[oi(`_Track`,2,e=>{let n=String(L(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,L(e,0,`_Track`)===!0?r+1:r),!0}),oi(`_Counts`,0,()=>Hm(t)),oi(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(Hm(t),!0)),!1)}),oi(`_PrintCounts`,0,()=>(e(I(Hm(t),!0)),!0))],$h=e=>String(e).padStart(2,`0`),eg=e=>`${e.getUTCFullYear()}.${$h(e.getUTCMonth()+1)}.${$h(e.getUTCDate())}.${$h(e.getUTCHours())}${$h(e.getUTCMinutes())}${$h(e.getUTCSeconds())}`,tg=e=>vn([...e].map(([e,t])=>[e,j([t])])),ng=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),rg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),ig=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),ag=(t,n,r)=>{if(t.version===`1.7.4`?!rg.has(n)||!t.isStarted&&ig.has(n):!t.isStarted&&ng.has(n))throw new e.C(`TLCGet(${n}) was undefined.`);let i=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return i;case`stats`:return On([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return On([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return On([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,at(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,at(eg(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return Wh(void 0);case`all`:return tg(t.registers);case`all:named`:return tg(Um(t))}if(n.startsWith(`s:`)){let r=Um(t).get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return at(t.properties.get(n.slice(2))??n);throw new e.C(`TLCGet(${n}) was undefined.`)},og=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.C(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(n)}`);return ag(t,n,r?.state)},sg=e=>e.length===0?[[]]:e.flatMap((t,n)=>sg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),cg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(cg),e.kind===`Function`&&e.range.forEach(cg))},lg=(t,n)=>[R(`Print`,2,e=>(t(`${D(I(L(e,0,`Print`),!0,!0))} ${D(I(L(e,1,`Print`),!0,!0))}`),L(e,1,`Print`))),R(`PrintT`,1,e=>(t(D(I(L(e,0,`PrintT`),!0,!0))),!0)),R(`Assert`,2,t=>{if(L(t,0,`Assert`)!==!0)throw new e.C(`The first argument of Assert evaluated to FALSE; the second argument was:\n${D(I(L(t,1,`Assert`)))}`,e.W.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>vn([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=ni(e,0,`@@`),n=ni(e,1,`@@`);return yn([...Ke(t),...Ke(n)])}),R(`ToString`,1,e=>at(I(L(e,0,`ToString`),!0))),R(`TLCEval`,1,e=>{let t=L(e,0,`TLCEval`);return cg(t),t}),R(`Permutations`,1,e=>{let t=ei(e,0,`Permutations`);return fn(sg(t).map(e=>vn(t.map((t,n)=>[t,e[n]]))))}),ai(`SortSeq`,2,e=>{let t=ri(e,1,`SortSeq`);return j(ti(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`?_i({...oi(`TLCGet`,1,(e,t)=>og(n,L(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):_i(Ci(`TLCGet`,1,(e,t)=>og(n,wi(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)`),oi(`TLCSet`,2,e=>{let r=L(e,0,`TLCSet`);return qh(n,t,r,L(e,1,`TLCSet`)),!0}),ii(`Any`,pt),R(`RandomElement`,1,e=>Bm($r(e,0,`RandomElement`),n.getRandom()))],ug=(e,t)=>e.every(e=>ir(e,t)),dg=fn([!1,!0]),fg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return _n(fg(e,t,r),fg(e,r,n))},pg=[`\\cup`,`\\cap`,`\\`],mg=e=>typeof e==`object`&&e.kind===`MixedSet`,hg=(e,t,n)=>{let r=t.kind===`Interval`?N(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return pn(r.filter(e=>ir(e,n)===t))}if(r.length===0)return n;if(!Be(n))return Et({kind:`SetOperation`,operator:e,left:t,right:n});let i=N(n).elements.filter(e=>!ir(e,t));return pn([...r,...i])},gg=[ii(`TRUE`,!0),ii(`FALSE`,!1),ii(`BOOLEAN`,dg),ii(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),si(`=`,un),si(`#`,(e,t)=>!un(e,t)),R(`~`,1,e=>!Zr(e,0,`~`)),R(`<=>`,2,e=>Zr(e,0,`<=>`)===Zr(e,1,`<=>`)),R(`/\\`,2,e=>Zr(e,0,`/\\`)&&Zr(e,1,`/\\`)),R(`\\/`,2,e=>Zr(e,0,`\\/`)||Zr(e,1,`\\/`)),R(`=>`,2,e=>!Zr(e,0,`=>`)||Zr(e,1,`=>`)),R(`\\in`,2,e=>ir(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!ir(L(e,0,`\\notin`),L(e,1,`\\notin`))),R(`\\subseteq`,2,e=>{let t=Qr(e,0,`\\subseteq`),n=L(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&M(t.base)?ug(N(t.base).elements,n.base):ug(N(t).elements,n)}),...pg.map(e=>R(e,2,t=>{let n=L(t,0,e),r=L(t,1,e);if(Be(n)&&Be(r)&&!mg(n)&&!mg(r)){if(e===`\\cup`&&P(n))return r;let t=e===`\\cup`?_n:e===`\\cap`?gn:hn;return rr((e,n)=>t(N(e),N(n)),(t,n)=>hg(e,t,n),n,r)}return Be(n)?hg(e,n,r):e!==`\\`&&Be(r)?hg(e,r,n):Et({kind:`SetOperation`,operator:e,left:n,right:r})})),R(`SUBSET`,1,e=>({kind:`Subset`,base:L(e,0,`SUBSET`)})),R(`UNION`,1,e=>{let t=Qr(e,0,`UNION`),n=Ve(t)?t.elements.filter(Ve):[];if(!Ve(t)||n.length!==t.elements.length)return Et({kind:`Union`,base:t});if(mg(t)||n.some(mg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{ir(t,e)||e.elements.push(t)})),pn(e.elements)}return n.length===0?mn:fg(n.map(N),0,n.length)}),R(`DOMAIN`,1,t=>{let n=L(t,0,`DOMAIN`);if(!k(n))throw new e._(`DOMAIN expects a function but received ${I(n)}`);return _r(n)})],_g=yi(`Integers`,`Neg`,`IntValue`,1),vg=t=>{let n=yi(t,`DotDot`,`IntervalValue`,2);return[bi(t,`+`,`Plus`,(e,t)=>e+t),bi(t,`-`,`Minus`,(e,t)=>e-t),bi(t,`*`,`Times`,(e,t)=>e*t),bi(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.C(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.C(`0^0 is undefined.`);return t**n}),bi(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.C(`The second argument of \\div is 0.`);if(t===`Naturals`){let e=Math.trunc(n/r)|0;return e<0&&Math.imul(e,r)!==n?e-1:e}let i=Math.floor(n/r);if(ci(i))throw li(`${n} \\div ${r}`);return i}),bi(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.C(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),R(`..`,2,e=>({kind:`Interval`,low:vi(L(e,0,`..`),n),high:vi(L(e,1,`..`),n)}))]},yg=vg(`Naturals`),bg=vg(`Integers`),xg=e=>{let t=yg.indexOf(e);return t===-1?void 0:bg[t]},Sg=[ii(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...yg,Si(`<`,(e,t)=>e<t),Si(`>`,(e,t)=>e>t),Si(`<=`,(e,t)=>e<=t),Si(`>=`,(e,t)=>e>=t,`>`)],Cg=[ii(`Int`,{kind:`InfiniteSet`,name:`Int`}),...bg,Si(`>=`,(e,t)=>e>=t),R(`-.`,1,e=>{let t=vi(L(e,0,`-`),_g);if(ci(-t))throw li(`-${t}`);return-t})],wg=(t,n,r)=>{let i=L(t,n,r),a=er(i);if(!a)throw new e.C(`${r}\n${I(i)}`);return a},Tg=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:wg(e,t,n)},Eg=(e,t,n)=>typeof e==`string`?at(e.slice(t,n)):j(e.slice(t,n)),Dg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Og=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,kg=(e,t)=>{let n=$d.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?_i(e,t):e}):t},Ag=t=>kg(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>Tg(e,0,Dg(``,`Len`)).length),R(`\\o`,2,t=>{let n=Tg(t,0,Og(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=wg(t,1,Og(`t \\o s`,`sequence`));return j([...n,...e])}let r=L(t,1,`\\o`);if(typeof r!=`string`)throw new e.C(`${Og(`t \\o s`,`string`)}\n${I(r)}`);return at(n+r)}),R(`Append`,2,e=>j([...wg(e,0,Og(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(e,1,`Append`)])),R(`Head`,1,t=>{let n=wg(t,0,Dg(``,`Head`));if(n.length===0)throw new e.C(`Attempted to apply Head to the empty sequence.`);return n[0]}),R(`Tail`,1,t=>{let n=Tg(t,0,Dg(``,`Tail`));if(n.length===0)throw new e.C(`Attempted to apply Tail to the empty sequence.`);return Eg(n,1)}),R(`SubSeq`,3,t=>{let n=Tg(t,0,Dg(`first `,`SubSeq`)),r=Xr(t,1,`SubSeq`),i=Xr(t,2,`SubSeq`);if(r>i)return Eg(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.C(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Eg(n,r-1,i)}),ai(`SelectSeq`,2,e=>{let t=ri(e,1,`SelectSeq`);return j(wg(e,0,Dg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw Jr(`second`,`SelectSeq`,`operator`,n);return n}))})]),jg=t=>kg(`FiniteSets`,[R(`IsFiniteSet`,1,t=>{let n=L(t,0,`IsFiniteSet`);if(O(n))return Qn(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e._(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${I(n)}\nis a finite set.`:`Attempted to check if the ${He(n)} ${I(n)} is a finite set.`)}),R(`Cardinality`,1,n=>{let r=L(n,0,`Cardinality`);if(!O(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.C(`Attempted to compute cardinality of the value\n${I(r)}`);return Xn(r,t)})]),Mg=/* @__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`]]]),Ng=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Sg};case`Integers`:return{extends:[`Naturals`],operators:Cg};case`Sequences`:return{extends:[],operators:Ag(n.version)};case`FiniteSets`:return{extends:[],operators:jg(n.version)};case`TLC`:return{extends:[],operators:kg(`TLC`,lg(t,n))};case`Randomization`:return{extends:[],operators:zh(n)};case`_Possible`:return{extends:[],operators:Qh(t,n)};case`Json`:return{extends:[],operators:Nh(r)};case`Bags`:return{extends:[],operators:ph(i)};case`TLCExt`:return{extends:[],operators:Zh(t,n)};default:return}},Pg=`$subexpression`,Fg=(t,n)=>new e.O(`${t} at line ${n.line}, column ${n.column}`),Ig=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Ig(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ke(e)){let e=Ig(r,t,n);if(e)return e}},Lg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Rg=(e,t)=>{let n=e.location,r=Lg(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 Fg(`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 Fg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Pg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Pg,args:e.args,location:n,resolution:ma},location:n}},zg=(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:ma})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ma}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ma};return Rg({...t,params:[...t.params,...r]},a)},Bg=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s={index:0,current:void 0,isFailed:!1},c=(n,i)=>{if(!n)throw Fg(i,a);ga.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.z(n),message:i}}),s.isFailed=!0},l=e=>{let r=[],i=[];for(;s.index<t.length;){let o=t[s.index];if(o.kind!==`Name`)throw Fg(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Ro(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw Fg(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=xa(u),f=s.index===t.length-1;if(n.args.length!==d&&(!i||n.args.length!==0))return c(r.argumentRanges?.[s.index]??a.range,`The operator ${n.name} requires ${d-n.earlier} arguments.`);if(f)return{definition:u,args:n.args};if(u.kind!==`Operator`)throw Fg(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),s.current=u.body,s.index++},d=()=>{for(;s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&Ig(s.current,e.name,[]);if(!a)return c(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return c(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),s.current=a.label.body,s.index++}},f=e=>{let n=s.current;if(!n)throw Fg(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(e);return}if(n.kind===`Let`){if(e.kind!==`Operand`||Ha(e.operand,1)!==0)throw Fg(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=Ka(n);if(r&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),s.current=r.body;return}if(n.kind===`Case`&&e.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[Ha(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw Fg(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=Ha(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Fg(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw Fg(`Unexpected subexpression selector`,a);let i=r?r.sets:qa(n),c=i?.[Ha(e.operand,i.length)];if(!c)throw Fg(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return zg(p.definition,{...o,args:p.args});for(d();s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw Fg(`A name selector here must be from a LET clause`,a);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return r;if(e)return zg(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw Fg(`Subexpression selection failed`,a);return Rg(o,s.current)},Vg=(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 Ua(e,t,n)},Hg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ke(e).some(Hg),Ug=(e,t,n,r=!1)=>{if(!Hg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Vo(e,e=>Ug(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Wg(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)=>Ug(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Vo(e,e=>Ug(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Vg(a.name,[],void 0,t):a.kind===`Apply`?Vg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Bg(o,t,a,r);return c!==a&&ha.add(c),c},Wg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Ug(e.expression,t,n,!0)}))}),Gg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Kg=(e,t)=>Wg(e,Gg(t.definitions),()=>!1),qg=(e,t)=>{let n=Gg([...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=>Ug(e,n,i),o=e=>i(e)||!n(e),s=e=>Ug(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 Wg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Wg(e,n,o):Bo(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=>Hg(e.body))||e.assumptions.some(e=>Hg(e.expression))?{...p,definitions:e.definitions.map(e=>Bo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Jg=(e,t)=>e.maxLevels[t]??3,Yg=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Ws({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),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=>xs(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>xs(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ss(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=vs(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)&&xs(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(Gs(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.z(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(gs(e.name,i));a!==void 0&&Jg(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=vs(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=Jg(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.I([...i.values()])}},Xg=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Zg=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Qg=new Map(qd.flatMap(e=>e.map(t=>[t,e[0]]))),$g=e=>Qg.get(e)??e,e_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},t_=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},n_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:e_(e)&2147483647,kind:t,isLocal:n}),r_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:$g(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:$g(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},i_=(e,t)=>{let n=[];for(let r=t;;){let t=r_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},a_=e=>({line:e.line,column:e.column}),o_=(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=i_(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},s_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,c_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},l_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&s_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&s_(e[n+1],e[n+2])?n+=s_(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=>c_[e])}"`:r.text)}return t},u_=e=>e[2]?.text,d_=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},f_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>f_(e.modules,t)).find(Boolean),p_=e=>{let t=e===void 0?[]:se(e),n={module:void 0};return{tokens:t,ranges:d_(t),getModule:()=>n.module??=e===void 0?Jp(``):Yp(e,t)}},m_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=p_(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:(Zd.has(i)?t?.(i):void 0)??Qd.get(i)??t?.(i)??Kp(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(u_(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>f_(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},h_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=i_(t,e+1);i.push({location:a_(t[e]),apply:e=>r.forEach(t=>e.put(n_(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,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:a_(u),apply:t=>t.put(n_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&i_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),Zg.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(a_(u)),i.push({location:a_(u),apply:e=>e.put(n_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(n_(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=$g(e.name);i.push({location:e.location,apply:n=>n.put(n_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(n_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(n_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>ba(e.location,t.location)?-1:+!!ba(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=t_();n.set(i??``,o),Kd.toReversed().forEach(e=>o.put(n_(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},g_=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),Jd.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=o_(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},ee=m(e=>e.extends),te=m(e=>e.instances),ne=/* @__PURE__ */ new Set([void 0]),h=/* @__PURE__ */ new Map;l_(o(void 0)).forEach((e,t)=>{t===3&&Xd.forEach(i),i(e)});let g=l(void 0);for(;;){let n=ee(g,/* @__PURE__ */ new Set)??te(g,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),h.set(r.unit,[...h.get(r.unit)??[],a]),!ne.has(a)){if(ne.add(a),t(a).tokens.length===0){let n=r.unit??u_(t(void 0).tokens);throw e.F(a,n)}l_(o(a)).forEach(i)}}Xg.forEach(i);let re=/* @__PURE__ */ new Set,ie=e=>{if(re.has(e))return;re.add(e);let t=h.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ie),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ie(void 0),Yd.forEach(i),[...r]},__=(e,t)=>{let n=m_(e,t),r=n.getParsed,i,a=()=>i??=h_(r);return{getStringOrder:e=>g_(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},v_=t=>{switch(t.kind){case`Number`:if(!Ue(t.value))throw e.K(new e.C(`Integer overflow: ${t.value} is outside TLC's 32-bit range`),e.W.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return _t(t.name);case`Set`:return fn(t.elements.map(v_))}},y_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],b_=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.O))throw r;let i=bp(t);throw i===void 0?r:e.I([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},x_=t=>new e.O(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),S_=(t,n)=>t.location.range&&n.location.range&&{location:e.z(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.z(n.location.range)}.`},C_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,w_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:C_(e),T_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:ts(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),E_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>I(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e._(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&At(e,r)})});if(n)return n[1];throw new e._(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},D_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||ke(e).some(e=>D_(e,t)),O_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Xo(e),n.get(e)??n.size)),n},k_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),A_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw tu(e);if(e.kind===`Number`&&!Ue(e.value))throw nu(e);A_(e.kind===`Let`?[...ke(e),...k_(e.instances??[])]:ke(e))}),j_=(t,n)=>{let r=n.order??__(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=new Map(gg.map(e=>[e.name,e])),u=/* @__PURE__ */ new Map,d=Vm(t.checkDeadlock,n.seed);d.isWarningEnabled=n.isWarningEnabled??!0,d.isTool=n.isTool??!1,d.version=n.version??`master`;let f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,ee=[],te=/* @__PURE__ */ new Map,ne=[],h=[],g=(e,t)=>ne.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),re={value:0},ie=e=>`${e}#${re.value++}`,_=[],ae=[],oe=Yg(e=>{let t=m.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,le=/* @__PURE__ */ new Map,ue=e=>{let t=u.get(e);if(t)return t;let r=Ng(e,n.print,d,n.files,l);if(!r)return;Mg.get(e)?.forEach(ue);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ue(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{l.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:ps.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:hs(e,t.name)??i.get(t.name)?.range})}),u.set(e,i),i},v=e=>{if(Zd.has(e)&&n.loadModule?.(e)!==void 0)return;let t=ue(e),r=Mg.get(e)??[];return t&&g(e,r),t&&r.includes(`Integers`)&&ue(`Integers`),t},y=e=>(A_([...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]),...k_(e.instances)]),e.modules.forEach(y),e);y(i);let de=(t,i)=>{let a=n.loadModule?.(t)??Ne.get(t)??Kp(n.source,t);if(a===void 0)throw e.F(t,i);let o=b_(a,t,r);if(o.name!==t)throw e.I([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return y(o)},fe=t=>{let n=h.indexOf(t.name);if(n!==-1){let r=[...h.slice(n),t.name].map(e=>`${e}.tla`);throw new e.O(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];h.push(t.name),ne.push(r);let s=ye(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:ae,levelChecks:o});if(ne.pop(),h.pop(),a.length>0)throw e.I(a,!1,void 0,ae);let c=i.find(e=>r.has(e.name)),l=c&&f.get(c.name),u=l&&S_(c,l.module);if(u)throw e.I([u],!1,void 0,ae);if(c)throw x_(c);return o.forEach(e=>e()),{linked:s,closure:r}},pe=(e,t)=>{let r=f.get(e);if(r)return g(e,te.get(e)??[]),r;let i=fe(de(e,t));return(qm(d.version).has(e)?Ng(e,n.print,d,n.files,l):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(l.set(t.key,e),a.delete(t.key))}),f.set(e,i.linked),te.set(e,i.closure),g(e,i.closure),i.linked},b=(e,t,n,r,i)=>{let l=i?void 0:v(e.module);if(l)return x(e,l);let u=i??pe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=y_(u),f=`#${re.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Ao(Kg(e,t),d,t,n);_.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let ee=cs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Fo(t,p)])),variables:new Set(u.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ie(`${i}@${t.name}`),f=l(u);return a.set(u,f),d.length>0&&c.add(f),e.name!==void 0&&ce.set(u,`${e.name}!${ce.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ie});return S(e,u.exported,d,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return d.length>0&&se.set(r,{name:n,location:e.location}),e.name!==void 0&&le.set(r,n),r})},x=(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}])),S=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},C=(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:ns(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),me=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),he=(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=me(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ns(r,n),location:n}}},ge=(e,t,n,r)=>{let i=e.location,s=r?void 0:v(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=me(n.arity);return C(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${re.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=y_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};_.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>D_(f(e),p),ee=d.map(t=>{let n=he(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),te=[],ne=cs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ns(e.params,i),location:i,resolution:ma}:ts(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${te.length}`,a=r(i);return te.push(a.kind===`Operator`?{...a,name:i}:T_(a,i)),i},createName:ie}),h=new Set(d.map(e=>e.name)),g=[...c.exported].filter(([e])=>!h.has(e)).map(([t,n])=>{let r=ne.getKey(n.key),a=me(n.arity),o=[...e.params,...a];return C(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...ee,...te,...g]},_e=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),ve=/* @__PURE__ */ new Map,ye=(t,r)=>{let s=Gd(t,n.loadClass?.(t.name),t===i);ve.set(t.name,s.overrides);let c=s.module,l=_.length,u=new Map([...gg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:To,errors:[],warnings:[]},te=[f],ne=t=>t.forEach((t,n)=>{let r=h.get(n);if(!r){u.set(n,t),h.set(n,t);return}if(!r.range||!t.range||e.z(r.range)===e.z(t.range))return;let i=e.z(t.range),a=e.z(r.range);w_(r.kind)===w_(t.kind)?f.warnings.push({location:i,message:`Warning: the ${C_(r.kind)} of '${n}' conflicts with \nits ${C_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${C_(t.kind)} of '${n}' conflicts with \nits ${C_(r.kind)} at ${a}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,re=/* @__PURE__ */ new Map,ie=[],se=[...c.constants],ce=c.variables.map(e=>e.name),ue=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:v(e);if(n){ne(n);return}let i=t??pe(e,c.name);se.push(...i.constants.filter(e=>se.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{ce.includes(e)||(ce.push(e),ue.push(i.variableLocations[t]))}),ne(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>re.set(t,e)),ie.push(i)});let y=new Map(u),de=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],fe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});de.forEach(e=>h.set(e.name,fe(e)));let C=e=>({key:he(e),arity:xa(e),params:Sa(e),kind:Eo(c,e)?`Theorem`:`Definition`,range:e.location.range}),me=se.length===0&&ce.length===0,he=e=>c===i?e.name:`${e.name}@${r.id}`,w=/* @__PURE__ */ new Map,T=()=>new Map([...r.modules,...re]),be=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&ba(e.location,t.location)},xe=e=>{let t=c.modules.find(t=>t.name===e.module);return t?be(t)?re.get(t.name):void 0:T().get(e.module)},Se=e=>({imported:u,getInstance:e=>{let t=xe(e),n=t?void 0:v(e.module);if(n)return{declarations:[],symbols:x(e,n),instancer:c.name};let r=t??pe(e.module,c.name),i=y_(r);return{declarations:i,symbols:S(e,r.exported,i,e=>e),instancer:c.name}},bound:y,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:he,instanced:w,facts:g,reports:te,warnings:r.warnings}),Ce=e=>[...de.filter(t=>ba(t.location,e)).map(e=>[e.name,fe(e)]),...c.definitions.filter(t=>ba(t.location,e)).map(e=>[e.name,C(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),we=e=>{let t=T(),n=t.get(e.name),i=n&&S_(e,n.module);if(n&&!i)throw x_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};te.push(a);let o=ye(e,{id:`${r.id}/${e.name}`,symbols:Ce(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||re.set(e.name,o),p.has(e.name)||p.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=b(e,c,Se(c),me,T().get(e.module));w.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||h.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>we(e)}))].sort((e,t)=>ba(e.location,t.location)?-1:1).forEach(e=>e.link());let Te=qg(fs(c,(e,t)=>ge(e,t,c.name,xe(e))),_e(u));r.errors.push(...Mo(Te,Se(Te))),Te.definitions.forEach(e=>{let t=he(e);a.set(t,e),o.set(t,!me);let n=C(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ba(r,e.location))&&(u.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ee={module:Te,constants:se,variables:ce,variableLocations:ue,visible:u,exported:h,modules:re,extended:ie,facts:/* @__PURE__ */ new Set([...g,...[...Te.theorems,...Te.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Ee);let De=_.splice(l).map(e=>({location:e.location,check:()=>oe(e)}));return r.levelChecks.push(()=>Ks(Te,{constants:new Set(se.map(e=>e.name)),variables:new Set(ce),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>le.get(u.get(e)?.key??e)},De,ae)),ee.push(Ee),Ee},w=fe(i).linked;ae.length>0&&!n.isSanyReported&&n.print(e.B(ae));let T=e=>w.visible.get(e)?.key??e;w.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let be=[],xe=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>xe(e,t)),be.push(...e.module.assumptions))};xe(w,/* @__PURE__ */ new Set);let Se=w.constants.map(e=>e.name),Ce=w.variables,we=e=>e.module===void 0?[e.name,T(e.name)]:e.module===i.name||Se.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],Te=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:w.constants.find(t=>t.name===e)?.arity??0},Ee=/* @__PURE__ */ new Map,De=/* @__PURE__ */ new Set,Oe=(e,t)=>{l.set(e,t),a.delete(e),Ee.delete(e),De.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=v_(e.value);ln(t),we(e).forEach(e=>{let n=Te(e);n===0?Ee.set(e,t):Oe(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ke=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=ke.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.h(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(v_),v_(t.value)]),ke.set(n,r)}),ke.forEach(e=>we(e).forEach(t=>Oe(t,E_(e.name,Te(t)||e.rows[0][0].length,e.rows))));let E=new Map(t.substitutions.flatMap(e=>we(e).map(t=>[t,T(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!Se.includes(r)&&!w.visible.has(r))throw new e.h(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e.h(`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 o=T(i),s=a.get(o);if(!(s!==void 0||l.has(o)||Ee.has(o)||Se.includes(i)||Ce.includes(i)))throw new e.h(`The configuration file substitutes for ${r} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(w.constants.find(e=>e.name===r)?.arity??w.visible.get(r)?.arity))throw new e.h(`The configuration file substitutes for ${r} with ${i} of different number of arguments.`)});let Ae=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(we)),je=(e,t)=>{if(Ae.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&je(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=je(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=C(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),w.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Me=Se.filter(e=>!Ee.has(e)&&!E.has(e)&&!De.has(e));if(Me.length>0&&!n.isUnconfigured){let t=r.getDeclarationOrder(`constant`).find(e=>Me.includes(e))??Me[0];throw new e.h(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&l.forEach((e,t)=>{let n=xg(e);n&&l.set(t,n)});let Pe=O_(Ce,ee.flatMap(e=>e.module.variables.map(e=>e.name))),Fe=oc({definitions:a,substitutions:E,constants:Ee,variableIndex:Pe,builtins:l,variables:Ce}),Ie={runtime:d,definitions:a,builtins:l,constants:Ee,substitutions:E,instanceNames:ce,variables:Ce,variableIndex:Pe,facts:Fe,startupValues:Array.from({length:Fe.ids.size},()=>void 0),substitutedDefinitions:c,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Le=Ws({constants:new Set(Ee.keys()),variables:/* @__PURE__ */ new Set([...Ce,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>l.has(e))]),getDefinition:e=>pu(e,Ie)}),Re=t=>{try{H(t,{environment:Ie,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e._)return t;throw t}};E.forEach((t,n)=>{let r=a.get(t),i=Se.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Le.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Re(r.body):void 0;if(i){let r=Xi(i)?``:` - specifically: ${i.message}`;throw new e.h(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),d.version!==`1.7.4`&&(d.isStarted=!0);let D=new Set(ee.flatMap(e=>e.module.instances.map(e=>e.module))),ze=r.createDefinitionOrder();return{environment:Ie,assumptions:be,variableLocations:w.variableLocations,instanceActions:se,startupDefinitions:ee.filter(e=>!D.has(e.module.name)||y_(e).length===0).flatMap(e=>ze(e===w?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:w.constants,rootSymbols:w.visible,javaOverrides:ee.flatMap(e=>ve.get(e.module.name)??[])}},M_={kind:`Boolean`,value:!0},N_={kind:`Boolean`,value:!1},P_=e=>e?M_:N_,F_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,I_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),L_=(e,t,n)=>({kind:e,operands:[t,n]}),R_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?R_(e,t.operands).operands:[t])}),z_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return z_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,z_(t)),0)}},B_=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 B_(e.body);case`And`:case`Or`:return e.operands.some(B_)}},V_=/* @__PURE__ */ new WeakMap,H_={count:0},U_=e=>{let t=V_.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`#${H_.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(U_).join(`,`)})`;default:return`${e.kind}(${U_(e.body)})`}})();return V_.set(e,n),n},W_=(e,t)=>e===t||U_(e)===U_(t),G_=(e,t)=>{let n=U_(t);return e.some(e=>e===t||U_(e)===n)},K_=e=>e===`And`?`Or`:`And`,q_=(e,t)=>{switch(e.kind){case`Boolean`:return t?P_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return q_(e.body,!t);case`And`:case`Or`:return R_(t?K_(e.kind):e.kind,e.operands.map(e=>q_(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,q_(e.body,t))}}},J_=e=>{switch(e.kind){case`Boolean`:return P_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return R_(K_(e.kind),e.operands.map(J_));case`Always`:return $(`Eventually`,J_(e.body));case`Eventually`:return $(`Always`,J_(e.body));default:return $(`Not`,e)}},Y_=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Y_(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return P_(t)}return n.length===0?P_(!t):n.length===1?n[0]:R_(e.kind,n)}case`Not`:{let t=Y_(e.body);return t.kind===`Boolean`?P_(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Y_(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},X_=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Z_=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=Z_(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r.value*=t.operands.length,r.value>2147483647))throw new e._(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r.value===1)return{kind:`And`,operands:n};let i=Array.from({length:r.value},()=>[]),a={groups:1,repeat:r.value};for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}a.repeat/=e.operands.length;let t={value:0};for(let n=0;n<a.groups;n++)for(let n of e.operands)for(let e=0;e<a.repeat;e++)i[t.value++].push(n);a.groups*=e.operands.length}return{kind:`Or`,operands:i.map(e=>R_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=Z_(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=X_(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:R_(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return R_(`Or`,n)}case`Not`:return F_(t.body)?t:Z_(J_(t.body));default:return t}},Q_=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Q_(e.operands[0]):R_(e.kind,e.operands.map(Q_));case`Not`:return e.body.kind===`Not`?Q_(e.body.body):$(`Not`,Q_(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Q_(e.body));default:return e}},$_=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return $_(e.operands[0]);let t=Math.floor(e.operands.length/2);return L_(e.kind,$_(R_(e.kind,e.operands.slice(0,t))),$_(R_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,$_(e.body));default:return e}},ev=(e,t)=>{e.kind===`Eventually`&&!G_(t,e)&&t.push(e),`body`in e&&ev(e.body,t),`operands`in e&&e.operands.forEach(e=>ev(e,t))},tv=e=>{let t=e.filter(I_),n=e.flatMap(e=>e.kind===`Not`&&I_(e.body)?[e.body]:[]);return!t.some(e=>G_(n,e))},nv=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,$(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e._(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},rv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},iv=(e,t,n)=>e.flatMap(e=>{let r=rv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),av=e=>[...new Set(e.map(U_))].sort().join(`|`),ov=(e,t)=>{let n=new Set(t.map(av));return[...e.filter(e=>!n.has(av(e))),...t]},sv=e=>{let t=nv(e),n=iv(t,`Always`,`And`),r=iv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=rv(t,`Eventually`,`Or`);if(n&&!(G_(e,n.first)||G_(e,n.second)))return ov(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(G_(e,t.first)||G_(e,t.second))&&!G_(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!tv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=rv(t[e],`Always`,`And`);n&&(G_(t,n.first)||t.push(n.first),G_(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)G_(t,e.first)&&G_(t,e.second)&&!G_(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!tv(t)?[]:i(t)};return a(e)},cv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>z_(e)<=1)}),lv=e=>{let t=sv([e]).map(cv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=av(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 sv(n)){let n=av(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(cv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},uv=(e,t)=>!G_(e,t)||G_(e,t.body),dv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&z_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=X_(t);if(r){let e=z_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(B_(t))throw new e._(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},fv=(e,t)=>{let n=e.findIndex(e=>W_(e,t));return n===-1?(e.push(t),e.length-1):n},pv=e=>{let t=Z_(Y_(q_(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Q_(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])dv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:R_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:W_(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&$_(e.formula),n=[];t&&ev(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>fv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>fv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>fv(i,e))}));return{tableau:t&&lv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},mv=()=>e.K(new e._(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.W.livenessEvaluationFailure),hv=/* @__PURE__ */ new Set([`~>`,`-+->`]),gv=/* @__PURE__ */ new WeakSet,_v=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),vv=(t,n)=>new e._(`TLC cannot handle the temporal formula ${B(t)}${n===void 0?``:`:\n${n}`}`),yv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ou(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return yv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?yv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=pu(e,n);if(t)return fc(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:E(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Vo(e,(e,a)=>(i.value=Math.max(i.value,yv(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 hv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},bv=(t,n)=>{try{return Su(t,n)}catch(t){if(!(t instanceof e._))throw t;if(!Xi(t))return;throw e.K(new e._(`${e.N}${t.message}`),e.W.error)}},xv=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s)=>{let c=(e,t,n=s,c=a,l)=>xv(e,t,r,i,c,o||l!==void 0&&r.substitutedDefinitions.has(l),n);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,n,B(e)));if(t.kind===`Label`)return c(t.body,n);if(t.kind===`Let`)return c(t.body,Sv(t,n,r));if(t.kind===`Identifier`){let i=E(t)?ou(n,t.name):void 0;if(i?.kind===`Thunk`)return c(i.expression,i.scope);let o=r.constants.has(t.name)?void 0:pu(t.name,r);if(!i&&o?.kind===`Operator`&&o.params.length===0&&fc(o,r)>0){if(a.has(o))throw e.R();return c(o.body,void 0,o.name,/* @__PURE__ */ new Set([...a,o]),o)}}let l=_v(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||yv(t,n,r)===3)){let e=Wu(t,l),n=E(t)?void 0:pu(t.operator,r);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&!o)return c(e.body,nd(e,t.args,l),t.operator,a,n)}let u=i&&t.kind===`Forall`&&t.bounds.every(e=>yv(e.set,n,r)===0),d=u?bv(t.bounds,l):void 0;if(u&&d){let e=[];if(Cu(t.bounds,d,n,n=>(e.push(...c(t.body,n,B(t.body))),!1)),e.length===0)throw mv();return e}return[{expression:t,scope:n,name:s}]},Sv=(e,t,n)=>{let r=id(e.definitions,_v(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&gv.add(e.binding);return r},Cv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?yv(t,n,r):a;if(o===0){let i=H(t,_v(r,n));if(typeof i!=`boolean`)throw new e._(`TLC expected a boolean value, but did not find one. ${Jl(t)}`);return P_(i)}return o===1?{kind:`State`,expression:t,scope:n}:{kind:`Action`,expression:t,unchanged:void 0,scope:n}},o={depth:0},s=(t,n,r,i)=>{if(o.depth>=100)throw e.R();o.depth++;let s=p(t,n);o.depth--;let c=z_(s);return c>2?s:a(r,i,c)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=_v(r,t),o=E(e)||pu(n,r)===void 0?ou(t,n):void 0;if(o?.kind===`Thunk`&&gv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:E(e)?Gu(n,a):Uu(n,r);if(c?.kind!==`Closure`)throw vv(e);let u=e.kind===`Apply`?e.args:[],d=!E(e)&&pu(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,nd(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.D||r&&!i;throw!(n instanceof e._)||a?n:vv(t)}},u=(t,n)=>{let i=yv(t,n,r);if(!t.bounds.every(e=>yv(e.set,n,r)===0)){if(i<=2)return a(t,n,i);throw vv(t)}let o=[],s=t.kind===`Forall`;try{wu(t.bounds,_v(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e._)||r instanceof e.D)throw r;if(i<=2)return a(t,n,i);throw vv(t,s&&!Xi(r)?r.message:void 0)}return o.length===0?P_(s):d(t,n,R_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=z_(n);return r>2?n:a(e,t,r)},f=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===`~`&&!E(e)||e.operator===`=>`),p=(e,t)=>{let n=yv(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Sv(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,L_(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!E(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,L_(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,R_(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&yv(e.condition,t,r)===0){let n=H(e.condition,_v(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,L_(`Or`,L_(`And`,n,p(e.consequent,t)),L_(`And`,$(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`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`?$(`Always`,$(`Eventually`,L_(`Or`,i,a))):L_(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw vv(e)}};return p(t,n)},wv=(t,n,r,i,a)=>{let o=e=>wv(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r={environment:i,scope:t.scope,state:n,next:void 0},o=t.kind===`State`?fu(H(t.expression,r),`a temporal property predicate`):Ll(t.step,r);return a.set(t,o),o}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let e={environment:i,scope:t.scope,state:n,next:r};return t.unchanged&&fu(H(t.unchanged,e),`a subscript`)?!1:fu(H(t.expression,e),`an action predicate`)}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return wv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e._(`TLC cannot evaluate a temporal formula in a single step`)}},Tv=(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)=>Tv(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 wv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Ev=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Dv=(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},Ov=t=>e.K(new e._(`${e.P}${t}`),e.W.error),kv=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!A(e)||!A(i))throw Ov(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Av=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Av);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},jv=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Mv=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.h(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Ov(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>H(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!O(o)||!M(o))throw Ov(`The symmetry operator must specify a set of functions.`);let s=N(o).elements;if(!s.every(k))throw Ov(`The symmetry values must be function records.`);let c=s.map(kv),l=i.body.kind===`Apply`?i.body.args:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=Av(jv(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Bi.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;c.forEach(e=>{e.size>0&&f.set(Ev(e),e)});let p=[...f.values()],m={start:0};for(;m.start<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m.start,t).forEach(e=>{let t=Dv(n,e),r=Ev(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let ee=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),te=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!jv(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||te.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>A(e)&&ee.has(e.name))})),f.size!==0)return[...f.values()]},Nv=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Fv(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(Fv(e[r],t));return a}},Pv=(e,t)=>{let n=[],r=[];for(let i of e){let e=Fv(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(ht);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(ht(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},Fv=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=Pv(e.elements,t);return n?vt(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=Nv(n.domain,t),i=Nv(n.range,t)??n.range;if(r){let e=vn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?yt(n.domain,e.range):e}return i===n.range?n:yt(n.domain,i)}if(n===`Interval`||!O(e)||!M(e))return e;let r=N(e),i=Nv(r.elements,t);return i?fn(i):r},Iv=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=Fv(e[o],i),a===0&&(a=ht(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Lv={line:0,column:0},Rv=e=>({kind:`Identifier`,name:e,location:Lv}),zv=/* @__PURE__ */ new Set([`name`,`property`]),Bv=(t,n,r)=>{let i=pu(n,r);if(!i)throw new e.h(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.h(zv.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},Vv=(t,n,r)=>{if(lc(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return H(Rv(t),ly(r,void 0,void 0))}catch(t){if(t instanceof e._||e.U(t))return;throw t}},Hv=(t,n,r)=>{let i=Bv(t,n,r);if(Vv(n,i,r)!==void 0)throw new e.h(`The ${t} ${n} cannot be a constant.`);return i},Uv=(t,n,r)=>{let i=r.constants.has(n)?void 0:Bv(t,n,r),a=i?Vv(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.h(`The ${t} of ${n} is equal to ${I(a)}`);return a===void 0?i:void 0},Wv=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Gv=(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})),Bu(e.startupDefinitions,r),t.invariants.forEach(e=>{Uv(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Kv=(t,n)=>{let r=Ws({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>pu(e,n)});return t.flatMap(t=>{let i=Uv(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1762
+ `]]),th=(e=`master`)=>e===`1.7.4`?eh:$m,nh=(t,n,r)=>new e.C(`Applying ${t} to the following value,\nwhich is not ${n}:\n${I(r)}`),rh=e=>k(e)?F(e):void 0,ih=(e,t,n)=>{let r=L(e,t,n),i=rh(r);if(!i)throw nh(n,`a function with a finite domain`,r);return i},ah=(e,t,n)=>{let r=L(e,t,n),i=rh(r);if(!i)throw Yr(t===0?`first`:`second`,n,`bag`,r);return i},oh=(e,t)=>{if(!O(e)||!M(e))throw t();return N(e).elements},sh=e=>e.range.every(e=>typeof e==`number`&&e>0),ch=(e,t)=>{let n=e.domain.findIndex(e=>At(e,t));return n===-1?void 0:e.range[n]},lh=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,uh=lh(`BagDiff`,`tlc2.value.impl.Value`,2),dh=lh(`SqSubseteq`,`tlc2.value.IBoolValue`,2),fh=lh(`BagUnion`,`tlc2.value.impl.Value`,1),ph=lh(`BagOfAll`,`tlc2.value.impl.Value`,2),mh=lh(`BagCup`,`tlc2.value.impl.Value`,2),hh=lh(`BagCardinality`,`tlc2.value.impl.IntValue`,1),gh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${hi(e)}`;throw _i(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')`)},_h=(e,t,n)=>{let r=gh(e,n)+gh(t,n);if(li(r))throw ui(`${e}+${t}`);return r},vh=(e,t,n,r)=>{let i=ch(n,e.domain[t]),a=gh(e.range[t],r);return i===void 0?a:a-gh(i,r)|0},yh=(e,t)=>vn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>At(e[0],r));a?a[1]=_h(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),bh=yt([],[]),xh=t=>[ai(`EmptyBag`,bh),R(`IsABag`,1,e=>{let t=rh(L(e,0,`IsABag`));return t!==void 0&&sh(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return ih(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw nh(`BagCardinality`,`a bag`,t);return _h(e,n,hh)},0)}),R(`BagIn`,2,e=>{let t=L(e,1,`BagIn`),n=ch(ih(e,1,`BagIn`),L(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Yr(`second`,`BagIn`,`bag`,t);return n>0}),R(`CopiesIn`,2,e=>{let t=L(e,1,`CopiesIn`),n=ch(ih(e,1,`CopiesIn`),L(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Yr(`second`,`CopiesIn`,`bag`,t);return n}),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=ah(e,t,`(+)`);if(!sh(n))throw Yr(t===0?`first`:`second`,`(+)`,`bag`,L(e,t,`(+)`));return n});return yh(t,mh)}),R(`\\ominus`,2,e=>{let t=ah(e,0,`(-)`),n=ah(e,1,`(-)`);return vn(t.domain.flatMap((e,r)=>{let i=vh(t,r,n,uh);return i>0?[[e,i]]:[]}))}),R(`BagUnion`,1,t=>{let n=L(t,0,`BagUnion`),r=oh(n,()=>nh(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??bh;let i=r.map(t=>{let r=rh(t);if(!r)throw new e.C(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(n)}`);return r});return yh(i,fh)}),R(`\\sqsubseteq`,2,e=>{let t=ih(e,0,`\\sqsubseteq`),n=ih(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>vh(t,r,n,dh)<=0)}),oi(`BagOfAll`,2,t=>{let n=ii(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.C(`The first argument of BagOfAll should be an operator, but instead it is:\n${I(n.literalBody)}`);let r=L(t,1,`BagOfAll`),i=rh(r);if(!i)throw Yr(`second`,`BagOfAll`,`function with a finite domain`,r);return yh(i.domain.map((e,t)=>yt([n.call([e])],[i.range[t]])),ph)}),R(`SubBag`,1,n=>{let r=L(n,0,`SubBag`);if(!k(r))throw new e._(`DOMAIN expects a function but received ${I(r)}`);let i=F(r),a=fn(i.range).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e._(`Attempted to apply a function to ${I(i)}, which is not in its domain`);return fn(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>yt(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>vr(ih(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=oh(t,()=>nh(`BagToSet`,`a function with a finite domain`,t));return yt([...n],n.map(()=>1))})],Sh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Ch=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,wh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Th=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Eh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Dh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Oh=e=>{if(!k(e))return!1;let t=F(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},kh=(e,t)=>_i(e,`Cannot convert value: unsupported value type tlc2.value.impl.${hi(t)}`),Ah=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),jh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw kh(t,e);return`[${N(e).elements.map(e=>Nh(e,t)).join(`,`)}]`},Mh=(e,t)=>{let n=F(e),r=tr(n);return r?`[${r.map(e=>Nh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Ah(typeof e==`string`?e:I(e))}:${Nh(n.range[r],t)}`).join(`,`)}}`},Nh=(e,t)=>typeof e==`string`?Ah(e):typeof e==`object`?e.kind===`ModelValue`?Ah(e.name):O(e)?jh(e,t):Mh(e,t):String(e),Ph=e=>{if(O(e))return jh(e,Sh);if(!k(e)||Oh(e))throw kh(Sh,e);return Mh(e,Sh)},Fh=e=>{if(!k(e))throw kh(Ch,e);return Mh(e,Ch)},Ih=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))},Lh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return at(e);if(Array.isArray(e))return j(e.map(e=>Lh(e,t)));if(typeof e==`object`&&e)return kn(Object.entries(e).map(([e,n])=>[at(e),Lh(n,t)]));throw _i(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Rh=(e,t)=>{if(e.trim()===``)return Lh(null,t);try{return Lh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Ih(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?_i(t,e.message):e}},zh=(e,t)=>{if(typeof e!=`string`)throw _i(t,`Cannot cast tlc2.value.impl.${hi(e)} to tlc2.value.impl.StringValue`);return e},Bh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw _i(n,`${t} (No such file or directory)`);return r},Vh=e=>[si(`ToJson`,1,e=>at(Nh(L(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),si(`ToJsonArray`,1,e=>at(Ph(L(e,0,`ToJsonArray`)))),si(`ToJsonObject`,1,e=>at(Fh(L(e,0,`ToJsonObject`)))),si(`JsonSerialize`,2,t=>{let n=zh(L(t,0,`JsonSerialize`),wh),r=L(t,1,`JsonSerialize`);if(!tr(r)&&!Oh(r))throw Yr(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,Nh(r,wh)),!0}),si(`ndJsonSerialize`,2,t=>{let n=zh(L(t,0,`ndJsonSerialize`),Th),r=L(t,1,`ndJsonSerialize`),i=tr(r);if(!i)throw Yr(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${Nh(e,Th)}\n`).join(``)),!0}),si(`JsonDeserialize`,1,t=>{let n=zh(L(t,0,`JsonDeserialize`),Eh);return Rh(Bh(e,n,Eh),Eh)}),si(`ndJsonDeserialize`,1,t=>{let n=zh(L(t,0,`ndJsonDeserialize`),Dh);return j(Bh(e,n,Dh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Rh(e,Dh)))})],Hh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Uh=1e6,Wh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Yr(t,n,`nonnegative integer`,e);return e},Gh=(e,t,n,r)=>fn(Array.from({length:t},()=>fn(e.filter(()=>r.nextDouble()<n)))),Kh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Wh(L(e,0,n),`first`,n),i=Wh(L(e,1,n),`second`,n),a=L(e,2,n);if(!O(a)||!M(a))throw Yr(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw Yr(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Yr(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Gh(o,r,o.length===0?0:i/o.length,t.getRandom())},qh=e=>[si(`RandomSubset`,2,t=>{let n=L(t,0,`RandomSubset`);if(typeof n!=`number`)throw Yr(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw _i(Hh,String(n));let r=L(t,1,`RandomSubset`);if(!O(r)||!P(r)&&!M(r))throw Yr(`second`,`RandomSubset`,`a finite set`,r);let i=Gm(r,e.version);if(i&&i.reduce((e,t)=>e*N(t).elements.length,1)>Uh)throw _i(Hh,`Attempted to construct a set with too many elements (>${Uh}).`);return fn(Km(n,r,e.getRandom(),e.version))}),si(`RandomSetOfSubsets`,3,t=>Kh(t,e)),si(`TestRandomSetOfSubsets`,3,t=>j(Array.from({length:5},()=>N(Kh(t,e)).elements.length)))],Jh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Yh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Jh})`,Xh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Jh}) throws java.io.IOException`,Zh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Jh})`,Qh=e=>kn([[`name`,e??`UnnamedAction`],[`location`,kn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),$h=(e,t,n)=>{let r=e.map((e,t)=>j([t+1,kn(Object.entries(e))])),i=r.slice(1).map((e,n)=>j([r[n],t[n],e])),a=n?[j([r[r.length-1],n.action,r[n.start]])]:[];return kn([[`action`,fn([...i,...a])],[`state`,fn(r)]])},eg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Zm(e).get(t)},tg=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),I(i));else throw new e.C(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(r)}`)},ng=e=>e.every(e=>e!==void 0),rg=(e,t)=>kn(t.variables.map((t,n)=>[t,e[n]])),ig=(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&&!E(e)){if(t.variableIndex.has(r))return!0;let e=gu(r,t);if(e&&!n.has(e)&&(n.add(e),ig(e.body,t,n)))return!0}return ke(e).some(e=>ig(e,t,n))},ag=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[R(`AssertEq`,2,e=>{let n=L(e,0,`AssertEq`),r=L(e,1,`AssertEq`),i=At(n,r);return i||(t(I(`Assertion failed`,!0)),t(I(n,!0)),t(I(r,!0))),i}),wi(`AssertError`,2,t=>{let r=ii(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw _i(Yh,`In computing AssertError, a non-string expression (line ${r.location.line}, col ${r.location.column}) was used as the err of an AssertError(err, exp).`);let i=Ti(t,0,`AssertError`)();try{Ti(t,1,`AssertError`)()}catch(t){if(t instanceof e._)return ea(t.message,n.isTool)===i;throw t}return!1}),si(`TLCGetOrDefault`,2,e=>{let t=L(e,0,`TLCGetOrDefault`);return eg(n,t)??L(e,1,`TLCGetOrDefault`)}),{...oi(`TLCGetAndSet`,4,e=>{let r=L(e,0,`TLCGetAndSet`),i=eg(n,r)??L(e,3,`TLCGetAndSet`),a=ii(e,1,`TLCGetAndSet`);return tg(n,t,r,a.call([i,L(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},si(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!ng(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw _i(Xh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return j(n.getBehavior(r).map(e=>rg(e,t.environment)))}),si(`CounterExample`,0,()=>n.counterExample??kn([[`action`,fn([])],[`state`,fn([])]])),R(`ToTrace`,1,t=>{let n=L(t,0,`ToTrace`);if(!k(n)||!At(vr(n),fn([`action`,`state`])))throw new e._(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(n)}`);let r=N(gr(n,`state`)).elements.map(e=>tr(e)??[]);return j(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),R(`TLCModelValue`,1,t=>{let n=L(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.C(`The argument of ModelValue should be a string, but instead it is:\n${I(n)}`);return _t(n)}),wi(`TLCDefer`,1,()=>!0),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),wi(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!ng(i))throw _i(Zh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||hu(Ti(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.j(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),wi(`TLCCache`,2,(e,t)=>{let n=ii(e,0,`TLCCache`),i=Lr(Ti(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=ig(o,t.environment,/* @__PURE__ */ new Set)&&t.state?a(t.state):r,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(i);if(l!==void 0)return l;let u=n.call([]);return c.set(i,u),u}),R(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Dm([L(e,0,`TLCFP`)])))),si(`TLCEvalDefinition`,1,(t,n)=>{let r=L(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?gu(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.C(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.C(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return H({kind:`Identifier`,name:r,location:i.location},n)})]},og=(e,t)=>[si(`_Track`,2,e=>{let n=String(L(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,L(e,0,`_Track`)===!0?r+1:r),!0}),si(`_Counts`,0,()=>Xm(t)),si(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(Xm(t),!0)),!1)}),si(`_PrintCounts`,0,()=>(e(I(Xm(t),!0)),!0))],sg=e=>String(e).padStart(2,`0`),cg=e=>`${e.getUTCFullYear()}.${sg(e.getUTCMonth()+1)}.${sg(e.getUTCDate())}.${sg(e.getUTCHours())}${sg(e.getUTCMinutes())}${sg(e.getUTCSeconds())}`,lg=e=>vn([...e].map(([e,t])=>[e,j([t])])),ug=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),dg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),fg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),pg=(t,n,r)=>{if(t.version===`1.7.4`?!dg.has(n)||!t.isStarted&&fg.has(n):!t.isStarted&&ug.has(n))throw new e.C(`TLCGet(${n}) was undefined.`);let i=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return i;case`stats`:return kn([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return kn([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return kn([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,at(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,at(cg(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return Qh(void 0);case`all`:return lg(t.registers);case`all:named`:return lg(Zm(t))}if(n.startsWith(`s:`)){let r=Zm(t).get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return at(t.properties.get(n.slice(2))??n);throw new e.C(`TLCGet(${n}) was undefined.`)},mg=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.C(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(n)}`);return pg(t,n,r?.state)},hg=e=>e.length===0?[[]]:e.flatMap((t,n)=>hg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),gg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(gg),e.kind===`Function`&&e.range.forEach(gg))},_g=(t,n)=>[R(`Print`,2,e=>(t(`${D(I(L(e,0,`Print`),!0,!0))} ${D(I(L(e,1,`Print`),!0,!0))}`),L(e,1,`Print`))),R(`PrintT`,1,e=>(t(D(I(L(e,0,`PrintT`),!0,!0))),!0)),R(`Assert`,2,t=>{if(L(t,0,`Assert`)!==!0)throw new e.C(`The first argument of Assert evaluated to FALSE; the second argument was:\n${D(I(L(t,1,`Assert`)))}`,e.G.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>vn([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=ri(e,0,`@@`),n=ri(e,1,`@@`);return yn([...Ke(t),...Ke(n)])}),R(`ToString`,1,e=>at(I(L(e,0,`ToString`),!0))),R(`TLCEval`,1,e=>{let t=L(e,0,`TLCEval`);return gg(t),t}),R(`Permutations`,1,e=>{let t=ti(e,0,`Permutations`);return fn(hg(t).map(e=>vn(t.map((t,n)=>[t,e[n]]))))}),oi(`SortSeq`,2,e=>{let t=ii(e,1,`SortSeq`);return j(ni(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`?vi({...si(`TLCGet`,1,(e,t)=>mg(n,L(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):vi(wi(`TLCGet`,1,(e,t)=>mg(n,Ti(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)`),si(`TLCSet`,2,e=>{let r=L(e,0,`TLCSet`);return tg(n,t,r,L(e,1,`TLCSet`)),!0}),ai(`Any`,pt),R(`RandomElement`,1,e=>Jm(ei(e,0,`RandomElement`),n.getRandom()))],vg=(e,t)=>e.every(e=>ar(e,t)),yg=fn([!1,!0]),bg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return _n(bg(e,t,r),bg(e,r,n))},xg=[`\\cup`,`\\cap`,`\\`],Sg=e=>typeof e==`object`&&e.kind===`MixedSet`,Cg=(e,t,n)=>{let r=t.kind===`Interval`?N(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return pn(r.filter(e=>ar(e,n)===t))}if(r.length===0)return n;if(!Be(n))return Et({kind:`SetOperation`,operator:e,left:t,right:n});let i=N(n).elements.filter(e=>!ar(e,t));return pn([...r,...i])},wg=[ai(`TRUE`,!0),ai(`FALSE`,!1),ai(`BOOLEAN`,yg),ai(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ci(`=`,un),ci(`#`,(e,t)=>!un(e,t)),R(`~`,1,e=>!Qr(e,0,`~`)),R(`<=>`,2,e=>Qr(e,0,`<=>`)===Qr(e,1,`<=>`)),R(`/\\`,2,e=>Qr(e,0,`/\\`)&&Qr(e,1,`/\\`)),R(`\\/`,2,e=>Qr(e,0,`\\/`)||Qr(e,1,`\\/`)),R(`=>`,2,e=>!Qr(e,0,`=>`)||Qr(e,1,`=>`)),R(`\\in`,2,e=>ar(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!ar(L(e,0,`\\notin`),L(e,1,`\\notin`))),R(`\\subseteq`,2,e=>{let t=$r(e,0,`\\subseteq`),n=L(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&M(t.base)?vg(N(t.base).elements,n.base):vg(N(t).elements,n)}),...xg.map(e=>R(e,2,t=>{let n=L(t,0,e),r=L(t,1,e);if(Be(n)&&Be(r)&&!Sg(n)&&!Sg(r)){if(e===`\\cup`&&P(n))return r;let t=e===`\\cup`?_n:e===`\\cap`?gn:hn;return ir((e,n)=>t(N(e),N(n)),(t,n)=>Cg(e,t,n),n,r)}return Be(n)?Cg(e,n,r):e!==`\\`&&Be(r)?Cg(e,r,n):Et({kind:`SetOperation`,operator:e,left:n,right:r})})),R(`SUBSET`,1,e=>({kind:`Subset`,base:L(e,0,`SUBSET`)})),R(`UNION`,1,e=>{let t=$r(e,0,`UNION`),n=Ve(t)?t.elements.filter(Ve):[];if(!Ve(t)||n.length!==t.elements.length)return Et({kind:`Union`,base:t});if(Sg(t)||n.some(Sg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{ar(t,e)||e.elements.push(t)})),pn(e.elements)}return n.length===0?mn:bg(n.map(N),0,n.length)}),R(`DOMAIN`,1,t=>{let n=L(t,0,`DOMAIN`);if(!k(n))throw new e._(`DOMAIN expects a function but received ${I(n)}`);return vr(n)})],Tg=bi(`Integers`,`Neg`,`IntValue`,1),Eg=t=>{let n=bi(t,`DotDot`,`IntervalValue`,2);return[xi(t,`+`,`Plus`,(e,t)=>e+t),xi(t,`-`,`Minus`,(e,t)=>e-t),xi(t,`*`,`Times`,(e,t)=>e*t),xi(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.C(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.C(`0^0 is undefined.`);return t**n}),xi(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.C(`The second argument of \\div is 0.`);if(t===`Naturals`){let e=Math.trunc(n/r)|0;return e<0&&Math.imul(e,r)!==n?e-1:e}let i=Math.floor(n/r);if(li(i))throw ui(`${n} \\div ${r}`);return i}),xi(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.C(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),R(`..`,2,e=>({kind:`Interval`,low:yi(L(e,0,`..`),n),high:yi(L(e,1,`..`),n)}))]},Dg=Eg(`Naturals`),Og=Eg(`Integers`),kg=e=>{let t=Dg.indexOf(e);return t===-1?void 0:Og[t]},Ag=[ai(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Dg,Ci(`<`,(e,t)=>e<t),Ci(`>`,(e,t)=>e>t),Ci(`<=`,(e,t)=>e<=t),Ci(`>=`,(e,t)=>e>=t,`>`)],jg=[ai(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Og,Ci(`>=`,(e,t)=>e>=t),R(`-.`,1,e=>{let t=yi(L(e,0,`-`),Tg);if(li(-t))throw ui(`-${t}`);return-t})],Mg=(t,n,r)=>{let i=L(t,n,r),a=tr(i);if(!a)throw new e.C(`${r}\n${I(i)}`);return a},Ng=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:Mg(e,t,n)},Pg=(e,t,n)=>typeof e==`string`?at(e.slice(t,n)):j(e.slice(t,n)),Fg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Ig=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Lg=(e,t)=>{let n=cf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?vi(e,t):e}):t},Rg=t=>Lg(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>Ng(e,0,Fg(``,`Len`)).length),R(`\\o`,2,t=>{let n=Ng(t,0,Ig(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=Mg(t,1,Ig(`t \\o s`,`sequence`));return j([...n,...e])}let r=L(t,1,`\\o`);if(typeof r!=`string`)throw new e.C(`${Ig(`t \\o s`,`string`)}\n${I(r)}`);return at(n+r)}),R(`Append`,2,e=>j([...Mg(e,0,Ig(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(e,1,`Append`)])),R(`Head`,1,t=>{let n=Mg(t,0,Fg(``,`Head`));if(n.length===0)throw new e.C(`Attempted to apply Head to the empty sequence.`);return n[0]}),R(`Tail`,1,t=>{let n=Ng(t,0,Fg(``,`Tail`));if(n.length===0)throw new e.C(`Attempted to apply Tail to the empty sequence.`);return Pg(n,1)}),R(`SubSeq`,3,t=>{let n=Ng(t,0,Fg(`first `,`SubSeq`)),r=Zr(t,1,`SubSeq`),i=Zr(t,2,`SubSeq`);if(r>i)return Pg(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.C(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Pg(n,r-1,i)}),oi(`SelectSeq`,2,e=>{let t=ii(e,1,`SelectSeq`);return j(Mg(e,0,Fg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw Yr(`second`,`SelectSeq`,`operator`,n);return n}))})]),zg=t=>Lg(`FiniteSets`,[R(`IsFiniteSet`,1,t=>{let n=L(t,0,`IsFiniteSet`);if(O(n))return $n(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e._(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${I(n)}\nis a finite set.`:`Attempted to check if the ${He(n)} ${I(n)} is a finite set.`)}),R(`Cardinality`,1,n=>{let r=L(n,0,`Cardinality`);if(!O(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.C(`Attempted to compute cardinality of the value\n${I(r)}`);return Zn(r,t)})]),Bg=/* @__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`]]]),Vg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Ag};case`Integers`:return{extends:[`Naturals`],operators:jg};case`Sequences`:return{extends:[],operators:Rg(n.version)};case`FiniteSets`:return{extends:[],operators:zg(n.version)};case`TLC`:return{extends:[],operators:Lg(`TLC`,_g(t,n))};case`Randomization`:return{extends:[],operators:qh(n)};case`_Possible`:return{extends:[],operators:og(t,n)};case`Json`:return{extends:[],operators:Vh(r)};case`Bags`:return{extends:[],operators:xh(i)};case`TLCExt`:return{extends:[],operators:ag(t,n)};default:return}},Hg=`$subexpression`,Ug=(t,n)=>new e.O(`${t} at line ${n.line}, column ${n.column}`),Wg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Wg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ke(e)){let e=Wg(r,t,n);if(e)return e}},Gg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Kg=(e,t)=>{let n=e.location,r=Gg(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 Ug(`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 Ug(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Hg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Hg,args:e.args,location:n,resolution:ha},location:n}},qg=(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:ha})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ha}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ha};return Kg({...t,params:[...t.params,...r]},a)},Jg=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s={index:0,current:void 0,isFailed:!1},c=(n,i)=>{if(!n)throw Ug(i,a);_a.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.B(n),message:i}}),s.isFailed=!0},l=e=>{let r=[],i=[];for(;s.index<t.length;){let o=t[s.index];if(o.kind!==`Name`)throw Ug(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Ro(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw Ug(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=Sa(u),f=s.index===t.length-1;if(n.args.length!==d&&(!i||n.args.length!==0))return c(r.argumentRanges?.[s.index]??a.range,`The operator ${n.name} requires ${d-n.earlier} arguments.`);if(f)return{definition:u,args:n.args};if(u.kind!==`Operator`)throw Ug(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),s.current=u.body,s.index++},d=()=>{for(;s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&Wg(s.current,e.name,[]);if(!a)return c(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return c(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),s.current=a.label.body,s.index++}},f=e=>{let n=s.current;if(!n)throw Ug(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(e);return}if(n.kind===`Let`){if(e.kind!==`Operand`||Ua(e.operand,1)!==0)throw Ug(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=qa(n);if(r&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),s.current=r.body;return}if(n.kind===`Case`&&e.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[Ua(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw Ug(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=Ua(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Ug(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw Ug(`Unexpected subexpression selector`,a);let i=r?r.sets:Ja(n),c=i?.[Ua(e.operand,i.length)];if(!c)throw Ug(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return qg(p.definition,{...o,args:p.args});for(d();s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw Ug(`A name selector here must be from a LET clause`,a);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return r;if(e)return qg(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw Ug(`Subexpression selection failed`,a);return Kg(o,s.current)},Yg=(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 Wa(e,t,n)},Xg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ke(e).some(Xg),Zg=(e,t,n,r=!1)=>{if(!Xg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Vo(e,e=>Zg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Qg(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))}:Vo(e,e=>Zg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Yg(a.name,[],void 0,t):a.kind===`Apply`?Yg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Jg(o,t,a,r);return c!==a&&ga.add(c),c},Qg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Zg(e.expression,t,n,!0)}))}),$g=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},e_=(e,t)=>Qg(e,$g(t.definitions),()=>!1),t_=(e,t)=>{let n=$g([...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 Qg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Qg(e,n,o):Bo(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=>Xg(e.body))||e.assumptions.some(e=>Xg(e.expression))?{...p,definitions:e.definitions.map(e=>Bo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},n_=(e,t)=>e.maxLevels[t]??3,r_=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=qs({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),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=>ws(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>ws(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ts(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=xs(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)&&ws(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(Js(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.B(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(ys(e.name,i));a!==void 0&&n_(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=xs(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=n_(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.L([...i.values()])}},i_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],a_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),o_=new Map(tf.flatMap(e=>e.map(t=>[t,e[0]]))),s_=e=>o_.get(e)??e,c_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},l_=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},u_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:c_(e)&2147483647,kind:t,isLocal:n}),d_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:s_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:s_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},f_=(e,t)=>{let n=[];for(let r=t;;){let t=d_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},p_=e=>({line:e.line,column:e.column}),m_=(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=f_(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},h_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,g_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},__=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&h_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&h_(e[n+1],e[n+2])?n+=h_(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=>g_[e])}"`:r.text)}return t},v_=e=>e[2]?.text,y_=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},b_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>b_(e.modules,t)).find(Boolean),x_=e=>{let t=e===void 0?[]:se(e),n={module:void 0};return{tokens:t,ranges:y_(t),getModule:()=>n.module??=e===void 0?nm(``):rm(e,t)}},S_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=x_(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:(of.has(i)?t?.(i):void 0)??sf.get(i)??t?.(i)??em(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(v_(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>b_(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},C_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=f_(t,e+1);i.push({location:p_(t[e]),apply:e=>r.forEach(t=>e.put(u_(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,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:p_(u),apply:t=>t.put(u_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&f_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),a_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(p_(u)),i.push({location:p_(u),apply:e=>e.put(u_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(u_(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=s_(e.name);i.push({location:e.location,apply:n=>n.put(u_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(u_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(u_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>xa(e.location,t.location)?-1:+!!xa(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=l_();n.set(i??``,o),ef.toReversed().forEach(e=>o.put(u_(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},w_=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),nf.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=m_(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},ee=m(e=>e.extends),te=m(e=>e.instances),ne=/* @__PURE__ */ new Set([void 0]),h=/* @__PURE__ */ new Map;__(o(void 0)).forEach((e,t)=>{t===3&&af.forEach(i),i(e)});let g=l(void 0);for(;;){let n=ee(g,/* @__PURE__ */ new Set)??te(g,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),h.set(r.unit,[...h.get(r.unit)??[],a]),!ne.has(a)){if(ne.add(a),t(a).tokens.length===0){let n=r.unit??v_(t(void 0).tokens);throw e.I(a,n)}__(o(a)).forEach(i)}}i_.forEach(i);let re=/* @__PURE__ */ new Set,ie=e=>{if(re.has(e))return;re.add(e);let t=h.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ie),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ie(void 0),rf.forEach(i),[...r]},T_=(e,t)=>{let n=S_(e,t),r=n.getParsed,i,a=()=>i??=C_(r);return{getStringOrder:e=>w_(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},E_=t=>{switch(t.kind){case`Number`:if(!Ue(t.value))throw e.q(new e.C(`Integer overflow: ${t.value} is outside TLC's 32-bit range`),e.G.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return _t(t.name);case`Set`:return fn(t.elements.map(E_))}},D_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],O_=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.O))throw r;let i=Op(t);throw i===void 0?r:e.L([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},k_=t=>new e.O(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),A_=(t,n)=>t.location.range&&n.location.range&&{location:e.B(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.B(n.location.range)}.`},j_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,M_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:j_(e),N_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:is(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),P_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>I(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e._(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&At(e,r)})});if(n)return n[1];throw new e._(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},F_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||ke(e).some(e=>F_(e,t)),I_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set($o(e),n.get(e)??n.size)),n},L_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),R_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw iu(e);if(e.kind===`Number`&&!Ue(e.value))throw au(e);R_(e.kind===`Let`?[...ke(e),...L_(e.instances??[])]:ke(e))}),z_=(t,n)=>{let r=n.order??T_(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=new Map(wg.map(e=>[e.name,e])),u=/* @__PURE__ */ new Map,d=Ym(t.checkDeadlock,n.seed);d.isWarningEnabled=n.isWarningEnabled??!0,d.isTool=n.isTool??!1,d.version=n.version??`master`;let f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,ee=[],te=/* @__PURE__ */ new Map,ne=[],h=[],g=(e,t)=>ne.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),re={value:0},ie=e=>`${e}#${re.value++}`,_=[],ae=[],oe=r_(e=>{let t=m.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,le=/* @__PURE__ */ new Map,ue=e=>{let t=u.get(e);if(t)return t;let r=Vg(e,n.print,d,n.files,l);if(!r)return;Bg.get(e)?.forEach(ue);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ue(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{l.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:gs.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:vs(e,t.name)??i.get(t.name)?.range})}),u.set(e,i),i},v=e=>{if(of.has(e)&&n.loadModule?.(e)!==void 0)return;let t=ue(e),r=Bg.get(e)??[];return t&&g(e,r),t&&r.includes(`Integers`)&&ue(`Integers`),t},y=e=>(R_([...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]),...L_(e.instances)]),e.modules.forEach(y),e);y(i);let de=(t,i)=>{let a=n.loadModule?.(t)??Ne.get(t)??em(n.source,t);if(a===void 0)throw e.I(t,i);let o=O_(a,t,r);if(o.name!==t)throw e.L([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return y(o)},fe=t=>{let n=h.indexOf(t.name);if(n!==-1){let r=[...h.slice(n),t.name].map(e=>`${e}.tla`);throw new e.O(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];h.push(t.name),ne.push(r);let s=ye(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:ae,levelChecks:o});if(ne.pop(),h.pop(),a.length>0)throw e.L(a,!1,void 0,ae);let c=i.find(e=>r.has(e.name)),l=c&&f.get(c.name),u=l&&A_(c,l.module);if(u)throw e.L([u],!1,void 0,ae);if(c)throw k_(c);return o.forEach(e=>e()),{linked:s,closure:r}},pe=(e,t)=>{let r=f.get(e);if(r)return g(e,te.get(e)??[]),r;let i=fe(de(e,t));return(th(d.version).has(e)?Vg(e,n.print,d,n.files,l):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(l.set(t.key,e),a.delete(t.key))}),f.set(e,i.linked),te.set(e,i.closure),g(e,i.closure),i.linked},b=(e,t,n,r,i)=>{let l=i?void 0:v(e.module);if(l)return x(e,l);let u=i??pe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=D_(u),f=`#${re.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=jo(e_(e,t),d,t,n);_.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let ee=ds({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Fo(t,p)])),variables:new Set(u.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ie(`${i}@${t.name}`),f=l(u);return a.set(u,f),d.length>0&&c.add(f),e.name!==void 0&&ce.set(u,`${e.name}!${ce.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ie});return S(e,u.exported,d,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return d.length>0&&se.set(r,{name:n,location:e.location}),e.name!==void 0&&le.set(r,n),r})},x=(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}])),S=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},C=(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:as(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),me=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),he=(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=me(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:as(r,n),location:n}}},ge=(e,t,n,r)=>{let i=e.location,s=r?void 0:v(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=me(n.arity);return C(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${re.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=D_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};_.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>F_(f(e),p),ee=d.map(t=>{let n=he(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),te=[],ne=ds({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:as(e.params,i),location:i,resolution:ha}:is(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${te.length}`,a=r(i);return te.push(a.kind===`Operator`?{...a,name:i}:N_(a,i)),i},createName:ie}),h=new Set(d.map(e=>e.name)),g=[...c.exported].filter(([e])=>!h.has(e)).map(([t,n])=>{let r=ne.getKey(n.key),a=me(n.arity),o=[...e.params,...a];return C(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...ee,...te,...g]},_e=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),ve=/* @__PURE__ */ new Map,ye=(t,r)=>{let s=$d(t,n.loadClass?.(t.name),t===i);ve.set(t.name,s.overrides);let c=s.module,l=_.length,u=new Map([...wg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Eo,errors:[],warnings:[]},te=[f],ne=t=>t.forEach((t,n)=>{let r=h.get(n);if(!r){u.set(n,t),h.set(n,t);return}if(!r.range||!t.range||e.B(r.range)===e.B(t.range))return;let i=e.B(t.range),a=e.B(r.range);M_(r.kind)===M_(t.kind)?f.warnings.push({location:i,message:`Warning: the ${j_(r.kind)} of '${n}' conflicts with \nits ${j_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${j_(t.kind)} of '${n}' conflicts with \nits ${j_(r.kind)} at ${a}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,re=/* @__PURE__ */ new Map,ie=[],se=[...c.constants],ce=c.variables.map(e=>e.name),ue=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:v(e);if(n){ne(n);return}let i=t??pe(e,c.name);se.push(...i.constants.filter(e=>se.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{ce.includes(e)||(ce.push(e),ue.push(i.variableLocations[t]))}),ne(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>re.set(t,e)),ie.push(i)});let y=new Map(u),de=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],fe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});de.forEach(e=>h.set(e.name,fe(e)));let C=e=>({key:he(e),arity:Sa(e),params:Ca(e),kind:Do(c,e)?`Theorem`:`Definition`,range:e.location.range}),me=se.length===0&&ce.length===0,he=e=>c===i?e.name:`${e.name}@${r.id}`,w=/* @__PURE__ */ new Map,T=()=>new Map([...r.modules,...re]),be=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&xa(e.location,t.location)},xe=e=>{let t=c.modules.find(t=>t.name===e.module);return t?be(t)?re.get(t.name):void 0:T().get(e.module)},Se=e=>({imported:u,getInstance:e=>{let t=xe(e),n=t?void 0:v(e.module);if(n)return{declarations:[],symbols:x(e,n),instancer:c.name};let r=t??pe(e.module,c.name),i=D_(r);return{declarations:i,symbols:S(e,r.exported,i,e=>e),instancer:c.name}},bound:y,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:he,instanced:w,facts:g,reports:te,warnings:r.warnings}),Ce=e=>[...de.filter(t=>xa(t.location,e)).map(e=>[e.name,fe(e)]),...c.definitions.filter(t=>xa(t.location,e)).map(e=>[e.name,C(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),we=e=>{let t=T(),n=t.get(e.name),i=n&&A_(e,n.module);if(n&&!i)throw k_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};te.push(a);let o=ye(e,{id:`${r.id}/${e.name}`,symbols:Ce(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||re.set(e.name,o),p.has(e.name)||p.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=b(e,c,Se(c),me,T().get(e.module));w.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||h.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>we(e)}))].sort((e,t)=>xa(e.location,t.location)?-1:1).forEach(e=>e.link());let Te=t_(hs(c,(e,t)=>ge(e,t,c.name,xe(e))),_e(u));r.errors.push(...No(Te,Se(Te))),Te.definitions.forEach(e=>{let t=he(e);a.set(t,e),o.set(t,!me);let n=C(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!xa(r,e.location))&&(u.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ee={module:Te,constants:se,variables:ce,variableLocations:ue,visible:u,exported:h,modules:re,extended:ie,facts:/* @__PURE__ */ new Set([...g,...[...Te.theorems,...Te.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Ee);let De=_.splice(l).map(e=>({location:e.location,check:()=>oe(e)}));return r.levelChecks.push(()=>Ys(Te,{constants:new Set(se.map(e=>e.name)),variables:new Set(ce),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>le.get(u.get(e)?.key??e)},De,ae)),ee.push(Ee),Ee},w=fe(i).linked;ae.length>0&&!n.isSanyReported&&n.print(e.V(ae));let T=e=>w.visible.get(e)?.key??e;w.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let be=[],xe=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>xe(e,t)),be.push(...e.module.assumptions))};xe(w,/* @__PURE__ */ new Set);let Se=w.constants.map(e=>e.name),Ce=w.variables,we=e=>e.module===void 0?[e.name,T(e.name)]:e.module===i.name||Se.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],Te=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:w.constants.find(t=>t.name===e)?.arity??0},Ee=/* @__PURE__ */ new Map,De=/* @__PURE__ */ new Set,Oe=(e,t)=>{l.set(e,t),a.delete(e),Ee.delete(e),De.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=E_(e.value);ln(t),we(e).forEach(e=>{let n=Te(e);n===0?Ee.set(e,t):Oe(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ke=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=ke.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.h(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(E_),E_(t.value)]),ke.set(n,r)}),ke.forEach(e=>we(e).forEach(t=>Oe(t,P_(e.name,Te(t)||e.rows[0][0].length,e.rows))));let E=new Map(t.substitutions.flatMap(e=>we(e).map(t=>[t,T(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!Se.includes(r)&&!w.visible.has(r))throw new e.h(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e.h(`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 o=T(i),s=a.get(o);if(!(s!==void 0||l.has(o)||Ee.has(o)||Se.includes(i)||Ce.includes(i)))throw new e.h(`The configuration file substitutes for ${r} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(w.constants.find(e=>e.name===r)?.arity??w.visible.get(r)?.arity))throw new e.h(`The configuration file substitutes for ${r} with ${i} of different number of arguments.`)});let Ae=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(we)),je=(e,t)=>{if(Ae.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&je(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=je(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=C(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),w.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Me=Se.filter(e=>!Ee.has(e)&&!E.has(e)&&!De.has(e));if(Me.length>0&&!n.isUnconfigured){let t=r.getDeclarationOrder(`constant`).find(e=>Me.includes(e))??Me[0];throw new e.h(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&l.forEach((e,t)=>{let n=kg(e);n&&l.set(t,n)});let Pe=I_(Ce,ee.flatMap(e=>e.module.variables.map(e=>e.name))),Fe=lc({definitions:a,substitutions:E,constants:Ee,variableIndex:Pe,builtins:l,variables:Ce}),Ie={runtime:d,definitions:a,builtins:l,constants:Ee,substitutions:E,instanceNames:ce,variables:Ce,variableIndex:Pe,facts:Fe,startupValues:Array.from({length:Fe.ids.size},()=>void 0),substitutedDefinitions:c,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Le=qs({constants:new Set(Ee.keys()),variables:/* @__PURE__ */ new Set([...Ce,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>l.has(e))]),getDefinition:e=>gu(e,Ie)}),Re=t=>{try{H(t,{environment:Ie,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e._)return t;throw t}};E.forEach((t,n)=>{let r=a.get(t),i=Se.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Le.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Re(r.body):void 0;if(i){let r=Zi(i)?``:` - specifically: ${i.message}`;throw new e.h(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),d.version!==`1.7.4`&&(d.isStarted=!0);let D=new Set(ee.flatMap(e=>e.module.instances.map(e=>e.module))),ze=r.createDefinitionOrder();return{environment:Ie,assumptions:be,variableLocations:w.variableLocations,instanceActions:se,startupDefinitions:ee.filter(e=>!D.has(e.module.name)||D_(e).length===0).flatMap(e=>ze(e===w?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:w.constants,rootSymbols:w.visible,javaOverrides:ee.flatMap(e=>ve.get(e.module.name)??[])}},B_={kind:`Boolean`,value:!0},V_={kind:`Boolean`,value:!1},H_=e=>e?B_:V_,U_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,W_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),G_=(e,t,n)=>({kind:e,operands:[t,n]}),K_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?K_(e,t.operands).operands:[t])}),q_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return q_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,q_(t)),0)}},J_=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 J_(e.body);case`And`:case`Or`:return e.operands.some(J_)}},Y_=/* @__PURE__ */ new WeakMap,X_={count:0},Z_=e=>{let t=Y_.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`#${X_.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Z_).join(`,`)})`;default:return`${e.kind}(${Z_(e.body)})`}})();return Y_.set(e,n),n},Q_=(e,t)=>e===t||Z_(e)===Z_(t),$_=(e,t)=>{let n=Z_(t);return e.some(e=>e===t||Z_(e)===n)},ev=e=>e===`And`?`Or`:`And`,tv=(e,t)=>{switch(e.kind){case`Boolean`:return t?H_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return tv(e.body,!t);case`And`:case`Or`:return K_(t?ev(e.kind):e.kind,e.operands.map(e=>tv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,tv(e.body,t))}}},nv=e=>{switch(e.kind){case`Boolean`:return H_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return K_(ev(e.kind),e.operands.map(nv));case`Always`:return $(`Eventually`,nv(e.body));case`Eventually`:return $(`Always`,nv(e.body));default:return $(`Not`,e)}},rv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=rv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return H_(t)}return n.length===0?H_(!t):n.length===1?n[0]:K_(e.kind,n)}case`Not`:{let t=rv(e.body);return t.kind===`Boolean`?H_(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=rv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},iv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,av=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=av(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r.value*=t.operands.length,r.value>2147483647))throw new e._(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r.value===1)return{kind:`And`,operands:n};let i=Array.from({length:r.value},()=>[]),a={groups:1,repeat:r.value};for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}a.repeat/=e.operands.length;let t={value:0};for(let n=0;n<a.groups;n++)for(let n of e.operands)for(let e=0;e<a.repeat;e++)i[t.value++].push(n);a.groups*=e.operands.length}return{kind:`Or`,operands:i.map(e=>K_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=av(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=iv(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:K_(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return K_(`Or`,n)}case`Not`:return U_(t.body)?t:av(nv(t.body));default:return t}},ov=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?ov(e.operands[0]):K_(e.kind,e.operands.map(ov));case`Not`:return e.body.kind===`Not`?ov(e.body.body):$(`Not`,ov(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,ov(e.body));default:return e}},sv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return sv(e.operands[0]);let t=Math.floor(e.operands.length/2);return G_(e.kind,sv(K_(e.kind,e.operands.slice(0,t))),sv(K_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,sv(e.body));default:return e}},cv=(e,t)=>{e.kind===`Eventually`&&!$_(t,e)&&t.push(e),`body`in e&&cv(e.body,t),`operands`in e&&e.operands.forEach(e=>cv(e,t))},lv=e=>{let t=e.filter(W_),n=e.flatMap(e=>e.kind===`Not`&&W_(e.body)?[e.body]:[]);return!t.some(e=>$_(n,e))},uv=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,$(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e._(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},dv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},fv=(e,t,n)=>e.flatMap(e=>{let r=dv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),pv=e=>[...new Set(e.map(Z_))].sort().join(`|`),mv=(e,t)=>{let n=new Set(t.map(pv));return[...e.filter(e=>!n.has(pv(e))),...t]},hv=e=>{let t=uv(e),n=fv(t,`Always`,`And`),r=fv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=dv(t,`Eventually`,`Or`);if(n&&!($_(e,n.first)||$_(e,n.second)))return mv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>($_(e,t.first)||$_(e,t.second))&&!$_(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!lv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=dv(t[e],`Always`,`And`);n&&($_(t,n.first)||t.push(n.first),$_(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)$_(t,e.first)&&$_(t,e.second)&&!$_(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!lv(t)?[]:i(t)};return a(e)},gv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>q_(e)<=1)}),_v=e=>{let t=hv([e]).map(gv),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 hv(n)){let n=pv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(gv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},vv=(e,t)=>!$_(e,t)||$_(e,t.body),yv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&q_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=iv(t);if(r){let e=q_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(J_(t))throw new e._(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},bv=(e,t)=>{let n=e.findIndex(e=>Q_(e,t));return n===-1?(e.push(t),e.length-1):n},xv=e=>{let t=av(rv(tv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=ov(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])yv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:K_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Q_(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&sv(e.formula),n=[];t&&cv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>bv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>bv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>bv(i,e))}));return{tableau:t&&_v(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Sv=()=>e.q(new e._(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.G.livenessEvaluationFailure),Cv=/* @__PURE__ */ new Set([`~>`,`-+->`]),wv=/* @__PURE__ */ new WeakSet,Tv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ev=(t,n)=>new e._(`TLC cannot handle the temporal formula ${B(t)}${n===void 0?``:`:\n${n}`}`),Dv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=lu(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return r.isReleased?0:Dv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Dv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=gu(e,n);if(t)return hc(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:E(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Vo(e,(e,a)=>(i.value=Math.max(i.value,Dv(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 Cv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Ov=(t,n)=>{try{return Tu(t,n)}catch(t){if(!(t instanceof e._))throw t;if(!Zi(t))return;throw e.q(new e._(`${e.P}${t.message}`),e.G.error)}},kv=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s)=>{let c=(e,t,n=s,c=a,l)=>kv(e,t,r,i,c,o||l!==void 0&&r.substitutedDefinitions.has(l),n);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,n,B(e)));if(t.kind===`Label`)return c(t.body,n);if(t.kind===`Let`)return c(t.body,Av(t,n,r));if(t.kind===`Identifier`){let i=E(t)?lu(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return c(i.expression,i.scope);let o=r.constants.has(t.name)?void 0:gu(t.name,r);if(!i&&o?.kind===`Operator`&&o.params.length===0&&hc(o,r)>0){if(a.has(o))throw e.z();return c(o.body,void 0,o.name,/* @__PURE__ */ new Set([...a,o]),o)}}let l=Tv(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||Dv(t,n,r)===3)){let e=qu(t,l),n=E(t)?void 0:gu(t.operator,r);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&!o)return c(e.body,ad(e,t.args,l),t.operator,a,n)}let u=i&&t.kind===`Forall`&&t.bounds.every(e=>Dv(e.set,n,r)===0),d=u?Ov(t.bounds,l):void 0;if(u&&d){let e=[];if(Eu(t.bounds,d,n,n=>(e.push(...c(t.body,n,B(t.body))),!1)),e.length===0)throw Sv();return e}return[{expression:t,scope:n,name:s}]},Av=(e,t,n)=>{let r=ld(e.definitions,Tv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&wv.add(e.binding);return r},jv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?Dv(t,n,r):a;if(o===0){let i=H(t,Tv(r,n));if(typeof i!=`boolean`)throw new e._(`TLC expected a boolean value, but did not find one. ${Zl(t)}`);return H_(i)}return o===1?{kind:`State`,expression:t,scope:n}:{kind:`Action`,expression:t,unchanged:void 0,scope:n}},o={depth:0},s=(t,n,r,i)=>{if(o.depth>=100)throw e.z();o.depth++;let s=p(t,n);o.depth--;let c=q_(s);return c>2?s:a(r,i,c)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=Tv(r,t),o=E(e)||gu(n,r)===void 0?lu(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&wv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:E(e)?Ju(n,a):Ku(n,r);if(c?.kind!==`Closure`)throw Ev(e);let u=e.kind===`Apply`?e.args:[],d=!E(e)&&gu(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,ad(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.D||r&&!i;throw!(n instanceof e._)||a?n:Ev(t)}},u=(t,n)=>{let i=Dv(t,n,r);if(!t.bounds.every(e=>Dv(e.set,n,r)===0)){if(i<=2)return a(t,n,i);throw Ev(t)}let o=[],s=t.kind===`Forall`;try{Du(t.bounds,Tv(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e._)||r instanceof e.D)throw r;if(i<=2)return a(t,n,i);throw Ev(t,s&&!Zi(r)?r.message:void 0)}return o.length===0?H_(s):d(t,n,K_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=q_(n);return r>2?n:a(e,t,r)},f=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===`~`&&!E(e)||e.operator===`=>`),p=(e,t)=>{let n=Dv(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Av(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,G_(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!E(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,G_(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,K_(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Dv(e.condition,t,r)===0){let n=H(e.condition,Tv(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,G_(`Or`,G_(`And`,n,p(e.consequent,t)),G_(`And`,$(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`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`?$(`Always`,$(`Eventually`,G_(`Or`,i,a))):G_(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Ev(e)}};return p(t,n)},Mv=(t,n,r,i,a)=>{let o=e=>Mv(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r={environment:i,scope:t.scope,state:n,next:void 0},o=t.kind===`State`?hu(H(t.expression,r),`a temporal property predicate`):Bl(t.step,r);return a.set(t,o),o}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let e={environment:i,scope:t.scope,state:n,next:r};return t.unchanged&&hu(H(t.unchanged,e),`a subscript`)?!1:hu(H(t.expression,e),`an action predicate`)}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return Mv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e._(`TLC cannot evaluate a temporal formula in a single step`)}},Nv=(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)=>Nv(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 Mv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Pv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Fv=(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},Iv=t=>e.q(new e._(`${e.F}${t}`),e.G.error),Lv=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!A(e)||!A(i))throw Iv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Rv=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Rv);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},zv=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Bv=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.h(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Iv(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>H(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!O(o)||!M(o))throw Iv(`The symmetry operator must specify a set of functions.`);let s=N(o).elements;if(!s.every(k))throw Iv(`The symmetry values must be function records.`);let c=s.map(Lv),l=i.body.kind===`Apply`?i.body.args:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=Rv(zv(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Vi.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;c.forEach(e=>{e.size>0&&f.set(Pv(e),e)});let p=[...f.values()],m={start:0};for(;m.start<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m.start,t).forEach(e=>{let t=Fv(n,e),r=Pv(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let ee=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),te=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!zv(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||te.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>A(e)&&ee.has(e.name))})),f.size!==0)return[...f.values()]},Vv=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Uv(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(Uv(e[r],t));return a}},Hv=(e,t)=>{let n=[],r=[];for(let i of e){let e=Uv(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(ht);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(ht(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},Uv=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=Hv(e.elements,t);return n?vt(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=Vv(n.domain,t),i=Vv(n.range,t)??n.range;if(r){let e=vn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?yt(n.domain,e.range):e}return i===n.range?n:yt(n.domain,i)}if(n===`Interval`||!O(e)||!M(e))return e;let r=N(e),i=Vv(r.elements,t);return i?fn(i):r},Wv=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=Uv(e[o],i),a===0&&(a=ht(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Gv={line:0,column:0},Kv=e=>({kind:`Identifier`,name:e,location:Gv}),qv=/* @__PURE__ */ new Set([`name`,`property`]),Jv=(t,n,r)=>{let i=gu(n,r);if(!i)throw new e.h(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.h(qv.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},Yv=(t,n,r)=>{if(fc(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return H(Kv(t),_y(r,void 0,void 0))}catch(t){if(t instanceof e._||e.W(t))return;throw t}},Xv=(t,n,r)=>{let i=Jv(t,n,r);if(Yv(n,i,r)!==void 0)throw new e.h(`The ${t} ${n} cannot be a constant.`);return i},Zv=(t,n,r)=>{let i=r.constants.has(n)?void 0:Jv(t,n,r),a=i?Yv(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.h(`The ${t} of ${n} is equal to ${I(a)}`);return a===void 0?i:void 0},Qv=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},$v=(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})),Uu(e.startupDefinitions,r),t.invariants.forEach(e=>{Zv(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},ey=(t,n)=>{let r=qs({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>gu(e,n)});return t.flatMap(t=>{let i=Zv(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1763
1763
  Note that a bug can cause TLC to incorrectly report this error.
1764
1764
  If you believe your TLA+ or PlusCal specification to be correct,
1765
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.K(new e.h(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.W.safetyEvaluationFailure)}return[{name:t,expression:Rv(t),scope:void 0}]})},qv=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>qv(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=pu(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return qv(n.body,t)}return[e]},Jv=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||yv(i,t.scope,n)>0)return!1;let a=H(i,ly(n,void 0,void 0,t.scope));if(a===!1)throw new e.h(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.h(`The operator ${i.name}, which equals ${I(a)},\ncannot be used as a ${r}`);return!0},Yv=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Hv(t,e,n),Rv(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 e.h(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=Bv(`name`,t.specification,n),s=Vv(t.specification,o,n);if(s!==void 0)throw new e.h(`The value of ${t.specification} is equal to ${I(s)}`);if(xv(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(Jv(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.K(new e.h(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.W.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){i.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&yv(s.expression,o.scope,n)<2)throw e.K(new e._(`TLC cannot handle the temporal formula ${B(s.expression)}`),e.W.error);let c=yv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.h(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.h(`The specification ${t.specification} must contain at most one [][Next]_vars`);let c=[...r,...i],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:r.length===0?void 0:{kind:`And`,operands:r.map(d),location:Lv},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},Xv=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=Uv(`property`,t,n);if(!a)return;yv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;xv(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(Jv(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&yv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!E(e)?pu(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=yv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2)throw new e.h(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},Zv=(e,t,n)=>t.flatMap(t=>Uv(e,t,n)?[{name:t,expression:Rv(t),scope:void 0}]:[]),Qv=(e,t)=>{let n=pu(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},$v=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.h(`_POSSIBLE lists ${r} more than once`);Hv(`possible`,r,n);let a=Rv(r);if(yv(a,void 0,n)===3)throw new e.h(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),ey=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||E(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},ty=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=pu(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},ny=(e,t)=>e.flatMap(e=>qv(e.expression,t).map(n=>{let r=e.scope===void 0?mc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:ey(n,r,t),predicate:ty(e.expression,t)}})),ry=(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},iy=/[\u0100-\uffff]/,ay=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),oy=e=>e.kind===`String`?iy.test(e.value):e.kind===`Set`&&e.elements.some(oy),sy=e=>e.kind===`String`&&iy.test(e.value)||e.kind===`Apply`&&ay.has(e.operator)||ke(e).some(sy),cy=(e,t)=>e.constants.some(e=>oy(e.value)||(e.args??[]).some(oy))||[...t.definitions.values()].some(e=>sy(e.body)||e.kind===`Function`&&e.bounds.some(e=>sy(e.set))),ly=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),uy=(e,t,n)=>fu(H(e,t),n),dy=(t,n,r=fy)=>{let i=H(t,n);if(typeof i!=`boolean`)throw new e._(r(t,n.environment));return i},fy=(e,t)=>{let n=e.kind===`Identifier`?pu(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`?ql(i):Jl(r)}`},py=(e,t)=>dy(e.expression,t,(n,r)=>(dy(e.predicate,t),fy(n,r))),my=()=>{},hy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=uy(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),gy=(t,n,r)=>{try{return uy(t,ly(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e._)return{message:t.message};throw t}},_y=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=gy(n.expression,t,`an assumption`);if(e)return{name:B(n.expression),trace:[],message:e.message}}},vy=(t,n,r,i)=>{let a=Kv(t.invariants,n),o=Yv(t,n),s=Xv(t,n,i),c=ny([...a,...s.invariants],n),l=[...new Map(c.map(e=>[e.predicate,e])).values()],u=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(u||s.initialPredicates.length>0||n.variables.length>0))throw new e.h(n.runtime.version===`1.7.4`?Wi:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.h(`The configuration file did not specify the next state predicate.`);let d=ny(Zv(`constraint`,t.constraints,n),n),f=Zv(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&Bv(`rlreward`,t.rlReward,n),t.periodic!==void 0&&Bv(`periodic`,t.periodic,n);let p=$v(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:Mv(t.symmetry,n,t.substitutions);t.view!==void 0&&Bv(`view function`,t.view,n);let ee=t.view===void 0?void 0:{name:t.view,expression:Rv(t.view),scope:void 0},te=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Lv};return{...e,unchanged:t}}),ne=e=>yv(e.expression,void 0,n)>=2,h=p.filter(e=>!ne(e)),g=p.filter(ne),re=n.runtime,ie={indices:void 0},_=()=>{if(ie.indices)return ie.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return ie.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ie.indices},ae=(e,t)=>H(e,ly(n,t,void 0)),oe=e=>{let t=_(),n=m===void 0?e:Iv(e,m,t);return ym(ee===void 0?t.map(e=>n[e]):[ae(ee.expression,n)])},se=/* @__PURE__ */ new WeakSet,ce=(t,r,i)=>{let a=i&&!se.has(i)?i:void 0;if(ry(t,r,a))return!1;try{let e=ly(n,r,void 0,t.scope),i=t.membership;return a&&i?!cr(r[i.variable],a[i.variable],H(i.set,e)):!py(t,e)}catch(n){throw i?ia(e.K(n,e.W.safetyEvaluationFailure),Bi.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},le=cy(t,n);re.getFingerprint=oe;let ue=()=>{let e=p.find(e=>!re.possibleCounts.get(e.name));if(!e)return;let t=Qv(e.name,n),r=t?` at ${ql(t)}`:``;return{name:e.name,code:Bi.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:D(I(Hm(re),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:_,getStoredFingerprints:(e,t)=>ee!==void 0||le?BigInt64Array.from(e,oe):bm(t,_()),getFingerprintState:e=>{if(le)return[String(oe(e))];let t=m===void 0?e:Iv(e,m,_());return ee===void 0?t:[ae(ee.expression,t)]},findViolatedInvariant:(e,t)=>{let n=c.find(n=>ce(n,e,t));return n&&se.add(e),n},getViolatedInvariants:e=>{let t=l.filter(t=>c.some(n=>n.predicate===t.predicate&&ce(n,e,void 0)));return t.length>0&&se.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>dy(n,ly(t,e,void 0,r));d.every(e=>r(e.predicate,e.scope))&&n();let i=l.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(d.every(e=>dy(e.predicate,ly(n,t,void 0,e.scope)))&&f.every(r=>dy(r.expression,ly(n,e,t,r.scope))))||r())||l.every(e=>dy(e.predicate,ly(n,t,void 0,e.scope))))&&te.every(r=>dy(r.box,ly(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>ry(r,e,t)||py(r,ly(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!dy(t.expression,ly(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>te.find(r=>{try{return!dy(r.action,ly(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${B(r.box)}`)&&!uy(r.unchanged,ly(n,e,t,r.scope),`a subscript`)}catch(e){throw ia(yy(e),Bi.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>dy(i.expression,ly(n,t,r),t=>`${e.P}${fy(t,n)}`)),trackStatePossible:h.length===0?my:e=>hy(h,re,ly(n,e,void 0)),trackActionPossible:g.length===0?my:(e,t)=>hy(g,re,ly(n,e,t)),findUnwitnessedPossible:ue,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=pu(e,n);return t!==void 0&&zu(t,n)!==void 0});if(i!==void 0){if(r)return;throw e.K(new e._(`${e.P}The post condition ${i} cannot be a constant.`),e.W.error)}let a=ue();if(a)return a;for(let e of t.postconditions){let t=gy(Rv(e),n,`a postcondition`);if(!t)continue;let r=Qv(e,n),i=r?` at ${ql(r)}`:``;return t.message===void 0?{name:e,code:Bi.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Bi.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},yy=t=>t instanceof e.C?e.K(t,t.exitCode):t,by=(e,t)=>e*((t-e)/2**64),xy=e=>e.includes(`.`)?e:`${e}.0`,Sy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return xy(String(e));let[n,r]=e.toExponential().split(`e`);return`${xy(n)}E${r.replace(`+`,``)}`},Cy=e=>e!==void 0&&e>=`0`&&e<=`9`,wy=e=>{if(e===0)return`0.0`;let t=Sy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Cy(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(;Cy(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Cy(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Cy(t[n.next])&&Number(t[n.next])>=5&&(n.result=Ty(n.result));Cy(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Ty=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ty(r)}.`:n===`9`?`${Ty(r)}0`:`${r}${Number(n)+1}`},Ey=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}`)},Dy=(e,t,n)=>{if(by(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},Oy=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}).`},ky=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Ay=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^kr(e[t]),16777619),r=Math.imul(r^Fr(e[t]),1540483477);t[0]=ky(n)||1,t[1]=ky(r)},jy=()=>{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)}}},My=(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}},Ny=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Py=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return My(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Fy=e=>Atomics.load(e.used,0)*2>=e.slots.length,Iy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&My(t,n);return{slots:t,used:e.used}},Ly=[void 0,`lambda`,`tuple`,`record`],Ry=()=>{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=gr(e.domain);return t?(r(7),r(Ly.indexOf(St(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Ly.indexOf(St(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})}},zy=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 _t(t.strings[n[r.index++]]);if(e===5)return vt(i(n[r.index++]));let a=Ly[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=En({kind:`Interval`,low:e,high:e+t-1});return xt(yt(o,i(t)),a)}let o=n[r.index++],s=i(o);return xt(yt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return pu}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return U_}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Gr}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Kp}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return nt}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return wv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return R_}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return On}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Cv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return Gh}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return qd}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Zp}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return Km}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return kr}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return pd}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return ee}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return id}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return Oe}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return Gm}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return k}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return j_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Dr}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return __}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Or}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return fn}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Wh}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return ql}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return qm}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Mt}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return mv}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return aa}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return yv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Ft}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Xp}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return bp}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return E}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return B}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return wu}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Hv}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return ta}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Iy}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Bl}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return Gv}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return la}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Ay}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Uc}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Bi}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return cd}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return by}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Vi}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return _y}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return na}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return vy}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return $i}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Ny}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Rl}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return uv}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return pv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return j}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return wy}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Wc}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Rv}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Qi}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Ry}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return ou}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Py}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return zl}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Oy}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Ui}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return nd}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return jy}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Uu}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Fy}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Vl}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return zy}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return sd}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Ey}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return lc}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return ly}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Yi}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Tv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return br}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return yy}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Xi}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Wv}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return pa}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return ym}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return kt}});
1765
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.q(new e.h(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.G.safetyEvaluationFailure)}return[{name:t,expression:Kv(t),scope:void 0}]})},ty=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>ty(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=gu(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return ty(n.body,t)}return[e]},ny=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||Dv(i,t.scope,n)>0)return!1;let a=H(i,_y(n,void 0,void 0,t.scope));if(a===!1)throw new e.h(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.h(`The operator ${i.name}, which equals ${I(a)},\ncannot be used as a ${r}`);return!0},ry=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Xv(t,e,n),Kv(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 e.h(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=Jv(`name`,t.specification,n),s=Yv(t.specification,o,n);if(s!==void 0)throw new e.h(`The value of ${t.specification} is equal to ${I(s)}`);if(kv(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(ny(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.q(new e.h(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.G.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){i.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Dv(s.expression,o.scope,n)<2)throw e.q(new e._(`TLC cannot handle the temporal formula ${B(s.expression)}`),e.G.error);let c=Dv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.h(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.h(`The specification ${t.specification} must contain at most one [][Next]_vars`);let c=[...r,...i],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:r.length===0?void 0:{kind:`And`,operands:r.map(d),location:Gv},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},iy=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=Zv(`property`,t,n);if(!a)return;Dv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;kv(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(ny(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&Dv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!E(e)?gu(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=Dv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2)throw new e.h(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},ay=(e,t,n)=>t.flatMap(t=>Zv(e,t,n)?[{name:t,expression:Kv(t),scope:void 0}]:[]),oy=(e,t)=>{let n=gu(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},sy=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.h(`_POSSIBLE lists ${r} more than once`);Xv(`possible`,r,n);let a=Kv(r);if(Dv(a,void 0,n)===3)throw new e.h(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),cy=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||E(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},ly=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=gu(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},uy=(e,t)=>e.flatMap(e=>ty(e.expression,t).map(n=>{let r=e.scope===void 0?_c(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:cy(n,r,t),predicate:ly(e.expression,t)}})),dy=(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},fy=/[\u0100-\uffff]/,py=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),my=e=>e.kind===`String`?fy.test(e.value):e.kind===`Set`&&e.elements.some(my),hy=e=>e.kind===`String`&&fy.test(e.value)||e.kind===`Apply`&&py.has(e.operator)||ke(e).some(hy),gy=(e,t)=>e.constants.some(e=>my(e.value)||(e.args??[]).some(my))||[...t.definitions.values()].some(e=>hy(e.body)||e.kind===`Function`&&e.bounds.some(e=>hy(e.set))),_y=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),vy=(e,t,n)=>hu(H(e,t),n),yy=(t,n,r=by)=>{let i=H(t,n);if(typeof i!=`boolean`)throw new e._(r(t,n.environment));return i},by=(e,t)=>{let n=e.kind===`Identifier`?gu(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`?Xl(i):Zl(r)}`},xy=(e,t)=>yy(e.expression,t,(n,r)=>(yy(e.predicate,t),by(n,r))),Sy=()=>{},Cy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=vy(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),wy=(t,n,r)=>{try{return vy(t,_y(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e._)return{message:t.message};throw t}},Ty=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=wy(n.expression,t,`an assumption`);if(e)return{name:B(n.expression),trace:[],message:e.message}}},Ey=(t,n,r,i)=>{let a=ey(t.invariants,n),o=ry(t,n),s=iy(t,n,i),c=uy([...a,...s.invariants],n),l=[...new Map(c.map(e=>[e.predicate,e])).values()],u=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(u||s.initialPredicates.length>0||n.variables.length>0))throw new e.h(n.runtime.version===`1.7.4`?Gi:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.h(`The configuration file did not specify the next state predicate.`);let d=uy(ay(`constraint`,t.constraints,n),n),f=ay(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&Jv(`rlreward`,t.rlReward,n),t.periodic!==void 0&&Jv(`periodic`,t.periodic,n);let p=sy(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:Bv(t.symmetry,n,t.substitutions);t.view!==void 0&&Jv(`view function`,t.view,n);let ee=t.view===void 0?void 0:{name:t.view,expression:Kv(t.view),scope:void 0},te=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Gv};return{...e,unchanged:t}}),ne=e=>Dv(e.expression,void 0,n)>=2,h=p.filter(e=>!ne(e)),g=p.filter(ne),re=n.runtime,ie={indices:void 0},_=()=>{if(ie.indices)return ie.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return ie.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ie.indices},ae=(e,t)=>H(e,_y(n,t,void 0)),oe=e=>{let t=_(),n=m===void 0?e:Wv(e,m,t);return Dm(ee===void 0?t.map(e=>n[e]):[ae(ee.expression,n)])},se=/* @__PURE__ */ new WeakSet,ce=(t,r,i)=>{let a=i&&!se.has(i)?i:void 0;if(dy(t,r,a))return!1;try{let e=_y(n,r,void 0,t.scope),i=t.membership;return a&&i?!lr(r[i.variable],a[i.variable],H(i.set,e)):!xy(t,e)}catch(n){throw i?aa(e.q(n,e.G.safetyEvaluationFailure),Vi.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},le=gy(t,n);re.getFingerprint=oe;let ue=()=>{let e=p.find(e=>!re.possibleCounts.get(e.name));if(!e)return;let t=oy(e.name,n),r=t?` at ${Xl(t)}`:``;return{name:e.name,code:Vi.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:D(I(Xm(re),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:_,getStoredFingerprints:(e,t)=>ee!==void 0||le?BigInt64Array.from(e,oe):Om(t,_()),getFingerprintState:e=>{if(le)return[String(oe(e))];let t=m===void 0?e:Wv(e,m,_());return ee===void 0?t:[ae(ee.expression,t)]},findViolatedInvariant:(e,t)=>{let n=c.find(n=>ce(n,e,t));return n&&se.add(e),n},getViolatedInvariants:e=>{let t=l.filter(t=>c.some(n=>n.predicate===t.predicate&&ce(n,e,void 0)));return t.length>0&&se.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>yy(n,_y(t,e,void 0,r));d.every(e=>r(e.predicate,e.scope))&&n();let i=l.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(d.every(e=>yy(e.predicate,_y(n,t,void 0,e.scope)))&&f.every(r=>yy(r.expression,_y(n,e,t,r.scope))))||r())||l.every(e=>yy(e.predicate,_y(n,t,void 0,e.scope))))&&te.every(r=>yy(r.box,_y(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>dy(r,e,t)||xy(r,_y(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!yy(t.expression,_y(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>te.find(r=>{try{return!yy(r.action,_y(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${B(r.box)}`)&&!vy(r.unchanged,_y(n,e,t,r.scope),`a subscript`)}catch(e){throw aa(Dy(e),Vi.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>yy(i.expression,_y(n,t,r),t=>`${e.F}${by(t,n)}`)),trackStatePossible:h.length===0?Sy:e=>Cy(h,re,_y(n,e,void 0)),trackActionPossible:g.length===0?Sy:(e,t)=>Cy(g,re,_y(n,e,t)),findUnwitnessedPossible:ue,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=gu(e,n);return t!==void 0&&Hu(t,n)!==void 0});if(i!==void 0){if(r)return;throw e.q(new e._(`${e.F}The post condition ${i} cannot be a constant.`),e.G.error)}let a=ue();if(a)return a;for(let e of t.postconditions){let t=wy(Kv(e),n,`a postcondition`);if(!t)continue;let r=oy(e,n),i=r?` at ${Xl(r)}`:``;return t.message===void 0?{name:e,code:Vi.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Vi.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},Dy=t=>t instanceof e.C?e.q(t,t.exitCode):t,Oy=(e,t)=>e*((t-e)/2**64),ky=e=>e.includes(`.`)?e:`${e}.0`,Ay=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return ky(String(e));let[n,r]=e.toExponential().split(`e`);return`${ky(n)}E${r.replace(`+`,``)}`},jy=e=>e!==void 0&&e>=`0`&&e<=`9`,My=e=>{if(e===0)return`0.0`;let t=Ay(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;jy(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(;jy(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;jy(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(jy(t[n.next])&&Number(t[n.next])>=5&&(n.result=Ny(n.result));jy(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Ny=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ny(r)}.`:n===`9`?`${Ny(r)}0`:`${r}${Number(n)+1}`},Py=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}`)},Fy=(e,t,n)=>{if(Oy(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},Iy=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}).`},Ly=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Ry=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Ar(e[t]),16777619),r=Math.imul(r^Ir(e[t]),1540483477);t[0]=Ly(n)||1,t[1]=Ly(r)},zy=()=>{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)}}},By=(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}},Vy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Hy=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return By(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Uy=e=>Atomics.load(e.used,0)*2>=e.slots.length,Wy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&By(t,n);return{slots:t,used:e.used}},Gy=[void 0,`lambda`,`tuple`,`record`],Ky=()=>{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=_r(e.domain);return t?(r(7),r(Gy.indexOf(St(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Gy.indexOf(St(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})}},qy=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 _t(t.strings[n[r.index++]]);if(e===5)return vt(i(n[r.index++]));let a=Gy[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Dn({kind:`Interval`,low:e,high:e+t-1});return xt(yt(o,i(t)),a)}let o=n[r.index++],s=i(o);return xt(yt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return gu}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return Z_}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Kr}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return em}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return nt}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Mv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return da}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return K_}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return kn}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return jv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return $h}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return tf}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return am}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return eh}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return Ar}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return vd}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return ee}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return ld}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return Oe}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return $m}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return k}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return z_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Or}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return T_}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return kr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return fn}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Qh}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Xl}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return th}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Mt}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Sv}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return oa}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Dv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Ft}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return im}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return nm}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Op}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return E}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return B}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Du}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Xv}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return na}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Wy}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Ul}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return $v}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Ry}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Kc}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Fy}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Vi}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return pd}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Oy}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Hi}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Ty}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return ra}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Ey}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return ea}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Vy}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Vl}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return vv}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return xv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return j}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return My}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return qc}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Kv}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return $i}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Ky}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return lu}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Hy}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Hl}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Iy}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return ad}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return zy}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Ku}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Uy}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Wl}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return qy}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return fd}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Py}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return fc}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return _y}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Xi}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Nv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return xr}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Zi}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Qv}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return ma}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return Dm}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return kt}});