tla-ts 0.0.6-dev.fd7689c → 0.0.7-dev.bd12468
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/run.cjs +1 -1
- package/dist/run.js +1 -1
- package/dist/transfer.cjs +12 -12
- package/dist/transfer.js +12 -12
- package/package.json +1 -1
- package/src/search.ts +4 -7
- package/src/successors.ts +81 -21
- package/src/tlc/fingerprint.ts +75 -60
package/dist/transfer.cjs
CHANGED
|
@@ -86,7 +86,7 @@ _TEPosition ==
|
|
|
86
86
|
THEN _TETraceLength
|
|
87
87
|
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
88
88
|
|
|
89
|
-
=============================================================================`,Ee=/* @__PURE__ */ new Map([[`Reals`,Ce],[`RealTime`,we],[`Toolbox`,Te]]),De={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:` `}},Oe=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},ke=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ae=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),je=e=>{let t=t=>{let n=h(e,t,Oe);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,ke);if(e.startsWith(`..`,n)&&ke(e[n+2]))return{kind:`Constant`,first:t,last:h(e,n+2,ke)-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=ke(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,ke)-1,children:[]};if(Ae(n))return{kind:`Constant`,first:t,last:h(e,t,Ae)-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)},Me=e=>{let t=e.length===0?void 0:je(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=De[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 h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),ee=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||ee===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${ee}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},O=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ne=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`,Pe=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Fe=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:O(e)?`set`:`function`,j=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Ie={isUsed:!1},Le=(e,t)=>(Ie.isUsed=!0,e.writtenKeys=t,e),Re=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Wn(e.domain,t)]]),ze=(e,t,n)=>Le(xn(e,t),n),Be=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(Be);e.writtenKeys=void 0,e.range.forEach(Be)}},Ve=e=>e.every(e=>typeof e==`string`),He=(e,t)=>e.length>0&&t.length>0&&Ve(e)!==Ve(t),Ue=(e,t)=>{Ie.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return He(n,r)?Ht(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=M(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:M(t,n);if(r!==0)return r}return 0},We=(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=M(n[e],r[e]);if(t!==0)return t}return 0},Ge=e=>A(e)?e.type:void 0,Ke=(t,n,r)=>{let i=Ge(t),a=Ge(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.g(`Attempted to ${o} the differently-typed model values ${L(t)} and ${L(n)}`)}throw i===void 0?new e.g(`Attempted to ${o} the typed model value ${L(n)} and the non-model value\n${L(t)}`):new e.g(`Attempted to ${o}${r?``:` the`} typed model value ${L(t)} and non-model value\n${L(n)}`)},qe={ranks:Object.create(null),size:0},Je=e=>{qe.ranks=Object.create(null),qe.size=0,ot.clear();for(let t of e)Ze(t)},Ye={is174:!1},Xe=e=>{Ye.is174=e===`1.7.4`},Ze=e=>(qe.ranks[e]===void 0&&(qe.ranks[e]=qe.size++),e),Qe=()=>qe.size,$e=e=>qe.ranks[Ze(e)],et=(e,t)=>{if(e===t)return 0;let n=qe.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},tt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),nt=(e,t)=>(tt(e)||tt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),rt=(t,n,r)=>{if(!tt(t))throw new e.g(`Attempted to ${r} the set ${L(N(t)?P(t):t,!0)} with the value:\n${L(n,!0)}`);if(!tt(n))throw new e.g(`Attempted to compare overridden value ${L(t,!0)} with non-overridden value:\n${L(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.g(`Attempted to compare ${L(t,!0)} with the value\n${L(n,!0)}`)},it={kind:`InfiniteSet`,name:`Any`},at=t=>{throw new e.g(`Attempted to compare ANY with the value\n${L(t)}`)},M=(t,n)=>{if(t===n)return Ie.isUsed&&Be(t),t===it?at(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return Ue(t,n);if(r===`Set`&&i===`Set`)return We(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&&Ke(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return Ke(t,n,!1),r===`ModelValue`?-1:1;if(t===it||n===it)return at(t===it?n:t);if(O(t)&&O(n)&&nt(t,n))return rt(t,n,`compare`);let a=O(t);if(a!==O(n))throw new e.g(`Attempted to compare ${Fe(t)} ${L(t)} with ${Fe(n)} ${L(n)}`);return a?We(P(t),P(n)):Ue(I(t),I(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return et(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(Ke(t,n,!1),A(t))return-1;if(A(n))return 1;throw new e.g(`Attempted to compare ${Fe(t)} ${L(t)} with ${Fe(n)} ${L(n)}`)},ot=/* @__PURE__ */ new Map,st=e=>{let t=ot.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:$e(e)};return ot.set(e,n),n},ct=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),lt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),ut={isPresent:!1},dt=(e,t)=>(t===`lambda`&&(ut.isPresent=!0),t!==void 0&&(e.functionClass=t),e),ft=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,pt=e=>dt(e,`lambda`),mt=/* @__PURE__ */ new WeakSet,ht=/* @__PURE__ */ new WeakSet,gt={isPresent:!1},_t=e=>(gt.isPresent=!0,e),vt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),yt=e=>{gt.isPresent&&typeof e==`object`&&vt.has(e.kind)&&ht.add(e)},bt=e=>{if((ut.isPresent||gt.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(mt.has(e))return;mt.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(bt),e.range.forEach(bt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(bt):O(e)&&N(e)&&(yt(e),P(e).elements.forEach(bt))}},xt=(e,t)=>{if(yt(e),e===t)return Ie.isUsed&&Be(e),e!==it||at(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Ke(e,t,!0),M(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 Ue(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return We(e,t)===0;if(A(e)||A(t))return Ke(e,t,!0),A(e)&&A(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return xt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:xt(e.domain,t.domain)&&xt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(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]&&xt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>xt(e,t.factors[n]));let n=O(e)&&O(t)&&!(N(e)&&N(t));if(n&&nt(e,t))return rt(e,t,`check equality of`)===0;if(n){if(!tt(e)){let n=P(e);if(!tt(t))return We(n,P(t))===0}return Ar(e)===Ar(t)}return M(e,t)===0},St=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):Ar(n)===Ar(r);return n},Ct=St(!1),wt=St(!0),Tt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Et=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=xr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||wt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||wt(i[e],n))return i[e]}return n.kind===`Set`?Tt(n.elements,t):(Tt(n.domain,t),Tt(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}},Dt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Ot=e=>{if(!k(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Dt(t.domain)}},kt=e=>{if(!k(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},At=(e,t)=>(Ke(t,e,!1),1),jt=(e,t)=>(Ke(t,e,!0),!1),Mt=(e,t)=>(e.type!==void 0&&Ke(e,t,!1),A(t)?e.rank-t.rank:-1),Nt=(e,t)=>(e.type!==void 0&&Ke(e,t,!0),A(t)&&e.name===t.name),Pt={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`}},Ft=(e,t,n)=>{let r=Pt[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},It=(t,n,r)=>{let i=Ot(r);if(!i){if(A(r))return At(r,n);throw new e.g(`Attempted to compare the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Lt(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 Lt(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.g(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${L(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Lt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Ht(e[n],t[n]);if(r!==0)return r}return 0},Rt=(t,n)=>{let r=I(t);if(t.kind===`Function`&&Gn(r)!==void 0){let e=k(n)?Gn(n):void 0;return e?r.range.length-e.length||Lt(r.range,e):It({...r,low:1},t,n)}if(ft(t)===`record`){let i=kt(n);if(!i){if(A(n))return At(n,t);throw new e.g(`Attempted to compare record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length-i.domain.length||Lt(r.domain,i.domain)||Lt(r.range,i.range)}return It({...r,low:Dt(r.domain)},t,n)},zt=(e,t)=>tt(e)||tt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Bt=(e,t)=>{let n=Pe(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},Vt=(t,n)=>{if(zt(t,n))return M(t,n);if(!Pe(t))return Vt(P(t),n);if(!O(n)){if(A(n))return At(n,t);throw new e.g(`Attempted to compare the set ${L(t)} with the value:\n${L(n)}`)}let r=Bt(t,n);return r.elements.length-r.otherElements.length||Lt(r.elements,r.otherElements)},Ht=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return M(t,n);if(A(n))return At(n,t);throw new e.g(Ft(t,n,!1))}return t.kind===`ModelValue`?Mt(t,n):k(t)?Rt(t,n):Vt(t,n)},Ut=(e,t)=>e.every((e,n)=>qt(e,t[n])),Wt=(t,n,r)=>{let i=Ot(r);if(!i){if(A(r))return jt(r,n);throw new e.g(`Attempted to check equality of the function ${L(n)} with the value:\n${L(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)&&Ut(t.range,i.range);let a=t.low??i.low;return a===void 0?Ut(t.domain,i.domain)&&Ut(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e.g(`Attempted to compare an integer with non-integer:\n${L(t)}.`);return t===a+n})&&Ut(t.range,i.range)},Gt=(t,n)=>{let r=I(t);if(t.kind===`Function`&&Gn(r)!==void 0){let e=k(n)?Gn(n):void 0;return e?r.range.length===e.length&&Ut(r.range,e):Wt({...r,low:1},t,n)}if(ft(t)===`record`){let i=kt(n);if(!i){if(A(n))return jt(n,t);throw new e.g(`Attempted to check equality of record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length===i.domain.length&&Ut(r.domain,i.domain)&&Ut(r.range,i.range)}return Wt({...r,low:Dt(r.domain)},t,n)},Kt=(t,n)=>{if(zt(t,n))return xt(t,n);if(!Pe(t))return Kt(P(t),n);if(!O(n)){if(A(n))return jt(n,t);throw new e.g(`Attempted to check equality of the set ${L(t)} with the value:\n${L(n)}`)}let r=Bt(t,n);return r.elements.length===r.otherElements.length&&Ut(r.elements,r.otherElements)},qt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(A(n))return jt(n,t);throw new e.g(Ft(t,n,!0))}return t.kind===`ModelValue`?Nt(t,n):k(t)?Gt(t,n):Kt(t,n)},Jt=e=>{let t=[];for(let n of e){let e=Xt(n,t);e.isFound||t.splice(e.index,0,n)}return t},Yt=(e,t)=>{let n=qn.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Xt=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Yt(e,()=>Ht(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}},Zt=(e,t)=>t.some(t=>Yt(t,()=>qt(t,e))),Qt=/* @__PURE__ */ new WeakSet,$t=e=>{typeof e==`object`&&(e.kind===`Set`&&(Qt.add(e),e.elements.forEach($t)),e.kind===`Function`&&(e.domain.forEach($t),e.range.forEach($t)))},en=(e,t)=>Jn(xt,qt,e,t),tn=e=>{for(let t=1;t<e.length;t++)if(M(e[t-1],e[t])>=0)return!1;return!0},nn=e=>{for(let t=1;t<e.length;t++)yt(e[t]);if(e.length<2||tn(e))return ct(e);let t=[...e].sort(M),n=[t[0]];for(let e=1;e<t.length;e++)M(n[n.length-1],t[e])!==0&&n.push(t[e]);return ct(n)},rn=e=>Jn(nn,e=>({kind:`MixedSet`,elements:e}),e,void 0),an=ct([]),on=(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&&M(r[a],t)<0;)a++;a<r.length&&M(r[a],t)===0||i.push(t)}return i.length===n.length?e:ct(i)},sn=(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&&M(r[a],t)<0;)a++;a<r.length&&M(r[a],t)===0&&i.push(t)}return i.length===n.length?e:ct(i)},cn=(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=M(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=ct(i);if(e.hash!==0&&e.hash!==gr){let t=e.hash,n=0;for(;n<a.length;n++){let e=xr(a[n]);if(e===gr)break;t=t+mr(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+Tr(a[e])|0;c.fingerprint=t}return c},ln=e=>{let t=e.length<2?e:[...e].sort((e,t)=>M(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&M(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return lt(n,r)},un=e=>{let t=ln(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Le(t,e.map(e=>e[0]))},dn=[],fn=[],pn=/* @__PURE__ */ new WeakMap,mn=e=>{let t=dn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return dn[e]=n,n},hn=e=>{if(Vn(e),e.low===1&&e.high>=1)return mn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},gn=e=>e.length>0&&(e===dn[e.length]||pn.has(e)),_n=e=>{let t=P(e).elements;return gn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},vn=e=>{let t=fn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return fn[e]=n,n},yn=e=>dt(lt(mn(e.length),e),`tuple`),bn=e=>dt(ln(e),`record`),xn=(e,t)=>dt(lt(e,t),`record`),Sn=e=>O(e)&&!tt(e),Cn=(e,t=!1)=>`UNION(${L(e.base,t)})`,wn=(t,n=e=>P(e).elements)=>{if(!Sn(t.base))throw new e.g(`Attempted to enumerate the nonenumerable set:\n${Cn(t)}`);return n(t.base)},Tn=(t,n,r)=>{if(Sn(t))return t;throw new e.g(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(t)}\nwhen enumerating:\n${Cn(r)}`)},N=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 N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||En(e.domain)===!0||En(e)===!0;case`RecordSet`:return e.sets.every(N)||En(e)===!0;case`ProductSet`:return e.factors.every(N)||En(e)===!0;case`Union`:return N(e.base)&&Pn(e.base).every(N);case`SetOperation`:return e.operator===`\\cup`?N(e.left)&&N(e.right):e.operator===`\\cap`?N(e.left)||N(e.right):N(e.left);default:return!1}},En=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=En(e.domain);return t===void 0?void 0:!t&&En(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=En(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return N(e)?P(e).elements.length===0:void 0;default:return}},Dn=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},On=(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},kn=e=>{if(typeof e!=`object`||e.kind!==`Subset`||tt(e.base))return;let t=P(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=[]:On(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return ct(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)})},An=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(ct(r.map(t=>e[t])));while(On(r,e.length))}return t},jn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(tt(o))throw new e.g(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Mn=(t,n=e=>P(e).elements)=>{if(typeof t!=`object`)throw new e.g(`Expected a set but found ${L(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return Jt(t.elements);case`Interval`:{let e=hn(t);return e!==dn[e.length]&&pn.set(e,t),e}case`Subset`:{if(Vn(t.base)===0)return An([]);if(!O(t.base))throw new e.g(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${Me(L(t.base))}`);let n=P(t.base).elements;if(n.length>30)throw new e.g(Bn(t));return An(n)}case`FunctionSet`:{if(!Ye.is174&&F(t))return[];if(tt(t.domain))throw new e.g(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(t.domain)}\ncannot be enumerated.`);let r=_n(t.domain);if((r.length>0||Ye.is174)&&tt(t.range))throw new e.g(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Dn(r.map(()=>i)).map(e=>lt(r,e))}case`RecordSet`:{if(!Ye.is174&&F(t))return[];let e=jn(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${L(e)}`);return Dn(e).map(e=>bn(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!Ye.is174&&F(t))return[];let e=jn(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${L(e)}`);return Dn(e).map(yn)}case`FilteredSet`:if(!O(t.base)||tt(t.base))throw new e.g(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(t.base)}\nis not enumerable`);return P(t.base).elements.filter(t.test);case`Union`:{let e=wn(t).flatMap((e,n)=>P(Tn(e,n,t)).elements);return P(rn(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!Sn(t.left)||!Sn(t.right)))throw new e.g(`Attempted to enumerate S \\cup T when S:\n${L(t.left)}\nand T:\n${L(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!Sn(t.left)&&!Sn(t.right))throw new e.g(`Attempted to enumerate S \\cap T when neither S:\n${L(t.left)}\nnor T:\n${L(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Sn(t.left))throw new e.g(`Attempted to enumerate S \\ T when S:\n${L(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return cn(P(t.left),P(t.right)).elements;let n=t.operator===`\\`||Sn(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return P(r).elements.filter(e=>Yn(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e.g(`Attempted to enumerate the non-enumerable set ${L(t)}`);default:throw new e.g(`Expected a set but found ${L(t)}`)}},Nn=/* @__PURE__ */ new WeakMap,P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return ct(Mn(e));let t=typeof e==`object`?Nn.get(e):void 0;if(t)return t;let n=qn.sets;n?.push(e);let r=Mn(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`)?ct(r):nn(r);return typeof e==`object`&&Nn.set(e,i),i},Pn=e=>{if(typeof e!=`object`||ht.has(e))return P(e).elements;let t=qn.sets;t?.push(e);let n=Rn(e);return t?.pop(),n},Fn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,In=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(In);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(In)&&e.range.every(In);case`SetOperation`:return e.operator!==`\\cup`&&In(e.left)&&In(e.right);case`FilteredSet`:return In(e.base);case`ProductSet`:return e.factors.every(In);default:return!1}},Ln=e=>typeof e!=`object`||ht.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ln(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ln(e.left)||Ln(e.right):Fn(e)?.some(Ln)??!1,Rn=e=>{if(e.kind===`Union`)return wn(e,Pn).flatMap((t,n)=>Pn(Tn(t,n,e)));if(e.kind===`FilteredSet`&&!tt(e.base))return Pn(e.base).filter(e.test);if(Fn(e)?.some(Ln))return Mn(e,Pn);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Sn(e.left)||!Sn(e.right)?P(e).elements:[...Pn(e.left),...Pn(e.right)];let t=e.operator===`\\`||Sn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Sn(n)?Pn(n).filter(t=>Yn(t,r)===(e.operator===`\\cap`)):P(e).elements},F=t=>{if(typeof t!=`object`||!O(t))throw new e.g(`Shouldn't call isEmpty() on value ${L(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.g(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(F);case`RecordSet`:return t.sets.some(F);case`FunctionSet`:return!F(t.domain)&&F(t.range);case`Union`:return wn(t).every((e,n)=>F(Tn(e,n,t)));default:return P(t).elements.length===0}},zn=(t,n,r)=>t.reduce((t,i)=>{let a=t*Vn(i,n);if(a>2147483647)throw new e.g(r());return a},1),Bn=e=>`Overflow when computing the number of elements in:\n${L(e)}`,Vn=(t,n)=>{if(typeof t!=`object`)throw new e.g(`Attempted to compute the number of elements in the ${Fe(t)} ${L(t)}.`);switch(t.kind){case`ModelValue`:throw new e.g(`Attempted to compute the number of elements in the model value ${L(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Vn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.g(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.g(`Attempted to compute the number of elements in the overridden value ${L(t)}.`);case`Subset`:{let r=Vn(t.base,n);if(r>=31)throw new e.g(Bn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(F(t.domain))return 1;if(F(t.range))return 0;if(Vn(t.range,n)===1)return 1}let r=Vn(t.domain,n),i=Vn(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.g(Bn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&F(t)?0:zn(t.sets,n,()=>Bn(t));case`ProductSet`:return n!==`1.7.4`&&F(t)?0:zn(t.factors,n,()=>`Overflow when computing the number of elements in ${L(t)}`);default:return yt(t),P(t).elements.length}},Hn=e=>`Attempted to check if the set ${L(e)}is finite.`,Un=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.g(`Attempted to check if the ${Fe(t)} ${L(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.g(`Attempted to check if the function:\n${L(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Un(t.base)&&F(t.base);case`Subset`:return Un(t.base);case`FunctionSet`:{let e=Un(t.domain);if(e&&F(t.domain))return!0;let n=Un(t.range);return n&&F(t.range)?!0:n&&(e||Vn(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(!Un(t))n.isAllFinite=!1;else if(F(t))return!0;return n.isAllFinite}case`Union`:if(!Sn(t.base))throw new e.g(`Attempted to check if the nonenumerable set:\n${Cn(t)}\nis a finite set.`);return P(t.base).elements.every(Un);case`SetOperation`:if(t.operator===`\\cup`)return Un(t.left)&&Un(t.right);if(t.operator===`\\cap`){if(!Un(t.left)&&!Un(t.right))throw new e.g(Hn(t));return!0}if(Un(t.left))return!0;if(!Un(t.right))throw new e.g(Hn(t));return!1;case`FilteredSet`:if(!Un(t.base))throw new e.g(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(t.base)}\nis finite.`);return!0}},Wn=(e,t,n=M)=>{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},Gn=e=>{if(typeof e!=`object`||!k(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Kn=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!k(t))return`${n} ${Fe(t)} ${L(t)}`;let r=ft(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},qn={sets:void 0},Jn=(t,n,r,i)=>{let a=qn.sets,o=qn.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.g))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)}},Yn=(e,t)=>{let n=qn.sets;if(n===void 0)return Qn(e,t);n.push(t);let r=Qn(e,t);return n.pop(),r},Xn=(e,t)=>Wn(t.elements,e)!==-1,Zn=(e,t)=>Qt.has(t)?Xt(e,t.elements).isFound:Zt(e,t.elements),Qn=(t,n)=>{if(!O(n))throw new e.g(Kn(t,n));switch(n.kind){case`Set`:return yt(t),Jn(Xn,Zn,t,n);case`MixedSet`:return Zt(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.g(`Attempted to check if the value:\n${L(t)}\nis in the integer interval ${L(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.g(`Attempted to check if the value:\n${L(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!O(t)||tt(t))throw new e.g(`Attempted to check if the non-enumerable value\n${Me(L(t))}\nis element of\n${Me(L(n))}`);return P(t).elements.every(e=>Yn(e,n.base));case`FunctionSet`:{if(!k(t)){if(A(t))return!1;throw new e.g(`Attempted to check if \n${L(t)}\nwhich is not a TLC function value, is in the set of functions:\n${Me(L(n))}`)}let r=I(t),i=Dt(r.domain);return(i===void 0?en(n.domain,ct(r.domain)):en({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>Yn(e,n.range))}case`RecordSet`:{let r=k(t)?I(t):void 0;if(!r||!Ve(r.domain)){if(A(t))return!1;throw new e.g(`Attempted to check if non-record\n${L(t)}\nis in the set of records:\n${L(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=Wn(r.domain,e);return i!==-1&&Yn(r.range[i],n.sets[t])})}case`ProductSet`:{let r=k(t)?Gn(t):void 0;if(r===void 0){if(k(t)&&I(t).domain.every(e=>typeof e==`number`)||A(t))return!1;throw new e.g(`Attempted to check if non-tuple\n${L(t)}\nis in the set of tuples:\n${L(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>Yn(e,n.factors[t]))}case`FilteredSet`:return Yn(t,n.base)&&n.test(t);case`Union`:if(!Sn(n.base))throw new e.g(`Attempted to check if:\n ${L(t)}\nis an element of the non-enumerable set:\n ${Cn(n)}`);return P(n.base).elements.some(e=>Yn(t,e));case`SetOperation`:return n.operator===`\\cup`?Yn(t,n.left)||Yn(t,n.right):Yn(t,n.left)&&Yn(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Gn(t);if(r===void 0){if(A(t))return!1;throw new e.g(`Attempted to check if the value:\n${Me(L(t))}\nis an element of ${Me(L(n))}.`)}return r.every(e=>Yn(e,n.base))}default:throw new e.g(Kn(t,n))}},$n=(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?Yn(e,n):e.range.every((e,r)=>$n(e,t.range[r],n.range)),I=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){N(t.domain)||Vn(t.domain);let e=_n(t.domain);return dt(lt(e,e.map(e=>t.apply(e))),ft(t))}throw new e.g(`Expected a function but found ${L(t)}`)},er=(e,t,n)=>{let r=Me(L(e)),i=Me(L(t)),a=n===`1.7.4`;switch(ft(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.`}},tr=(e,t)=>{if(!Ye.is174)return er(e,t);let n=Me(L(t));return ft(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},nr=(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},rr=t=>new e.g(`Attempted to apply function with integer domain to the non-integer argument ${Me(L(t))}`),ir=(e,t,n)=>{throw Ye.is174||e.length<32?e.forEach(e=>qt(e,t)):Wn(e,t,Ht),n},ar=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=ft(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.g(r(t,n));if(o===void 0&&!Ye.is174&&gn(i))throw rr(n)}let a=nr(i,n);return a===-1?Jn(Wn,ir,i,n):a},or=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!Yn(n,t.domain))throw new e.g(ft(t)===`lambda`?er(t,n):`Attempted to apply a function to ${L(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.g(`Attempted to apply ${L(t)}, which is not a function`);let i=r??er,a=ar(t,n,i);if(a===-1)throw new e.g(i(t,n));return t.range[a]},sr=e=>gn(e)?pn.get(e)??vn(e.length):void 0,cr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return sr(t)??ct(t)},lr=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!N(t.domain))){if(!Yn(n,t.domain))return t;let e=r(t.apply(n));return dt({kind:`LazyFunction`,domain:t.domain,apply:r=>en(n,r)?e:t.apply(r),source:t.source},ft(t))}if(!k(t))throw new e.g(`Attempted to apply EXCEPT construct to the value ${Me(L(t))}.`);let a=I(t),o=ar(a,n,tr);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=dt(lt(a.domain,s),ft(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==gr){let e=xr(l);if(e!==gr){let t=xr(a.domain[o]);u.hash=c===l?a.hash:a.hash-hr(t,xr(c))+hr(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Er(e,c)+Er(e,l)|0}return u},ur=/* @__PURE__ */ new WeakMap,dr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},fr=(e,t)=>Math.imul(e^t,16777619),pr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return dr(t)},mr=e=>dr(e+2654435769|0),hr=(e,t)=>dr(Math.imul(e,668265261)+t|0),gr=795548749,_r=e=>{if(e.kind===`ModelValue`)return dr(fr(pr(e.name),109));if(O(e)){if(!N(e))return gr;let t=P(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=xr(t[e]);if(r===gr)return gr;n=n+mr(r)|0}return n}if(e.kind===`LazyFunction`&&!N(e.domain))return gr;let t=I(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=xr(t.domain[e]),i=xr(t.range[e]);if(r===gr||i===gr)return gr;n=n+hr(r,i)|0}return n},vr=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.g(`TLC has found a state in which the value of a variable contains ${L(t)}`);if(O(t)){P(t).elements.forEach(vr);return}let n=I(t);n.domain.forEach(vr),n.range.forEach(vr)},yr=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{xr(t)===gr&&vr(t);return}catch(t){if(!(t instanceof e.g))throw t;return t}},br=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[]}},xr=e=>{if(typeof e==`number`)return dr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return pr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=_r(e)),e.hash;let t=ur.get(e);if(t!==void 0)return t;let n=_r(e);return ur.set(e,n),n},Sr=/* @__PURE__ */ new WeakMap,Cr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},wr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Cr(t)},Tr=e=>Cr(Or(e)+2135587861|0),Er=(e,t)=>Cr(Math.imul(Or(e),374761393)+Or(t)|0),Dr=e=>{if(e.kind===`ModelValue`)return Cr(wr(e.name)^60);if(O(e)){if(!N(e))return wr(Ar(e));let t=P(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Tr(t[e])|0;return n}let t=I(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Er(t.domain[e],t.range[e])|0;return n},Or=e=>{if(typeof e==`number`)return Cr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return wr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Dr(e)),e.fingerprint;let t=Sr.get(e);if(t!==void 0)return t;let n=Dr(e);return Sr.set(e,n),n},kr=/* @__PURE__ */ new WeakMap,Ar=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=kr.get(e);if(t!==void 0)return t;let n=jr(e);return kr.set(e,n),n},jr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Ar(t.base)}>`;if(t.kind===`FilteredSet`&&!N(t))throw new e.g(`Attempted to compare the non-enumerable set ${L(t)} with another value`);if(O(t))return N(t)?`{${P(t).elements.map(Ar).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${Ar(e)}:${Ar(n.range[t])}`).join(`,`)})`},Mr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Nr=e=>e.reduce((e,t)=>e===0?0:e*Vn(t),1),Pr=e=>{if(e.kind===`Subset`)return Vn(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`&&N(e.domain)&&Vn(e.domain)===0)return ct([lt([],[])]);let t=e.kind===`FunctionSet`?Vn(e.range)**Vn(e.domain):Nr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?an:t<=1999?P(e):void 0},Fr=(t,n)=>{if(n)return Pr(t);if(N(t))try{return Pr(t)}catch(t){if(t instanceof e.g)return;throw t}},Ir=(e,t)=>{let n=e=>L(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 Cn(e,t)}},Lr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Rr=t=>{if(N(t.domain))try{return I(t)}catch(t){if(t instanceof e.g)return;throw t}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Mr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(P(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=Fr(e,t);return n?r(n):Ir(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Rr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ye.is174&&ft(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&ft(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:ft(e)===`record`||i.domain.every(e=>typeof e==`string`&&Lr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Re(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},zr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Me(L(n))}\n`).join(``)},Br=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Vr=(t,n)=>Br.has(t)?new e.g(n):new e.S(n),Hr=(t,n,r,i)=>new e.S(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${L(i)}`),Ur=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Ur(r))throw Vr(n,`${n} expects a value as argument ${t+1}`);return r},Wr=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw Vr(n,`${n} expects an integer but received ${L(r)}`);return r},Gr=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Vr(n,`${n} expects a boolean but received ${L(r)}`);return r},Kr=(e,t,n)=>{let r=R(e,t,n);if(!O(r))throw Vr(n,`${n} expects a set but received ${L(r)}`);return r},qr=(e,t,n)=>{let r=Kr(e,t,n);if(!N(r))throw Vr(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},Jr=(e,t,n)=>P(qr(e,t,n)).elements,Yr=(e,t,n)=>{let r=R(e,t,n),i=Gn(r);if(!i)throw Vr(n,`${n} expects a sequence but received ${L(r)}`);return i},Xr=(e,t,n)=>{let r=R(e,t,n);if(!k(r))throw Vr(n,`${n} expects a function but received ${L(r)}`);return I(r)},Zr=(e,t,n)=>{let r=e[t];if(r===void 0||!Ur(r))throw Vr(n,`${n} expects an operator as argument ${t+1}`);return r},Qr=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(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}),$r=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ei=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ti=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ni=e=>e>2147483647||e<-2147483648,ri=t=>new e.S(`Overflow when computing ${t}`),ii={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`},ai={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},oi={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`},si={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},ci=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ai[e.operator];if(e.kind!==`Function`)return ii[e.kind];let t=ft(e);return t===void 0?`FcnRcdValue`:si[t]},li=e=>oi[ci(e)],ui=(t,n)=>new e.g(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),di=(t,n)=>{let r=r=>(...i)=>{let a=qn.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e.g&&(t.isLazy===!0||!(r instanceof e.S))?(qn.sets&&(qn.sets.length=a),ui(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},fi=(e,t)=>{if(typeof e!=`number`)throw ui(t,`Cannot cast tlc2.value.impl.${ci(e)} to tlc2.value.impl.IntValue`);return e},pi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,mi=(e,t,n,r)=>{let i=pi(e,n,`IntValue`,2);return ti(t,(e,n)=>{let a=fi(e,i),o=fi(n,i),s=r(a,o);if(ni(s))throw ri(`${a}${t}${o}`);return s})},hi=(t,n,r)=>{if(typeof t!=`number`)throw new e.S(`The ${n} argument of ${r} should be an integer, but instead it is:\n${L(t)}`);return t},gi=(e,t,n=e)=>ti(e,(e,r)=>t(hi(e,`first`,n),hi(r,`second`,n))),_i=(e,t,n)=>({...ei(e,t,n),isLazy:!0}),vi=(e,t,n)=>{let r=Zr(e,t,n);return()=>r.call([])},yi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),bi=()=>({bool:nl,condition:(e,t)=>{if(typeof e!=`boolean`)throw zc(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Bc(t,n,e);return e},apply:or,expectFunction:$c,tuple:yn,set:rn,record:xn,writtenRecord:ze,equal:xt,enumerate:pl,unassigned:(e,t)=>{throw qc(e,t)},primeOutsideAction:e=>{throw Yc(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:el,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Zc(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),xi={value:void 0},Si=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ci=e=>`local${e.counter++}`,wi=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),E(e).forEach(e=>wi(e,t)),t),Ti=(e,t,n)=>{let r=Si(e,V(t,e.environment)),i=wi(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Si(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Ei=(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(()=>Ci(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Ai(e,t.set,s)}, ${Si(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Ci(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Ai(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Ci(e),a=Ci(e),o=Ci(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})`},Di=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Ai(e,r[0],n)}, "the left side of =>") ? bool(${Ai(e,r[1],n)}, "the right side of =>") : true)`;if(D(t))return Ti(e,t,n);let i=zl(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ti(e,t,n);if(i.name===`DOMAIN`)return`${Si(e,Uc(t))}(${Ai(e,r[0],n)})`;if(i.name===`TLCEval`)return Ti(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Si(e,Wc(t,i))}(${Ai(e,r[0],n)}, ${Ai(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Iu(r[0],a))return`${Si(e,i.evaluateUnary)}(${Ai(e,r[0],n)})`;let o=r.length===2&&Iu(r[0],a)&&Iu(r[1],a);return i.evaluateBinary&&o?`${Si(e,i.evaluateBinary)}(${Ai(e,r[0],n)}, ${Ai(e,r[1],n)})`:Ti(e,t,n)},Oi=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(D(e))return!1;let r=Zl(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Oi(e.expression,t,n);case`FieldAccess`:return Oi(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Oi(e,t,n));default:return!1}},ki=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return ki(e.record);case`FunctionApplication`:return[e.function,...e.args].every(ki);default:return!1}},Ai=(e,t,n)=>{let r=(t,r=n)=>Ai(e,t,r);if(Su(t)&&_u(t,e.environment))return Ti(e,t,n);switch(t.kind){case`Number`:return j(t.value)?String(t.value):Ti(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(D(t))return Ti(e,t,n);let i=Zl(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Si(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Si(e,i.value):Ti(e,t,n)}case`Apply`:return Di(e,t,n);case`And`:case`Or`:{let n=Si(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)}, ${Si(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{ad(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Oi(t.function,n,e.environment)?r(t.function):ki(t.function)?r(t.function,i):Ti(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Si(e,t)}))`,o=Hc(e.environment.runtime.version),s=o?`, ${Si(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`${Si(e,Vc(t))}(${r(t.record)})`;case`Record`:{let i=ld(t.fields);if(ud(i))return Ti(e,t,n);let a=Si(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}, ${Si(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=Si(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`)?Ei(e,t,n):Ti(e,t,n);default:return Ti(e,t,n)}},ji=(e,t)=>{if(!yi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ai(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(`
|
|
89
|
+
=============================================================================`,Ee=/* @__PURE__ */ new Map([[`Reals`,Ce],[`RealTime`,we],[`Toolbox`,Te]]),De={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:` `}},Oe=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},ke=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ae=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),je=e=>{let t=t=>{let n=h(e,t,Oe);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,ke);if(e.startsWith(`..`,n)&&ke(e[n+2]))return{kind:`Constant`,first:t,last:h(e,n+2,ke)-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=ke(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,ke)-1,children:[]};if(Ae(n))return{kind:`Constant`,first:t,last:h(e,t,Ae)-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)},Me=e=>{let t=e.length===0?void 0:je(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=De[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 h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),ee=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||ee===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${ee}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},O=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ne=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`,Pe=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Fe=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:O(e)?`set`:`function`,j=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Ie={isUsed:!1},Le=(e,t)=>(Ie.isUsed=!0,e.writtenKeys=t,e),Re=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Wn(e.domain,t)]]),ze=(e,t,n)=>Le(xn(e,t),n),Be=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(Be);e.writtenKeys=void 0,e.range.forEach(Be)}},Ve=e=>e.every(e=>typeof e==`string`),He=(e,t)=>e.length>0&&t.length>0&&Ve(e)!==Ve(t),Ue=(e,t)=>{Ie.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return He(n,r)?Ht(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=M(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:M(t,n);if(r!==0)return r}return 0},We=(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=M(n[e],r[e]);if(t!==0)return t}return 0},Ge=e=>A(e)?e.type:void 0,Ke=(t,n,r)=>{let i=Ge(t),a=Ge(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.g(`Attempted to ${o} the differently-typed model values ${L(t)} and ${L(n)}`)}throw i===void 0?new e.g(`Attempted to ${o} the typed model value ${L(n)} and the non-model value\n${L(t)}`):new e.g(`Attempted to ${o}${r?``:` the`} typed model value ${L(t)} and non-model value\n${L(n)}`)},qe={ranks:Object.create(null),size:0},Je=e=>{qe.ranks=Object.create(null),qe.size=0,ot.clear();for(let t of e)Ze(t)},Ye={is174:!1},Xe=e=>{Ye.is174=e===`1.7.4`},Ze=e=>(qe.ranks[e]===void 0&&(qe.ranks[e]=qe.size++),e),Qe=()=>qe.size,$e=e=>qe.ranks[Ze(e)],et=(e,t)=>{if(e===t)return 0;let n=qe.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},tt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),nt=(e,t)=>(tt(e)||tt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),rt=(t,n,r)=>{if(!tt(t))throw new e.g(`Attempted to ${r} the set ${L(N(t)?P(t):t,!0)} with the value:\n${L(n,!0)}`);if(!tt(n))throw new e.g(`Attempted to compare overridden value ${L(t,!0)} with non-overridden value:\n${L(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.g(`Attempted to compare ${L(t,!0)} with the value\n${L(n,!0)}`)},it={kind:`InfiniteSet`,name:`Any`},at=t=>{throw new e.g(`Attempted to compare ANY with the value\n${L(t)}`)},M=(t,n)=>{if(t===n)return Ie.isUsed&&Be(t),t===it?at(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return Ue(t,n);if(r===`Set`&&i===`Set`)return We(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&&Ke(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return Ke(t,n,!1),r===`ModelValue`?-1:1;if(t===it||n===it)return at(t===it?n:t);if(O(t)&&O(n)&&nt(t,n))return rt(t,n,`compare`);let a=O(t);if(a!==O(n))throw new e.g(`Attempted to compare ${Fe(t)} ${L(t)} with ${Fe(n)} ${L(n)}`);return a?We(P(t),P(n)):Ue(I(t),I(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return et(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(Ke(t,n,!1),A(t))return-1;if(A(n))return 1;throw new e.g(`Attempted to compare ${Fe(t)} ${L(t)} with ${Fe(n)} ${L(n)}`)},ot=/* @__PURE__ */ new Map,st=e=>{let t=ot.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:$e(e)};return ot.set(e,n),n},ct=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),lt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),ut={isPresent:!1},dt=(e,t)=>(t===`lambda`&&(ut.isPresent=!0),t!==void 0&&(e.functionClass=t),e),ft=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,pt=e=>dt(e,`lambda`),mt=/* @__PURE__ */ new WeakSet,ht=/* @__PURE__ */ new WeakSet,gt={isPresent:!1},_t=e=>(gt.isPresent=!0,e),vt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),yt=e=>{gt.isPresent&&typeof e==`object`&&vt.has(e.kind)&&ht.add(e)},bt=e=>{if((ut.isPresent||gt.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(mt.has(e))return;mt.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(bt),e.range.forEach(bt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(bt):O(e)&&N(e)&&(yt(e),P(e).elements.forEach(bt))}},xt=(e,t)=>{if(yt(e),e===t)return Ie.isUsed&&Be(e),e!==it||at(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Ke(e,t,!0),M(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 Ue(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return We(e,t)===0;if(A(e)||A(t))return Ke(e,t,!0),A(e)&&A(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return xt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:xt(e.domain,t.domain)&&xt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(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]&&xt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>xt(e,t.factors[n]));let n=O(e)&&O(t)&&!(N(e)&&N(t));if(n&&nt(e,t))return rt(e,t,`check equality of`)===0;if(n){if(!tt(e)){let n=P(e);if(!tt(t))return We(n,P(t))===0}return Ar(e)===Ar(t)}return M(e,t)===0},St=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):Ar(n)===Ar(r);return n},Ct=St(!1),wt=St(!0),Tt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Et=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=xr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||wt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||wt(i[e],n))return i[e]}return n.kind===`Set`?Tt(n.elements,t):(Tt(n.domain,t),Tt(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}},Dt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Ot=e=>{if(!k(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Dt(t.domain)}},kt=e=>{if(!k(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},At=(e,t)=>(Ke(t,e,!1),1),jt=(e,t)=>(Ke(t,e,!0),!1),Mt=(e,t)=>(e.type!==void 0&&Ke(e,t,!1),A(t)?e.rank-t.rank:-1),Nt=(e,t)=>(e.type!==void 0&&Ke(e,t,!0),A(t)&&e.name===t.name),Pt={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`}},Ft=(e,t,n)=>{let r=Pt[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},It=(t,n,r)=>{let i=Ot(r);if(!i){if(A(r))return At(r,n);throw new e.g(`Attempted to compare the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Lt(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 Lt(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.g(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${L(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Lt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Ht(e[n],t[n]);if(r!==0)return r}return 0},Rt=(t,n)=>{let r=I(t);if(t.kind===`Function`&&Gn(r)!==void 0){let e=k(n)?Gn(n):void 0;return e?r.range.length-e.length||Lt(r.range,e):It({...r,low:1},t,n)}if(ft(t)===`record`){let i=kt(n);if(!i){if(A(n))return At(n,t);throw new e.g(`Attempted to compare record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length-i.domain.length||Lt(r.domain,i.domain)||Lt(r.range,i.range)}return It({...r,low:Dt(r.domain)},t,n)},zt=(e,t)=>tt(e)||tt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Bt=(e,t)=>{let n=Pe(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},Vt=(t,n)=>{if(zt(t,n))return M(t,n);if(!Pe(t))return Vt(P(t),n);if(!O(n)){if(A(n))return At(n,t);throw new e.g(`Attempted to compare the set ${L(t)} with the value:\n${L(n)}`)}let r=Bt(t,n);return r.elements.length-r.otherElements.length||Lt(r.elements,r.otherElements)},Ht=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return M(t,n);if(A(n))return At(n,t);throw new e.g(Ft(t,n,!1))}return t.kind===`ModelValue`?Mt(t,n):k(t)?Rt(t,n):Vt(t,n)},Ut=(e,t)=>e.every((e,n)=>qt(e,t[n])),Wt=(t,n,r)=>{let i=Ot(r);if(!i){if(A(r))return jt(r,n);throw new e.g(`Attempted to check equality of the function ${L(n)} with the value:\n${L(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)&&Ut(t.range,i.range);let a=t.low??i.low;return a===void 0?Ut(t.domain,i.domain)&&Ut(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e.g(`Attempted to compare an integer with non-integer:\n${L(t)}.`);return t===a+n})&&Ut(t.range,i.range)},Gt=(t,n)=>{let r=I(t);if(t.kind===`Function`&&Gn(r)!==void 0){let e=k(n)?Gn(n):void 0;return e?r.range.length===e.length&&Ut(r.range,e):Wt({...r,low:1},t,n)}if(ft(t)===`record`){let i=kt(n);if(!i){if(A(n))return jt(n,t);throw new e.g(`Attempted to check equality of record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length===i.domain.length&&Ut(r.domain,i.domain)&&Ut(r.range,i.range)}return Wt({...r,low:Dt(r.domain)},t,n)},Kt=(t,n)=>{if(zt(t,n))return xt(t,n);if(!Pe(t))return Kt(P(t),n);if(!O(n)){if(A(n))return jt(n,t);throw new e.g(`Attempted to check equality of the set ${L(t)} with the value:\n${L(n)}`)}let r=Bt(t,n);return r.elements.length===r.otherElements.length&&Ut(r.elements,r.otherElements)},qt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(A(n))return jt(n,t);throw new e.g(Ft(t,n,!0))}return t.kind===`ModelValue`?Nt(t,n):k(t)?Gt(t,n):Kt(t,n)},Jt=e=>{let t=[];for(let n of e){let e=Xt(n,t);e.isFound||t.splice(e.index,0,n)}return t},Yt=(e,t)=>{let n=qn.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Xt=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Yt(e,()=>Ht(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}},Zt=(e,t)=>t.some(t=>Yt(t,()=>qt(t,e))),Qt=/* @__PURE__ */ new WeakSet,$t=e=>{typeof e==`object`&&(e.kind===`Set`&&(Qt.add(e),e.elements.forEach($t)),e.kind===`Function`&&(e.domain.forEach($t),e.range.forEach($t)))},en=(e,t)=>Jn(xt,qt,e,t),tn=e=>{for(let t=1;t<e.length;t++)if(M(e[t-1],e[t])>=0)return!1;return!0},nn=e=>{for(let t=1;t<e.length;t++)yt(e[t]);if(e.length<2||tn(e))return ct(e);let t=[...e].sort(M),n=[t[0]];for(let e=1;e<t.length;e++)M(n[n.length-1],t[e])!==0&&n.push(t[e]);return ct(n)},rn=e=>Jn(nn,e=>({kind:`MixedSet`,elements:e}),e,void 0),an=ct([]),on=(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&&M(r[a],t)<0;)a++;a<r.length&&M(r[a],t)===0||i.push(t)}return i.length===n.length?e:ct(i)},sn=(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&&M(r[a],t)<0;)a++;a<r.length&&M(r[a],t)===0&&i.push(t)}return i.length===n.length?e:ct(i)},cn=(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=M(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=ct(i);if(e.hash!==0&&e.hash!==gr){let t=e.hash,n=0;for(;n<a.length;n++){let e=xr(a[n]);if(e===gr)break;t=t+mr(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+Tr(a[e])|0;c.fingerprint=t}return c},ln=e=>{let t=e.length<2?e:[...e].sort((e,t)=>M(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&M(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return lt(n,r)},un=e=>{let t=ln(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Le(t,e.map(e=>e[0]))},dn=[],fn=[],pn=/* @__PURE__ */ new WeakMap,mn=e=>{let t=dn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return dn[e]=n,n},hn=e=>{if(Vn(e),e.low===1&&e.high>=1)return mn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},gn=e=>e.length>0&&(e===dn[e.length]||pn.has(e)),_n=e=>{let t=P(e).elements;return gn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},vn=e=>{let t=fn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return fn[e]=n,n},yn=e=>dt(lt(mn(e.length),e),`tuple`),bn=e=>dt(ln(e),`record`),xn=(e,t)=>dt(lt(e,t),`record`),Sn=e=>O(e)&&!tt(e),Cn=(e,t=!1)=>`UNION(${L(e.base,t)})`,wn=(t,n=e=>P(e).elements)=>{if(!Sn(t.base))throw new e.g(`Attempted to enumerate the nonenumerable set:\n${Cn(t)}`);return n(t.base)},Tn=(t,n,r)=>{if(Sn(t))return t;throw new e.g(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(t)}\nwhen enumerating:\n${Cn(r)}`)},N=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 N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||En(e.domain)===!0||En(e)===!0;case`RecordSet`:return e.sets.every(N)||En(e)===!0;case`ProductSet`:return e.factors.every(N)||En(e)===!0;case`Union`:return N(e.base)&&Pn(e.base).every(N);case`SetOperation`:return e.operator===`\\cup`?N(e.left)&&N(e.right):e.operator===`\\cap`?N(e.left)||N(e.right):N(e.left);default:return!1}},En=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=En(e.domain);return t===void 0?void 0:!t&&En(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=En(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return N(e)?P(e).elements.length===0:void 0;default:return}},Dn=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},On=(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},kn=e=>{if(typeof e!=`object`||e.kind!==`Subset`||tt(e.base))return;let t=P(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=[]:On(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return ct(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)})},An=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(ct(r.map(t=>e[t])));while(On(r,e.length))}return t},jn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(tt(o))throw new e.g(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Mn=(t,n=e=>P(e).elements)=>{if(typeof t!=`object`)throw new e.g(`Expected a set but found ${L(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return Jt(t.elements);case`Interval`:{let e=hn(t);return e!==dn[e.length]&&pn.set(e,t),e}case`Subset`:{if(Vn(t.base)===0)return An([]);if(!O(t.base))throw new e.g(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${Me(L(t.base))}`);let n=P(t.base).elements;if(n.length>30)throw new e.g(Bn(t));return An(n)}case`FunctionSet`:{if(!Ye.is174&&F(t))return[];if(tt(t.domain))throw new e.g(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(t.domain)}\ncannot be enumerated.`);let r=_n(t.domain);if((r.length>0||Ye.is174)&&tt(t.range))throw new e.g(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Dn(r.map(()=>i)).map(e=>lt(r,e))}case`RecordSet`:{if(!Ye.is174&&F(t))return[];let e=jn(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${L(e)}`);return Dn(e).map(e=>bn(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!Ye.is174&&F(t))return[];let e=jn(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${L(e)}`);return Dn(e).map(yn)}case`FilteredSet`:if(!O(t.base)||tt(t.base))throw new e.g(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(t.base)}\nis not enumerable`);return P(t.base).elements.filter(t.test);case`Union`:{let e=wn(t).flatMap((e,n)=>P(Tn(e,n,t)).elements);return P(rn(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!Sn(t.left)||!Sn(t.right)))throw new e.g(`Attempted to enumerate S \\cup T when S:\n${L(t.left)}\nand T:\n${L(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!Sn(t.left)&&!Sn(t.right))throw new e.g(`Attempted to enumerate S \\cap T when neither S:\n${L(t.left)}\nnor T:\n${L(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Sn(t.left))throw new e.g(`Attempted to enumerate S \\ T when S:\n${L(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return cn(P(t.left),P(t.right)).elements;let n=t.operator===`\\`||Sn(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return P(r).elements.filter(e=>Yn(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e.g(`Attempted to enumerate the non-enumerable set ${L(t)}`);default:throw new e.g(`Expected a set but found ${L(t)}`)}},Nn=/* @__PURE__ */ new WeakMap,P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return ct(Mn(e));let t=typeof e==`object`?Nn.get(e):void 0;if(t)return t;let n=qn.sets;n?.push(e);let r=Mn(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`)?ct(r):nn(r);return typeof e==`object`&&Nn.set(e,i),i},Pn=e=>{if(typeof e!=`object`||ht.has(e))return P(e).elements;let t=qn.sets;t?.push(e);let n=Rn(e);return t?.pop(),n},Fn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,In=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(In);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(In)&&e.range.every(In);case`SetOperation`:return e.operator!==`\\cup`&&In(e.left)&&In(e.right);case`FilteredSet`:return In(e.base);case`ProductSet`:return e.factors.every(In);default:return!1}},Ln=e=>typeof e!=`object`||ht.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ln(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ln(e.left)||Ln(e.right):Fn(e)?.some(Ln)??!1,Rn=e=>{if(e.kind===`Union`)return wn(e,Pn).flatMap((t,n)=>Pn(Tn(t,n,e)));if(e.kind===`FilteredSet`&&!tt(e.base))return Pn(e.base).filter(e.test);if(Fn(e)?.some(Ln))return Mn(e,Pn);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Sn(e.left)||!Sn(e.right)?P(e).elements:[...Pn(e.left),...Pn(e.right)];let t=e.operator===`\\`||Sn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Sn(n)?Pn(n).filter(t=>Yn(t,r)===(e.operator===`\\cap`)):P(e).elements},F=t=>{if(typeof t!=`object`||!O(t))throw new e.g(`Shouldn't call isEmpty() on value ${L(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.g(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(F);case`RecordSet`:return t.sets.some(F);case`FunctionSet`:return!F(t.domain)&&F(t.range);case`Union`:return wn(t).every((e,n)=>F(Tn(e,n,t)));default:return P(t).elements.length===0}},zn=(t,n,r)=>t.reduce((t,i)=>{let a=t*Vn(i,n);if(a>2147483647)throw new e.g(r());return a},1),Bn=e=>`Overflow when computing the number of elements in:\n${L(e)}`,Vn=(t,n)=>{if(typeof t!=`object`)throw new e.g(`Attempted to compute the number of elements in the ${Fe(t)} ${L(t)}.`);switch(t.kind){case`ModelValue`:throw new e.g(`Attempted to compute the number of elements in the model value ${L(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Vn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.g(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.g(`Attempted to compute the number of elements in the overridden value ${L(t)}.`);case`Subset`:{let r=Vn(t.base,n);if(r>=31)throw new e.g(Bn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(F(t.domain))return 1;if(F(t.range))return 0;if(Vn(t.range,n)===1)return 1}let r=Vn(t.domain,n),i=Vn(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.g(Bn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&F(t)?0:zn(t.sets,n,()=>Bn(t));case`ProductSet`:return n!==`1.7.4`&&F(t)?0:zn(t.factors,n,()=>`Overflow when computing the number of elements in ${L(t)}`);default:return yt(t),P(t).elements.length}},Hn=e=>`Attempted to check if the set ${L(e)}is finite.`,Un=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.g(`Attempted to check if the ${Fe(t)} ${L(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.g(`Attempted to check if the function:\n${L(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Un(t.base)&&F(t.base);case`Subset`:return Un(t.base);case`FunctionSet`:{let e=Un(t.domain);if(e&&F(t.domain))return!0;let n=Un(t.range);return n&&F(t.range)?!0:n&&(e||Vn(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(!Un(t))n.isAllFinite=!1;else if(F(t))return!0;return n.isAllFinite}case`Union`:if(!Sn(t.base))throw new e.g(`Attempted to check if the nonenumerable set:\n${Cn(t)}\nis a finite set.`);return P(t.base).elements.every(Un);case`SetOperation`:if(t.operator===`\\cup`)return Un(t.left)&&Un(t.right);if(t.operator===`\\cap`){if(!Un(t.left)&&!Un(t.right))throw new e.g(Hn(t));return!0}if(Un(t.left))return!0;if(!Un(t.right))throw new e.g(Hn(t));return!1;case`FilteredSet`:if(!Un(t.base))throw new e.g(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(t.base)}\nis finite.`);return!0}},Wn=(e,t,n=M)=>{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},Gn=e=>{if(typeof e!=`object`||!k(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Kn=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!k(t))return`${n} ${Fe(t)} ${L(t)}`;let r=ft(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},qn={sets:void 0},Jn=(t,n,r,i)=>{let a=qn.sets,o=qn.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.g))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)}},Yn=(e,t)=>{let n=qn.sets;if(n===void 0)return Qn(e,t);n.push(t);let r=Qn(e,t);return n.pop(),r},Xn=(e,t)=>Wn(t.elements,e)!==-1,Zn=(e,t)=>Qt.has(t)?Xt(e,t.elements).isFound:Zt(e,t.elements),Qn=(t,n)=>{if(!O(n))throw new e.g(Kn(t,n));switch(n.kind){case`Set`:return yt(t),Jn(Xn,Zn,t,n);case`MixedSet`:return Zt(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.g(`Attempted to check if the value:\n${L(t)}\nis in the integer interval ${L(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.g(`Attempted to check if the value:\n${L(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!O(t)||tt(t))throw new e.g(`Attempted to check if the non-enumerable value\n${Me(L(t))}\nis element of\n${Me(L(n))}`);return P(t).elements.every(e=>Yn(e,n.base));case`FunctionSet`:{if(!k(t)){if(A(t))return!1;throw new e.g(`Attempted to check if \n${L(t)}\nwhich is not a TLC function value, is in the set of functions:\n${Me(L(n))}`)}let r=I(t),i=Dt(r.domain);return(i===void 0?en(n.domain,ct(r.domain)):en({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>Yn(e,n.range))}case`RecordSet`:{let r=k(t)?I(t):void 0;if(!r||!Ve(r.domain)){if(A(t))return!1;throw new e.g(`Attempted to check if non-record\n${L(t)}\nis in the set of records:\n${L(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=Wn(r.domain,e);return i!==-1&&Yn(r.range[i],n.sets[t])})}case`ProductSet`:{let r=k(t)?Gn(t):void 0;if(r===void 0){if(k(t)&&I(t).domain.every(e=>typeof e==`number`)||A(t))return!1;throw new e.g(`Attempted to check if non-tuple\n${L(t)}\nis in the set of tuples:\n${L(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>Yn(e,n.factors[t]))}case`FilteredSet`:return Yn(t,n.base)&&n.test(t);case`Union`:if(!Sn(n.base))throw new e.g(`Attempted to check if:\n ${L(t)}\nis an element of the non-enumerable set:\n ${Cn(n)}`);return P(n.base).elements.some(e=>Yn(t,e));case`SetOperation`:return n.operator===`\\cup`?Yn(t,n.left)||Yn(t,n.right):Yn(t,n.left)&&Yn(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Gn(t);if(r===void 0){if(A(t))return!1;throw new e.g(`Attempted to check if the value:\n${Me(L(t))}\nis an element of ${Me(L(n))}.`)}return r.every(e=>Yn(e,n.base))}default:throw new e.g(Kn(t,n))}},$n=(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?Yn(e,n):e.range.every((e,r)=>$n(e,t.range[r],n.range)),I=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){N(t.domain)||Vn(t.domain);let e=_n(t.domain);return dt(lt(e,e.map(e=>t.apply(e))),ft(t))}throw new e.g(`Expected a function but found ${L(t)}`)},er=(e,t,n)=>{let r=Me(L(e)),i=Me(L(t)),a=n===`1.7.4`;switch(ft(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.`}},tr=(e,t)=>{if(!Ye.is174)return er(e,t);let n=Me(L(t));return ft(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},nr=(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},rr=t=>new e.g(`Attempted to apply function with integer domain to the non-integer argument ${Me(L(t))}`),ir=(e,t,n)=>{throw Ye.is174||e.length<32?e.forEach(e=>qt(e,t)):Wn(e,t,Ht),n},ar=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=ft(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.g(r(t,n));if(o===void 0&&!Ye.is174&&gn(i))throw rr(n)}let a=nr(i,n);return a===-1?Jn(Wn,ir,i,n):a},or=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!Yn(n,t.domain))throw new e.g(ft(t)===`lambda`?er(t,n):`Attempted to apply a function to ${L(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.g(`Attempted to apply ${L(t)}, which is not a function`);let i=r??er,a=ar(t,n,i);if(a===-1)throw new e.g(i(t,n));return t.range[a]},sr=e=>gn(e)?pn.get(e)??vn(e.length):void 0,cr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return sr(t)??ct(t)},lr=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!N(t.domain))){if(!Yn(n,t.domain))return t;let e=r(t.apply(n));return dt({kind:`LazyFunction`,domain:t.domain,apply:r=>en(n,r)?e:t.apply(r),source:t.source},ft(t))}if(!k(t))throw new e.g(`Attempted to apply EXCEPT construct to the value ${Me(L(t))}.`);let a=I(t),o=ar(a,n,tr);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=dt(lt(a.domain,s),ft(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==gr){let e=xr(l);if(e!==gr){let t=xr(a.domain[o]);u.hash=c===l?a.hash:a.hash-hr(t,xr(c))+hr(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Er(e,c)+Er(e,l)|0}return u},ur=/* @__PURE__ */ new WeakMap,dr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},fr=(e,t)=>Math.imul(e^t,16777619),pr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return dr(t)},mr=e=>dr(e+2654435769|0),hr=(e,t)=>dr(Math.imul(e,668265261)+t|0),gr=795548749,_r=e=>{if(e.kind===`ModelValue`)return dr(fr(pr(e.name),109));if(O(e)){if(!N(e))return gr;let t=P(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=xr(t[e]);if(r===gr)return gr;n=n+mr(r)|0}return n}if(e.kind===`LazyFunction`&&!N(e.domain))return gr;let t=I(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=xr(t.domain[e]),i=xr(t.range[e]);if(r===gr||i===gr)return gr;n=n+hr(r,i)|0}return n},vr=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.g(`TLC has found a state in which the value of a variable contains ${L(t)}`);if(O(t)){P(t).elements.forEach(vr);return}let n=I(t);n.domain.forEach(vr),n.range.forEach(vr)},yr=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{xr(t)===gr&&vr(t);return}catch(t){if(!(t instanceof e.g))throw t;return t}},br=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[]}},xr=e=>{if(typeof e==`number`)return dr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return pr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=_r(e)),e.hash;let t=ur.get(e);if(t!==void 0)return t;let n=_r(e);return ur.set(e,n),n},Sr=/* @__PURE__ */ new WeakMap,Cr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},wr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Cr(t)},Tr=e=>Cr(Or(e)+2135587861|0),Er=(e,t)=>Cr(Math.imul(Or(e),374761393)+Or(t)|0),Dr=e=>{if(e.kind===`ModelValue`)return Cr(wr(e.name)^60);if(O(e)){if(!N(e))return wr(Ar(e));let t=P(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Tr(t[e])|0;return n}let t=I(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Er(t.domain[e],t.range[e])|0;return n},Or=e=>{if(typeof e==`number`)return Cr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return wr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Dr(e)),e.fingerprint;let t=Sr.get(e);if(t!==void 0)return t;let n=Dr(e);return Sr.set(e,n),n},kr=/* @__PURE__ */ new WeakMap,Ar=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=kr.get(e);if(t!==void 0)return t;let n=jr(e);return kr.set(e,n),n},jr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Ar(t.base)}>`;if(t.kind===`FilteredSet`&&!N(t))throw new e.g(`Attempted to compare the non-enumerable set ${L(t)} with another value`);if(O(t))return N(t)?`{${P(t).elements.map(Ar).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${Ar(e)}:${Ar(n.range[t])}`).join(`,`)})`},Mr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Nr=e=>e.reduce((e,t)=>e===0?0:e*Vn(t),1),Pr=e=>{if(e.kind===`Subset`)return Vn(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`&&N(e.domain)&&Vn(e.domain)===0)return ct([lt([],[])]);let t=e.kind===`FunctionSet`?Vn(e.range)**Vn(e.domain):Nr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?an:t<=1999?P(e):void 0},Fr=(t,n)=>{if(n)return Pr(t);if(N(t))try{return Pr(t)}catch(t){if(t instanceof e.g)return;throw t}},Ir=(e,t)=>{let n=e=>L(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 Cn(e,t)}},Lr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Rr=t=>{if(N(t.domain))try{return I(t)}catch(t){if(t instanceof e.g)return;throw t}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Mr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(P(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=Fr(e,t);return n?r(n):Ir(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Rr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ye.is174&&ft(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&ft(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:ft(e)===`record`||i.domain.every(e=>typeof e==`string`&&Lr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Re(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},zr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Me(L(n))}\n`).join(``)},Br=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Vr=(t,n)=>Br.has(t)?new e.g(n):new e.S(n),Hr=(t,n,r,i)=>new e.S(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${L(i)}`),Ur=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Ur(r))throw Vr(n,`${n} expects a value as argument ${t+1}`);return r},Wr=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw Vr(n,`${n} expects an integer but received ${L(r)}`);return r},Gr=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Vr(n,`${n} expects a boolean but received ${L(r)}`);return r},Kr=(e,t,n)=>{let r=R(e,t,n);if(!O(r))throw Vr(n,`${n} expects a set but received ${L(r)}`);return r},qr=(e,t,n)=>{let r=Kr(e,t,n);if(!N(r))throw Vr(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},Jr=(e,t,n)=>P(qr(e,t,n)).elements,Yr=(e,t,n)=>{let r=R(e,t,n),i=Gn(r);if(!i)throw Vr(n,`${n} expects a sequence but received ${L(r)}`);return i},Xr=(e,t,n)=>{let r=R(e,t,n);if(!k(r))throw Vr(n,`${n} expects a function but received ${L(r)}`);return I(r)},Zr=(e,t,n)=>{let r=e[t];if(r===void 0||!Ur(r))throw Vr(n,`${n} expects an operator as argument ${t+1}`);return r},Qr=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(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}),$r=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ei=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ti=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ni=e=>e>2147483647||e<-2147483648,ri=t=>new e.S(`Overflow when computing ${t}`),ii={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`},ai={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},oi={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`},si={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},ci=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ai[e.operator];if(e.kind!==`Function`)return ii[e.kind];let t=ft(e);return t===void 0?`FcnRcdValue`:si[t]},li=e=>oi[ci(e)],ui=(t,n)=>new e.g(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),di=(t,n)=>{let r=r=>(...i)=>{let a=qn.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e.g&&(t.isLazy===!0||!(r instanceof e.S))?(qn.sets&&(qn.sets.length=a),ui(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},fi=(e,t)=>{if(typeof e!=`number`)throw ui(t,`Cannot cast tlc2.value.impl.${ci(e)} to tlc2.value.impl.IntValue`);return e},pi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,mi=(e,t,n,r)=>{let i=pi(e,n,`IntValue`,2);return ti(t,(e,n)=>{let a=fi(e,i),o=fi(n,i),s=r(a,o);if(ni(s))throw ri(`${a}${t}${o}`);return s})},hi=(t,n,r)=>{if(typeof t!=`number`)throw new e.S(`The ${n} argument of ${r} should be an integer, but instead it is:\n${L(t)}`);return t},gi=(e,t,n=e)=>ti(e,(e,r)=>t(hi(e,`first`,n),hi(r,`second`,n))),_i=(e,t,n)=>({...ei(e,t,n),isLazy:!0}),vi=(e,t,n)=>{let r=Zr(e,t,n);return()=>r.call([])},yi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),bi=()=>({bool:ol,condition:(e,t)=>{if(typeof e!=`boolean`)throw Uc(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Wc(t,n,e);return e},apply:or,expectFunction:rl,tuple:yn,set:rn,record:xn,writtenRecord:ze,equal:xt,enumerate:_l,unassigned:(e,t)=>{throw Zc(e,t)},primeOutsideAction:e=>{throw $c(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:il,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>tl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),xi={value:void 0},Si=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ci=e=>`local${e.counter++}`,wi=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),E(e).forEach(e=>wi(e,t)),t),Ti=(e,t,n)=>{let r=Si(e,V(t,e.environment)),i=wi(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Si(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Ei=(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(()=>Ci(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Ai(e,t.set,s)}, ${Si(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Ci(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Ai(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Ci(e),a=Ci(e),o=Ci(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})`},Di=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Ai(e,r[0],n)}, "the left side of =>") ? bool(${Ai(e,r[1],n)}, "the right side of =>") : true)`;if(D(t))return Ti(e,t,n);let i=Ul(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ti(e,t,n);if(i.name===`DOMAIN`)return`${Si(e,qc(t))}(${Ai(e,r[0],n)})`;if(i.name===`TLCEval`)return Ti(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Si(e,Jc(t,i))}(${Ai(e,r[0],n)}, ${Ai(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Bu(r[0],a))return`${Si(e,i.evaluateUnary)}(${Ai(e,r[0],n)})`;let o=r.length===2&&Bu(r[0],a)&&Bu(r[1],a);return i.evaluateBinary&&o?`${Si(e,i.evaluateBinary)}(${Ai(e,r[0],n)}, ${Ai(e,r[1],n)})`:Ti(e,t,n)},Oi=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(D(e))return!1;let r=tu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Oi(e.expression,t,n);case`FieldAccess`:return Oi(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Oi(e,t,n));default:return!1}},ki=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return ki(e.record);case`FunctionApplication`:return[e.function,...e.args].every(ki);default:return!1}},Ai=(e,t,n)=>{let r=(t,r=n)=>Ai(e,t,r);if(Eu(t)&&xu(t,e.environment))return Ti(e,t,n);switch(t.kind){case`Number`:return j(t.value)?String(t.value):Ti(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(D(t))return Ti(e,t,n);let i=tu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Si(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Si(e,i.value):Ti(e,t,n)}case`Apply`:return Di(e,t,n);case`And`:case`Or`:{let n=Si(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)}, ${Si(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{ld(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Oi(t.function,n,e.environment)?r(t.function):ki(t.function)?r(t.function,i):Ti(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Si(e,t)}))`,o=Kc(e.environment.runtime.version),s=o?`, ${Si(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`${Si(e,Gc(t))}(${r(t.record)})`;case`Record`:{let i=pd(t.fields);if(md(i))return Ti(e,t,n);let a=Si(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}, ${Si(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=Si(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`)?Ei(e,t,n):Ti(e,t,n);default:return Ti(e,t,n)}},ji=(e,t)=>{if(!yi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ai(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(`
|
|
90
90
|
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;xi.value??=bi();let o=xi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Mi={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},Ni={none:0,error:1,warning:3,state:4},Pi={0:``,1:`Error: `,3:`Warning: `,4:`State `},Fi=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===Ni.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
|
|
91
91
|
(Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${Pi[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},Ii=`The configuration file did not specify the initial state predicate.
|
|
92
92
|
Can also be caused by trying to run TLC on a specification from
|
|
@@ -136,10 +136,10 @@ It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the
|
|
|
136
136
|
`],[2154,`but it produced the following error:
|
|
137
137
|
`],[2213,`:
|
|
138
138
|
`],[2281,` - specifically: `]]),Wi=(e,t,n)=>{let r=n?Ui.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)}${Gi(t.slice(a),n)}`},Gi=(e,t)=>{let n=t?Vi(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ni.none} @!@!@\n${Wi(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Ki=e=>String(e).padStart(2,`0`),qi=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 ${Ki(r%24)}h`:e>36e5?`${Ki(r%24)}h ${Ki(n)}min`:e>6e4?`${Ki(n)}min ${Ki(t)}s`:`${Ki(t)}s`},Ji=e=>`${e.getFullYear()}-${Ki(e.getMonth()+1)}-${Ki(e.getDate())} ${Ki(e.getHours())}:${Ki(e.getMinutes())}:${Ki(e.getSeconds())}`,Yi=/* @__PURE__ */ new WeakMap,Xi=(t,n,r)=>{if(!(t instanceof e.g))return t;let i=e.G(new e.g(`${r}\n${t.message}`,t),e.B(t));return Yi.set(i,{code:n,headline:r,inner:t}),i},Zi=e=>Yi.has(e),Qi=e.N.slice(0,e.N.indexOf(`
|
|
139
|
-
`)),$i=`${e.N}tlc2.tool.EvalException: `,ea=`${e.N}util.Assert$TLCRuntimeException: `,ta=e=>Hi(e)?$i:ea,na=t=>{try{return t()}catch(t){throw t instanceof e.g?Hi(t)?new e.g(`${e.M}${t.message}`):Vi(t.message)?t:new e.g(`${e.N}${t.message}`):t}},ra=[$i,ea,e.N,e.M],ia=(e,t)=>{let n=Yi.get(e);if(n)return`${n.headline}\n${ia(n.inner,t)}`;let r=e.message,i=ra.find(e=>r.startsWith(e))??``;return`${i}${Gi(r.slice(i.length),t)}`},aa=(t,n)=>{let r=Yi.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:ia(t,!0)};if(n&&Hi(t))return{code:Vi(i)?.code??Mi.general,message:i,toolMessage:i};let a=n&&!i.startsWith(Qi)?e.N:``;return{code:Mi.general,message:`${a}${i}`,toolMessage:`${a}${ia(t,!0)}`}},oa=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),sa=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},ca=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(oa.has(e.kind))return!1;let a=sa(e);if(a!==void 0&&!D(e)&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&
|
|
140
|
-
from outside that declaration's scope.`,Xa=(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.R(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:Ka(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?Ga(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Wa(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${Ya}`);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=Ja(t.operand);if(u.isSufficesOpen){if(La(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`?ja(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=Va(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Ha(e);if(!l)return;let f=La(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=La(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Wa(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${Ya}`);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.`))},Za=(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.R(t.location.range),message:r}),!0)},Qa=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.R(i),o=t.params.filter((i,a)=>{let o=ya(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.R(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)},$a=(e,t,n,r)=>{if(!Ua(e))return!1;let i=za(e),a=i[0],o=i.length>1&&a.kind===`Name`?ya(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Xa(e,i,o,t,n,r),o!==void 0},eo=(t,n,r,i)=>{let a=t.location;if(uo(t,r,i))return;let o=fa.get(t);if(o!==void 0)return o;if(pa(n))return t.kind===`Apply`?t.args.length:0;let s=ya(r,n);if(s?.isNonFact){i.errors.push({location:e.R(Na(t,n)),message:`Step number of non-expression step used as an expression.`});return}if($a(t,r,i,!1)||Ia(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=la),s)return s.arity;let c=Aa(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,fa.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(ya(r,l)!==void 0||Aa(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.R(t.kind===`Apply`&&u===`-.`?Ma(a,`-`):Na(t,n));if(!Fa(n)||Ia(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=Pa(t);f&&a.range&&i.errors.push({location:e.R(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},to=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Ta(e,Da(t.pattern),t.pattern.ranges,n),t)),no=(e,t)=>e.kind===`Identifier`&&e.name===t&&D(e)||E(e).some(e=>no(e,t)),ro=(e,t)=>{e.kind===`FunctionConstruction`&&no(e.body,t)&&(e.isRecursive=!0),E(e).forEach(e=>ro(e,t))},io=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Oa(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.R(s),message:t})},l=t.kind===`Function`?to(t.bounds,n,a):Ea(n,t.params,a),u=ya(l,o)??ba(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`?(B(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),ro(t.body,o),t.isSelfReferential=no(t.body,o)):B(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:Sa(o,ya(n,o)??ba(o,a,s),{kind:`Definition`,arity:ga(t),range:s},a)},ao=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(ya(e,t.name)?.isPending)return e;let n={name:t.name,arity:ga(t),params:_a(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)=>_o(t,e,n),e)};return s(e.reduce((e,t)=>{let a=pa(t.name)?e:s(e,e=>!ha(t.location,e.location)),o={name:t.name,arity:ga(t),kind:`Definition`,range:t.location.range,parent:a};if(va(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||pa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return io(t,a,u,i)?{...o,params:_a(t)}:a},a),()=>!0)},oo=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ya(t,r)??ba(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},so=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=oo(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.R(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},co=(t,n,r)=>{if(so(t,n,r))return;let i=t.operator,a=ja(i,n,r),o=eo(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.R(t.argumentsRange??Na(t,i)),message:`The operator ${i} requires ${o-(oo(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>lo(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.R(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=eo(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else B(e,n,r);return!0}if(e.kind===`Lambda`){B(e,n,r);let s=e.params.length===o;return!s&&ua.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)??Na(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 B(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=ja(u,n,r)?.params??[],f=eo(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Na(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.`)})},lo=(e,t,n)=>{e.kind===`Identifier`?eo(e,e.name,t,n):B(e,t,n)},uo=(e,t,n)=>{let r=da.get(e);return r?(r.args.forEach(e=>lo(e,t,n)),n.errors.push(r.error),!0):!1},B=(t,n,r)=>{if(ua.has(t)&&!r.isGenerated){B(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(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(so(t,n,r))return;let i=t.name,a=eo(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.R(Na(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:eo(t,t.operator,n,r);return;case`Apply`:co(t,n,r);return;case`Lambda`:B(t.body,Ta(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`:B(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&&B(t.other,n,r);return;case`Let`:B(t.body,ao(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(t.body,to(t.bounds,n,r),a(Oa(t.bounds)));return;case`UnboundedQuantifier`:B(t.body,Ta(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&B(t.set,n,r),B(t.body,Ta(n,Da(t.pattern),t.pattern.ranges,r),a(Da(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:B(t.predicate,to([t.bound],n,r),a(Da(t.bound.pattern)));return;case`SetMap`:B(t.expression,to(t.bounds,n,r),a(Oa(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.R(i.location.range??Ma(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:B(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(Za(t,r))return;B(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),Qa(t,n,r);return;case`Subexpression`:if(uo(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>lo(e,n,r)),$a(t,n,r,!1)}},fo=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||so(t,n,r)||$a(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&ya(n,i)?.isNonFact?r.errors.push({location:e.R(Na(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||B(t,n,r)}),po=(e,t,n)=>(e.set&&B(e.set,t,n),Ca(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),mo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:po(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?mo(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},ho=(e,t,n)=>e.kind===`AssumeProve`?mo(e,t,n):(B(e,t,n),t),go=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&fo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>vo(t,e,r),t)},_o=(e,t,n)=>{let r=wo(e,t,n);return e.name===void 0?r:Ca(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},vo=(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=ho(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return go(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return go(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 fo(r.facts,t,n),o(t);case`Instance`:return o(_o(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?_o(t,e,i):ao([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),go(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Ta(to(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ta(to(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Oa(r.bounds),...r.names]}),go(e.proof,a(t),n),a(o)}default:return go(e.proof,a(t),n),a(t)}},yo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ho(e.statement,void 0,t);e.name!==void 0&&wa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),go(e.proof,n,t),r&&(r.isInProof=!1)},bo={line:0,column:0},xo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),So=(e,t)=>{let n=new Map([...ma,...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},Co=(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`){B(r,o,a);return}let i=eo(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.D(`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.R(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.R(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!ya(o,e.name)&&!Aa(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.R(i),message:`Substitution missing for symbol ${n.name} declared at ${e.R(o)} \nand instantiated in module ${r}.`})}),c},wo=(e,t,n)=>{let r=n.getInstance(e);return Co(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ca(e,t,r,n),t)},To=(e,t,n,r)=>{let i=So(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Co(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:bo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Eo=(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)=>ha(e.location,t.location)?-1:+!!ha(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.D)||!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},Do=(t,n)=>{let r=So(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([...ma,...n.bound].map(([e,t])=>[e,{...t,position:bo}])),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)=>wa(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Eo([...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=Sa(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);xo(t,e)?B(e.body,void 0,i):io(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:ga(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);Ea(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>wa(t,e,i)),e.name!==void 0&&wa(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);B(e.expression,void 0,r),e.name!==void 0&&wa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>yo(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>fo(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.R(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Oo=/* @__PURE__ */ new WeakSet,ko=/* @__PURE__ */ new WeakSet,Ao=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Io(e,(e,r)=>Ao(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&D(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&D(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},jo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Mo=/* @__PURE__ */ new WeakMap,No=e=>Mo.get(e)??e.name,Po=(e,t)=>(No(t)!==e.name&&Mo.set(e,No(t)),e),Fo=(e,t)=>Po(e.kind===`Function`?{...e,bounds:jo(e.bounds,e=>t(e,[])),body:t(e.body,Oa(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Io=(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=>Fo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:jo(e.bounds,n),body:t(e.body,Oa(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,Da(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,Da(e.bound.pattern))};case`SetMap`:return{...e,bounds:jo(e.bounds,n),expression:t(e.expression,Oa(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)}}},Lo=`LAMBDA`,Ro=(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 Io(e,(e,n)=>(r.push(...Ro(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},zo=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}},Bo=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Vo=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ho=(e,t)=>e.map(e=>({pattern:Vo(e.pattern,t),set:e.set})),Uo=(e,t)=>e.kind===`Function`?{...e,bounds:Ho(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Wo=(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=>Po({...Uo(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ho(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Vo(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Vo(e.bound.pattern,n),set:e.bound.set}};default:return e}},Go=e=>`${e}@ENABLED`,Ko=(e,t)=>e.modes.get(t)??e,qo=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!D(e)&&t.instantiation.variables.has(e.name),Jo=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Jo(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=D(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Jo(r.body,t,/* @__PURE__ */ new Map):void 0},Yo=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return qo(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Go(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:es(e.expression,Ko(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[es(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:es(e.subscript,Ko(t,`Primed`),n),location:r},es(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Jo(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:Go(r),location:e.location},location:e.location},es({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Xo=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:la}),Zo=(e,t)=>e.map(e=>Xo(e.name,t)),Qo=(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:[...Zo(t,r),...i.map(e=>Xo(e,r))],location:r},location:r}},$o=(e,t)=>e.instantiation.isParameterized(t)?ns(e,t):void 0,es=(t,n,r)=>{let i=e=>es(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!D(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:es(t.expression,Ko(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:es(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},Ko(n,`Enabled`),r)};let c=Yo(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name);if(e)return Oo.add(e),e;let r=$o(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&&ga(i)>0?Qo(r,o,ga(i),t.location):{kind:`Apply`,operator:r,args:Zo(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||ko.has(t),l=e=>(c&&ko.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:Lo,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Lo,args:r,resolution:la},location:t.location};if(s)throw new e.D(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=$o(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...Zo(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=$o(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?Qo(e,o,ga(r),t.location):{...t,operator:e}}let l=zo(n),u=Io(t,(e,t)=>t.length===0?i(e):es(e,n,Bo(r,t,l)));return Wo(u,r,l)},ts=(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:Xo(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ns=(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=zo(e),o=Uo(Fo(i,(t,n)=>es(t,e,Bo(/* @__PURE__ */ new Map,n,a))),a);return ts(o,r.params,i.location)}):t},rs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Ro(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=>$o(i,e)??e,getQualifiedKey:t=>{let n=$o(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ts(r,e.params,r.location)):t}}},is=e=>e.kind===`Let`&&e.instances!==void 0||E(e).some(is),as=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Io(e,e=>as(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ha(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}},os=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ss=(e,t)=>e.definitions.some(e=>is(e.body))||e.assumptions.some(e=>is(e.expression))||e.theorems.some(e=>{let t=os(e);return t!==void 0&&is(t)})?{...e,definitions:e.definitions.map(e=>Fo(e,e=>as(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:as(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=os(e);return n===void 0?e:{...e,statement:as(n,t,[])}})}:e,cs=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=qn.sets,a=i??[],o=a.length;qn.sets=a;try{return n()}catch(e){throw Ou(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,qn.sets=i}},ls=(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},us=e=>!e.includes(void 0),ds=e=>e.variables.map(()=>void 0),fs=(e,t,n)=>{let r=[...e];return r[t]=n,r},ps=(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}},ms=e=>e.kind===`Identifier`?e.name:void 0,hs=(e,t,n)=>{if(t.kind===`Label`)return hs(e,t.body,n);let r=ms(t);if(r===void 0)return;let i=Xc(n,r);if(i?.kind===`Thunk`)return hs(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=zl(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?hs(e,o.body,o.scope):void 0},gs=(e,t,n)=>{if(t.kind===`Prime`)return hs(e,t.expression,n);if(t.kind===`Label`)return gs(e,t.body,n);let r=ms(t);if(r===void 0)return;let i=Xc(n,r);if(i?.kind===`Thunk`)return gs(e,i.expression,i.scope);if(i)return;let a=zl(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?gs(e,a.body,a.scope):void 0},_s=t=>{if(typeof t!=`boolean`)throw new e.g(`TLC expected a boolean expression.`);return t},vs=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),ys=(e,t,n)=>{t===void 0?us(n)&&e.onState(n):us(n)&&vs(e)?xs(e,t,n):t.kind===`Predicate`?Ss(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?js(e,t.expression,t.rest,t.scope,n):bs(e,t,n)&&ys(e,t.rest,n)},bs=(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?Jc(t,r.runtime.version):t}})();return!xt(i,a)},xs=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){js(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!bs(e,r,n):!_s(H(r.expression,ls(e,r.scope,n))))return}e.onState(n)},Ss=(t,n,r,i,a)=>cs(t,n,()=>{switch(n.kind){case`Let`:Ss(t,n.body,r,ru(n.definitions,ls(t,i,a)),a);return;case`Label`:Ss(t,n.body,r,i,a);return;default:if(ks.has(n.kind))throw new e.g(`The state relation is not a boolean expression.`);cs(t,n,()=>As(t,n,r,i,a))}}),Cs=(e,t,n,r)=>{_s(t)&&ys(e,n,r)},ws=(e,t,n,r,i)=>{let a=ls(e,r,i);if(t.kind===`Identifier`){let o=Xc(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ss(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ss(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:zl(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&sl(s,e.environment))){Ss(e,c.body,n,c.scope,i);return}Cs(e,H(t,a),n,i);return}let o=Vl(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ss(e,o.body,n,tu(o,t.args,a),i):Cs(e,H(t,a),n,i)},Ts=(e,t,n,r,i)=>{let a=n[r];a===void 0?ys(e,t,fs(n,r,i)):xt(a,i)&&ys(e,t,n)},Es=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Ds=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?hs(t,o,i):gs(t,o,i),l=ls(t,i,a);if(c===void 0){H(n,l)===!0&&ys(t,r,a);return}let u=H(s,l),d=a[c];if(n.operator===`=`){Ts(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)H(n,l)===!0&&ys(t,r,a);else{if(!Sn(f))throw new e.g(`The right side of \\IN is not enumerable.`);for(let e of Pn(f))ys(t,r,fs(a,c,e))}},Os=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),ks=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),As=(t,n,r,i,a)=>{let o=ls(t,i,a);switch(n.kind){case`Identifier`:ws(t,n,r,i,a);return;case`Apply`:if(Os.has(n.operator)&&n.args.length===2){Ds(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(_s(H(n.args[0],o))){Ss(t,n.args[1],r,i,a);return}ys(t,r,a);return}ws(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)=>Es(`Predicate`,t,i,e),r);Ss(t,e[0],n,i,a);return}let o=e[e.length-1];Ss(t,ps(n,e.length-1),Es(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>Ss(t,e,r,i,a));return}Ss(t,ps(n,e.length-1),r,i,a),Ss(t,e[e.length-1],r,i,a);return}case`Exists`:vl(n.bounds,o,e=>(Ss(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(vl(n.bounds,o,t=>(e.push(t),!1)),e.length===0){ys(t,r,a);return}let i=e.slice(1).reduce((e,t)=>Es(`Predicate`,n.body,t,e),r);Ss(t,n.body,i,e[0],a);return}case`If`:Ss(t,_s(H(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>_s(H(e.condition,o)))?.body??n.other;if(s===void 0)throw new e.g(`TLC encountered a CASE with no conditions true.`);Ss(t,s,r,i,a);return}case`FunctionApplication`:{let e=Cl(H(n.function,t.isInit?o:el(o)));if(e){Ss(t,e.body,r,wl(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){js(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){Ss(t,n.action,r,i,a),js(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){Ss(t,n.action,Es(`Changed`,n.subscript,i,r),i,a);return}}Cs(t,H(n,o),r,a)},js=(e,t,n,r,i)=>cs(e,t,()=>{let a=hs(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Ts(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){ys(e,n,i);return}let s=o.reduceRight((e,t)=>Es(`Unchanged`,t,r,e),n);js(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=Xc(r,t.name);if(a?.kind===`Thunk`){js(e,a.expression,n,a.scope,i);return}let o=a?void 0:zl(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){js(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});xt(s,c)&&ys(e,n,i)}),Ms=(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}},Ns=/* @__PURE__ */ Error(`The replay found a successor`),Ps=(e,t,n,r)=>{let i=Ms(r,!1,n,()=>{throw Ns},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Es(`Changed`,e.subscript,t,void 0);Ss(i,e.action,n,t,ds(r))}else Ss(i,e,void 0,t,ds(r));return!1}catch(e){if(e!==Ns)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Fs=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Ms(t,!0,void 0,n),o=i.reduceRight((e,t)=>Es(`Predicate`,t.expression,t.scope,e),void 0);Ss(a,r.expression,o,r.scope,ds(t))},Is=(e,t,n,r)=>{e.some(e=>ks.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Ms(n,!1,t,e=>i.push(e));Ss(a,e.expression,void 0,e.scope,ds(n)),i.forEach(t=>r(t,e))})},Ls=/* @__PURE__ */ new WeakMap,Rs=/* @__PURE__ */ new WeakMap,zs=(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},Bs=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Vs=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Hs=(t,n)=>{let r=new e.g(n);return t.isInit?r:e.G(r,e.U.error)},Us=(e,t,n,r)=>{let i=Rc(n);return r&&ks.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 ${Vs(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Ws=(e,t,n)=>{let r=li(t),i=Lc(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 ${Vs(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
141
|
-
`:``}${i}`},Gs=(e,t,n)=>Ks(e,t,H(t,n)),Ks=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw Hs(e,Us(e,n,t,r))},qs=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=Mu(n,r.environment))(r),Js=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ys=(e,t,n)=>{let r=n?Ls:Rs,i=r.get(e);if(i)return i;let a=Sc(e,t,n);return r.set(e,a),a},Xs=(e,t)=>{if(t.constants.has(e))return;let n=rl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Zs=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Zs(e.expression,t,!1,r);if(e.kind!==`Identifier`||D(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Xs(e.name,t);if(a&&!r.has(a))return r.add(a),Zs(a.body,t,n,r)},Qs=(e,t,n)=>Zs(e,t,!n),$s=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return $s(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=ru(e.definitions,zs(r,t,n));return $s(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Xc(t,e.name);if(a?.kind===`Thunk`)return $s(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=Xs(e.name,r.environment);if(s)return $s(s.body,void 0,n,r,i)},ec=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||D(e))||!t&&e.kind===`Prime`,tc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>tc(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=Xs(e.name,t);if(i)return n.add(e.name),tc(i.body,t,n)},nc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),rc=(e,t,n)=>nc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Js(e.operator)&&(ec(e.args[0],n)||Qs(e.args[0],t,n)!==void 0)||D(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ic=/* @__PURE__ */ new Set,ac=(e,t)=>{if(D(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Io(e,(e,i)=>{let a=r.isReadOnly?ac(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},oc=(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||D(e)?void 0:rl(r,t);return i&&!n.has(i)&&(n.add(i),oc(i.body,t,n))?!0:E(e).some(e=>oc(e,t,n))},sc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Qs(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=tc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return rc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Ys(e,t,n)}},cc=(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(ca(e,t)===void 0||oc(e,t,/* @__PURE__ */ new Set))return!0;let n=ac(e,ic);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)}},lc=(e,t,n)=>{let r=e.map(e=>sc(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=vs(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Tc(u)){d??=zs(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=qs(a,e,n,d);if(!Ks(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=zs(t,n,u);let r=qs(i,s,e.expression,d);if(!Ks(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=zs(t,n,u);let r=qs(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Bs(u,e.index,r),d=void 0;else if(!xt(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=u[t];if(e===void 0)u=Bs(u,t,n[t]),d=void 0;else if(!xt(e,n[t]))return}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)},uc=e=>(t,n,r,i,a,o)=>{Gs(t,e,zs(t,n,r))&&o(r,i)},dc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=zs(r,i,a);if(a[l]!==void 0){Gs(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Sn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Vs(r)}, the right side of \\IN is not enumerable.`;throw Hs(r,`${t}\n${Lc(e)}`)}let p=Pn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Bs(a,l,p[e]),o)}},fc=/* @__PURE__ */ new WeakMap,pc=e=>{let t=fc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(pc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return fc.set(e,n),n},mc=(e,t)=>{let n=e.args[0],r=uc(e),i=(e,r,i)=>$s(n,r,i,e,!t)??-1,a=dc(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],zs(t,n,o));l(Bs(o,u,d),s)}},hc=(e,t,n)=>{let r=Lc(e);return(i,a,o,s,c,l)=>{let u=zs(i,a,o),d=H(e.function,n?u:el(u)),f=Cl(d);if(f!==void 0){Ys(f.body,t,n)(i,wl(f,e,u),o,s,c,l);return}if(!k(d))throw Hs(i,`In computing ${Vs(i)}, a non-function (${li(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw Hs(i,`In computing ${Vs(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},gc=(e,t)=>{if(tc(e,t))return lc([pc(e)],t,!1);if(e.kind===`Tuple`)return Ys(pc(e),t,!1);let n=pc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Xc(i,e.name):void 0;l?.kind===`Thunk`?Ys(pc(l.expression),t,!1)(r,l.scope,a,o,s,c):Gs(r,n,zs(r,i,a))&&c(a,o)}},_c=(e,t,n)=>{let r=e.operator,i=uc(e),a=D(e)?void 0:zl(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=zu(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Ys(a.body,t,n),o.body(e,i(zs(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=zs(a,o,s),f=Vl(e,d);f?.kind===`Closure`?Ys(f.body,t,n)(a,tu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},vc=(e,t,n)=>{let r=uc(e),i=D(e)?void 0:Xs(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Xc(s,e.name);f?.kind===`Thunk`?Ys(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Ys(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},yc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||D(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!D(a))return;let o=Zs(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>yc(e,t,n)),i=r[0],a=r.every(e=>e!==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}}if(e.kind!==`Apply`||D(e))return;let r=zl(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=yc(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`&&D(o))return{variable:i.variable,argument:o.name,labels:i.labels}},bc=(e,t,n)=>{let r=Xc(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},xc=(e,t,n)=>{let r=e.map(e=>Ys(e,t,n)),i=n?[]:e.map(e=>yc(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?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&bc(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Sc=(t,n,r)=>{let i=e=>Ys(e,n,r);switch(t.kind){case`And`:return lc(t.operands,n,r);case`Or`:return xc(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=dl(H(a.set,zs(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,Zc(i,t,u[n]),o,s,c,l)}}let o=r?void 0:cc(t,n);if(o){let e=lc(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=zs(r,i,a),d=t.bounds.map(e=>dl(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=Zc(n,o.names[t],e);if(t===d.length-1){let e=zs(r,i,a);if(!o.guards.every(t=>Gs(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{vl(t.bounds,zs(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&ca(t,n)!==void 0&&!oc(t.body,n,/* @__PURE__ */ new Set)?ac(t,ic):void 0;return(n,r,i,o,s,c)=>{let l=[];vl(t.bounds,zs(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Xc(r,e)?.kind===`Value`)){u.every(e=>Gs(n,t.body,zs(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Tc(i)?u.slice(r).every(e=>Gs(n,t.body,zs(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,zs(r,i,a));if(typeof l!=`boolean`)throw Hs(r,Ws(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=zs(r,i,a),u=e.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw Hs(r,`In computing ${Vs(r)}, a non-boolean expression${r.isEnabled?``:` `}(${li(t)}) was used as a guard condition of a CASE.\n${Rc(e.source)}`)})?.body??n;if(!u)throw Hs(r,`In computing ${Vs(r)}, TLC encountered a CASE with no conditions true.\n${Lc(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=pu(t.definitions,n);return(n,i,a,o,s,c)=>e(n,ru(t.definitions,zs(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.g(`UNCHANGED appears in an initial predicate at ${Fc(t)}`)}:gc(t.expression,n);case`AngleAction`:{let e=i(t.action),r=pc(t.subscript),a=(e,t,i)=>{try{return Gs(e,r,zs(e,t,i))}catch(t){throw e.isEnabled?Jc(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,pc(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return vc(t,n,r);case`FunctionApplication`:return hc(t,n,r);case`Apply`:{let e=t.args;if(Js(t.operator)){let i=Qs(e[0],n,r);if(i!==void 0)return t.operator===`=`?lc([t],n,r):dc(t,()=>i);if(ec(e[0],r))return mc(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=H(e[0],zs(n,r,i));(typeof c==`boolean`?c:nl(c,`the left side of => at ${Fc(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return _c(t,n,r)}default:return uc(t)}},Cc=/* @__PURE__ */ new WeakMap,wc=e=>{let t=Cc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Cc.set(e,n),n},Tc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ec=(t,n)=>{let r=n.state;if(!r||!Tc(r))throw new e.g(`ENABLED needs a complete state at ${Fc(t)}`);let i=n.environment;if(i.callStack)return Ps(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return Ys(t,i,!1)(a,n.scope,wc(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Dc=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};Ys(t,n,!0)(a,i,wc(n),void 0,!1,t=>{if(!a.isStopped){if(!Tc(t))throw e.G(new e._([...t]),e.U.error);a.isStopped=r(t)}})},Oc=(e,t,n)=>{let r=[];return Dc(e,t,e=>(r.push(e),!1),n),r},kc=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return Ys(t,r,!1)(o,a,wc(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!Tc(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.v(`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},Ac=(e,t,n,r)=>{let i=[];return kc(e,t,n,e=>(i.push(e),!1),r),i},jc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Mc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Nc=e=>Mc.has(e.kind)||e.kind===`Apply`&&jc.has(e.operator),Pc=(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&&Ne(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Fc=e=>`line ${e.location.line}, column ${e.location.column}`,Ic=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Lc=e=>{let t=e.location.range;return t?Ic(t):Fc(e)},Rc=e=>e.kind===`Number`?e.text??String(e.value):Lc(e),zc=(t,n)=>new e.g(`A non-boolean expression (${li(n)}) was used as the condition of an IF.\n${Lc(t)}`),Bc=(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.g(`A non-boolean expression (${li(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Rc(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.g(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${li(r)}.\n${Lc({...t,location:{...t.location,range:{...i,end:a}}})}`)},Vc=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${L(e)}\n${Lc(t)}`,i=e=>`Attempted to apply function:\n${Me(L(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!k(a))throw new e.g(`Attempted to select field "${n}" from a non-record value ${Me(L(a))}\n${Lc(t)}`);let o=ft(a);if(o===`tuple`)throw rr(n);return or(a,n,o===`record`?r:i)}},Hc=e=>e===`1.7.4`?(t,n)=>er(t,n,e):void 0,Uc=t=>n=>{if(!k(n))throw new e.g(`Attempted to apply the operator DOMAIN to a non-function\n(${li(n)})\n${Lc(t)}`);return cr(n)},Wc=(t,n)=>(r,i)=>{if(!O(r)||tt(r))throw new e.g(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Lc(t)}`);return n.evaluate([r,i])},Gc=t=>e.G(new e.g(`TLC can't handle real numbers: ${t.text} at ${Fc(t)}`),e.U.configParseError),Kc=t=>e.G(new e.g(`TLC can't handle a number this big: ${t.text??t.value} at ${Fc(t)}`),e.U.error),qc=(t,n)=>new e.O(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Lc(n)}`,t),Jc=(t,n)=>t instanceof e.O&&n!==`1.7.4`?new e.g(`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,Yc=t=>new e.g(`A primed expression appears outside an action at ${Fc(t)}`),Xc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Zc=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Qc=(t,n,r)=>{if(n.kind===`Name`)return Zc(t,n.name,r);let i=Gn(r);if(!i||i.length!==n.names.length)throw new e.g(`Cannot bind <<${n.names.join(`, `)}>> to ${L(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>Zc(e,t,i[n]),t)},$c=(t,n)=>{if(k(t))return t;throw new e.g(`A non-function (${li(t)}) was applied as a function.\n${Lc(n)}`)},el=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},tl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),nl=(t,n)=>{if(typeof t!=`boolean`)throw new e.g(`Expected ${n} to be a boolean but found ${L(t)}`);return t},rl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),il=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),al=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),ol=(e,t)=>{if(il.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&al.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=rl(n,t);if(e&&!t.constants.has(n)&&!sl(e,t))return!0}return E(e).some(e=>ol(e,t))},sl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!ol(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>ol(e.set,t)));return t.constantLevels.set(e,r),r},cl=(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.`},ll=(t,n,r)=>{if(!O(t)||tt(t)){let i=L(t),a=r===`1.7.4`?void 0:cl(t,i);throw new e.g(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Rc(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Rc(n)}\n${a}`)}},ul=(e,t,n)=>(ll(e,t,n),typeof e==`object`&&e.kind===`Interval`?hn(e):kn(e)??P(e).elements),dl=(e,t,n)=>n===`1.7.4`?(ll(e,t,n),kn(e)??Pn(e)):ul(e,t,n),fl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Vn(e),e},pl=(e,t,n)=>fl(e)??dl(e,t,n),ml=(e,t,n)=>fl(e)??ul(e,t,n),hl=(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},gl=(e,t)=>e.map(e=>pl(H(e.set,t),e.set,t.environment.runtime.version)),_l=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):hl(t[n],t=>i(n-1,Qc(a,e[n].pattern,t)));return i(e.length-1,n)},vl=(e,t,n)=>_l(e,gl(e,t),t.scope,n),yl=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},bl=(e,t,n)=>{if(e.length===1)return Qc(t,e[0].pattern,n);let r=Gn(n)??[];return e.reduce((e,t,n)=>Qc(e,t.pattern,r[n]),t)},xl=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Sl=e=>Object.assign(e.value,{lambda:e}),Cl=e=>xl(e)?e.lambda:void 0,wl=(t,n,r)=>{let i=t.value,a=n.args.map(e=>H(e,r)),o=a.length===1?a[0]:yn(a),s=(e,t,r)=>`In applying the function\n${Me(L(i))},\nthe ${e} is:\n${Me(L(t))}${r}.\n${Lc(n.function)}`,c=t.bounds;if(c.length===1){if(!Yn(o,i.domain))throw new e.g(s(`first argument`,o,`which is not in its domain`));return bl(c,t.scope,o)}let l=Gn(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e.g(`Attempted to apply a function to an argument not in its domain.\n${Lc(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!Yn(r,u[n]))throw new e.g(s(i,r,`${t.pattern.kind===`Name`?``:`
|
|
142
|
-
`}which is not in its domain`));if(t.pattern.kind===`Tuple`&&Gn(r)?.length!==t.pattern.names.length)throw new e.g(s(i,r,`which does not match its formal parameter`))}),bl(c,t.scope,yn(l.slice(0,c.length)))},Tl=/* @__PURE__ */ new WeakMap,El=(e,t)=>{let n=Tl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={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:Ic(r)};return Tl.set(t,i),i},Dl=(e,t,n)=>{let r=El(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Ol=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=xr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Ct(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},kl=/* @__PURE__ */ new WeakMap,Al=e=>{let t=kl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return kl.set(e,n),n},jl=(e,t)=>{let n=yl(e.bounds,t),r=Ol(n,(n,r)=>H(e.body,tl(t,bl(e.bounds,Zc(void 0,e.name,r),n))),Dl(e.bounds,e.body,n));return Sl({value:r,bounds:e.bounds,body:e.body,scope:Zc(void 0,e.name,r)}),e.bounds.length===1?pt(r):r},Ml=(t,n)=>{if(typeof n!=`object`||ft(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Ne(n.domain))return n;try{let e=I(n);return lt(e.domain,e.range)}catch(t){if(t instanceof e.g)return n;throw t}},Nl=(e,t)=>e.kind===`Function`?e.isSelfReferential?jl(e,t):H(Al(e),t):H(e.body,t),Pl=(t,n)=>{let r=sl(t,n.environment),i=r?n.environment.definitionValues.get(t):void 0;if(i!==void 0)return i;if(t.kind===`Operator`&&t.params.length>0)throw new e.g(`Operator ${t.name} requires ${t.params.length} arguments`);let a=tl(n,void 0);if(!r)return Nl(t,a);let o=n.environment.runtime.evaluateAtStartup(()=>Ml(t,Nl(t,a)));return n.environment.definitionValues.set(t,o),o},Fl=(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))&&sl(t,n))try{$t(Pl(t,{environment:n,scope:void 0,state:void 0,next:void 0}))}catch(t){if(!(t instanceof e.g)&&!e.H(t))throw t}}),Il=(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,tl(t,e.scope));return n&&(!e.isStreamed||In(r))&&(e.cache=r),r},Ll=/* @__PURE__ */ new WeakMap,Rl=e=>{let t=Ll.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Ll.set(e,n),n},zl=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return zl(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Rl(r):t.builtins.get(e)},Bl=/* @__PURE__ */ new WeakMap,Vl=(e,t)=>{if(D(e))return Hl(e.operator,t);let n=Bl.get(e),r=n===void 0?zl(e.operator,t.environment)??null:n;return n===void 0&&Bl.set(e,r),r??Hl(e.operator,t)},Hl=(e,t)=>{let n=Xc(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return zl(e,t.environment)},Ul=e=>e.kind===`Closure`?e.params.length:e.arity,Wl=(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:Hl(r,n);if(!i)throw new e.g(`Expected an operator argument at ${Fc(t)}`);return i},Gl=(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)=>Zc(e,n.name,t[r]),e.scope);return H(e.body,tl(n,r))},Kl=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Ul(e),call:n=>Gl(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},ql=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Hl(e.name,t);return n!==void 0&&Ul(n)>0},Jl=(e,t)=>e.map(e=>ql(e,t)?Kl(Wl(e,t),t):H(e,t)),Yl=(t,n)=>new e.g(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),Xl=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Zl=(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 Zl(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([])}},Ql=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&j(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=D(e)?void 0:Zl(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Xc(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Xl(e,t)}}return t=>Xl(e,t)},$l=/* @__PURE__ */ new WeakMap,eu=(e,t)=>{let n=$l.get(e);if(n)return n;let r=Ql(e,t);return $l.set(e,r),r},tu=(e,t,n,r)=>{if(t.length!==e.params.length)throw Yl(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:Wl(t[a],n)}:(r?.[a]??eu(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},nu=(e,t,n,r,i)=>{if(e.kind===`Closure`){let a=tl(n,tu(e,t,n,i));return n.environment.callStack?H(e.body,a):(r.entry?.body===e.body?r.entry:r.entry={body:e.body,evaluator:Mu(e.body,n.environment)}).evaluator(a)}return e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(Lu(t,n),n):e.evaluate(Jl(t,n),n)},ru=(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),iu=(t,n,r)=>{let i=Xc(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Il(i,r);if(i?.kind===`Operator`){if(Ul(i.operator)===0)return Gl(i.operator,[],r);throw new e.g(`Operator ${t} is used without arguments`)}let a=Zl(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw qc(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Pl(a.definition,r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.g(`Unknown identifier ${t} at ${Fc(n)}`)},au=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),ou=(e,t)=>au.has(e)||t.builtins.get(e)?.isStateLevel===!0,su={builtins:au,definitions:/* @__PURE__ */ new WeakMap},cu={builtins:new Set([...au].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},lu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&sl(e,t),uu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!D(e)){let e=rl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!lu(e,t)&&du(e,t,n))return!0}return E(e).some(e=>uu(e,t,n))},du=(e,t,n=su)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=uu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>uu(e.set,t,n));return n.definitions.set(e,i),i},fu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},pu=(e,t)=>({impure:new Set(e.filter(e=>du(e,t))),streamed:new Set(e.filter(e=>du(e,t,fu)))}),mu=e=>[...e.definitions.values()].some(t=>du(t,e)),hu=e=>[...e.definitions.values()].some(t=>du(t,e,cu)),gu=/* @__PURE__ */ new WeakMap,_u=(e,t)=>{let n=gu.get(e);if(n!==void 0)return n;let r=xu(e,t,yu);return gu.set(e,r),r},vu=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),yu=/* @__PURE__ */ new Set,bu=(e,t,n)=>n.size===0?_u(e,t):xu(e,t,n),xu=(e,t,n)=>{if(!vu.has(e.kind))return!1;if(e.kind===`Identifier`&&D(e))return n.has(e.name);if(D(e))return!1;if(e.kind===`Identifier`){let n=Zl(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&lu(n.definition,t)}if(e.kind===`Apply`){if(ou(e.operator,t)||fu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=zl(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=rl(e.operator,t);if(!n||!sl(n,t)||du(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&bu(e,t,n))}let r={value:!0};return Io(e,(e,i)=>(r.value&&=bu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Su=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Cu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},wu=(e,t)=>{if(e.kind===`Identifier`&&D(e))return!t.has(e.name);if(D(e))return!0;let n={value:!1};return Io(e,(e,r)=>(n.value||=wu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Tu=(e,t)=>Oo.has(e)&&Su(e)&&ca(e,t)!==void 0&&!wu(e,yu),Eu=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Du=(e,t,n,r)=>i=>{r.expressions.push(e);let a=qn.sets,o=qn.callStack,s=a??[],c=s.length;qn.sets=s,qn.callStack=r;try{let a=t(i),o=Eu(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Nc(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=Pc(e,r.values),a=i&&!E(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!k(a)?void 0:a;throw Ou(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,qn.sets=a,qn.callStack=o}},Ou=(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.g){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},ku=(t,n,r)=>{if(!(r instanceof e.g))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}},Au=e=>({...e,evaluators:/* @__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=fd(e,t),i=t.callStack,a=i?Du(e,r,t,i):Su(e)&&_u(e,t)?Cu(r):Tu(e,t)?Fu(r):r;return t.evaluators.set(e,a),a},ju=/* @__PURE__ */ new WeakMap,Mu=(e,t)=>{if(t.callStack)return V(e,t);let n=ju.get(e);if(n)return n;let r=(Su(e)&&_u(e,t)?void 0:ji(e,t))??V(e,t);return ju.set(e,r),r},H=(e,t)=>Mu(e,t.environment)(t),Nu=(e,t)=>{let n=e.name,r=D(e)?void 0:Zl(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw qc(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&sl(e,t))return t=>Pl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Mu(e.body,t),n.body(tl(r,void 0)));return Pu(e,t)?Fu(r):r}return t=>Pl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Pl(e,t);return sl(e,t)||!Pu(e,t)?n:Fu(n)}return t=>iu(n,e,t)},Pu=(e,t)=>ca(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>ca(e.set,t)!==void 0)),Fu=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Iu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||D(e))return!0;let n=zl(e.name,t);return n===void 0||Ul(n)===0},Lu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Ru=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Lu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Iu(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Iu(t[0],n)&&Iu(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(Jl(t,n),n)},zu=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Yl(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:eu(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:Wl(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Bu=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),Vu=/* @__PURE__ */ new WeakMap,Hu=e=>{let t=Vu.get(e);if(t)return t;let n={constant:Bu(),state:Bu()};return Vu.set(e,n),n},Uu=e=>e.kind===`ExceptAt`||E(e).some(Uu),Wu=/* @__PURE__ */ new WeakMap,Gu=(e,t)=>{let n=Wu.get(e);if(n!==void 0)return n;let r=ca(e,t)!==void 0&&ac(e,yu),i=r&&[...new Set(Uu(e)?[...r,`@`]:r)];return Wu.set(e,i??!1),i??!1},Ku=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,U={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},qu=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:xr(e),Ju=e=>Ku(e)?(U.sources[U.sourceCount++]=void 0,U.args[U.argCount++]=e,U.hash=fr(U.hash,qu(e)),!0):!1,Yu=(e,t,n)=>{if(!t)return!1;U.sources[U.sourceCount++]=e,U.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=Xc(n,t[e]);if(r?.kind!==`Value`||!Ku(r.value))return!1;U.args[U.argCount++]=r.value,U.hash=fr(U.hash,qu(r.value))}return!0},Xu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&j(e.value))return()=>Ju(e.value);if(e.kind===`Identifier`){let n=D(e)?void 0:Zl(e.name,t);if(n?.kind===`Value`)return()=>Ju(n.value);if(n===void 0)return n=>{let r=Xc(n.scope,e.name);return r?.kind===`Value`?Ju(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:Yu(r.expression,Gu(r.expression,t),r.scope)}}let n=Gu(e,t);return t=>Yu(e,n,t.scope)},Zu=e=>{if(e.args.length!==U.argCount||e.sources.length!==U.sourceCount)return!1;for(let t=0;t<U.sourceCount;t++)if(e.sources[t]!==U.sources[t])return!1;for(let t=0;t<U.argCount;t++)if(!Ct(e.args[t],U.args[t]))return!1;return!0},Qu=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(Zu(e[t]))return e[t]}},$u=(e,t)=>{let n=rl(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!du(n,t))return sl(n,t)?`constant`:Pu(n,t)?`state`:void 0},ed=(e,t,n,r)=>{let i=zu(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Mu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=Hu(e),c=t.map(e=>Xu(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);U.sourceCount=0,U.argCount=0,U.hash=t.length,U.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||U.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=U.hash&1073741823,d=a.calls.get(u),f=Qu(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=U.sources.slice(0,U.sourceCount),m=U.args.slice(0,U.argCount),h=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:h};d?d.push(e):a.calls.set(u,[e])}return h}},td=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=V(r[0],n),t=V(r[1],n);return n=>!nl(e(n),`the left side of =>`)||nl(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e.g(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=D(t)?void 0:zl(t.operator,n);if(i?.kind===`Closure`){let e=n.callStack?void 0:$u(t,n);return ed(i,r,n,e)}if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=V(r[0],n),i=Uc(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=V(r[0],n);return ko.has(t)||ol(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=Wc(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Ru(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.g(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={entry:void 0},o=r.map(e=>eu(e,n));return i=>{let s=Hl(t.operator,i);if(s)return nu(s,r,i,a,o);throw n.definitions.get(t.operator)?.kind===`Function`?new e.g(`${t.operator} is a function; apply it with brackets`):new e.g(`Unknown operator ${t.operator} at ${Fc(t)}`)}},nd=(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=>hl(pl(o(s),a.set,t.runtime.version),t=>nl(i(tl(s,Zc(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)=>pl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?nl(i(tl(s,a)),r)!==n:hl(c[t],n=>l(t-1,Zc(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>vl(o,e,t=>nl(i(tl(e,t)),r)!==n)?!n:n},rd=(e,t)=>{if(e.kind===`Tuple`)return yn(e.names.map(e=>{let n=Xc(t,e);return n?.kind===`Value`&&n.value}));let n=Xc(t,e.name);return n?.kind===`Value`?n.value:void 0},id=/* @__PURE__ */ new WeakSet,ad=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&id.add(e)},od=(t,n)=>{let r=id.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=_n(e),a=lt(r,r.map(e=>i(tl(t,Zc(t.scope,n,e)))));return Ne(e)?a:pt(a)}let n=[],r=a.map(e=>ml(H(e.set,t),e.set,t.environment.runtime.version));return _l(a,r,t.scope,e=>{let r=a.length===1?rd(o.pattern,e)??!1:yn(a.map(t=>rd(t.pattern,e)??!1));return n.push([r,i(tl(t,e))]),!1}),ln(n)},u=(e,n)=>{let r=Sl({value:Ol(e,e=>i(tl(n,bl(a,n.scope,e))),Dl(a,t.body,e)),bounds:a,body:t.body,scope:n.scope});return a.length===1?pt(r):r},d=n.callStack;return n=>{let i=s?c(n):yl(a,n);if(t.isRecursive||r||n.isKeepLazy||!N(i))return u(i,n);if(!Ne(i)){if(d)return u(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e.g))throw t;return u(i,n)}}if(!d)return l(i,n);try{return l(i,n)}catch(e){throw ku(d,t,e),e}}},sd=(e,t)=>{let n=id.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):yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(tl(i,Zc(i.scope,`@`,e))):lr(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(Mi.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Lc(e.function)}`)}return n}},cd=(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:Ic(a)},s=(e,t)=>n=>nl(e(tl(t,Qc(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 Ne(n)?ct(P(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 vl(t.bounds,n,t=>(r.push(e(tl(n,t))),!1)),rn(r)}}let r=t.set;if(!r)return()=>{throw new e.g(`TLC cannot evaluate an unbounded CHOOSE at ${Fc(t)}`)};let i=V(t.body,n),a=V(r,n);return n=>{let o=a(n);if(!O(o)||tt(o))throw new e.g(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Lc(t)}`);let s={value:void 0},c=ml(o,r,n.environment.runtime.version);if(hl(c,e=>{let r=Qc(n.scope,t.pattern,e);return nl(i(tl(n,r)),`the body of CHOOSE`)?(s.value=rd(t.pattern,r),!0):!1}),s.value===void 0)throw new e.g(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Lc(t)}`);return s.value}},ld=e=>[...e].sort((e,t)=>M(e.name,t.name)),ud=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),dd=(e,t)=>{let n=ld(e),r=ud(n),i=n.map(e=>V(e.value,t));if(r)return e=>bn(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=>ze(a,i.map(t=>t(e)),o):e=>xn(a,i.map(t=>t(e)))},fd=(t,n)=>{let r=e=>V(e,n);switch(t.kind){case`Number`:{let e=t.value;return j(e)?()=>e:()=>{throw Kc(t)}}case`Decimal`:return()=>{throw Gc(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Nu(t,n);case`Apply`:return td(t,n);case`Bracket`:return()=>{throw new e.g(`A bracket without a function or subscript is not an expression at ${Fc(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.g(`An operator cannot be used as a value at ${Fc(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 Bc(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 Bc(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw Yc(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=>xt(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 zc(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.g(`A non-boolean expression (${li(n)}) was used as a condition of a CASE. ${Rc(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.g(`Attempted to evaluate a CASE with no conditions true.\n${Lc(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(tl(n,ru(t.definitions,n)))}case`Forall`:case`Exists`:return nd(t,n);case`UnboundedQuantifier`:return()=>{throw new e.g(`TLC cannot evaluate an unbounded quantifier at ${Fc(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return cd(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>rn(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>yn(e.map(e=>e(t)))}case`FunctionConstruction`:return od(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 dd(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 sd(t,n);case`ExceptAt`:return n=>{let r=Xc(n.scope,`@`);if(r?.kind!==`Value`)throw new e.g(`@ appears outside an EXCEPT at ${Fc(t)}`);return r.value};case`FunctionApplication`:{ad(t.function);let e=r(t.function),i=n=>$c(e(el(n)),t),a=t.args.map(r),o=Hc(n.runtime.version);if(a.length===1){let e=a[0];return t=>or(i(t),e(t),o)}return e=>or(i(e),yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Vc(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?nl(e(t),`an action`)||n(t):nl(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>Ec(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.g(`The subexpression reference at ${Fc(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e.g(`TLC cannot evaluate a temporal formula in a state at ${Fc(t)}`)}}},pd=`tlc2/value/impl/`,md={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},hd={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},gd=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)}},_d=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),vd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],yd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??_d.get(e[3])}${`[]`.repeat(e[1].length)}`),bd=(e,t)=>e[e[t].first].text,xd=(e,t)=>bd(e,t).replaceAll(`/`,`.`),Sd=t=>{let n=gd(t);if(n.readUint32()!==3405691582)throw new e.D(`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===md.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===md.integer?i.value=n.readInt32():t===md.float?n.readUint32():t===md.long||t===md.double?(n.readBytes(8),e++):t===md.class||t===md.string||t===md.methodType||t===md.module||t===md.package?i.first=n.readUint16():t===md.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=xd(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=yd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:gd(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()},()=>xd(r,d.readUint16())):[],p=vd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=yd(i.slice(a+1))[0],h=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(`,`)})${h}`})}return{pool:r,methods:s}},Cd=(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.k(`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===md.integer)return t.value;if(t.tag===md.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>=hd.iconstM1&&t<=hd.iconst5)s.push(t-hd.iconst0),e+=1;else if(t===hd.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===hd.sipush)s.push(r()<<16>>16),e+=3;else if(t===hd.ldc)s.push(l(o[e+1])),e+=2;else if(t===hd.ldcW)s.push(l(r())),e+=3;else if(t===hd.dup){let t=c();s.push(t,t),e+=1}else if(t===hd.getstatic){let t=Cd(n,r());if(t.className!==`${pd}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===hd.invokestatic){let t=Cd(n,r()),o=c();if(t.className!==`${pd}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===hd.new)s.push({className:bd(n,r()),value:void 0}),e+=3;else if(t===hd.invokespecial){let t=Cd(n,r()),o=c(),s=c();if(!(t.className===`${pd}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===hd.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()},Td=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Sd(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)}))}},Ed=/* @__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(`,`),Dd=[[`\\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`,`≀`],[`^+`,`⁺`]],Od=/* @__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(`,`),kd=/* @__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(`.`),Ad=/* @__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(`.`),jd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Md=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
139
|
+
`)),$i=`${e.N}tlc2.tool.EvalException: `,ea=`${e.N}util.Assert$TLCRuntimeException: `,ta=e=>Hi(e)?$i:ea,na=t=>{try{return t()}catch(t){throw t instanceof e.g?Hi(t)?new e.g(`${e.M}${t.message}`):Vi(t.message)?t:new e.g(`${e.N}${t.message}`):t}},ra=[$i,ea,e.N,e.M],ia=(e,t)=>{let n=Yi.get(e);if(n)return`${n.headline}\n${ia(n.inner,t)}`;let r=e.message,i=ra.find(e=>r.startsWith(e))??``;return`${i}${Gi(r.slice(i.length),t)}`},aa=(t,n)=>{let r=Yi.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:ia(t,!0)};if(n&&Hi(t))return{code:Vi(i)?.code??Mi.general,message:i,toolMessage:i};let a=n&&!i.startsWith(Qi)?e.N:``;return{code:Mi.general,message:`${a}${i}`,toolMessage:`${a}${ia(t,!0)}`}},oa=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),sa=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},ca=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(oa.has(e.kind))return!1;let a=sa(e);if(a!==void 0&&!D(e)&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&uu(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return E(e).every(i)};return i(e)?[...n]:void 0},la={kind:`Local`},ua=/* @__PURE__ */ new WeakSet,da=/* @__PURE__ */ new WeakMap,fa=/* @__PURE__ */ new WeakMap,pa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ma=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ha=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ga=e=>e.kind===`Operator`?e.params.length:0,_a=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],va=e=>e.name.includes(`!`),ya=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ba=(e,t,n)=>{let r=t.bindings.get(e);return r&&ha(r.position,t.location)&&(!n||ha(r.position,n.start))?r:void 0},xa=(t,n)=>t!==void 0&&n!==void 0&&e.R(t)===e.R(n),Sa=(t,n,r,i)=>{if(n===void 0)return!0;if(xa(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.R(a),s=n.range&&e.R(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},Ca=(e,t,n,r)=>Sa(t,ya(e,t)??ba(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,wa=(e,t,n)=>{Sa(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ta=(e,t,n,r)=>t.reduce((e,t,i)=>Ca(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ea=(e,t,n)=>t.reduce((e,t)=>Ca(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Da=e=>e.kind===`Name`?[e.name]:e.names,Oa=e=>e.flatMap(e=>Da(e.pattern)),ka=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ha(n.location,t.location))?n:void 0},Aa=(e,t)=>{let n=ka(e,t);return n?{key:t.getKey(n),arity:ga(n),params:_a(n),kind:`Definition`}:t.imported.get(e)},ja=(e,t,n)=>ya(t,e)??Aa(e,n),Ma=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Na=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Ma(e.location,e.spelling??t)},Pa=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ha(e.location,e.args[0].location)?`prefix`:`postfix`}},Fa=e=>!/^[\p{L}\d_]/u.test(e),Ia=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),La=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Ra=(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])}})},za=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Ra(e.name,[],void 0):Ra(e.operator,e.args,e.argumentCounts),Ba=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Va=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Oa(e.bounds),body:e.body,sets:Ba(e.bounds)};case`SetMap`:return{names:Oa(e.bounds),body:e.expression,sets:Ba(e.bounds)};case`SetFilter`:return{names:Da(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Da(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}},Ha=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}},Ua=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Wa=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ga=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Ga(e.body,t):E(e).reduce((e,n)=>e??Ga(n,t),void 0)},Ka=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Ka(i,t,n||Wa(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ga(e.set,t):Ga(e,t)},qa=e=>e.kind===`Label`?qa(e.body):e,Ja=e=>typeof e==`number`?`argument selector ${e}`:e,Ya=`within the scope of a declaration
|
|
140
|
+
from outside that declaration's scope.`,Xa=(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.R(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:Ka(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?Ga(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Wa(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${Ya}`);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=Ja(t.operand);if(u.isSufficesOpen){if(La(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`?ja(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=Va(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Ha(e);if(!l)return;let f=La(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=La(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Wa(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${Ya}`);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.`))},Za=(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.R(t.location.range),message:r}),!0)},Qa=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.R(i),o=t.params.filter((i,a)=>{let o=ya(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.R(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)},$a=(e,t,n,r)=>{if(!Ua(e))return!1;let i=za(e),a=i[0],o=i.length>1&&a.kind===`Name`?ya(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Xa(e,i,o,t,n,r),o!==void 0},eo=(t,n,r,i)=>{let a=t.location;if(uo(t,r,i))return;let o=fa.get(t);if(o!==void 0)return o;if(pa(n))return t.kind===`Apply`?t.args.length:0;let s=ya(r,n);if(s?.isNonFact){i.errors.push({location:e.R(Na(t,n)),message:`Step number of non-expression step used as an expression.`});return}if($a(t,r,i,!1)||Ia(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=la),s)return s.arity;let c=Aa(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,fa.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(ya(r,l)!==void 0||Aa(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.R(t.kind===`Apply`&&u===`-.`?Ma(a,`-`):Na(t,n));if(!Fa(n)||Ia(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=Pa(t);f&&a.range&&i.errors.push({location:e.R(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},to=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Ta(e,Da(t.pattern),t.pattern.ranges,n),t)),no=(e,t)=>e.kind===`Identifier`&&e.name===t&&D(e)||E(e).some(e=>no(e,t)),ro=(e,t)=>{e.kind===`FunctionConstruction`&&no(e.body,t)&&(e.isRecursive=!0),E(e).forEach(e=>ro(e,t))},io=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Oa(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.R(s),message:t})},l=t.kind===`Function`?to(t.bounds,n,a):Ea(n,t.params,a),u=ya(l,o)??ba(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`?(B(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),ro(t.body,o),t.isSelfReferential=no(t.body,o)):B(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:Sa(o,ya(n,o)??ba(o,a,s),{kind:`Definition`,arity:ga(t),range:s},a)},ao=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(ya(e,t.name)?.isPending)return e;let n={name:t.name,arity:ga(t),params:_a(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)=>_o(t,e,n),e)};return s(e.reduce((e,t)=>{let a=pa(t.name)?e:s(e,e=>!ha(t.location,e.location)),o={name:t.name,arity:ga(t),kind:`Definition`,range:t.location.range,parent:a};if(va(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||pa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return io(t,a,u,i)?{...o,params:_a(t)}:a},a),()=>!0)},oo=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ya(t,r)??ba(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},so=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=oo(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.R(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},co=(t,n,r)=>{if(so(t,n,r))return;let i=t.operator,a=ja(i,n,r),o=eo(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.R(t.argumentsRange??Na(t,i)),message:`The operator ${i} requires ${o-(oo(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>lo(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.R(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=eo(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else B(e,n,r);return!0}if(e.kind===`Lambda`){B(e,n,r);let s=e.params.length===o;return!s&&ua.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)??Na(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 B(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=ja(u,n,r)?.params??[],f=eo(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Na(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.`)})},lo=(e,t,n)=>{e.kind===`Identifier`?eo(e,e.name,t,n):B(e,t,n)},uo=(e,t,n)=>{let r=da.get(e);return r?(r.args.forEach(e=>lo(e,t,n)),n.errors.push(r.error),!0):!1},B=(t,n,r)=>{if(ua.has(t)&&!r.isGenerated){B(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(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(so(t,n,r))return;let i=t.name,a=eo(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.R(Na(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:eo(t,t.operator,n,r);return;case`Apply`:co(t,n,r);return;case`Lambda`:B(t.body,Ta(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`:B(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&&B(t.other,n,r);return;case`Let`:B(t.body,ao(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(t.body,to(t.bounds,n,r),a(Oa(t.bounds)));return;case`UnboundedQuantifier`:B(t.body,Ta(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&B(t.set,n,r),B(t.body,Ta(n,Da(t.pattern),t.pattern.ranges,r),a(Da(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:B(t.predicate,to([t.bound],n,r),a(Da(t.bound.pattern)));return;case`SetMap`:B(t.expression,to(t.bounds,n,r),a(Oa(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.R(i.location.range??Ma(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:B(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(Za(t,r))return;B(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),Qa(t,n,r);return;case`Subexpression`:if(uo(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>lo(e,n,r)),$a(t,n,r,!1)}},fo=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||so(t,n,r)||$a(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&ya(n,i)?.isNonFact?r.errors.push({location:e.R(Na(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||B(t,n,r)}),po=(e,t,n)=>(e.set&&B(e.set,t,n),Ca(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),mo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:po(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?mo(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},ho=(e,t,n)=>e.kind===`AssumeProve`?mo(e,t,n):(B(e,t,n),t),go=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&fo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>vo(t,e,r),t)},_o=(e,t,n)=>{let r=wo(e,t,n);return e.name===void 0?r:Ca(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},vo=(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=ho(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return go(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return go(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 fo(r.facts,t,n),o(t);case`Instance`:return o(_o(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?_o(t,e,i):ao([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),go(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Ta(to(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ta(to(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Oa(r.bounds),...r.names]}),go(e.proof,a(t),n),a(o)}default:return go(e.proof,a(t),n),a(t)}},yo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ho(e.statement,void 0,t);e.name!==void 0&&wa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),go(e.proof,n,t),r&&(r.isInProof=!1)},bo={line:0,column:0},xo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),So=(e,t)=>{let n=new Map([...ma,...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},Co=(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`){B(r,o,a);return}let i=eo(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.D(`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.R(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.R(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!ya(o,e.name)&&!Aa(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.R(i),message:`Substitution missing for symbol ${n.name} declared at ${e.R(o)} \nand instantiated in module ${r}.`})}),c},wo=(e,t,n)=>{let r=n.getInstance(e);return Co(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ca(e,t,r,n),t)},To=(e,t,n,r)=>{let i=So(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Co(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:bo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Eo=(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)=>ha(e.location,t.location)?-1:+!!ha(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.D)||!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},Do=(t,n)=>{let r=So(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([...ma,...n.bound].map(([e,t])=>[e,{...t,position:bo}])),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)=>wa(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Eo([...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=Sa(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);xo(t,e)?B(e.body,void 0,i):io(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:ga(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);Ea(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>wa(t,e,i)),e.name!==void 0&&wa(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);B(e.expression,void 0,r),e.name!==void 0&&wa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>yo(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>fo(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.R(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Oo=/* @__PURE__ */ new WeakSet,ko=/* @__PURE__ */ new WeakSet,Ao=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Io(e,(e,r)=>Ao(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&D(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&D(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},jo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Mo=/* @__PURE__ */ new WeakMap,No=e=>Mo.get(e)??e.name,Po=(e,t)=>(No(t)!==e.name&&Mo.set(e,No(t)),e),Fo=(e,t)=>Po(e.kind===`Function`?{...e,bounds:jo(e.bounds,e=>t(e,[])),body:t(e.body,Oa(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Io=(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=>Fo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:jo(e.bounds,n),body:t(e.body,Oa(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,Da(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,Da(e.bound.pattern))};case`SetMap`:return{...e,bounds:jo(e.bounds,n),expression:t(e.expression,Oa(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)}}},Lo=`LAMBDA`,Ro=(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 Io(e,(e,n)=>(r.push(...Ro(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},zo=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}},Bo=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Vo=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ho=(e,t)=>e.map(e=>({pattern:Vo(e.pattern,t),set:e.set})),Uo=(e,t)=>e.kind===`Function`?{...e,bounds:Ho(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Wo=(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=>Po({...Uo(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ho(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Vo(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Vo(e.bound.pattern,n),set:e.bound.set}};default:return e}},Go=e=>`${e}@ENABLED`,Ko=(e,t)=>e.modes.get(t)??e,qo=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!D(e)&&t.instantiation.variables.has(e.name),Jo=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Jo(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=D(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Jo(r.body,t,/* @__PURE__ */ new Map):void 0},Yo=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return qo(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Go(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:es(e.expression,Ko(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[es(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:es(e.subscript,Ko(t,`Primed`),n),location:r},es(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Jo(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:Go(r),location:e.location},location:e.location},es({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Xo=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:la}),Zo=(e,t)=>e.map(e=>Xo(e.name,t)),Qo=(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:[...Zo(t,r),...i.map(e=>Xo(e,r))],location:r},location:r}},$o=(e,t)=>e.instantiation.isParameterized(t)?ns(e,t):void 0,es=(t,n,r)=>{let i=e=>es(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!D(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:es(t.expression,Ko(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:es(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},Ko(n,`Enabled`),r)};let c=Yo(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name);if(e)return Oo.add(e),e;let r=$o(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&&ga(i)>0?Qo(r,o,ga(i),t.location):{kind:`Apply`,operator:r,args:Zo(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||ko.has(t),l=e=>(c&&ko.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:Lo,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Lo,args:r,resolution:la},location:t.location};if(s)throw new e.D(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=$o(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...Zo(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=$o(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?Qo(e,o,ga(r),t.location):{...t,operator:e}}let l=zo(n),u=Io(t,(e,t)=>t.length===0?i(e):es(e,n,Bo(r,t,l)));return Wo(u,r,l)},ts=(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:Xo(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ns=(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=zo(e),o=Uo(Fo(i,(t,n)=>es(t,e,Bo(/* @__PURE__ */ new Map,n,a))),a);return ts(o,r.params,i.location)}):t},rs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Ro(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=>$o(i,e)??e,getQualifiedKey:t=>{let n=$o(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ts(r,e.params,r.location)):t}}},is=e=>e.kind===`Let`&&e.instances!==void 0||E(e).some(is),as=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Io(e,e=>as(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ha(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}},os=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ss=(e,t)=>e.definitions.some(e=>is(e.body))||e.assumptions.some(e=>is(e.expression))||e.theorems.some(e=>{let t=os(e);return t!==void 0&&is(t)})?{...e,definitions:e.definitions.map(e=>Fo(e,e=>as(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:as(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=os(e);return n===void 0?e:{...e,statement:as(n,t,[])}})}:e,cs=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=qn.sets,a=i??[],o=a.length;qn.sets=a;try{return n()}catch(e){throw Mu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,qn.sets=i}},ls=(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},us=e=>!e.includes(void 0),ds=e=>e.variables.map(()=>void 0),fs=(e,t,n)=>{let r=[...e];return r[t]=n,r},ps=(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}},ms=e=>e.kind===`Identifier`?e.name:void 0,hs=(e,t,n)=>{if(t.kind===`Label`)return hs(e,t.body,n);let r=ms(t);if(r===void 0)return;let i=el(n,r);if(i?.kind===`Thunk`)return hs(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Ul(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?hs(e,o.body,o.scope):void 0},gs=(e,t,n)=>{if(t.kind===`Prime`)return hs(e,t.expression,n);if(t.kind===`Label`)return gs(e,t.body,n);let r=ms(t);if(r===void 0)return;let i=el(n,r);if(i?.kind===`Thunk`)return gs(e,i.expression,i.scope);if(i)return;let a=Ul(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?gs(e,a.body,a.scope):void 0},_s=t=>{if(typeof t!=`boolean`)throw new e.g(`TLC expected a boolean expression.`);return t},vs=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),ys=(e,t,n)=>{t===void 0?us(n)&&e.onState(n):us(n)&&vs(e)?xs(e,t,n):t.kind===`Predicate`?Ss(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?js(e,t.expression,t.rest,t.scope,n):bs(e,t,n)&&ys(e,t.rest,n)},bs=(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?Qc(t,r.runtime.version):t}})();return!xt(i,a)},xs=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){js(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!bs(e,r,n):!_s(H(r.expression,ls(e,r.scope,n))))return}e.onState(n)},Ss=(t,n,r,i,a)=>cs(t,n,()=>{switch(n.kind){case`Let`:Ss(t,n.body,r,su(n.definitions,ls(t,i,a)),a);return;case`Label`:Ss(t,n.body,r,i,a);return;default:if(ks.has(n.kind))throw new e.g(`The state relation is not a boolean expression.`);cs(t,n,()=>As(t,n,r,i,a))}}),Cs=(e,t,n,r)=>{_s(t)&&ys(e,n,r)},ws=(e,t,n,r,i)=>{let a=ls(e,r,i);if(t.kind===`Identifier`){let o=el(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ss(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ss(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:Ul(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&dl(s,e.environment))){Ss(e,c.body,n,c.scope,i);return}Cs(e,H(t,a),n,i);return}let o=Gl(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ss(e,o.body,n,au(o,t.args,a),i):Cs(e,H(t,a),n,i)},Ts=(e,t,n,r,i)=>{let a=n[r];a===void 0?ys(e,t,fs(n,r,i)):xt(a,i)&&ys(e,t,n)},Es=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Ds=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?hs(t,o,i):gs(t,o,i),l=ls(t,i,a);if(c===void 0){H(n,l)===!0&&ys(t,r,a);return}let u=H(s,l),d=a[c];if(n.operator===`=`){Ts(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)H(n,l)===!0&&ys(t,r,a);else{if(!Sn(f))throw new e.g(`The right side of \\IN is not enumerable.`);for(let e of Pn(f))ys(t,r,fs(a,c,e))}},Os=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),ks=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),As=(t,n,r,i,a)=>{let o=ls(t,i,a);switch(n.kind){case`Identifier`:ws(t,n,r,i,a);return;case`Apply`:if(Os.has(n.operator)&&n.args.length===2){Ds(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(_s(H(n.args[0],o))){Ss(t,n.args[1],r,i,a);return}ys(t,r,a);return}ws(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)=>Es(`Predicate`,t,i,e),r);Ss(t,e[0],n,i,a);return}let o=e[e.length-1];Ss(t,ps(n,e.length-1),Es(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>Ss(t,e,r,i,a));return}Ss(t,ps(n,e.length-1),r,i,a),Ss(t,e[e.length-1],r,i,a);return}case`Exists`:Sl(n.bounds,o,e=>(Ss(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(Sl(n.bounds,o,t=>(e.push(t),!1)),e.length===0){ys(t,r,a);return}let i=e.slice(1).reduce((e,t)=>Es(`Predicate`,n.body,t,e),r);Ss(t,n.body,i,e[0],a);return}case`If`:Ss(t,_s(H(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>_s(H(e.condition,o)))?.body??n.other;if(s===void 0)throw new e.g(`TLC encountered a CASE with no conditions true.`);Ss(t,s,r,i,a);return}case`FunctionApplication`:{let e=Dl(H(n.function,t.isInit?o:il(o)));if(e){Ss(t,e.body,r,Ol(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){js(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){Ss(t,n.action,r,i,a),js(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){Ss(t,n.action,Es(`Changed`,n.subscript,i,r),i,a);return}}Cs(t,H(n,o),r,a)},js=(e,t,n,r,i)=>cs(e,t,()=>{let a=hs(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Ts(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){ys(e,n,i);return}let s=o.reduceRight((e,t)=>Es(`Unchanged`,t,r,e),n);js(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=el(r,t.name);if(a?.kind===`Thunk`){js(e,a.expression,n,a.scope,i);return}let o=a?void 0:Ul(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){js(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});xt(s,c)&&ys(e,n,i)}),Ms=(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}},Ns=/* @__PURE__ */ Error(`The replay found a successor`),Ps=(e,t,n,r)=>{let i=Ms(r,!1,n,()=>{throw Ns},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Es(`Changed`,e.subscript,t,void 0);Ss(i,e.action,n,t,ds(r))}else Ss(i,e,void 0,t,ds(r));return!1}catch(e){if(e!==Ns)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Fs=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Ms(t,!0,void 0,n),o=i.reduceRight((e,t)=>Es(`Predicate`,t.expression,t.scope,e),void 0);Ss(a,r.expression,o,r.scope,ds(t))},Is=(e,t,n,r)=>{e.some(e=>ks.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Ms(n,!1,t,e=>i.push(e));Ss(a,e.expression,void 0,e.scope,ds(n)),i.forEach(t=>r(t,e))})},Ls=/* @__PURE__ */ new WeakMap,Rs=/* @__PURE__ */ new WeakMap,zs=(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},Bs=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Vs=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Hs=(t,n)=>{let r=new e.g(n);return t.isInit?r:e.G(r,e.U.error)},Us=(e,t,n,r)=>{let i=Hc(n);return r&&ks.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 ${Vs(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Ws=(e,t,n)=>{let r=li(t),i=Vc(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 ${Vs(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
141
|
+
`:``}${i}`},Gs=(e,t,n)=>Ks(e,t,H(t,n)),Ks=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw Hs(e,Us(e,n,t,r))},qs=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=Iu(n,r.environment))(r),Js=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ys=(e,t,n)=>{let r=n?Ls:Rs,i=r.get(e);if(i)return i;let a=Ec(e,t,n);return r.set(e,a),a},Xs=(e,t)=>{if(t.constants.has(e))return;let n=sl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Zs=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Zs(e.expression,t,!1,r);if(e.kind!==`Identifier`||D(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Xs(e.name,t);if(a&&!r.has(a))return r.add(a),Zs(a.body,t,n,r)},Qs=(e,t,n)=>Zs(e,t,!n),$s=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return $s(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=su(e.definitions,zs(r,t,n));return $s(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=el(t,e.name);if(a?.kind===`Thunk`)return $s(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=Xs(e.name,r.environment);if(s)return $s(s.body,void 0,n,r,i)},ec=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||D(e))||!t&&e.kind===`Prime`,tc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>tc(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=Xs(e.name,t);if(i)return n.add(e.name),tc(i.body,t,n)},nc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),rc=(e,t,n)=>nc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Js(e.operator)&&(ec(e.args[0],n)||Qs(e.args[0],t,n)!==void 0)||D(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ic=/* @__PURE__ */ new Set,ac=(e,t)=>{if(D(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Io(e,(e,i)=>{let a=r.isReadOnly?ac(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},oc=(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||D(e)?void 0:sl(r,t);return i&&!n.has(i)&&(n.add(i),oc(i.body,t,n))?!0:E(e).some(e=>oc(e,t,n))},sc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Qs(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=tc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return rc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Ys(e,t,n)}},cc=(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(ca(e,t)===void 0||oc(e,t,/* @__PURE__ */ new Set))return!0;let n=ac(e,ic);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)}},lc=(e,t,n)=>{let r=e.map(e=>sc(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=vs(t);for(let s=e;s<r.length;s++){if(s>0&&f&&kc(u)){d??=zs(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=qs(a,e,n,d);if(!Ks(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=zs(t,n,u);let r=qs(i,s,e.expression,d);if(!Ks(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=zs(t,n,u);let r=qs(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Bs(u,e.index,r),d=void 0;else if(!xt(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(!xt(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)},uc=e=>(t,n,r,i,a,o)=>{Gs(t,e,zs(t,n,r))&&o(r,i)},dc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=zs(r,i,a);if(a[l]!==void 0){Gs(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Sn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Vs(r)}, the right side of \\IN is not enumerable.`;throw Hs(r,`${t}\n${Vc(e)}`)}let p=Pn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Bs(a,l,p[e]),o)}},fc=/* @__PURE__ */ new WeakMap,pc=e=>{let t=fc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(pc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return fc.set(e,n),n},mc=(e,t)=>{let n=e.args[0],r=uc(e),i=(e,r,i)=>$s(n,r,i,e,!t)??-1,a=dc(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],zs(t,n,o));l(Bs(o,u,d),s)}},hc=(e,t,n)=>{let r=Vc(e);return(i,a,o,s,c,l)=>{let u=zs(i,a,o),d=H(e.function,n?u:il(u)),f=Dl(d);if(f!==void 0){Ys(f.body,t,n)(i,Ol(f,e,u),o,s,c,l);return}if(!k(d))throw Hs(i,`In computing ${Vs(i)}, a non-function (${li(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw Hs(i,`In computing ${Vs(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},gc=(e,t)=>{if(tc(e,t))return lc([pc(e)],t,!1);if(e.kind===`Tuple`)return Ys(pc(e),t,!1);let n=pc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?el(i,e.name):void 0;l?.kind===`Thunk`?Ys(pc(l.expression),t,!1)(r,l.scope,a,o,s,c):Gs(r,n,zs(r,i,a))&&c(a,o)}},_c=(e,t,n)=>{let r=e.operator,i=uc(e),a=D(e)?void 0:Ul(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Uu(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Ys(a.body,t,n),o.body(e,i(zs(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=zs(a,o,s),f=Gl(e,d);f?.kind===`Closure`?Ys(f.body,t,n)(a,au(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},vc=(e,t,n)=>{let r=uc(e),i=D(e)?void 0:Xs(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=el(s,e.name);f?.kind===`Thunk`?Ys(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Ys(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},yc=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||D(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`||!D(i))return;let a=Zs(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},bc=e=>e.kind===`And`?e.operands.flatMap(bc):[e],xc=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&rc(e,t,!1),Sc=e=>{let t=[];return(n,r,i)=>{let a=zs(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Ks(n,i,qs(t,r,i,a)))return}}},Cc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=bc(e),r=n.findIndex(e=>!xc(e,t)||yc(e,t)),i=r===-1?void 0:yc(n[r],t);return i?{...i,before:r===0?void 0:Sc(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Cc(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`||D(e))return;let r=Ul(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Cc(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`||!D(o))return;let s=i.before,c=s&&Uu(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(zs(e,t,n)),n))}},wc=(e,t,n)=>{let r=el(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},Tc=(e,t,n)=>{let r=e.map(e=>Ys(e,t,n)),i=n?[]:e.map(e=>Cc(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&&wc(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)}}},Ec=(t,n,r)=>{let i=e=>Ys(e,n,r);switch(t.kind){case`And`:return lc(t.operands,n,r);case`Or`:return Tc(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=hl(H(a.set,zs(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,tl(i,t,u[n]),o,s,c,l)}}let o=r?void 0:cc(t,n);if(o){let e=lc(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=zs(r,i,a),d=t.bounds.map(e=>hl(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=tl(n,o.names[t],e);if(t===d.length-1){let e=zs(r,i,a);if(!o.guards.every(t=>Gs(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{Sl(t.bounds,zs(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&ca(t,n)!==void 0&&!oc(t.body,n,/* @__PURE__ */ new Set)?ac(t,ic):void 0;return(n,r,i,o,s,c)=>{let l=[];Sl(t.bounds,zs(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>el(r,e)?.kind===`Value`)){u.every(e=>Gs(n,t.body,zs(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&kc(i)?u.slice(r).every(e=>Gs(n,t.body,zs(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,zs(r,i,a));if(typeof l!=`boolean`)throw Hs(r,Ws(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=zs(r,i,a),u=e.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw Hs(r,`In computing ${Vs(r)}, a non-boolean expression${r.isEnabled?``:` `}(${li(t)}) was used as a guard condition of a CASE.\n${Hc(e.source)}`)})?.body??n;if(!u)throw Hs(r,`In computing ${Vs(r)}, TLC encountered a CASE with no conditions true.\n${Vc(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=_u(t.definitions,n);return(n,i,a,o,s,c)=>e(n,su(t.definitions,zs(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.g(`UNCHANGED appears in an initial predicate at ${zc(t)}`)}:gc(t.expression,n);case`AngleAction`:{let e=i(t.action),r=pc(t.subscript),a=(e,t,i)=>{try{return Gs(e,r,zs(e,t,i))}catch(t){throw e.isEnabled?Qc(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,pc(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return vc(t,n,r);case`FunctionApplication`:return hc(t,n,r);case`Apply`:{let e=t.args;if(Js(t.operator)){let i=Qs(e[0],n,r);if(i!==void 0)return t.operator===`=`?lc([t],n,r):dc(t,()=>i);if(ec(e[0],r))return mc(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=H(e[0],zs(n,r,i));(typeof c==`boolean`?c:ol(c,`the left side of => at ${zc(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return _c(t,n,r)}default:return uc(t)}},Dc=/* @__PURE__ */ new WeakMap,Oc=e=>{let t=Dc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Dc.set(e,n),n},kc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ac=(t,n)=>{let r=n.state;if(!r||!kc(r))throw new e.g(`ENABLED needs a complete state at ${zc(t)}`);let i=n.environment;if(i.callStack)return Ps(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return Ys(t,i,!1)(a,n.scope,Oc(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},jc=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};Ys(t,n,!0)(a,i,Oc(n),void 0,!1,t=>{if(!a.isStopped){if(!kc(t))throw e.G(new e._([...t]),e.U.error);a.isStopped=r(t)}})},Mc=(e,t,n)=>{let r=[];return jc(e,t,e=>(r.push(e),!1),n),r},Nc=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return Ys(t,r,!1)(o,a,Oc(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!kc(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.v(`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},Pc=(e,t,n,r)=>{let i=[];return Nc(e,t,n,e=>(i.push(e),!1),r),i},Fc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Ic=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Lc=e=>Ic.has(e.kind)||e.kind===`Apply`&&Fc.has(e.operator),Rc=(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&&Ne(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},zc=e=>`line ${e.location.line}, column ${e.location.column}`,Bc=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Vc=e=>{let t=e.location.range;return t?Bc(t):zc(e)},Hc=e=>e.kind===`Number`?e.text??String(e.value):Vc(e),Uc=(t,n)=>new e.g(`A non-boolean expression (${li(n)}) was used as the condition of an IF.\n${Vc(t)}`),Wc=(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.g(`A non-boolean expression (${li(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Hc(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.g(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${li(r)}.\n${Vc({...t,location:{...t.location,range:{...i,end:a}}})}`)},Gc=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${L(e)}\n${Vc(t)}`,i=e=>`Attempted to apply function:\n${Me(L(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!k(a))throw new e.g(`Attempted to select field "${n}" from a non-record value ${Me(L(a))}\n${Vc(t)}`);let o=ft(a);if(o===`tuple`)throw rr(n);return or(a,n,o===`record`?r:i)}},Kc=e=>e===`1.7.4`?(t,n)=>er(t,n,e):void 0,qc=t=>n=>{if(!k(n))throw new e.g(`Attempted to apply the operator DOMAIN to a non-function\n(${li(n)})\n${Vc(t)}`);return cr(n)},Jc=(t,n)=>(r,i)=>{if(!O(r)||tt(r))throw new e.g(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Vc(t)}`);return n.evaluate([r,i])},Yc=t=>e.G(new e.g(`TLC can't handle real numbers: ${t.text} at ${zc(t)}`),e.U.configParseError),Xc=t=>e.G(new e.g(`TLC can't handle a number this big: ${t.text??t.value} at ${zc(t)}`),e.U.error),Zc=(t,n)=>new e.O(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Vc(n)}`,t),Qc=(t,n)=>t instanceof e.O&&n!==`1.7.4`?new e.g(`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,$c=t=>new e.g(`A primed expression appears outside an action at ${zc(t)}`),el=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},tl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),nl=(t,n,r)=>{if(n.kind===`Name`)return tl(t,n.name,r);let i=Gn(r);if(!i||i.length!==n.names.length)throw new e.g(`Cannot bind <<${n.names.join(`, `)}>> to ${L(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>tl(e,t,i[n]),t)},rl=(t,n)=>{if(k(t))return t;throw new e.g(`A non-function (${li(t)}) was applied as a function.\n${Vc(n)}`)},il=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},al=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),ol=(t,n)=>{if(typeof t!=`boolean`)throw new e.g(`Expected ${n} to be a boolean but found ${L(t)}`);return t},sl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),cl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),ll=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),ul=(e,t)=>{if(cl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&ll.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=sl(n,t);if(e&&!t.constants.has(n)&&!dl(e,t))return!0}return E(e).some(e=>ul(e,t))},dl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!ul(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>ul(e.set,t)));return t.constantLevels.set(e,r),r},fl=(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.`},pl=(t,n,r)=>{if(!O(t)||tt(t)){let i=L(t),a=r===`1.7.4`?void 0:fl(t,i);throw new e.g(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Hc(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Hc(n)}\n${a}`)}},ml=(e,t,n)=>(pl(e,t,n),typeof e==`object`&&e.kind===`Interval`?hn(e):kn(e)??P(e).elements),hl=(e,t,n)=>n===`1.7.4`?(pl(e,t,n),kn(e)??Pn(e)):ml(e,t,n),gl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Vn(e),e},_l=(e,t,n)=>gl(e)??hl(e,t,n),vl=(e,t,n)=>gl(e)??ml(e,t,n),yl=(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},bl=(e,t)=>e.map(e=>_l(H(e.set,t),e.set,t.environment.runtime.version)),xl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):yl(t[n],t=>i(n-1,nl(a,e[n].pattern,t)));return i(e.length-1,n)},Sl=(e,t,n)=>xl(e,bl(e,t),t.scope,n),Cl=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},wl=(e,t,n)=>{if(e.length===1)return nl(t,e[0].pattern,n);let r=Gn(n)??[];return e.reduce((e,t,n)=>nl(e,t.pattern,r[n]),t)},Tl=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,El=e=>Object.assign(e.value,{lambda:e}),Dl=e=>Tl(e)?e.lambda:void 0,Ol=(t,n,r)=>{let i=t.value,a=n.args.map(e=>H(e,r)),o=a.length===1?a[0]:yn(a),s=(e,t,r)=>`In applying the function\n${Me(L(i))},\nthe ${e} is:\n${Me(L(t))}${r}.\n${Vc(n.function)}`,c=t.bounds;if(c.length===1){if(!Yn(o,i.domain))throw new e.g(s(`first argument`,o,`which is not in its domain`));return wl(c,t.scope,o)}let l=Gn(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e.g(`Attempted to apply a function to an argument not in its domain.\n${Vc(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!Yn(r,u[n]))throw new e.g(s(i,r,`${t.pattern.kind===`Name`?``:`
|
|
142
|
+
`}which is not in its domain`));if(t.pattern.kind===`Tuple`&&Gn(r)?.length!==t.pattern.names.length)throw new e.g(s(i,r,`which does not match its formal parameter`))}),wl(c,t.scope,yn(l.slice(0,c.length)))},kl=/* @__PURE__ */ new WeakMap,Al=(e,t)=>{let n=kl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={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:Bc(r)};return kl.set(t,i),i},jl=(e,t,n)=>{let r=Al(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Ml=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=xr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Ct(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Nl=/* @__PURE__ */ new WeakMap,Pl=e=>{let t=Nl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Nl.set(e,n),n},Fl=(e,t)=>{let n=Cl(e.bounds,t),r=Ml(n,(n,r)=>H(e.body,al(t,wl(e.bounds,tl(void 0,e.name,r),n))),jl(e.bounds,e.body,n));return El({value:r,bounds:e.bounds,body:e.body,scope:tl(void 0,e.name,r)}),e.bounds.length===1?pt(r):r},Il=(t,n)=>{if(typeof n!=`object`||ft(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Ne(n.domain))return n;try{let e=I(n);return lt(e.domain,e.range)}catch(t){if(t instanceof e.g)return n;throw t}},Ll=(e,t)=>e.kind===`Function`?e.isSelfReferential?Fl(e,t):H(Pl(e),t):H(e.body,t),Rl=(t,n)=>{let r=dl(t,n.environment),i=r?n.environment.definitionValues.get(t):void 0;if(i!==void 0)return i;if(t.kind===`Operator`&&t.params.length>0)throw new e.g(`Operator ${t.name} requires ${t.params.length} arguments`);let a=al(n,void 0);if(!r)return Ll(t,a);let o=n.environment.runtime.evaluateAtStartup(()=>Il(t,Ll(t,a)));return n.environment.definitionValues.set(t,o),o},zl=(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))&&dl(t,n))try{$t(Rl(t,{environment:n,scope:void 0,state:void 0,next:void 0}))}catch(t){if(!(t instanceof e.g)&&!e.H(t))throw t}}),Bl=(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,al(t,e.scope));return n&&(!e.isStreamed||In(r))&&(e.cache=r),r},Vl=/* @__PURE__ */ new WeakMap,Hl=e=>{let t=Vl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Vl.set(e,n),n},Ul=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Ul(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Hl(r):t.builtins.get(e)},Wl=/* @__PURE__ */ new WeakMap,Gl=(e,t)=>{if(D(e))return Kl(e.operator,t);let n=Wl.get(e),r=n===void 0?Ul(e.operator,t.environment)??null:n;return n===void 0&&Wl.set(e,r),r??Kl(e.operator,t)},Kl=(e,t)=>{let n=el(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Ul(e,t.environment)},ql=e=>e.kind===`Closure`?e.params.length:e.arity,Jl=(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:Kl(r,n);if(!i)throw new e.g(`Expected an operator argument at ${zc(t)}`);return i},Yl=(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)=>tl(e,n.name,t[r]),e.scope);return H(e.body,al(n,r))},Xl=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:ql(e),call:n=>Yl(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Zl=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Kl(e.name,t);return n!==void 0&&ql(n)>0},Ql=(e,t)=>e.map(e=>Zl(e,t)?Xl(Jl(e,t),t):H(e,t)),$l=(t,n)=>new e.g(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),eu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),tu=(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 tu(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([])}},nu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&j(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=D(e)?void 0:tu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=el(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:eu(e,t)}}return t=>eu(e,t)},ru=/* @__PURE__ */ new WeakMap,iu=(e,t)=>{let n=ru.get(e);if(n)return n;let r=nu(e,t);return ru.set(e,r),r},au=(e,t,n,r)=>{if(t.length!==e.params.length)throw $l(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:Jl(t[a],n)}:(r?.[a]??iu(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},ou=(e,t,n,r,i)=>{if(e.kind===`Closure`){let a=al(n,au(e,t,n,i));return n.environment.callStack?H(e.body,a):(r.entry?.body===e.body?r.entry:r.entry={body:e.body,evaluator:Iu(e.body,n.environment)}).evaluator(a)}return e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(Vu(t,n),n):e.evaluate(Ql(t,n),n)},su=(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),cu=(t,n,r)=>{let i=el(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Bl(i,r);if(i?.kind===`Operator`){if(ql(i.operator)===0)return Yl(i.operator,[],r);throw new e.g(`Operator ${t} is used without arguments`)}let a=tu(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw Zc(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Rl(a.definition,r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.g(`Unknown identifier ${t} at ${zc(n)}`)},lu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),uu=(e,t)=>lu.has(e)||t.builtins.get(e)?.isStateLevel===!0,du={builtins:lu,definitions:/* @__PURE__ */ new WeakMap},fu={builtins:new Set([...lu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},pu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&dl(e,t),mu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!D(e)){let e=sl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!pu(e,t)&&hu(e,t,n))return!0}return E(e).some(e=>mu(e,t,n))},hu=(e,t,n=du)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=mu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>mu(e.set,t,n));return n.definitions.set(e,i),i},gu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},_u=(e,t)=>({impure:new Set(e.filter(e=>hu(e,t))),streamed:new Set(e.filter(e=>hu(e,t,gu)))}),vu=e=>[...e.definitions.values()].some(t=>hu(t,e)),yu=e=>[...e.definitions.values()].some(t=>hu(t,e,fu)),bu=/* @__PURE__ */ new WeakMap,xu=(e,t)=>{let n=bu.get(e);if(n!==void 0)return n;let r=Tu(e,t,Cu);return bu.set(e,r),r},Su=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Cu=/* @__PURE__ */ new Set,wu=(e,t,n)=>n.size===0?xu(e,t):Tu(e,t,n),Tu=(e,t,n)=>{if(!Su.has(e.kind))return!1;if(e.kind===`Identifier`&&D(e))return n.has(e.name);if(D(e))return!1;if(e.kind===`Identifier`){let n=tu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&pu(n.definition,t)}if(e.kind===`Apply`){if(uu(e.operator,t)||gu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=Ul(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=sl(e.operator,t);if(!n||!dl(n,t)||hu(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&wu(e,t,n))}let r={value:!0};return Io(e,(e,i)=>(r.value&&=wu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Eu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Du=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Ou=(e,t)=>{if(e.kind===`Identifier`&&D(e))return!t.has(e.name);if(D(e))return!0;let n={value:!1};return Io(e,(e,r)=>(n.value||=Ou(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},ku=(e,t)=>Oo.has(e)&&Eu(e)&&ca(e,t)!==void 0&&!Ou(e,Cu),Au=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,ju=(e,t,n,r)=>i=>{r.expressions.push(e);let a=qn.sets,o=qn.callStack,s=a??[],c=s.length;qn.sets=s,qn.callStack=r;try{let a=t(i),o=Au(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Lc(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=Rc(e,r.values),a=i&&!E(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!k(a)?void 0:a;throw Mu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,qn.sets=a,qn.callStack=o}},Mu=(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.g){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},Nu=(t,n,r)=>{if(!(r instanceof e.g))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}},Pu=e=>({...e,evaluators:/* @__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=gd(e,t),i=t.callStack,a=i?ju(e,r,t,i):Eu(e)&&xu(e,t)?Du(r):ku(e,t)?zu(r):r;return t.evaluators.set(e,a),a},Fu=/* @__PURE__ */ new WeakMap,Iu=(e,t)=>{if(t.callStack)return V(e,t);let n=Fu.get(e);if(n)return n;let r=(Eu(e)&&xu(e,t)?void 0:ji(e,t))??V(e,t);return Fu.set(e,r),r},H=(e,t)=>Iu(e,t.environment)(t),Lu=(e,t)=>{let n=e.name,r=D(e)?void 0:tu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Zc(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&dl(e,t))return t=>Rl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Iu(e.body,t),n.body(al(r,void 0)));return Ru(e,t)?zu(r):r}return t=>Rl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Rl(e,t);return dl(e,t)||!Ru(e,t)?n:zu(n)}return t=>cu(n,e,t)},Ru=(e,t)=>ca(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>ca(e.set,t)!==void 0)),zu=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Bu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||D(e))return!0;let n=Ul(e.name,t);return n===void 0||ql(n)===0},Vu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Hu=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Vu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Bu(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Bu(t[0],n)&&Bu(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(Ql(t,n),n)},Uu=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw $l(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:iu(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:Jl(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Wu=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),Gu=/* @__PURE__ */ new WeakMap,Ku=e=>{let t=Gu.get(e);if(t)return t;let n={constant:Wu(),state:Wu()};return Gu.set(e,n),n},qu=e=>e.kind===`ExceptAt`||E(e).some(qu),Ju=/* @__PURE__ */ new WeakMap,Yu=(e,t)=>{let n=Ju.get(e);if(n!==void 0)return n;let r=ca(e,t)!==void 0&&ac(e,Cu),i=r&&[...new Set(qu(e)?[...r,`@`]:r)];return Ju.set(e,i??!1),i??!1},Xu=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,U={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},Zu=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:xr(e),Qu=e=>Xu(e)?(U.sources[U.sourceCount++]=void 0,U.args[U.argCount++]=e,U.hash=fr(U.hash,Zu(e)),!0):!1,$u=(e,t,n)=>{if(!t)return!1;U.sources[U.sourceCount++]=e,U.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=el(n,t[e]);if(r?.kind!==`Value`||!Xu(r.value))return!1;U.args[U.argCount++]=r.value,U.hash=fr(U.hash,Zu(r.value))}return!0},ed=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&j(e.value))return()=>Qu(e.value);if(e.kind===`Identifier`){let n=D(e)?void 0:tu(e.name,t);if(n?.kind===`Value`)return()=>Qu(n.value);if(n===void 0)return n=>{let r=el(n.scope,e.name);return r?.kind===`Value`?Qu(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:$u(r.expression,Yu(r.expression,t),r.scope)}}let n=Yu(e,t);return t=>$u(e,n,t.scope)},td=e=>{if(e.args.length!==U.argCount||e.sources.length!==U.sourceCount)return!1;for(let t=0;t<U.sourceCount;t++)if(e.sources[t]!==U.sources[t])return!1;for(let t=0;t<U.argCount;t++)if(!Ct(e.args[t],U.args[t]))return!1;return!0},nd=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(td(e[t]))return e[t]}},rd=(e,t)=>{let n=sl(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!hu(n,t))return dl(n,t)?`constant`:Ru(n,t)?`state`:void 0},id=(e,t,n,r)=>{let i=Uu(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Iu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=Ku(e),c=t.map(e=>ed(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);U.sourceCount=0,U.argCount=0,U.hash=t.length,U.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||U.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=U.hash&1073741823,d=a.calls.get(u),f=nd(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=U.sources.slice(0,U.sourceCount),m=U.args.slice(0,U.argCount),h=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:h};d?d.push(e):a.calls.set(u,[e])}return h}},ad=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=V(r[0],n),t=V(r[1],n);return n=>!ol(e(n),`the left side of =>`)||ol(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e.g(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=D(t)?void 0:Ul(t.operator,n);if(i?.kind===`Closure`){let e=n.callStack?void 0:rd(t,n);return id(i,r,n,e)}if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=V(r[0],n),i=qc(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=V(r[0],n);return ko.has(t)||ul(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=Jc(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Hu(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.g(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={entry:void 0},o=r.map(e=>iu(e,n));return i=>{let s=Kl(t.operator,i);if(s)return ou(s,r,i,a,o);throw n.definitions.get(t.operator)?.kind===`Function`?new e.g(`${t.operator} is a function; apply it with brackets`):new e.g(`Unknown operator ${t.operator} at ${zc(t)}`)}},od=(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=>yl(_l(o(s),a.set,t.runtime.version),t=>ol(i(al(s,tl(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)=>_l(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?ol(i(al(s,a)),r)!==n:yl(c[t],n=>l(t-1,tl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Sl(o,e,t=>ol(i(al(e,t)),r)!==n)?!n:n},sd=(e,t)=>{if(e.kind===`Tuple`)return yn(e.names.map(e=>{let n=el(t,e);return n?.kind===`Value`&&n.value}));let n=el(t,e.name);return n?.kind===`Value`?n.value:void 0},cd=/* @__PURE__ */ new WeakSet,ld=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&cd.add(e)},ud=(t,n)=>{let r=cd.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=_n(e),a=lt(r,r.map(e=>i(al(t,tl(t.scope,n,e)))));return Ne(e)?a:pt(a)}let n=[],r=a.map(e=>vl(H(e.set,t),e.set,t.environment.runtime.version));return xl(a,r,t.scope,e=>{let r=a.length===1?sd(o.pattern,e)??!1:yn(a.map(t=>sd(t.pattern,e)??!1));return n.push([r,i(al(t,e))]),!1}),ln(n)},u=(e,n)=>{let r=El({value:Ml(e,e=>i(al(n,wl(a,n.scope,e))),jl(a,t.body,e)),bounds:a,body:t.body,scope:n.scope});return a.length===1?pt(r):r},d=n.callStack;return n=>{let i=s?c(n):Cl(a,n);if(t.isRecursive||r||n.isKeepLazy||!N(i))return u(i,n);if(!Ne(i)){if(d)return u(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e.g))throw t;return u(i,n)}}if(!d)return l(i,n);try{return l(i,n)}catch(e){throw Nu(d,t,e),e}}},dd=(e,t)=>{let n=cd.has(e);n&&ld(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):yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(al(i,tl(i.scope,`@`,e))):lr(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(Mi.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Vc(e.function)}`)}return n}},fd=(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:Bc(a)},s=(e,t)=>n=>ol(e(al(t,nl(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 Ne(n)?ct(P(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 Sl(t.bounds,n,t=>(r.push(e(al(n,t))),!1)),rn(r)}}let r=t.set;if(!r)return()=>{throw new e.g(`TLC cannot evaluate an unbounded CHOOSE at ${zc(t)}`)};let i=V(t.body,n),a=V(r,n);return n=>{let o=a(n);if(!O(o)||tt(o))throw new e.g(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Vc(t)}`);let s={value:void 0},c=vl(o,r,n.environment.runtime.version);if(yl(c,e=>{let r=nl(n.scope,t.pattern,e);return ol(i(al(n,r)),`the body of CHOOSE`)?(s.value=sd(t.pattern,r),!0):!1}),s.value===void 0)throw new e.g(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Vc(t)}`);return s.value}},pd=e=>[...e].sort((e,t)=>M(e.name,t.name)),md=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),hd=(e,t)=>{let n=pd(e),r=md(n),i=n.map(e=>V(e.value,t));if(r)return e=>bn(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=>ze(a,i.map(t=>t(e)),o):e=>xn(a,i.map(t=>t(e)))},gd=(t,n)=>{let r=e=>V(e,n);switch(t.kind){case`Number`:{let e=t.value;return j(e)?()=>e:()=>{throw Xc(t)}}case`Decimal`:return()=>{throw Yc(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Lu(t,n);case`Apply`:return ad(t,n);case`Bracket`:return()=>{throw new e.g(`A bracket without a function or subscript is not an expression at ${zc(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.g(`An operator cannot be used as a value at ${zc(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 Wc(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 Wc(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw $c(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=>xt(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 Uc(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.g(`A non-boolean expression (${li(n)}) was used as a condition of a CASE. ${Hc(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.g(`Attempted to evaluate a CASE with no conditions true.\n${Vc(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(al(n,su(t.definitions,n)))}case`Forall`:case`Exists`:return od(t,n);case`UnboundedQuantifier`:return()=>{throw new e.g(`TLC cannot evaluate an unbounded quantifier at ${zc(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return fd(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>rn(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>yn(e.map(e=>e(t)))}case`FunctionConstruction`:return ud(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 hd(t.fields,n);case`RecordSet`:{let e=pd(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=el(n.scope,`@`);if(r?.kind!==`Value`)throw new e.g(`@ appears outside an EXCEPT at ${zc(t)}`);return r.value};case`FunctionApplication`:{ld(t.function);let e=r(t.function),i=n=>rl(e(il(n)),t),a=t.args.map(r),o=Kc(n.runtime.version);if(a.length===1){let e=a[0];return t=>or(i(t),e(t),o)}return e=>or(i(e),yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Gc(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?ol(e(t),`an action`)||n(t):ol(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>Ac(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.g(`The subexpression reference at ${zc(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e.g(`TLC cannot evaluate a temporal formula in a state at ${zc(t)}`)}}},_d=`tlc2/value/impl/`,vd={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},yd={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},bd=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)}},xd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Sd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Cd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??xd.get(e[3])}${`[]`.repeat(e[1].length)}`),wd=(e,t)=>e[e[t].first].text,Td=(e,t)=>wd(e,t).replaceAll(`/`,`.`),Ed=t=>{let n=bd(t);if(n.readUint32()!==3405691582)throw new e.D(`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===vd.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===vd.integer?i.value=n.readInt32():t===vd.float?n.readUint32():t===vd.long||t===vd.double?(n.readBytes(8),e++):t===vd.class||t===vd.string||t===vd.methodType||t===vd.module||t===vd.package?i.first=n.readUint16():t===vd.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Td(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=Cd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:bd(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()},()=>Td(r,d.readUint16())):[],p=Sd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Cd(i.slice(a+1))[0],h=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(`,`)})${h}`})}return{pool:r,methods:s}},Dd=(e,t)=>{let n=e[t],r=e[n.second];return{className:wd(e,n.first),name:e[r.first].text}},Od=(t,n,r,i)=>{let a=()=>new e.k(`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===vd.integer)return t.value;if(t.tag===vd.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>=yd.iconstM1&&t<=yd.iconst5)s.push(t-yd.iconst0),e+=1;else if(t===yd.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===yd.sipush)s.push(r()<<16>>16),e+=3;else if(t===yd.ldc)s.push(l(o[e+1])),e+=2;else if(t===yd.ldcW)s.push(l(r())),e+=3;else if(t===yd.dup){let t=c();s.push(t,t),e+=1}else if(t===yd.getstatic){let t=Dd(n,r());if(t.className!==`${_d}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===yd.invokestatic){let t=Dd(n,r()),o=c();if(t.className!==`${_d}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===yd.new)s.push({className:wd(n,r()),value:void 0}),e+=3;else if(t===yd.invokespecial){let t=Dd(n,r()),o=c(),s=c();if(!(t.className===`${_d}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===yd.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()},kd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Ed(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:Od(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)}))}},Ad=/* @__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(`,`),jd=[[`\\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`,`≀`],[`^+`,`⁺`]],Md=/* @__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(`,`),Nd=/* @__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(`.`),Pd=/* @__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(`.`),Fd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Id=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
143
143
|
Nat == { }
|
|
144
144
|
a+b == {a, b}
|
|
145
145
|
a-b == CHOOSE n : b + n = a
|
|
@@ -455,9 +455,9 @@ _CheckName(name) ==
|
|
|
455
455
|
=> (PrintT(counts) /\\ FALSE)
|
|
456
456
|
_PrintCounts == PrintT(_Counts)
|
|
457
457
|
=============================================================================
|
|
458
|
-
`]]),Nd=/* @__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)`]])]]),Pd=y(`EOF`),Fd=y(`IDENTIFIER`),Id=y(`DEFBREAK`),Ld=(e,t)=>Array.from({length:y(t)-y(e)+1},(t,n)=>y(e)+n),Rd=new Set(Ld(`op_57`,`op_119`)),zd=new Set(Ld(`op_1`,`op_119`)),Bd=new Set(Ld(`op_57`,`op_70`)),Vd=/* @__PURE__ */ new Set([...Ld(`ACTION`,`EXCEPT`),y(`EXTENDS`),...Ld(`IF`,`SF`),y(`STATE`),...Ld(`THEN`,`WITH`),y(`US`),...Ld(`op_112`,`op_116`)]),Hd=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Ud=new Map([...Hd(`postfix`,160,160,!0,`[`),...Hd(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Hd(`prefix`,120,120,!1,`-.`),...Hd(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Hd(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Hd(`prefix`,40,40,!0,`\\lnot`),...Hd(`nfix`,100,130,!0,`\\times`),...Hd(`infix`,140,140,!1,`^`,`^^`),...Hd(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Hd(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Hd(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Hd(`infix`,100,110,!0,`|`,`||`,`%%`),...Hd(`infix`,100,110,!1,`%`),...Hd(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Hd(`infix`,90,140,!1,`\\wr`),...Hd(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Hd(`infix`,90,130,!1,`!!`),...Hd(`infix`,90,90,!1,`...`,`..`),...Hd(`infix`,80,80,!0,`\\intersect`,`\\union`),...Hd(`infix`,80,80,!1,`\\`),...Hd(`infix`,70,70,!1,`<:`,`:>`),...Hd(`infix`,60,60,!0,`@@`),...Hd(`infix`,50,140,!0,`\\cdot`),...Hd(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Hd(`infix`,30,30,!0,`\\land`,`\\lor`),...Hd(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Hd(`infix`,10,10,!1,`=>`)]),Wd=new Map([...Ud,...Dd.flatMap(e=>e.slice(1).map(t=>[t,Ud.get(e[0])]))]),Gd=Wd.get(`[`),Kd={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},qd=e=>({type:`tokens`,kinds:new Set(e)}),Jd=e=>typeof e==`string`?e.startsWith(`<`)?qd([y(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(Jd)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),Yd=e=>(...t)=>({type:e,body:W(...t)}),K=Yd(`zeroOrMore`),Xd=Yd(`oneOrMore`),q=Yd(`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}),Zd=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Qd=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Zd(e,n);return n},$d=(...e)=>{let t=e.map(y);return e=>t.includes(Qd(e,1).kind)},ef=(e,t=Qd(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},tf=e=>{let t=Qd(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},nf=e=>$d(`CASESEP`)(e)&&ef(e),rf=e=>{let t=Qd(e,1);Vd.has(t.kind)&&(t.kind=Fd)},af=(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}`,of=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),sf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},cf=e=>e.operatorStacks[e.operatorStacks.length-1],lf=(e,t)=>e.low>t.high,uf=(e,t)=>e.high<t.low,df=e=>e.fix===`prefix`?e:Wd.get(`${e.name}.`),ff=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Gd?of(`FcnAppl`,[n,...r.node.heirs]):of(`PostfixExpr`,[n,r.node]),operator:void 0})},pf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:of(`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:of(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},mf=e=>{let t=cf(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 ff(t,n),mf(e);if(i.operator!==void 0){let t=df(r.operator);return t!==void 0&&lf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${af(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 ${af(e,a.node.first,a.node.last)} and expression at location ${af(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return uf(a.operator,r.operator)?void 0:lf(a.operator,r.operator)?(pf(t,a.operator),mf(e)):`Precedence conflict between ops ${a.operator.name} in block ${af(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=df(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(uf(s,r.operator))return;if(!lf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${af(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return pf(t,s),mf(e);let c=af(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===Kd?`\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=cf(t),r=sf(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:mf(t)}),gf=hf(()=>!1),_f=hf(()=>!0),vf=J(e=>{e.lastOperator=Wd.get(e.token.image)}),yf=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},bf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?yf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},xf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!ef(e,n.first.beginColumn))return n;let t=xf(e,n);if(t!==void 0)return t}},Sf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(y),n=(e,...t)=>t.some(t=>e.kind===y(t)),r=e=>e!==void 0&&Rd.has(e.kind),i=e.token,a=Zd(e,i);i.next=void 0;let o=Zd(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===Fd&&(e=e.next)}else if(e.kind===Fd){let t=e.next;!r(t)||Bd.has(t.kind)||zd.has(t.kind)&&t.next?.kind!==Fd||(e=t.next?.kind===y(`SUBSTITUTE`)?i:zd.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Id&&(e.next={kind:Id,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Zd(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Cf=e=>{let t=Qd(e,1);if(t.kind===y(`LAB`)){let n=1;for(;n!==0;)if(t=Zd(e,t),t.kind===y(`LAB`)&&n++,t.kind===y(`RAB`)&&n--,t.kind===Pd)return!1;return Zd(e,t).kind===y(`IN`)}if(t.kind!==Fd)return!1;for(t=Zd(e,t);t.kind===y(`COMMA`);){if(t=Zd(e,t),t.kind!==Fd)return!1;t=Zd(e,t)}return t.kind===y(`IN`)},wf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Tf=e=>e.proofLevels.at(-1)??-1,Ef=e=>{let t=Qd(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:$d(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Tf(e)>=0&&wf(t)>Tf(e):$d(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Df=(e,t)=>{let n=wf(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},Of=e=>J(t=>Df(t,t.token)?void 0:`${af(t,t.token)}: ${e}`),kf=qd([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(y)),Af=qd([...kf.kinds,y(`op_76`)]),jf=qd(zd),Mf=qd(Bd),Nf=qd([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(y)),Pf=()=>K(X({expansion:[G(kf,`<op_77>`)],semantic:ef}),G(`PrefixOp`,`InfixOp`),_f),Ff=()=>G(W(X({expansion:[`OpenStart`],semantic:ef}),`OpenExpression`,gf),W(X({semantic:ef}),`ExtendableExpr`)),If=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),Lf=()=>G(W(X({semantic:e=>$d(`ASSUME`,`BOXASSUME`)(e)||Qd(e,2).kind===y(`COLONCOLON`)&&[y(`ASSUME`),y(`BOXASSUME`)].includes(Qd(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Rf=()=>[`JuncItem`,K(X({semantic:tf}),`JuncItem`)],zf=e=>J(t=>{t.expecting=e,rf(t)}),Bf=e=>J(t=>{t.isTerminalProof=e}),Vf=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Sf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),Hf={CompilationUnit:Z(void 0,[J(Sf),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>`),zf(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,zf(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,zf(`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(Sf)),W(X({semantic:e=>$d(`USE`)(e)&&Qd(e,2).kind!==y(`ONLY`)||$d(`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(Vf(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Vf(`Expression`,X({expansion:[`<IDENTIFIER>`,Mf]}),`PostfixLHS`,`Expression`),Vf(`Expression`,X({expansion:[`<IDENTIFIER>`,jf]}),`InfixLHS`,`Expression`),Vf(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),Vf(`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`,[Af,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,jf,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,Mf]),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>`,zf(`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,[kf,vf]),NonExpPrefixOp:Z(void 0,[Af,vf]),InfixOp:Z(`Infix Op`,[jf,vf]),PostfixOp:Z(void 0,[Mf,vf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Sf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),Lf(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),Lf(),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=sf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${af(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(Sf),G(W(X({amount:3}),X({semantic:$d(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Ef}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>$d(`BY`)(e)||Qd(e,2).kind===y(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>Qd(e,2).kind!==y(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,Bf(!0),q(`<ONLY>`)),W(`<USE>`,Bf(!1),q(`<ONLY>`)),W(`<HIDE>`,Bf(!1))),Y("an expression, `MODULE' or `DEF'"),q(If(),K(`<COMMA>`,Y(`MODULE or expression`),If(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),If(),K(`<COMMA>`,Y(`MODULE or expression`),If(),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`),Nf,Of(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Ef}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),Nf,Of(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:$d(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:$d(`INSTANCE`)}),`Instantiation`),W(X({semantic:$d(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Ef}),J(e=>{let t=sf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${af(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),Xd(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:$d(`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(Af,jf,Mf),qd([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(y))],semantic:ef}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${af(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:ef}),`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:Cf}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),Xd(`<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=sf(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`)),Xd(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Cf}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>Qd(e,2).kind===y(`MAPTO`)&&Vd.has(Qd(e,1).kind)}),J(e=>{Qd(e,1).kind=Fd}),`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=of(`FcnAppl`,t.heirs),e.lastOperator=Gd})),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>`,Xd(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(rf),`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===y(`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=>nf(e)&&Qd(e,2).kind!==y(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:nf}),`<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`,[Xd(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=Qd(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...Rf()),W(X({expansion:[`<AND>`]}),...Rf())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=xf(t,e.heirs[1]);return n&&`Item at ${af(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${af(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([])}),Pf(),Ff()],(e,t)=>{let n=cf(t);n.push({node:e.heirs[0],operator:Kd});let r=mf(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`),gf,K(G(W(X({expansion:[`PostfixOp`],semantic:ef}),`PostfixOp`,_f),W(X({expansion:[`<DOT>`],semantic:ef}),`<DOT>`,J(rf),X({semantic:ef}),`Identifier`,J(e=>{let t=cf(e);t[t.length-1].operator!==void 0&&ff(t,t.length),t[t.length-1]={node:of(`RecordComponent`,[t[t.length-1].node,sf(e,2),sf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:ef}),Y(`function argument`),`SBracketCases`,hf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:ef}),`InfixOp`,_f,Pf(),Ff()),W(X({expansion:[`<COLONCOLON>`],semantic:ef}),`<COLONCOLON>`,J(e=>{let t=cf(e);if(!bf(t[t.length-1].node))return`\`::' at ${af(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=cf(e),n=sf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!uf(r,e.lastOperator)){let t=sf(e,3);return`Removing label at ${af(e,t.first,t.last)} would change expression parsing.`}t.push({node:of(`Label`,[sf(e,3),sf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:ef}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:ef}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>Tf(e)<0&&e.proofLevels.length<=1?`${af(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${af(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:yf(e.heirs)===void 0?e.heirs.length===1?of(`GeneralId`,e.heirs):void 0:of(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>Qd(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=>Qd(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${af(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Uf=/* @__PURE__ */ new Map,Wf=e=>{let t=Uf.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Wf(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,Wf(Hf[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 Uf.set(e,n),n},Gf=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Kf=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Zd(e,e.scanPosition)),e.scanPosition=Zd(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`},qf=(e,t)=>{if(t.type===`tokens`)return Kf(e,t.kinds);if(t.type===`call`)return qf(e,Hf[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Gf(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=qf(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||Gf(e,t.semantic)?qf(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=qf(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=qf(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Jf=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=qf(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},Yf=(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||Wf(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Wf(a).hasSemanticStart?Wf(a).first.has(Qd(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Jf(e,i,a)&&(o===void 0||o(e))}),Xf=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,qf(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Zd(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Pd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Zd(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${be(e.token.image)}" `},Zf=(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??Xf(e)}\n\nResidual stack trace follows:\n${r}`,!1},Qf=(e,t)=>{let n=Zd(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,Zf(e))},$f=(e,t)=>{let n=Hf[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Qd(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!ep(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 Zf(e,i);let a=r.node??(r.heirs.length===0?void 0:of(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},ep=(e,t)=>{if(t.type===`tokens`)return Qf(e,t.kinds);if(t.type===`call`)return $f(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Zf(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Zf(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||ep(e,t));if(t.type===`choice`){let n=Yf(e,t.alternatives);return n===-1?Zf(e):ep(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!ep(e,t.body))return!1;if(t.type===`optional`)return Yf(e,[t.body])===-1||ep(e,t.body);for(;Yf(e,[t.body])===0;)if(!ep(e,t.body))return!1;return!0},tp=e=>{let t=T(e),n={kind:Pd,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=ep(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},np={low:15,high:15},rp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),ip=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)]]),ap=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),op=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),sp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),cp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),lp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),up=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...ap]),dp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),fp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),pp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),mp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),hp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),gp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),_p=/* @__PURE__ */ new Set([``,`*`,`-`]),vp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),yp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),bp=/* @__PURE__ */ new Set([`NEW`,...yp.keys()]),xp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Sp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Cp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),wp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?ip.has(e.operator):ap.has(e.operator)),Tp=e=>ip.has(e)||ap.has(e)||e===`-.`,Ep=(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}}},Dp=(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(`
|
|
459
|
-
`)}\n`},Op=(t,n)=>{let r=n===`tlapm`,i=r?ne(t):ne(t).map(te),a={index:0,offsideColumns:[]},o={},s=[],l=/* @__PURE__ */ new Set,u=[],d=[],f=e=>s[s.length-1].has(e),p=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],ee=[],g=(e,t=a.index-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];m[e]??=p(i[e]),h[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:m[e],end:h[t]};return e===t&&(ee[e]=o),o},_=(e,t)=>(e.location.range=g(t),e),re=(e=0)=>i[Math.min(a.index+e,i.length-1)],v=(e=0)=>{let t=re(e),n=a.offsideColumns[a.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},y=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie={index:0},ae=e=>{let t=i.slice(ie.index,a.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>r&&(e.kind===`Keyword`||Cp.has(e.text)),se=e=>{let t=i.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},ce=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:gp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):oe(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,le=(t,n=re(),r)=>{let a=i[i.length-1],o=n.line===a.line&&n.column===a.column;return new e.D(`${t} at line ${n.line}, column ${n.column}`,void 0,ue(t,n,o,r))},ue=(e,t,n,a)=>{if(r&&n){let e=i[i.length-1];return{reason:`Unexpected EOF`,...ae(se(e)),isEnd:n}}return r&&a?{reason:`Unexpected ${ce(a)}`,...se(a),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=re())=>le(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!oe(e),b=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=v();if(e.kind===`End`)throw le(`Unexpected end of expression`);return a.index++,e},S=e=>b(e)?(a.index++,!0):!1,C=e=>{if(!b(e))throw de(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return x()},pe=()=>{let e=v();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${y(e)}`);if(oe(e))throw de(`Unexpected keyword ${e.text}`);return a.index++,e.text},me=()=>{let e=a.index;return{name:pe(),range:g(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=v();return e.kind!==`String`&&(sp.has(e.text)||ip.has(e.text)||ap.has(e.text)||e.text===`'`)?(a.index++,e.text):pe()},_e={isUsed:!1},ve=()=>v().kind===`Identifier`||!fe(v())?pe():(_e.isUsed=!0,x().text),w=e=>{if(!r)return e();a.offsideColumns.push(-1);let t=e();return a.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},ye=()=>{if(b(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},be=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},xe=()=>{if(!S(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(T(me));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Se=()=>T(()=>{let e=T(xe);C(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),E=()=>{let e=v();if(e.kind===`Identifier`){let t=a.index,n=[x().text];for(;b(`!`)&&v(1).kind===`Identifier`;)x(),n.push(pe());return _({kind:`Identifier`,name:n.join(`!`),location:p(e)},t)}if(b(`<<`)||b(`(`))return A();throw de(`Expected a subscript but found ${y(e)}`)},D=e=>{let t=v(1),n=v(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(`==`,ap.has(n.text)?3:4))},Ce=e=>{let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&fp.has(t.text)||D(e)},we=()=>{let e=v(),t=e.kind===`Operator`&&(ip.has(e.text)||op.has(e.text))&&Ce(e);if(r&&e.kind!==`String`&&(op.has(e.text)||up.has(e.text)&&e.text!==`'`&&!ap.has(e.text)||lp.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&Ce(e))throw le(`incomplete expression`,e);if(t)return a.index++,_({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:p(e)},a.index-1);if(e.kind!==`String`&&up.has(e.text)&&Ce(e)){a.index++;let t=p(e);if(ap.has(e.text))return _({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return _({kind:`Lambda`,params:[n.name],body:Ep(e.text,n,t),operator:e.text,location:p(e)},a.index-1)}if(b(`LAMBDA`)){let t=a.index;x();let n=he(T(me));C(`:`);let r=j();return _({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:p(e)},t)}return j()},Te={range:void 0},Ee=()=>w(()=>{let e=a.index;C(`(`);let t=T(we);return C(`)`),Te.range=g(e),t}),De=()=>{let e=x();a.offsideColumns.push(e.column);let t=[j()];for(;re().text===e.text&&re().column===e.column;)a.index++,t.push(j());return a.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:p(e)}},Oe=e=>w(()=>{let t=p(e),n=v().kind===`Identifier`,i=b(`|->`,1)&&(n||fe(v()));if(i||n&&b(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a.index,n=p(v()),r=e();return n.range=g(t),C(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?pe():x().text),...S(`,`)?T(()=>r(pe)):[]];return C(`]`),{kind:e,fields:o,location:t}}if(ye()){let e=Se();C(`|->`);let n=j();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(S(`->`)){let e=j();return C(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(S(`EXCEPT`)){let e=T(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!fe(v()))throw de(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:T(()=>j())}),C(`]`);return C(`=`),{path:e,value:j()}});return C(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!b(`]_`)){let e=[o];for(;S(`,`);)e.push(j());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:o,subscript:E(),location:t}}),ke=()=>{let e=a.index,t=_(Fe(),e),n=p(x());return _({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},Ae=e=>w(()=>{let t=p(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(v(1).text===`\\in`||b(`<<`))){let e=a.index,n=xe();C(`\\in`);let r=j();if(S(`:`)){let e=j();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a.index=e}let n=v().kind===`Identifier`&&b(`\\in`,1)?ke():j();if(S(`:`)){let e=Se();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(j());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),je=e=>{let t=p(e),n=w(()=>b(`>>`)||b(`>>_`)?[]:T(()=>j()));if(S(`>>_`)){if(n.length!==1)throw le(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:E(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Me=e=>{let t=p(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Se();return C(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=he(T(me));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},O=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:j(),location:p(e)};let n=j();C(`->`),t.push({condition:n,body:j()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:p(e)}},Ne=()=>{let e=v(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||dp.has(e.text)||e.kind===`Operator`&&(ip.has(e.text)||ap.has(e.text)||op.has(e.text)))},k=()=>{let e=x();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a.index--,{kind:`Bound`,args:Ee()}}return{kind:`Name`,name:e.text,args:b(`(`)?Ee():[]}},A=e=>{let t=a.index,n=x(),i=p(n);if(r&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(pe);return C(`:`),{kind:`Lambda`,params:e,body:j(),location:i}}if(n.kind===`Number`){if(r&&/^\\[BOH]/.test(n.text))throw le(`incomplete expression`,n);return{kind:`Number`,value:c(n.text),text:n.text,location:i}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:i};if(n.kind===`String`)return{kind:`String`,value:n.text,location:i};let l=n.kind===`Step`&&Qe(n);if(l&&Ye()<0&&Je.length<=1)throw le(`Step number used outside proof`,n);if(l&&n.text[1]===`+`)throw le(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||l){let s=l?$e(n)??n.text:n.text;if(be()){let t=he(S(`(`)?T(me):[]);t.names.length>0&&C(`)`),C(`::`);let a=j();if(!r&&e!==void 0&&o.last!==void 0&&wp(a)&&e.high>=o.last.low)throw le(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:i}}let c=b(`(`);if(s===`@`&&!c&&!Ne())return{kind:`ExceptAt`,location:i};let u=c?Ee():[],d=[c?Te.range:void 0];if(!Ne())return c?{kind:`Apply`,operator:s,args:u,argumentsRange:Te.range,location:i}:{kind:`Identifier`,name:s,location:i};let f=[{kind:`Name`,name:s,args:u}],p=[g(t,t)];for(;Ne();)x(),p.push(g(a.index,a.index)),Te.range=void 0,f.push(k()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),ee=f.flatMap(e=>`args`in e?e.args:[]),te=f.map(e=>`args`in e?e.args.length:0),ne=d.at(-1)??g(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:i}:ee.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:i}:{kind:`Apply`,operator:h,args:ee,...te.slice(0,-1).some(e=>e>0)&&{argumentCounts:te},argumentsRange:ne,selectorRanges:p,argumentRanges:d,location:i}}if(n.kind===`Operator`&&Tp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:Ee(),location:i};if(n.kind===`Operator`&&Tp(n.text)&&!r)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:i};switch(n.text){case`(`:{let e=w(()=>j());return C(`)`),e}case`[`:return Oe(n);case`{`:return Ae(n);case`<<`:return je(n);case`@`:return{kind:`ExceptAt`,location:i};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Me(n);case`IF`:{let e=j();C(`THEN`);let t=j();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:i}}case`CASE`:return O(n);case`LET`:{let e=[],t=[];for(s.push(/* @__PURE__ */ new Set);!S(`IN`);){if(r&&b(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`,ae(re()));if(S(`RECURSIVE`)){Ge();continue}let n=Re(!1);n.kind===`Instance`?t.push(n):e.push(n)}s.pop();let n=j();return t.length===0?{kind:`Let`,definitions:e,body:n,location:i}:{kind:`Let`,definitions:e,instances:t,body:n,location:i}}case`CHOOSE`:{let e=xe(),t=S(`\\in`)?j():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:i}}case`WF_`:case`SF_`:{let e=E(),t=w(()=>{C(`(`);let e=j();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:i}}}throw de(`Unexpected ${y(n)}`,n)},Pe=(e,t,n)=>{o.last=o.preceding={low:t,high:n};let i=j(n+1),a=v(),s=a.text===`'`||ap.has(a.text)?np.high:ip.get(a.text)?.high;if(!r&&a.kind===`Operator`&&s!==void 0&&s>=t)throw le(`Precedence conflict between ${e.text} and ${a.text}`,a);return i},Fe=()=>{let e=o.preceding;o.preceding=void 0;let t=v(),n=p(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return De();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[Pe(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[Pe(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:Pe(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:Pe(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:Pe(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:Pe(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[r?j(9):Pe(t,10,13)],location:n}}return A(e)},j=(e=0)=>{let t=a.index,n=Fe(),r={left:n.location.range?n:_(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let i=p(n);if(n.text===`'`&&e<=15){x(),o.last=np,r.left=_({kind:`Prime`,expression:r.left,location:i},t);continue}if(ap.has(n.text)&&e<=15){x(),o.last=np,r.left=_({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=w(()=>T(()=>j()));w(()=>C(`]`)),o.last=rp,r.left=_({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&fe(v(1))){x();let e=x().text;r.left=_({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=ip.get(n.text);if(!a||a.low<e)break;let s=r.previous;if(s){let e=!(s.low>a.high||s.high<a.low),t=s.text===n.text&&a.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw le(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw le(`Precedence conflict between ${n.text} and -`,v());o.last=o.preceding=a;let c=j(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[g(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=_(r.left,t),r.previous={...a,text:n.text}}return r.left},Ie=()=>{if(!S(`(`))return[];let e=We();return C(`)`),e},Le=()=>{let e=p(v()),t=j(),n=i[a.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},Re=e=>{let t=a.index;return _(Be(e),t)},ze=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Be=e=>{let t=v(),n=p(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...Le(),isLocal:e,isRecursive:f(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&ip.has(v(1).text)&&v(2).kind===`Identifier`&&b(`==`,3)){let e=me(),t=x().text,n=me();return C(`==`),r(t,[ze(e),ze(n)])}let i=t.kind!==`String`&&sp.has(t.text),o=t.kind===`Identifier`&&ap.has(v(1).text)&&b(`==`,2);if(i||o){let e=i?t.text:v(1).text;i&&x();let n=me();return o&&x(),C(`==`),r(e,[ze(n)])}let s=pe();if(S(`[`)){let t=w(()=>Se());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:f(s),location:n}}let c=a.index,l=Ie();return C(`==`),b(`INSTANCE`)?{...Ve(s,l,e,n),definitionRange:g(c)}:r(s,l)},Ve=(e,t,n,r)=>{let i=a.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:S(`WITH`)?T(()=>{let e=a.index,t=ge(),n=g(e);return C(`<-`),{name:t,nameRange:n,expression:we()}}):[],isLocal:n,location:r,instanceRange:g(i)}},He=()=>{let e=a.index;return _(Ue(),e)},Ue=()=>{let e=p(v());if(b(`_`)&&v(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(v().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!S(`(`))return{name:t,arity:0,location:e};let n=T(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},We=()=>T(He),Ge=()=>{let e=We();return e.forEach(e=>s[s.length-1].add(e.name)),e},Ke=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&xp.has(e.text)&&t.value++,e.kind===`Operator`&&Sp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},qe=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,Ke(1)):t.kind===`Operator`&&ap.has(t.text)?b(`==`,2):t.kind===`Operator`&&ip.has(t.text)?v(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&sp.has(e.text)&&t.kind===`Identifier`&&b(`==`,2)},Je=[],Ye=()=>Je[Je.length-1]??-1,Xe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Ze=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)},Qe=e=>!e.text.endsWith(`.`)&&!_p.has(Ze(e)),$e=e=>{let t=Ze(e);if(_p.has(t))return;let n=Xe(e);if(n>=0)return`<${n}>${t}`;let r=Ye(),i=Je[Je.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},et=e=>{if(e.kind===`Keyword`)return mp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Je.length===0;if(e.text[1]===`+`||Je.length===0)return!0;let t=Ye();return t>=0&&Xe(e)>t},tt=e=>{let t=Xe(e),n=Je.length-1,r=Je[n-1]??-1,i=Je[n]<0;return i&&(Je[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Je[n]===t},nt=e=>!l.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),rt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Cp.has(e.name)&&!nt(e.name):!1,it=()=>{let e=v();return e.kind===`Step`?Qe(e):e.kind===`Keyword`?vp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!qe()},at=()=>{let e=a.index,t=v();return t.kind===`Operator`&&!cp.has(t.text)&&Tp(t.text)?(a.index++,_({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:p(t)},e)):S(`MODULE`)?_({kind:`ModuleFact`,name:pe(),location:p(t)},e):j()},M=e=>u[u.length-1]?.add(e),ot=e=>{u.push(/* @__PURE__ */ new Set);let t=e();return u.pop(),t},st=e=>u.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ct=()=>{let e=a.index,t=v(),n=T(()=>{let e=v();if((e.kind!==`Identifier`||oe(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${y(e)}`,e);return a.index++,e.text},`!`),r=p(t);return _(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},lt=()=>{if(r)return T(ct);let e=T(at),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&st(e.name)):void 0;if(t)throw le(`DEF clause entry should describe a defined operator`,t.location);return e},ut=()=>({facts:it()?T(at):[],defs:S(`DEF`)||S(`DEFS`)?lt():[]}),dt=()=>{let t=a.index,r=x(),i=r.text===`USE`&&S(`ONLY`),o=g(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...ut(),keyword:o,location:p(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!rt(e)):[];if(c.length>0)throw e.F(c.map(n=>({location:e.R(n.location.range??g(t)),message:`The only expression allowed as a fact in a HIDE is
|
|
460
|
-
the name of a theorem, assumption, or step.`})));return _(s,t)},ft=()=>{let e=a.index,t=p(v()),n=S(`NEW`),r=v().kind===`Keyword`?yp.get(v().text):void 0;if(!n&&r===void 0)throw de(`Expected a declaration but found ${y(v())}`);if(r!==void 0&&x(),r===`Variable`){let n=me();return M(n.name),_({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=He();M(i.name);let o=(r??`Constant`)===`Constant`&&b(`\\in`);if(o&&i.arity>0)throw le(`declared symbol with arguments before \\in`);return o&&x(),_({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:o?j():void 0,nameRange:i.location.range,location:t},e)},pt=()=>{let e=a.index,t=p(C(`ASSUME`)),n=T(()=>b(`ASSUME`)?ot(pt):v().kind===`Keyword`&&bp.has(v().text)?ft():j());return C(`PROVE`),_({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},mt=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&b(e,t.value+1)},ht=(e,t)=>{e.forEach(M),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(M))},gt=()=>{let e=v();if(b(`USE`)||b(`HIDE`))return dt();if(b(`INSTANCE`)){let t=a.index;return _(Ve(void 0,[],!1,p(e)),t)}if(b(`DEFINE`)||qe()){let t=a.index;S(`DEFINE`);let n=[Re(!1)];for(;qe();)n.push(Re(!1));let r={kind:`Define`,definitions:n,location:p(e)};return _(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:j()};if(S(`TAKE`)){let e=ye(),t=he(e?[]:T(me)),n=e?Se():[];return ht(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:T(()=>j())};if(S(`PICK`)){let e=mt(`:`),t=he(e?T(me):[]),n=e?[]:Se();return ht(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return S(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?pt():j()}},_t=e=>{let t=v();if(t.kind!==`Step`)throw de(`Expected a step number but found ${y(t)}`,t);if(!tt(t))throw le(`${e?`QED step`:`step`}'s number has bad level`,t);if(Xe(t)<0&&$e(t)!==void 0)throw le(`<*> and <+> cannot be used for a named step`,t);return a.index++,{name:$e(t),token:t.text,location:p(t)}},vt=()=>{let e=a.index,t=_t(b(`QED`,1)),n=a.index,r=/* @__PURE__ */ new Set;u.push(r);let i=S(`QED`)?{kind:`Qed`}:gt(),o=g(e),s=g(n),c=et(v());if(c&&!hp.has(i.kind))throw le(`Proof of a step that does not take a proof`);let l=c?bt():void 0;return u.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(M),_({...t,body:i,head:o,statement:s,proof:l},e)},yt=()=>{let e=p(v());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=g(a.index-1);return{kind:`By`,isOnly:S(`ONLY`),...ut(),keyword:t,location:e}}let t=v(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=g(a.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[vt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(vt());return{kind:`Steps`,level:Ye(),steps:n,location:e}},bt=()=>{let e=a.index;Je.push(-1);let t=ot(yt);return Je.pop(),_(t,e)},xt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},St=e=>{let t=a.index,n=x(),r=v().kind===`Identifier`&&b(`==`,1)?pe():void 0;r!==void 0&&(l.add(r),x());let i=ot(()=>({statement:b(`ASSUME`)?pt():j(),proof:et(v())?bt():void 0})),o=i.statement,s=_({name:r,statement:o,proof:i.proof,location:p(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&o.kind!==`AssumeProve`&&xt(e,_({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:p(n)},t))},Ct=()=>{let e=a.index,t=x(),n=v().kind===`Identifier`&&b(`==`,1)?pe():void 0;return n!==void 0&&(l.add(n),x()),_({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:p(t)},e)},wt=()=>{let e=p(C(`----`));C(`MODULE`);let t=ve();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),s.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&T(()=>{let e=a.index;n.extends.push(ve()),n.extendsRanges.push(g(e))});;){let t=a.index;ie.index=t;let r=v();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),s.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=wt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=p(x()),r=We();n.constants.push(...r),e.range=g(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=p(x()),r=T(()=>{let e=a.index,t=p(v());return _({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=g(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Ct();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&xt(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 de(`Expected a module unit but found ${y(r)}`);let e=dt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:Ge()});continue;case`INSTANCE`:Tt(n,_(Ve(void 0,[],!1,p(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Tt(n,_(Ve(void 0,[],!0,p(r)),t));continue}Tt(n,_(Be(!0),t));continue}r.kind===`Keyword`&&pp.has(r.text)?St(n):Tt(n,Re(!1))}}},Tt=(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}))},Et=wt(),Dt=_e.isUsed?tp(t):void 0;if(Dt!==void 0)throw new e.D(Dt);return Et},kp=e=>Op(e,`tlc`),Ap=e=>Op(e,`tlapm`),jp=e=>Op(e,`sany`),Mp=10454148508367108822n,Np=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Mp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Pp=Int32Array.from(Np,e=>Number(BigInt.asIntN(32,e>>32n))),Fp=Int32Array.from(Np,e=>Number(BigInt.asIntN(32,e))),Ip=Number(BigInt.asIntN(32,Mp>>32n)),Lp=Number(BigInt.asIntN(32,Mp));let Rp=Ip,zp=Lp;const Bp=e=>{let t=(e^zp)&255;zp=(zp>>>8|Rp<<24)^Fp[t],Rp=Rp>>>8^Pp[t]},Vp=e=>{for(let t=0;t<32;t+=8)Bp(e>>>t)},Hp=e=>{if(typeof e==`boolean`)Bp(0),Bp(e?116:102);else if(typeof e==`number`)Bp(1),Vp(e);else if(typeof e==`string`){Bp(3),Vp(e.length);for(let t=0;t<e.length;t++)Bp(e.charCodeAt(t))}else if(A(e))Bp(21),Vp($e(e.name)+1);else if(k(e)){let t=I(e);Bp(9),Vp(t.domain.length);for(let e=0;e<t.domain.length;e++)Hp(t.domain[e]),Hp(t.range[e])}else{let t=P(e).elements;Bp(5),Vp(t.length);for(let e of t)Hp(e)}},Up=e=>{let t={high:Rp,low:zp};Rp=Ip,zp=Lp;for(let t of e)Hp(t);let n=BigInt(Rp>>>0)<<32n|BigInt(zp>>>0);return Rp=t.high,zp=t.low,n},Wp=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||A(e))return 5;if(typeof e==`string`)return 5+e.length;if(k(e)){let t=I(e);return t.domain.reduce((e,n,r)=>e+Wp(n)+Wp(t.range[r]),5)}return P(e).elements.reduce((e,t)=>e+Wp(t),5)},Gp=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Rp=n<32?0:1<<n-32,zp=n<32?1<<n:0;for(let t=0;t<e;t++)Bp(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Rp,t[n+1]=t[a+1]^zp}}return t},Kp=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=n.get(e);if(t)return t;let r=Gp(e);return n.set(e,r),r},o=e=>{if(typeof e!=`object`||A(e))return Hp(e),Wp(e);let t=s(e),n={high:Rp,low:zp},r=a(i[t]);Rp=i[t+1],zp=i[t+2];for(let e=0;e<8;e++){let t=e<4?n.low:n.high,i=(e*256+(t>>>(e&3)*8&255))*2;Rp^=r[i],zp^=r[i+1]}return i[t]},s=e=>{let t=r.get(e);if(t!==void 0)return t;let n={high:Rp,low:zp};Rp=0,zp=0;let a={value:5};if(k(e)){let t=I(e);Bp(9),Vp(t.domain.length);for(let e=0;e<t.domain.length;e++)a.value+=o(t.domain[e]),a.value+=o(t.range[e])}else{let t=P(e).elements;Bp(5),Vp(t.length);for(let e of t)a.value+=o(e)}let s=i.length;return r.set(e,s),i.push(a.value,Rp,zp),Rp=n.high,zp=n.low,s};return(n,r)=>{let i={high:Rp,low:zp};Rp=Ip,zp=Lp;for(let t of e)o(n[t]);t[2*r]=zp,t[2*r+1]=Rp,Rp=i.high,zp=i.low}},qp=25214903917n,Jp=(1n<<48n)-1n,Yp=2147483647,Xp=e=>{let t={value:(BigInt.asUintN(64,e)^qp)&Jp},n=e=>(t.value=t.value*qp+11n&Jp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^qp)&Jp},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<=Yp)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Zp=[],Qp=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},$p=()=>{for(let e=1277011;Zp.length<1341;e++)Qp(e)&&Zp.push(e);return Zp},em=e=>{let t=$p(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},tm=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},nm=e=>{for(let t=Math.max(e,9);;t++){let e=tm(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)}}},rm=(e,t,n)=>{if(t<=0)return[];let r=nm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(em(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},im=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Yp),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},am=(1n<<63n)-1n-24n,om=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(am*BigInt(n)+i)%t;return r<0n?r+t:r})},sm=(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,cm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=_n(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>lt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>bn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:yn}}},lm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,um=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?im:rm;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:cm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Yp)?om(e,t,n):i(e,Number(t),n)).map(e=>a.create(sm(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},dm=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e.g(`RandomElement of the empty set`);return r},fm=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[..._n(t.domain)];return lt(e,e.map(()=>fm(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return bn(t.names.map((e,r)=>[e,fm(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return yn(t.factors.map(e=>fm(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.g(`RandomElement of the empty set`);return t.low+i}return dm(P(t).elements,n)},pm=(e,t=0n)=>{let n=Xp(t),r={random:Xp(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>bn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Up,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},mm=e=>ln([...e.possibleCounts].map(([e,t])=>[e,t])),hm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,mm(e)]]),gm=`----------------------------- MODULE Bags --------------------------------
|
|
458
|
+
`]]),Ld=/* @__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)`]])]]),Rd=y(`EOF`),zd=y(`IDENTIFIER`),Bd=y(`DEFBREAK`),Vd=(e,t)=>Array.from({length:y(t)-y(e)+1},(t,n)=>y(e)+n),Hd=new Set(Vd(`op_57`,`op_119`)),Ud=new Set(Vd(`op_1`,`op_119`)),Wd=new Set(Vd(`op_57`,`op_70`)),Gd=/* @__PURE__ */ new Set([...Vd(`ACTION`,`EXCEPT`),y(`EXTENDS`),...Vd(`IF`,`SF`),y(`STATE`),...Vd(`THEN`,`WITH`),y(`US`),...Vd(`op_112`,`op_116`)]),Kd=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),qd=new Map([...Kd(`postfix`,160,160,!0,`[`),...Kd(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Kd(`prefix`,120,120,!1,`-.`),...Kd(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Kd(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Kd(`prefix`,40,40,!0,`\\lnot`),...Kd(`nfix`,100,130,!0,`\\times`),...Kd(`infix`,140,140,!1,`^`,`^^`),...Kd(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Kd(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Kd(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Kd(`infix`,100,110,!0,`|`,`||`,`%%`),...Kd(`infix`,100,110,!1,`%`),...Kd(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Kd(`infix`,90,140,!1,`\\wr`),...Kd(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Kd(`infix`,90,130,!1,`!!`),...Kd(`infix`,90,90,!1,`...`,`..`),...Kd(`infix`,80,80,!0,`\\intersect`,`\\union`),...Kd(`infix`,80,80,!1,`\\`),...Kd(`infix`,70,70,!1,`<:`,`:>`),...Kd(`infix`,60,60,!0,`@@`),...Kd(`infix`,50,140,!0,`\\cdot`),...Kd(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Kd(`infix`,30,30,!0,`\\land`,`\\lor`),...Kd(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Kd(`infix`,10,10,!1,`=>`)]),Jd=new Map([...qd,...jd.flatMap(e=>e.slice(1).map(t=>[t,qd.get(e[0])]))]),Yd=Jd.get(`[`),Xd={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Zd=e=>({type:`tokens`,kinds:new Set(e)}),Qd=e=>typeof e==`string`?e.startsWith(`<`)?Zd([y(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(Qd)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),$d=e=>(...t)=>({type:e,body:W(...t)}),K=$d(`zeroOrMore`),ef=$d(`oneOrMore`),q=$d(`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),nf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=tf(e,n);return n},rf=(...e)=>{let t=e.map(y);return e=>t.includes(nf(e,1).kind)},af=(e,t=nf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},of=e=>{let t=nf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},sf=e=>rf(`CASESEP`)(e)&&af(e),cf=e=>{let t=nf(e,1);Gd.has(t.kind)&&(t.kind=zd)},lf=(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}`,uf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),df=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},ff=e=>e.operatorStacks[e.operatorStacks.length-1],pf=(e,t)=>e.low>t.high,mf=(e,t)=>e.high<t.low,hf=e=>e.fix===`prefix`?e:Jd.get(`${e.name}.`),gf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Yd?uf(`FcnAppl`,[n,...r.node.heirs]):uf(`PostfixExpr`,[n,r.node]),operator:void 0})},_f=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:uf(`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:uf(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 gf(t,n),vf(e);if(i.operator!==void 0){let t=hf(r.operator);return t!==void 0&&pf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${lf(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 ${lf(e,a.node.first,a.node.last)} and expression at location ${lf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return mf(a.operator,r.operator)?void 0:pf(a.operator,r.operator)?(_f(t,a.operator),vf(e)):`Precedence conflict between ops ${a.operator.name} in block ${lf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=hf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(mf(s,r.operator))return;if(!pf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${lf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return _f(t,s),vf(e);let c=lf(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===Xd?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},yf=e=>J(t=>{let n=ff(t),r=df(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)}),bf=yf(()=>!1),xf=yf(()=>!0),Sf=J(e=>{e.lastOperator=Jd.get(e.token.image)}),Cf=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},wf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Cf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Tf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!af(e,n.first.beginColumn))return n;let t=Tf(e,n);if(t!==void 0)return t}},Ef=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(y),n=(e,...t)=>t.some(t=>e.kind===y(t)),r=e=>e!==void 0&&Hd.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===zd&&(e=e.next)}else if(e.kind===zd){let t=e.next;!r(t)||Wd.has(t.kind)||Ud.has(t.kind)&&t.next?.kind!==zd||(e=t.next?.kind===y(`SUBSTITUTE`)?i:Ud.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Bd&&(e.next={kind:Bd,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},Df=e=>{let t=nf(e,1);if(t.kind===y(`LAB`)){let n=1;for(;n!==0;)if(t=tf(e,t),t.kind===y(`LAB`)&&n++,t.kind===y(`RAB`)&&n--,t.kind===Rd)return!1;return tf(e,t).kind===y(`IN`)}if(t.kind!==zd)return!1;for(t=tf(e,t);t.kind===y(`COMMA`);){if(t=tf(e,t),t.kind!==zd)return!1;t=tf(e,t)}return t.kind===y(`IN`)},Of=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),kf=e=>e.proofLevels.at(-1)??-1,Af=e=>{let t=nf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:rf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||kf(e)>=0&&Of(t)>kf(e):rf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},jf=(e,t)=>{let n=Of(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},Mf=e=>J(t=>jf(t,t.token)?void 0:`${lf(t,t.token)}: ${e}`),Nf=Zd([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(y)),Pf=Zd([...Nf.kinds,y(`op_76`)]),Ff=Zd(Ud),If=Zd(Wd),Lf=Zd([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(y)),Rf=()=>K(X({expansion:[G(Nf,`<op_77>`)],semantic:af}),G(`PrefixOp`,`InfixOp`),xf),zf=()=>G(W(X({expansion:[`OpenStart`],semantic:af}),`OpenExpression`,bf),W(X({semantic:af}),`ExtendableExpr`)),Bf=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),Vf=()=>G(W(X({semantic:e=>rf(`ASSUME`,`BOXASSUME`)(e)||nf(e,2).kind===y(`COLONCOLON`)&&[y(`ASSUME`),y(`BOXASSUME`)].includes(nf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Hf=()=>[`JuncItem`,K(X({semantic:of}),`JuncItem`)],Uf=e=>J(t=>{t.expecting=e,cf(t)}),Wf=e=>J(t=>{t.isTerminalProof=e}),Gf=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Ef(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),Kf={CompilationUnit:Z(void 0,[J(Ef),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>`),Uf(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,Uf(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Uf(`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(Ef)),W(X({semantic:e=>rf(`USE`)(e)&&nf(e,2).kind!==y(`ONLY`)||rf(`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(Gf(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Gf(`Expression`,X({expansion:[`<IDENTIFIER>`,If]}),`PostfixLHS`,`Expression`),Gf(`Expression`,X({expansion:[`<IDENTIFIER>`,Ff]}),`InfixLHS`,`Expression`),Gf(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),Gf(`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`,[Pf,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,Ff,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,If]),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>`,Uf(`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,[Nf,Sf]),NonExpPrefixOp:Z(void 0,[Pf,Sf]),InfixOp:Z(`Infix Op`,[Ff,Sf]),PostfixOp:Z(void 0,[If,Sf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Ef(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),Vf(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),Vf(),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=df(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${lf(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(Ef),G(W(X({amount:3}),X({semantic:rf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Af}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>rf(`BY`)(e)||nf(e,2).kind===y(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>nf(e,2).kind!==y(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,Wf(!0),q(`<ONLY>`)),W(`<USE>`,Wf(!1),q(`<ONLY>`)),W(`<HIDE>`,Wf(!1))),Y("an expression, `MODULE' or `DEF'"),q(Bf(),K(`<COMMA>`,Y(`MODULE or expression`),Bf(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),Bf(),K(`<COMMA>`,Y(`MODULE or expression`),Bf(),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`),Lf,Mf(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Af}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),Lf,Mf(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:rf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:rf(`INSTANCE`)}),`Instantiation`),W(X({semantic:rf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Af}),J(e=>{let t=df(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${lf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),ef(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:rf(`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(Pf,Ff,If),Zd([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(y))],semantic:af}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${lf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:af}),`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:Df}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),ef(`<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=df(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`)),ef(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Df}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>nf(e,2).kind===y(`MAPTO`)&&Gd.has(nf(e,1).kind)}),J(e=>{nf(e,1).kind=zd}),`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=uf(`FcnAppl`,t.heirs),e.lastOperator=Yd})),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>`,ef(`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===y(`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)&&nf(e,2).kind!==y(`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`,[ef(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=nf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...Hf()),W(X({expansion:[`<AND>`]}),...Hf())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Tf(t,e.heirs[1]);return n&&`Item at ${lf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${lf(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([])}),Rf(),zf()],(e,t)=>{let n=ff(t);n.push({node:e.heirs[0],operator:Xd});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`),bf,K(G(W(X({expansion:[`PostfixOp`],semantic:af}),`PostfixOp`,xf),W(X({expansion:[`<DOT>`],semantic:af}),`<DOT>`,J(cf),X({semantic:af}),`Identifier`,J(e=>{let t=ff(e);t[t.length-1].operator!==void 0&&gf(t,t.length),t[t.length-1]={node:uf(`RecordComponent`,[t[t.length-1].node,df(e,2),df(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:af}),Y(`function argument`),`SBracketCases`,yf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:af}),`InfixOp`,xf,Rf(),zf()),W(X({expansion:[`<COLONCOLON>`],semantic:af}),`<COLONCOLON>`,J(e=>{let t=ff(e);if(!wf(t[t.length-1].node))return`\`::' at ${lf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=ff(e),n=df(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!mf(r,e.lastOperator)){let t=df(e,3);return`Removing label at ${lf(e,t.first,t.last)} would change expression parsing.`}t.push({node:uf(`Label`,[df(e,3),df(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:af}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:af}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>kf(e)<0&&e.proofLevels.length<=1?`${lf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${lf(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:Cf(e.heirs)===void 0?e.heirs.length===1?uf(`GeneralId`,e.heirs):void 0:uf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>nf(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=>nf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${lf(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},qf=/* @__PURE__ */ new Map,Jf=e=>{let t=qf.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Jf(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,Jf(Kf[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 qf.set(e,n),n},Yf=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Xf=(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`},Zf=(e,t)=>{if(t.type===`tokens`)return Xf(e,t.kinds);if(t.type===`call`)return Zf(e,Kf[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Yf(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=Zf(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||Yf(e,t.semantic)?Zf(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Zf(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=Zf(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Qf=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Zf(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},$f=(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||Jf(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Jf(a).hasSemanticStart?Jf(a).first.has(nf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Qf(e,i,a)&&(o===void 0||o(e))}),ep=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,Zf(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===Rd){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 "${be(e.token.image)}" `},tp=(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??ep(e)}\n\nResidual stack trace follows:\n${r}`,!1},np=(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,tp(e))},rp=(e,t)=>{let n=Kf[t];n.message!==void 0&&(e.messages.push({name:n.message,token:nf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!ip(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 tp(e,i);let a=r.node??(r.heirs.length===0?void 0:uf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},ip=(e,t)=>{if(t.type===`tokens`)return np(e,t.kinds);if(t.type===`call`)return rp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||tp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||tp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||ip(e,t));if(t.type===`choice`){let n=$f(e,t.alternatives);return n===-1?tp(e):ip(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!ip(e,t.body))return!1;if(t.type===`optional`)return $f(e,[t.body])===-1||ip(e,t.body);for(;$f(e,[t.body])===0;)if(!ip(e,t.body))return!1;return!0},ap=e=>{let t=T(e),n={kind:Rd,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=ip(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},op={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)]]),lp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),up=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),dp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),fp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),pp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),mp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...lp]),hp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),gp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),_p=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),vp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),yp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),bp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),xp=/* @__PURE__ */ new Set([``,`*`,`-`]),Sp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Cp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),wp=/* @__PURE__ */ new Set([`NEW`,...Cp.keys()]),Tp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Ep=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Dp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Op=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):lp.has(e.operator)),kp=e=>cp.has(e)||lp.has(e)||e===`-.`,Ap=(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}}},jp=(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(`
|
|
459
|
+
`)}\n`},Mp=(t,n)=>{let r=n===`tlapm`,i=r?ne(t):ne(t).map(te),a={index:0,offsideColumns:[]},o={},s=[],l=/* @__PURE__ */ new Set,u=[],d=[],f=e=>s[s.length-1].has(e),p=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],ee=[],g=(e,t=a.index-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];m[e]??=p(i[e]),h[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:m[e],end:h[t]};return e===t&&(ee[e]=o),o},_=(e,t)=>(e.location.range=g(t),e),re=(e=0)=>i[Math.min(a.index+e,i.length-1)],v=(e=0)=>{let t=re(e),n=a.offsideColumns[a.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},y=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie={index:0},ae=e=>{let t=i.slice(ie.index,a.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>r&&(e.kind===`Keyword`||Dp.has(e.text)),se=e=>{let t=i.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},ce=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:bp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):oe(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,le=(t,n=re(),r)=>{let a=i[i.length-1],o=n.line===a.line&&n.column===a.column;return new e.D(`${t} at line ${n.line}, column ${n.column}`,void 0,ue(t,n,o,r))},ue=(e,t,n,a)=>{if(r&&n){let e=i[i.length-1];return{reason:`Unexpected EOF`,...ae(se(e)),isEnd:n}}return r&&a?{reason:`Unexpected ${ce(a)}`,...se(a),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=re())=>le(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!oe(e),b=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=v();if(e.kind===`End`)throw le(`Unexpected end of expression`);return a.index++,e},S=e=>b(e)?(a.index++,!0):!1,C=e=>{if(!b(e))throw de(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return x()},pe=()=>{let e=v();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${y(e)}`);if(oe(e))throw de(`Unexpected keyword ${e.text}`);return a.index++,e.text},me=()=>{let e=a.index;return{name:pe(),range:g(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=v();return e.kind!==`String`&&(dp.has(e.text)||cp.has(e.text)||lp.has(e.text)||e.text===`'`)?(a.index++,e.text):pe()},_e={isUsed:!1},ve=()=>v().kind===`Identifier`||!fe(v())?pe():(_e.isUsed=!0,x().text),w=e=>{if(!r)return e();a.offsideColumns.push(-1);let t=e();return a.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},ye=()=>{if(b(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},be=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},xe=()=>{if(!S(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(T(me));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Se=()=>T(()=>{let e=T(xe);C(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),E=()=>{let e=v();if(e.kind===`Identifier`){let t=a.index,n=[x().text];for(;b(`!`)&&v(1).kind===`Identifier`;)x(),n.push(pe());return _({kind:`Identifier`,name:n.join(`!`),location:p(e)},t)}if(b(`<<`)||b(`(`))return A();throw de(`Expected a subscript but found ${y(e)}`)},D=e=>{let t=v(1),n=v(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(`==`,lp.has(n.text)?3:4))},Ce=e=>{let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&gp.has(t.text)||D(e)},we=()=>{let e=v(),t=e.kind===`Operator`&&(cp.has(e.text)||up.has(e.text))&&Ce(e);if(r&&e.kind!==`String`&&(up.has(e.text)||mp.has(e.text)&&e.text!==`'`&&!lp.has(e.text)||pp.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&Ce(e))throw le(`incomplete expression`,e);if(t)return a.index++,_({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:p(e)},a.index-1);if(e.kind!==`String`&&mp.has(e.text)&&Ce(e)){a.index++;let t=p(e);if(lp.has(e.text))return _({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return _({kind:`Lambda`,params:[n.name],body:Ap(e.text,n,t),operator:e.text,location:p(e)},a.index-1)}if(b(`LAMBDA`)){let t=a.index;x();let n=he(T(me));C(`:`);let r=j();return _({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:p(e)},t)}return j()},Te={range:void 0},Ee=()=>w(()=>{let e=a.index;C(`(`);let t=T(we);return C(`)`),Te.range=g(e),t}),De=()=>{let e=x();a.offsideColumns.push(e.column);let t=[j()];for(;re().text===e.text&&re().column===e.column;)a.index++,t.push(j());return a.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:p(e)}},Oe=e=>w(()=>{let t=p(e),n=v().kind===`Identifier`,i=b(`|->`,1)&&(n||fe(v()));if(i||n&&b(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a.index,n=p(v()),r=e();return n.range=g(t),C(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?pe():x().text),...S(`,`)?T(()=>r(pe)):[]];return C(`]`),{kind:e,fields:o,location:t}}if(ye()){let e=Se();C(`|->`);let n=j();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(S(`->`)){let e=j();return C(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(S(`EXCEPT`)){let e=T(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!fe(v()))throw de(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:T(()=>j())}),C(`]`);return C(`=`),{path:e,value:j()}});return C(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!b(`]_`)){let e=[o];for(;S(`,`);)e.push(j());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:o,subscript:E(),location:t}}),ke=()=>{let e=a.index,t=_(Fe(),e),n=p(x());return _({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},Ae=e=>w(()=>{let t=p(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(v(1).text===`\\in`||b(`<<`))){let e=a.index,n=xe();C(`\\in`);let r=j();if(S(`:`)){let e=j();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a.index=e}let n=v().kind===`Identifier`&&b(`\\in`,1)?ke():j();if(S(`:`)){let e=Se();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(j());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),je=e=>{let t=p(e),n=w(()=>b(`>>`)||b(`>>_`)?[]:T(()=>j()));if(S(`>>_`)){if(n.length!==1)throw le(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:E(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Me=e=>{let t=p(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Se();return C(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=he(T(me));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},O=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:j(),location:p(e)};let n=j();C(`->`),t.push({condition:n,body:j()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:p(e)}},Ne=()=>{let e=v(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||hp.has(e.text)||e.kind===`Operator`&&(cp.has(e.text)||lp.has(e.text)||up.has(e.text)))},k=()=>{let e=x();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a.index--,{kind:`Bound`,args:Ee()}}return{kind:`Name`,name:e.text,args:b(`(`)?Ee():[]}},A=e=>{let t=a.index,n=x(),i=p(n);if(r&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(pe);return C(`:`),{kind:`Lambda`,params:e,body:j(),location:i}}if(n.kind===`Number`){if(r&&/^\\[BOH]/.test(n.text))throw le(`incomplete expression`,n);return{kind:`Number`,value:c(n.text),text:n.text,location:i}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:i};if(n.kind===`String`)return{kind:`String`,value:n.text,location:i};let l=n.kind===`Step`&&Qe(n);if(l&&Ye()<0&&Je.length<=1)throw le(`Step number used outside proof`,n);if(l&&n.text[1]===`+`)throw le(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||l){let s=l?$e(n)??n.text:n.text;if(be()){let t=he(S(`(`)?T(me):[]);t.names.length>0&&C(`)`),C(`::`);let a=j();if(!r&&e!==void 0&&o.last!==void 0&&Op(a)&&e.high>=o.last.low)throw le(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:i}}let c=b(`(`);if(s===`@`&&!c&&!Ne())return{kind:`ExceptAt`,location:i};let u=c?Ee():[],d=[c?Te.range:void 0];if(!Ne())return c?{kind:`Apply`,operator:s,args:u,argumentsRange:Te.range,location:i}:{kind:`Identifier`,name:s,location:i};let f=[{kind:`Name`,name:s,args:u}],p=[g(t,t)];for(;Ne();)x(),p.push(g(a.index,a.index)),Te.range=void 0,f.push(k()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),ee=f.flatMap(e=>`args`in e?e.args:[]),te=f.map(e=>`args`in e?e.args.length:0),ne=d.at(-1)??g(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:i}:ee.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:i}:{kind:`Apply`,operator:h,args:ee,...te.slice(0,-1).some(e=>e>0)&&{argumentCounts:te},argumentsRange:ne,selectorRanges:p,argumentRanges:d,location:i}}if(n.kind===`Operator`&&kp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:Ee(),location:i};if(n.kind===`Operator`&&kp(n.text)&&!r)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:i};switch(n.text){case`(`:{let e=w(()=>j());return C(`)`),e}case`[`:return Oe(n);case`{`:return Ae(n);case`<<`:return je(n);case`@`:return{kind:`ExceptAt`,location:i};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Me(n);case`IF`:{let e=j();C(`THEN`);let t=j();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:i}}case`CASE`:return O(n);case`LET`:{let e=[],t=[];for(s.push(/* @__PURE__ */ new Set);!S(`IN`);){if(r&&b(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`,ae(re()));if(S(`RECURSIVE`)){Ge();continue}let n=Re(!1);n.kind===`Instance`?t.push(n):e.push(n)}s.pop();let n=j();return t.length===0?{kind:`Let`,definitions:e,body:n,location:i}:{kind:`Let`,definitions:e,instances:t,body:n,location:i}}case`CHOOSE`:{let e=xe(),t=S(`\\in`)?j():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:i}}case`WF_`:case`SF_`:{let e=E(),t=w(()=>{C(`(`);let e=j();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:i}}}throw de(`Unexpected ${y(n)}`,n)},Pe=(e,t,n)=>{o.last=o.preceding={low:t,high:n};let i=j(n+1),a=v(),s=a.text===`'`||lp.has(a.text)?op.high:cp.get(a.text)?.high;if(!r&&a.kind===`Operator`&&s!==void 0&&s>=t)throw le(`Precedence conflict between ${e.text} and ${a.text}`,a);return i},Fe=()=>{let e=o.preceding;o.preceding=void 0;let t=v(),n=p(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return De();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[Pe(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[Pe(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:Pe(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:Pe(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:Pe(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:Pe(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[r?j(9):Pe(t,10,13)],location:n}}return A(e)},j=(e=0)=>{let t=a.index,n=Fe(),r={left:n.location.range?n:_(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let i=p(n);if(n.text===`'`&&e<=15){x(),o.last=op,r.left=_({kind:`Prime`,expression:r.left,location:i},t);continue}if(lp.has(n.text)&&e<=15){x(),o.last=op,r.left=_({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=w(()=>T(()=>j()));w(()=>C(`]`)),o.last=sp,r.left=_({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&fe(v(1))){x();let e=x().text;r.left=_({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=cp.get(n.text);if(!a||a.low<e)break;let s=r.previous;if(s){let e=!(s.low>a.high||s.high<a.low),t=s.text===n.text&&a.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw le(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw le(`Precedence conflict between ${n.text} and -`,v());o.last=o.preceding=a;let c=j(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[g(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=_(r.left,t),r.previous={...a,text:n.text}}return r.left},Ie=()=>{if(!S(`(`))return[];let e=We();return C(`)`),e},Le=()=>{let e=p(v()),t=j(),n=i[a.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},Re=e=>{let t=a.index;return _(Be(e),t)},ze=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Be=e=>{let t=v(),n=p(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...Le(),isLocal:e,isRecursive:f(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&cp.has(v(1).text)&&v(2).kind===`Identifier`&&b(`==`,3)){let e=me(),t=x().text,n=me();return C(`==`),r(t,[ze(e),ze(n)])}let i=t.kind!==`String`&&dp.has(t.text),o=t.kind===`Identifier`&&lp.has(v(1).text)&&b(`==`,2);if(i||o){let e=i?t.text:v(1).text;i&&x();let n=me();return o&&x(),C(`==`),r(e,[ze(n)])}let s=pe();if(S(`[`)){let t=w(()=>Se());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:f(s),location:n}}let c=a.index,l=Ie();return C(`==`),b(`INSTANCE`)?{...Ve(s,l,e,n),definitionRange:g(c)}:r(s,l)},Ve=(e,t,n,r)=>{let i=a.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:S(`WITH`)?T(()=>{let e=a.index,t=ge(),n=g(e);return C(`<-`),{name:t,nameRange:n,expression:we()}}):[],isLocal:n,location:r,instanceRange:g(i)}},He=()=>{let e=a.index;return _(Ue(),e)},Ue=()=>{let e=p(v());if(b(`_`)&&v(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(v().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!S(`(`))return{name:t,arity:0,location:e};let n=T(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},We=()=>T(He),Ge=()=>{let e=We();return e.forEach(e=>s[s.length-1].add(e.name)),e},Ke=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Tp.has(e.text)&&t.value++,e.kind===`Operator`&&Ep.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},qe=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,Ke(1)):t.kind===`Operator`&&lp.has(t.text)?b(`==`,2):t.kind===`Operator`&&cp.has(t.text)?v(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&dp.has(e.text)&&t.kind===`Identifier`&&b(`==`,2)},Je=[],Ye=()=>Je[Je.length-1]??-1,Xe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Ze=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)},Qe=e=>!e.text.endsWith(`.`)&&!xp.has(Ze(e)),$e=e=>{let t=Ze(e);if(xp.has(t))return;let n=Xe(e);if(n>=0)return`<${n}>${t}`;let r=Ye(),i=Je[Je.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},et=e=>{if(e.kind===`Keyword`)return vp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Je.length===0;if(e.text[1]===`+`||Je.length===0)return!0;let t=Ye();return t>=0&&Xe(e)>t},tt=e=>{let t=Xe(e),n=Je.length-1,r=Je[n-1]??-1,i=Je[n]<0;return i&&(Je[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Je[n]===t},nt=e=>!l.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),rt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Dp.has(e.name)&&!nt(e.name):!1,it=()=>{let e=v();return e.kind===`Step`?Qe(e):e.kind===`Keyword`?Sp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!qe()},at=()=>{let e=a.index,t=v();return t.kind===`Operator`&&!fp.has(t.text)&&kp(t.text)?(a.index++,_({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:p(t)},e)):S(`MODULE`)?_({kind:`ModuleFact`,name:pe(),location:p(t)},e):j()},M=e=>u[u.length-1]?.add(e),ot=e=>{u.push(/* @__PURE__ */ new Set);let t=e();return u.pop(),t},st=e=>u.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ct=()=>{let e=a.index,t=v(),n=T(()=>{let e=v();if((e.kind!==`Identifier`||oe(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${y(e)}`,e);return a.index++,e.text},`!`),r=p(t);return _(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},lt=()=>{if(r)return T(ct);let e=T(at),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&st(e.name)):void 0;if(t)throw le(`DEF clause entry should describe a defined operator`,t.location);return e},ut=()=>({facts:it()?T(at):[],defs:S(`DEF`)||S(`DEFS`)?lt():[]}),dt=()=>{let t=a.index,r=x(),i=r.text===`USE`&&S(`ONLY`),o=g(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...ut(),keyword:o,location:p(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!rt(e)):[];if(c.length>0)throw e.F(c.map(n=>({location:e.R(n.location.range??g(t)),message:`The only expression allowed as a fact in a HIDE is
|
|
460
|
+
the name of a theorem, assumption, or step.`})));return _(s,t)},ft=()=>{let e=a.index,t=p(v()),n=S(`NEW`),r=v().kind===`Keyword`?Cp.get(v().text):void 0;if(!n&&r===void 0)throw de(`Expected a declaration but found ${y(v())}`);if(r!==void 0&&x(),r===`Variable`){let n=me();return M(n.name),_({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=He();M(i.name);let o=(r??`Constant`)===`Constant`&&b(`\\in`);if(o&&i.arity>0)throw le(`declared symbol with arguments before \\in`);return o&&x(),_({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:o?j():void 0,nameRange:i.location.range,location:t},e)},pt=()=>{let e=a.index,t=p(C(`ASSUME`)),n=T(()=>b(`ASSUME`)?ot(pt):v().kind===`Keyword`&&wp.has(v().text)?ft():j());return C(`PROVE`),_({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},mt=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&b(e,t.value+1)},ht=(e,t)=>{e.forEach(M),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(M))},gt=()=>{let e=v();if(b(`USE`)||b(`HIDE`))return dt();if(b(`INSTANCE`)){let t=a.index;return _(Ve(void 0,[],!1,p(e)),t)}if(b(`DEFINE`)||qe()){let t=a.index;S(`DEFINE`);let n=[Re(!1)];for(;qe();)n.push(Re(!1));let r={kind:`Define`,definitions:n,location:p(e)};return _(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:j()};if(S(`TAKE`)){let e=ye(),t=he(e?[]:T(me)),n=e?Se():[];return ht(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:T(()=>j())};if(S(`PICK`)){let e=mt(`:`),t=he(e?T(me):[]),n=e?[]:Se();return ht(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return S(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?pt():j()}},_t=e=>{let t=v();if(t.kind!==`Step`)throw de(`Expected a step number but found ${y(t)}`,t);if(!tt(t))throw le(`${e?`QED step`:`step`}'s number has bad level`,t);if(Xe(t)<0&&$e(t)!==void 0)throw le(`<*> and <+> cannot be used for a named step`,t);return a.index++,{name:$e(t),token:t.text,location:p(t)}},vt=()=>{let e=a.index,t=_t(b(`QED`,1)),n=a.index,r=/* @__PURE__ */ new Set;u.push(r);let i=S(`QED`)?{kind:`Qed`}:gt(),o=g(e),s=g(n),c=et(v());if(c&&!yp.has(i.kind))throw le(`Proof of a step that does not take a proof`);let l=c?bt():void 0;return u.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(M),_({...t,body:i,head:o,statement:s,proof:l},e)},yt=()=>{let e=p(v());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=g(a.index-1);return{kind:`By`,isOnly:S(`ONLY`),...ut(),keyword:t,location:e}}let t=v(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=g(a.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[vt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(vt());return{kind:`Steps`,level:Ye(),steps:n,location:e}},bt=()=>{let e=a.index;Je.push(-1);let t=ot(yt);return Je.pop(),_(t,e)},xt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},St=e=>{let t=a.index,n=x(),r=v().kind===`Identifier`&&b(`==`,1)?pe():void 0;r!==void 0&&(l.add(r),x());let i=ot(()=>({statement:b(`ASSUME`)?pt():j(),proof:et(v())?bt():void 0})),o=i.statement,s=_({name:r,statement:o,proof:i.proof,location:p(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&o.kind!==`AssumeProve`&&xt(e,_({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:p(n)},t))},Ct=()=>{let e=a.index,t=x(),n=v().kind===`Identifier`&&b(`==`,1)?pe():void 0;return n!==void 0&&(l.add(n),x()),_({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:p(t)},e)},wt=()=>{let e=p(C(`----`));C(`MODULE`);let t=ve();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),s.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&T(()=>{let e=a.index;n.extends.push(ve()),n.extendsRanges.push(g(e))});;){let t=a.index;ie.index=t;let r=v();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),s.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=wt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=p(x()),r=We();n.constants.push(...r),e.range=g(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=p(x()),r=T(()=>{let e=a.index,t=p(v());return _({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=g(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Ct();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&xt(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 de(`Expected a module unit but found ${y(r)}`);let e=dt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:Ge()});continue;case`INSTANCE`:Tt(n,_(Ve(void 0,[],!1,p(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Tt(n,_(Ve(void 0,[],!0,p(r)),t));continue}Tt(n,_(Be(!0),t));continue}r.kind===`Keyword`&&_p.has(r.text)?St(n):Tt(n,Re(!1))}}},Tt=(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}))},Et=wt(),Dt=_e.isUsed?ap(t):void 0;if(Dt!==void 0)throw new e.D(Dt);return Et},Np=e=>Mp(e,`tlc`),Pp=e=>Mp(e,`tlapm`),Fp=e=>Mp(e,`sany`),Ip=10454148508367108822n,Lp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Ip);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Rp=Int32Array.from(Lp,e=>Number(BigInt.asIntN(32,e>>32n))),zp=Int32Array.from(Lp,e=>Number(BigInt.asIntN(32,e))),Bp=Number(BigInt.asIntN(32,Ip>>32n)),Vp=Number(BigInt.asIntN(32,Ip));let Hp=Bp,Up=Vp;const Wp=e=>{let t=(e^Up)&255;Up=(Up>>>8|Hp<<24)^zp[t],Hp=Hp>>>8^Rp[t]},Gp=e=>{for(let t=0;t<32;t+=8)Wp(e>>>t)},Kp=e=>{if(typeof e==`boolean`)return Wp(0),Wp(e?116:102),2;if(typeof e==`number`)return Wp(1),Gp(e),5;if(typeof e==`string`){Wp(3),Gp(e.length);for(let t=0;t<e.length;t++)Wp(e.charCodeAt(t));return 5+e.length}return Wp(21),Gp($e(e.name)+1),5},qp=e=>{if(typeof e!=`object`||A(e))Kp(e);else if(k(e)){let t=I(e);Wp(9),Gp(t.domain.length);for(let e=0;e<t.domain.length;e++)qp(t.domain[e]),qp(t.range[e])}else{let t=P(e).elements;Wp(5),Gp(t.length);for(let e of t)qp(e)}},Jp=e=>{let t={high:Hp,low:Up};Hp=Bp,Up=Vp;for(let t of e)qp(t);let n=BigInt(Hp>>>0)<<32n|BigInt(Up>>>0);return Hp=t.high,Up=t.low,n},Yp=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Hp=n<32?0:1<<n-32,Up=n<32?1<<n:0;for(let t=0;t<e;t++)Wp(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Hp,t[n+1]=t[a+1]^Up}}return t},Xp=(e,t=4194304)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=[],o=e=>{let t=n.get(e);if(t)return t;let r=Yp(e);return n.set(e,r),r},s=e=>{if(typeof e!=`object`||A(e))return Kp(e);let t=c(e),n=a[t],r=Hp,o=Up;Hp=i[3*t+1],Up=i[3*t+2];for(let e=0;e<8;e++){let t=e<4?o:r,i=(e*256+(t>>>(e&3)*8&255))*2;Hp^=n[i],Up^=n[i+1]}return i[3*t]},c=e=>{let t=r.get(e);if(t!==void 0)return t;let n=Hp,c=Up;Hp=0,Up=0;let l={value:5};if(k(e)){let t=I(e);Wp(9),Gp(t.domain.length);for(let e=0;e<t.domain.length;e++)l.value+=s(t.domain[e]),l.value+=s(t.range[e])}else{let t=P(e).elements;Wp(5),Gp(t.length);for(let e of t)l.value+=s(e)}let u=a.length;return r.set(e,u),i.push(l.value,Hp,Up),a.push(o(l.value)),Hp=n,Up=c,u};return o=>{let c=new BigInt64Array(o.length),l=new Int32Array(c.buffer),u=Hp,d=Up;return o.forEach((o,c)=>{r.size>=t&&(n.clear(),r.clear(),i.length=0,a.length=0),Hp=Bp,Up=Vp;for(let t of e)s(o[t]);l[2*c]=Up,l[2*c+1]=Hp}),Hp=u,Up=d,c}},Zp=25214903917n,Qp=(1n<<48n)-1n,$p=2147483647,em=e=>{let t={value:(BigInt.asUintN(64,e)^Zp)&Qp},n=e=>(t.value=t.value*Zp+11n&Qp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Zp)&Qp},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<=$p)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},tm=[],nm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},rm=()=>{for(let e=1277011;tm.length<1341;e++)nm(e)&&tm.push(e);return tm},im=e=>{let t=rm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},am=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},om=e=>{for(let t=Math.max(e,9);;t++){let e=am(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)}}},sm=(e,t,n)=>{if(t<=0)return[];let r=om(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})},cm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$p),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},lm=(1n<<63n)-1n-24n,um=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(lm*BigInt(n)+i)%t;return r<0n?r+t:r})},dm=(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,fm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=_n(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>lt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>bn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:yn}}},pm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,mm=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?cm:sm;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=pm(t,r)?void 0:fm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt($p)?um(e,t,n):i(e,Number(t),n)).map(e=>a.create(dm(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},hm=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e.g(`RandomElement of the empty set`);return r},gm=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[..._n(t.domain)];return lt(e,e.map(()=>gm(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return bn(t.names.map((e,r)=>[e,gm(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return yn(t.factors.map(e=>gm(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.g(`RandomElement of the empty set`);return t.low+i}return hm(P(t).elements,n)},_m=(e,t=0n)=>{let n=em(t),r={random:em(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>bn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Jp,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},vm=e=>ln([...e.possibleCounts].map(([e,t])=>[e,t])),ym=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,vm(e)]]),bm=`----------------------------- MODULE Bags --------------------------------
|
|
461
461
|
(**************************************************************************)
|
|
462
462
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
463
463
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -610,7 +610,7 @@ CopiesIn(e, B) ==
|
|
|
610
610
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
611
611
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
612
612
|
5 Dec 98 : Initial version.
|
|
613
|
-
`,
|
|
613
|
+
`,xm=/* @__PURE__ */ new Map([[`Bags`,bm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
614
614
|
(***************************************************************************)
|
|
615
615
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
616
616
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -1670,7 +1670,7 @@ _TLCTrace ==
|
|
|
1670
1670
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1671
1671
|
|
|
1672
1672
|
=============================================================================
|
|
1673
|
-
`]]),
|
|
1673
|
+
`]]),Sm=new Map([...[...xm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,bm.replace(`
|
|
1674
1674
|
LOCAL INSTANCE Naturals
|
|
1675
1675
|
`,`
|
|
1676
1676
|
EXTENDS TLC
|
|
@@ -1762,7 +1762,7 @@ _TEPosition ==
|
|
|
1762
1762
|
ELSE TLCGet("level") + 1
|
|
1763
1763
|
|
|
1764
1764
|
=============================================================================
|
|
1765
|
-
`]]),ym=(e=`master`)=>e===`1.7.4`?vm:_m,bm=(t,n,r)=>new e.S(`Applying ${t} to the following value,\nwhich is not ${n}:\n${L(r)}`),xm=e=>k(e)?I(e):void 0,Sm=(e,t,n)=>{let r=R(e,t,n),i=xm(r);if(!i)throw bm(n,`a function with a finite domain`,r);return i},Cm=(e,t,n)=>{let r=R(e,t,n),i=xm(r);if(!i)throw Hr(t===0?`first`:`second`,n,`bag`,r);return i},wm=(e,t)=>{if(!O(e)||!N(e))throw t();return P(e).elements},Tm=e=>e.range.every(e=>typeof e==`number`&&e>0),Em=(e,t)=>{let n=e.domain.findIndex(e=>xt(e,t));return n===-1?void 0:e.range[n]},Dm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Om=Dm(`BagDiff`,`tlc2.value.impl.Value`,2),km=Dm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Am=Dm(`BagUnion`,`tlc2.value.impl.Value`,1),jm=Dm(`BagOfAll`,`tlc2.value.impl.Value`,2),Mm=Dm(`BagCup`,`tlc2.value.impl.Value`,2),Nm=Dm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Pm=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${ci(e)}`;throw ui(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Fm=(e,t,n)=>{let r=Pm(e,n)+Pm(t,n);if(ni(r))throw ri(`${e}+${t}`);return r},Im=(e,t,n,r)=>{let i=Em(n,e.domain[t]),a=Pm(e.range[t],r);return i===void 0?a:a-Pm(i,r)|0},Lm=(e,t)=>ln(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>xt(e[0],r));a?a[1]=Fm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Rm=lt([],[]),zm=t=>[Qr(`EmptyBag`,Rm),z(`IsABag`,1,e=>{let t=xm(R(e,0,`IsABag`));return t!==void 0&&Tm(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Sm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw bm(`BagCardinality`,`a bag`,t);return Fm(e,n,Nm)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=Em(Sm(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Hr(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=Em(Sm(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Hr(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Cm(e,t,`(+)`);if(!Tm(n))throw Hr(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return Lm(t,Mm)}),z(`\\ominus`,2,e=>{let t=Cm(e,0,`(-)`),n=Cm(e,1,`(-)`);return ln(t.domain.flatMap((e,r)=>{let i=Im(t,r,n,Om);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=wm(n,()=>bm(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Rm;let i=r.map(t=>{let r=xm(t);if(!r)throw new e.S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(n)}`);return r});return Lm(i,Am)}),z(`\\sqsubseteq`,2,e=>{let t=Sm(e,0,`\\sqsubseteq`),n=Sm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Im(t,r,n,km)<=0)}),$r(`BagOfAll`,2,t=>{let n=Zr(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.S(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(n.literalBody)}`);let r=R(t,1,`BagOfAll`),i=xm(r);if(!i)throw Hr(`second`,`BagOfAll`,`function with a finite domain`,r);return Lm(i.domain.map((e,t)=>lt([n.call([e])],[i.range[t]])),jm)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!k(r))throw new e.g(`DOMAIN expects a function but received ${L(r)}`);let i=I(r),a=nn(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.g(`Attempted to apply a function to ${L(i)}, which is not in its domain`);return nn(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>lt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>cr(Sm(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=wm(t,()=>bm(`BagToSet`,`a function with a finite domain`,t));return lt([...n],n.map(()=>1))})],Bm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Vm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Hm=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Um=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Wm=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Gm=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Km=e=>{if(!k(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},qm=(e,t)=>ui(e,`Cannot convert value: unsupported value type tlc2.value.impl.${ci(t)}`),Jm=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ym=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw qm(t,e);return`[${P(e).elements.map(e=>Zm(e,t)).join(`,`)}]`},Xm=(e,t)=>{let n=I(e),r=Gn(n);return r?`[${r.map(e=>Zm(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Jm(typeof e==`string`?e:L(e))}:${Zm(n.range[r],t)}`).join(`,`)}}`},Zm=(e,t)=>typeof e==`string`?Jm(e):typeof e==`object`?e.kind===`ModelValue`?Jm(e.name):O(e)?Ym(e,t):Xm(e,t):String(e),Qm=e=>{if(O(e))return Ym(e,Bm);if(!k(e)||Km(e))throw qm(Bm,e);return Xm(e,Bm)},$m=e=>{if(!k(e))throw qm(Vm,e);return Xm(e,Vm)},eh=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))},th=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Ze(e);if(Array.isArray(e))return yn(e.map(e=>th(e,t)));if(typeof e==`object`&&e)return bn(Object.entries(e).map(([e,n])=>[Ze(e),th(n,t)]));throw ui(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},nh=(e,t)=>{if(e.trim()===``)return th(null,t);try{return th(JSON.parse(e,(e,t,n)=>typeof t==`number`?eh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?ui(t,e.message):e}},rh=(e,t)=>{if(typeof e!=`string`)throw ui(t,`Cannot cast tlc2.value.impl.${ci(e)} to tlc2.value.impl.StringValue`);return e},ih=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw ui(n,`${t} (No such file or directory)`);return r},ah=e=>[ei(`ToJson`,1,e=>Ze(Zm(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),ei(`ToJsonArray`,1,e=>Ze(Qm(R(e,0,`ToJsonArray`)))),ei(`ToJsonObject`,1,e=>Ze($m(R(e,0,`ToJsonObject`)))),ei(`JsonSerialize`,2,t=>{let n=rh(R(t,0,`JsonSerialize`),Hm),r=R(t,1,`JsonSerialize`);if(!Gn(r)&&!Km(r))throw Hr(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,Zm(r,Hm)),!0}),ei(`ndJsonSerialize`,2,t=>{let n=rh(R(t,0,`ndJsonSerialize`),Um),r=R(t,1,`ndJsonSerialize`),i=Gn(r);if(!i)throw Hr(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${Zm(e,Um)}\n`).join(``)),!0}),ei(`JsonDeserialize`,1,t=>{let n=rh(R(t,0,`JsonDeserialize`),Wm);return nh(ih(e,n,Wm),Wm)}),ei(`ndJsonDeserialize`,1,t=>{let n=rh(R(t,0,`ndJsonDeserialize`),Gm);return yn(ih(e,n,Gm).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>nh(e,Gm)))})],oh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,sh=1e6,ch=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Hr(t,n,`nonnegative integer`,e);return e},lh=(e,t,n,r)=>nn(Array.from({length:t},()=>nn(e.filter(()=>r.nextDouble()<n)))),uh=(e,t)=>{let n=`RandomSetOfSubsets`,r=ch(R(e,0,n),`first`,n),i=ch(R(e,1,n),`second`,n),a=R(e,2,n);if(!O(a)||!N(a))throw Hr(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw Hr(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Hr(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return lh(o,r,o.length===0?0:i/o.length,t.getRandom())},dh=e=>[ei(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw Hr(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw ui(oh,String(n));let r=R(t,1,`RandomSubset`);if(!O(r)||!F(r)&&!N(r))throw Hr(`second`,`RandomSubset`,`a finite set`,r);let i=lm(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>sh)throw ui(oh,`Attempted to construct a set with too many elements (>${sh}).`);return nn(um(n,r,e.getRandom(),e.version))}),ei(`RandomSetOfSubsets`,3,t=>uh(t,e)),ei(`TestRandomSetOfSubsets`,3,t=>yn(Array.from({length:5},()=>P(uh(t,e)).elements.length)))],fh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,ph=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${fh})`,mh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${fh}) throws java.io.IOException`,hh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${fh})`,gh=e=>bn([[`name`,e??`UnnamedAction`],[`location`,bn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),_h=(e,t,n)=>{let r=e.map((e,t)=>yn([t+1,bn(Object.entries(e))])),i=r.slice(1).map((e,n)=>yn([r[n],t[n],e])),a=n?[yn([r[r.length-1],n.action,r[n.start]])]:[];return bn([[`action`,nn([...i,...a])],[`state`,nn(r)]])},vh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return hm(e).get(t)},yh=(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),L(i));else throw new e.S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},bh=e=>e.every(e=>e!==void 0),xh=(e,t)=>bn(t.variables.map((t,n)=>[t,e[n]])),Sh=(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&&!D(e)){if(t.variableIndex.has(r))return!0;let e=rl(r,t);if(e&&!n.has(e)&&(n.add(e),Sh(e.body,t,n)))return!0}return E(e).some(e=>Sh(e,t,n))},Ch=(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[z(`AssertEq`,2,e=>{let n=R(e,0,`AssertEq`),r=R(e,1,`AssertEq`),i=xt(n,r);return i||(t(L(`Assertion failed`,!0)),t(L(n,!0)),t(L(r,!0))),i}),_i(`AssertError`,2,t=>{let r=Zr(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw ui(ph,`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=vi(t,0,`AssertError`)();try{vi(t,1,`AssertError`)()}catch(t){if(t instanceof e.g)return Gi(t.message,n.isTool)===i;throw t}return!1}),ei(`TLCGetOrDefault`,2,e=>{let t=R(e,0,`TLCGetOrDefault`);return vh(n,t)??R(e,1,`TLCGetOrDefault`)}),{...$r(`TLCGetAndSet`,4,e=>{let r=R(e,0,`TLCGetAndSet`),i=vh(n,r)??R(e,3,`TLCGetAndSet`),a=Zr(e,1,`TLCGetAndSet`);return yh(n,t,r,a.call([i,R(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},ei(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!bh(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw ui(mh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return yn(n.getBehavior(r).map(e=>xh(e,t.environment)))}),ei(`CounterExample`,0,()=>n.counterExample??bn([[`action`,nn([])],[`state`,nn([])]])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(!k(n)||!xt(cr(n),nn([`action`,`state`])))throw new e.g(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(n)}`);let r=P(or(n,`state`)).elements.map(e=>Gn(e)??[]);return yn(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,t=>{let n=R(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.S(`The argument of ModelValue should be a string, but instead it is:\n${L(n)}`);return st(n)}),_i(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),_i(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!bh(i))throw ui(hh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||nl(vi(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.k(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),_i(`TLCCache`,2,(e,t)=>{let n=Zr(e,0,`TLCCache`),i=Ar(vi(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Sh(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}),z(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Up([R(e,0,`TLCFP`)])))),ei(`TLCEvalDefinition`,1,(t,n)=>{let r=R(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?rl(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.S(`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)})]},wh=(e,t)=>[ei(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),ei(`_Counts`,0,()=>mm(t)),ei(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(mm(t),!0)),!1)}),ei(`_PrintCounts`,0,()=>(e(L(mm(t),!0)),!0))],Th=e=>String(e).padStart(2,`0`),Eh=e=>`${e.getUTCFullYear()}.${Th(e.getUTCMonth()+1)}.${Th(e.getUTCDate())}.${Th(e.getUTCHours())}${Th(e.getUTCMinutes())}${Th(e.getUTCSeconds())}`,Dh=e=>ln([...e].map(([e,t])=>[e,yn([t])])),Oh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),kh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Ah=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),jh=(t,n,r)=>{if(t.version===`1.7.4`?!kh.has(n)||!t.isStarted&&Ah.has(n):!t.isStarted&&Oh.has(n))throw new e.S(`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 bn([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return bn([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return bn([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,Ze(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Ze(Eh(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return gh(void 0);case`all`:return Dh(t.registers);case`all:named`:return Dh(hm(t))}if(n.startsWith(`s:`)){let r=hm(t).get(n);if(r===void 0)throw new e.S(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Ze(t.properties.get(n.slice(2))??n);throw new e.S(`TLCGet(${n}) was undefined.`)},Mh=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.S(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(n)}`);return jh(t,n,r?.state)},Nh=e=>e.length===0?[[]]:e.flatMap((t,n)=>Nh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Ph=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Ph),e.kind===`Function`&&e.range.forEach(Ph))},Fh=(t,n)=>[z(`Print`,2,e=>(t(`${Me(L(R(e,0,`Print`),!0,!0))} ${Me(L(R(e,1,`Print`),!0,!0))}`),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(Me(L(R(e,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,t=>{if(R(t,0,`Assert`)!==!0)throw new e.S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Me(L(R(t,1,`Assert`)))}`,e.U.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ln([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=Xr(e,0,`@@`),n=Xr(e,1,`@@`);return un([...Re(t),...Re(n)])}),z(`ToString`,1,e=>Ze(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return Ph(t),t}),z(`Permutations`,1,e=>{let t=Jr(e,0,`Permutations`);return nn(Nh(t).map(e=>ln(t.map((t,n)=>[t,e[n]]))))}),$r(`SortSeq`,2,e=>{let t=Zr(e,1,`SortSeq`);return yn(Yr(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`?di({...ei(`TLCGet`,1,(e,t)=>Mh(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):di(_i(`TLCGet`,1,(e,t)=>Mh(n,vi(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)`),ei(`TLCSet`,2,e=>{let r=R(e,0,`TLCSet`);return yh(n,t,r,R(e,1,`TLCSet`)),!0}),Qr(`Any`,it),z(`RandomElement`,1,e=>fm(qr(e,0,`RandomElement`),n.getRandom()))],Ih=(e,t)=>e.every(e=>Yn(e,t)),Lh=nn([!1,!0]),Rh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return cn(Rh(e,t,r),Rh(e,r,n))},zh=[`\\cup`,`\\cap`,`\\`],Bh=e=>typeof e==`object`&&e.kind===`MixedSet`,Vh=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return rn(r.filter(e=>Yn(e,n)===t))}if(r.length===0)return n;if(!Ne(n))return _t({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!Yn(e,t));return rn([...r,...i])},Hh=[Qr(`TRUE`,!0),Qr(`FALSE`,!1),Qr(`BOOLEAN`,Lh),Qr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ti(`=`,en),ti(`#`,(e,t)=>!en(e,t)),z(`~`,1,e=>!Gr(e,0,`~`)),z(`<=>`,2,e=>Gr(e,0,`<=>`)===Gr(e,1,`<=>`)),z(`/\\`,2,e=>Gr(e,0,`/\\`)&&Gr(e,1,`/\\`)),z(`\\/`,2,e=>Gr(e,0,`\\/`)||Gr(e,1,`\\/`)),z(`=>`,2,e=>!Gr(e,0,`=>`)||Gr(e,1,`=>`)),z(`\\in`,2,e=>Yn(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Yn(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=Kr(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?Ih(P(t.base).elements,n.base):Ih(P(t).elements,n)}),...zh.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if(Ne(n)&&Ne(r)&&!Bh(n)&&!Bh(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?cn:e===`\\cap`?sn:on;return Jn((e,n)=>t(P(e),P(n)),(t,n)=>Vh(e,t,n),n,r)}return Ne(n)?Vh(e,n,r):e!==`\\`&&Ne(r)?Vh(e,r,n):_t({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=Kr(e,0,`UNION`),n=Pe(t)?t.elements.filter(Pe):[];if(!Pe(t)||n.length!==t.elements.length)return _t({kind:`Union`,base:t});if(Bh(t)||n.some(Bh)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Yn(t,e)||e.elements.push(t)})),rn(e.elements)}return n.length===0?an:Rh(n.map(P),0,n.length)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!k(n))throw new e.g(`DOMAIN expects a function but received ${L(n)}`);return cr(n)})],Uh=pi(`Integers`,`Neg`,`IntValue`,1),Wh=t=>{let n=pi(t,`DotDot`,`IntervalValue`,2);return[mi(t,`+`,`Plus`,(e,t)=>e+t),mi(t,`-`,`Minus`,(e,t)=>e-t),mi(t,`*`,`Times`,(e,t)=>e*t),mi(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.S(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.S(`0^0 is undefined.`);return t**n}),mi(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.S(`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(ni(i))throw ri(`${n} \\div ${r}`);return i}),mi(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.S(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),z(`..`,2,e=>({kind:`Interval`,low:fi(R(e,0,`..`),n),high:fi(R(e,1,`..`),n)}))]},Gh=Wh(`Naturals`),Kh=Wh(`Integers`),qh=e=>{let t=Gh.indexOf(e);return t===-1?void 0:Kh[t]},Jh=[Qr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Gh,gi(`<`,(e,t)=>e<t),gi(`>`,(e,t)=>e>t),gi(`<=`,(e,t)=>e<=t),gi(`>=`,(e,t)=>e>=t,`>`)],Yh=[Qr(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Kh,gi(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=fi(R(e,0,`-`),Uh);if(ni(-t))throw ri(`-${t}`);return-t})],Xh=(t,n,r)=>{let i=R(t,n,r),a=Gn(i);if(!a)throw new e.S(`${r}\n${L(i)}`);return a},Zh=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Xh(e,t,n)},Qh=(e,t,n)=>typeof e==`string`?Ze(e.slice(t,n)):yn(e.slice(t,n)),$h=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,eg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,tg=(e,t)=>{let n=Nd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?di(e,t):e}):t},ng=t=>tg(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Zh(e,0,$h(``,`Len`)).length),z(`\\o`,2,t=>{let n=Zh(t,0,eg(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=Xh(t,1,eg(`t \\o s`,`sequence`));return yn([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.S(`${eg(`t \\o s`,`string`)}\n${L(r)}`);return Ze(n+r)}),z(`Append`,2,e=>yn([...Xh(e,0,eg(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=Xh(t,0,$h(``,`Head`));if(n.length===0)throw new e.S(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,t=>{let n=Zh(t,0,$h(``,`Tail`));if(n.length===0)throw new e.S(`Attempted to apply Tail to the empty sequence.`);return Qh(n,1)}),z(`SubSeq`,3,t=>{let n=Zh(t,0,$h(`first `,`SubSeq`)),r=Wr(t,1,`SubSeq`),i=Wr(t,2,`SubSeq`);if(r>i)return Qh(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.S(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Qh(n,r-1,i)}),$r(`SelectSeq`,2,e=>{let t=Zr(e,1,`SelectSeq`);return yn(Xh(e,0,$h(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw Hr(`second`,`SelectSeq`,`operator`,n);return n}))})]),rg=t=>tg(`FiniteSets`,[z(`IsFiniteSet`,1,t=>{let n=R(t,0,`IsFiniteSet`);if(O(n))return Un(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e.g(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${L(n)}\nis a finite set.`:`Attempted to check if the ${Fe(n)} ${L(n)} is a finite set.`)}),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!O(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.S(`Attempted to compute cardinality of the value\n${L(r)}`);return Vn(r,t)})]),ig=/* @__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`]]]),ag=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Jh};case`Integers`:return{extends:[`Naturals`],operators:Yh};case`Sequences`:return{extends:[],operators:ng(n.version)};case`FiniteSets`:return{extends:[],operators:rg(n.version)};case`TLC`:return{extends:[],operators:tg(`TLC`,Fh(t,n))};case`Randomization`:return{extends:[],operators:dh(n)};case`_Possible`:return{extends:[],operators:wh(t,n)};case`Json`:return{extends:[],operators:ah(r)};case`Bags`:return{extends:[],operators:zm(i)};case`TLCExt`:return{extends:[],operators:Ch(t,n)};default:return}},og=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}])),sg={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]}},cg=(e,t)=>{let n=sg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},lg=`$subexpression`,ug=(t,n)=>new e.D(`${t} at line ${n.line}, column ${n.column}`),dg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return dg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of E(e)){let e=dg(r,t,n);if(e)return e}},fg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),pg=(e,t)=>{let n=e.location,r=fg(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:lg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:lg,args:e.args,location:n,resolution:la},location:n}},mg=(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:la})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:la}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:la};return pg({...t,params:[...t.params,...r]},a)},hg=(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);da.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.R(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=>No(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=ga(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&&dg(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`||La(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=Va(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[La(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=La(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:Ha(n),c=i?.[La(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 mg(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 mg(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 pg(o,s.current)},gg=(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 Ra(e,t,n)},_g=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||E(e).some(_g),vg=(e,t,n,r=!1)=>{if(!_g(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Io(e,e=>vg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>yg(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)=>vg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Io(e,e=>vg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?gg(a.name,[],void 0,t):a.kind===`Apply`?gg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=hg(o,t,a,r);return c!==a&&ua.add(c),c},yg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:vg(e.expression,t,n,!0)}))}),bg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},xg=(e,t)=>yg(e,bg(t.definitions),()=>!1),Sg=(e,t)=>{let n=bg([...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=>vg(e,n,i),o=e=>i(e)||!n(e),s=e=>vg(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 yg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?yg(e,n,o):Fo(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=>_g(e.body))||e.assumptions.some(e=>_g(e.expression))?{...p,definitions:e.definitions.map(e=>Fo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Cg=(e,t)=>`${e}${t}`,wg=(e,t,n)=>`${e}${t}${n}`,Tg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Eg=(e,t,n)=>`${e},${t},${n}`,Dg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Og=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),kg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Ag=(e,t,n,r)=>({...Dg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),jg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Mg=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Ng=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,{...Ag(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Pg=Ag(`$Set`,0,[2],[1]),Fg=Ag(`$Junction`,0,[3],[1]),Ig=Ag(`$Choose`,0,[2],[1]),Lg=Ag(`$Function`,0,[3],[1]),Rg=Ag(`$FcnApply`,0,[2,2],[1,1]),zg=Ag(`$RcdSelect`,0,[2,0],[1,1]),Bg=Ag(`'`,2,[1],[0]),Vg=Ag(`ENABLED`,1,[2],[0]),Hg=Ag(`[]`,3,[3],[0]),Ug=Ag(`$SquareAct`,2,[2,1],[0,0]),Wg=Ag(`$WF`,3,[1,2],[0,0]),Gg=Ag(`$TemporalExists`,3,[3],[0]),Kg=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),qg=e=>e.map(e=>({name:e,arity:0})),Jg=(t,n)=>n.location.range?e.I(`${t}.`,n.location.range):new e.D(`${t} at line ${n.location.line}, column ${n.location.column}`),Yg=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Xg=e=>e.kind!==`Let`&&e.kind!==`Label`,Zg=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:g(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=g(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Ng.get(e)??og.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Dg(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(wg(e,n,t))}),t.data.constraints.forEach((e,t)=>Og(r.constraints,t,e)),kg(r.argConstraints,Cg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>kg(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>jg(t,r))throw new e.D(`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.D(`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(Eg(e,n,r)),c=Dg(Math.max(t.level,...n.filter((e,n)=>Mg(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)=>{Mg(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)=>Og(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Og(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Og(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Og(c.constraints,e,jg(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=>Og(c.constraints,e,jg(r,a)))}))}),t.argParams.forEach(e=>{let t=Tg(e),n=o(t.operator)?.operator;n&&Og(c.constraints,t.param,jg(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>kg(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>kg(c.argConstraints,Cg(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&kg(c.argConstraints,Cg(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=Tg(e),n=o(t.operator);n&&kg(c.argConstraints,Cg(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Tg(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Tg(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(wg(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(wg(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(wg(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=te(`LAMBDA`,qg(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=Dg();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=Kg(n,qg(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 Jg(`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 Jg(`Action used where only temporal formula or state predicate allowed`,e);Yg.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Xg(n)&&n.kind!==r)throw Jg(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=g(e,n);t.constraints.forEach((e,t)=>Og(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>kg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.D)||n.sany?n:Jg(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Dg();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(Fg,n)}case`Prime`:case`Unchanged`:return c(Bg,[e.expression],t);case`Enabled`:return c(Vg,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Hg,[n])}case`If`:return c(Fg,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Fg,[...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(Fg,[e.body],t,e.bounds.map(e=>e.set),Oa(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Jg(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Gg:Fg,[e.body],t,[],e.names);case`Choose`:return c(Ig,[e.body],t,e.set?[e.set]:[],Da(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Pg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Pg,[e.predicate],t,[e.bound.set],Da(e.bound.pattern));case`SetMap`:return c(Pg,[e.expression],t,e.bounds.map(e=>e.set),Oa(e.bounds));case`FunctionConstruction`:return c(Lg,[e.body],t,e.bounds.map(e=>e.set),Oa(e.bounds));case`Record`:return c(Lg,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Pg,e.fields.map(e=>e.value),t);case`Except`:return c(Pg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Rg,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(Pg,e.args,t)}]);case`Bracket`:return Dg();case`FieldAccess`:return a(zg,[o(e.record,t),{data:Dg()}]);case`BoxAction`:case`AngleAction`:return c(Ug,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Wg,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Dg()}},ee=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>ee(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 E(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Kg(t,qg(e.names))),i;default:return Io(e,(e,r)=>(a(e,n,Kg(t,qg(r))),e)),i}},te=(e,t,n,r)=>{let i=Kg(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=ee(n,i),c={...Dg(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(Cg(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(wg(e.name,n,t.name))).map(e=>Eg(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(Tg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Tg(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},g=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Dg(),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=te(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:g,toOperand:o}},Qg=(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`?Qg(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Dg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Og(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>kg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},$g=(t,n,r,i)=>{let a=Zg(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`?Qg(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.R(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.R(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=Eo([...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`?Qg(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.F(r)}})),...r],i);if(u.length>0)throw e.F(u,!1,void 0,i)},e_=(e,t)=>e.maxLevels[t]??3,t_=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Zg({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=>Og(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Og(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>kg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Tg(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)&&Og(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(Qg(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.R(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(Cg(e.name,i));a!==void 0&&e_(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=Tg(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=e_(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.F([...i.values()])}},n_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],r_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),i_=new Map(Dd.flatMap(e=>e.map(t=>[t,e[0]]))),a_=e=>i_.get(e)??e,o_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},s_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(o_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},c_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),l_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:a_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:a_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},u_=(e,t)=>{let n=[];for(let r=t;;){let t=l_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},d_=e=>({line:e.line,column:e.column}),f_=(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=u_(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},p_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,m_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},h_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&p_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&p_(e[n+1],e[n+2])?n+=p_(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>m_[e])}"`:r.text)}return t},g_=e=>e[2]?.text,__=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},v_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>v_(e.modules,t)).find(Boolean),y_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(jd.has(i)?t?.(i):void 0)??Md.get(i)??t?.(i)??Dp(e,i),s=o===void 0?[]:ne(o),c=__(s),l=c.get(g_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=kp(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>v_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},b_=(e,t)=>{let n=y_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=u_(t,e+1);r.push({location:d_(t[e]),apply:e=>i.forEach(t=>e.put(c_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:d_(u),apply:t=>t.put(c_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&u_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),r_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(d_(u)),r.push({location:d_(u),apply:e=>e.put(c_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(c_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=a_(e.name);r.push({location:e.location,apply:n=>n.put(c_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(c_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(c_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>ha(e.location,t.location)?-1:+!!ha(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=s_();i.set(e??``,s),Ed.toReversed().forEach(e=>s.put(c_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},x_=(e,t,n)=>b_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),S_=(e,t)=>{let n=b_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},C_=(e,t)=>x_(e,t,`variable`),w_=(t,n,r)=>{let i=y_(t,r),a=/* @__PURE__ */ new Set,o=e=>{a.add(e)},s=e=>{e.kind===`ModelValue`&&o(e.name),e.kind===`String`&&o(e.value),e.kind===`Set`&&e.elements.forEach(s)};n.constants.forEach(e=>{e.args?.forEach(s),s(e.value)}),Od.forEach(o);let c=e=>{let t=i(e);return t.tokens.slice(t.start,t.end)},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=e=>{let t=u.get(e);if(t)return t;let n=f_(c(e),e,l);return u.set(e,n),n},f=e=>l.get(e)??d(e),p=/* @__PURE__ */ new Set,m=(e,t)=>l.has(t)||p.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(f),...e.instances.filter(t=>m(e,t)).map(f),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},ee=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!m(n,e));return i===void 0?h(n,r,t):[n,i]};return t},te=ee(e=>e.extends),g=ee(e=>e.instances),ne=/* @__PURE__ */ new Set([void 0]),_=/* @__PURE__ */ new Map;h_(c(void 0)).forEach((e,t)=>{t===3&&Ad.forEach(o),o(e)});let re=d(void 0);for(;;){let t=te(re,/* @__PURE__ */ new Set)??g(re,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(p.add(`${n.key}>${r}`),_.set(n.unit,[..._.get(n.unit)??[],r]),!ne.has(r)){if(ne.add(r),i(r).tokens.length===0){let t=n.unit??g_(i(void 0).tokens);throw e.P(r,t)}h_(c(r)).forEach(o)}}n_.forEach(o);let v=/* @__PURE__ */ new Set,y=e=>{if(v.has(e))return;v.add(e);let t=_.get(e)??[],n=d(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(y),c(e).forEach(e=>{e.kind===`String`&&o(e.text)})};return y(void 0),kd.forEach(o),[...a]},T_=t=>{switch(t.kind){case`Number`:if(!j(t.value))throw e.G(new e.S(`Integer overflow: ${t.value} is outside TLC's 32-bit range`),e.U.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return st(t.name);case`Set`:return nn(t.elements.map(T_))}},E_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],D_=(t,n)=>{try{return kp(t)}catch(r){if(!(r instanceof e.D))throw r;let i=tp(t);throw i===void 0?r:e.F([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},O_=t=>new e.D(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),k_=(t,n)=>t.location.range&&n.location.range&&{location:e.R(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.R(n.location.range)}.`},A_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,j_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:A_(e),M_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Xo(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),N_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>L(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.g(`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`)&&xt(e,r)})});if(n)return n[1];throw new e.g(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},P_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||E(e).some(e=>P_(e,t)),F_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Go(e),n.get(e)??n.size)),n},I_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),L_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Gc(e);if(e.kind===`Number`&&!j(e.value))throw Kc(e);L_(e.kind===`Let`?[...E(e),...I_(e.instances??[])]:E(e))}),R_=(t,n)=>{let r=kp(n.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set,c=new Map(Hh.map(e=>[e.name,e])),l=/* @__PURE__ */ new Map,u=pm(t.checkDeadlock,n.seed);u.isWarningEnabled=n.isWarningEnabled??!0,u.isTool=n.isTool??!1,u.version=n.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=/* @__PURE__ */ new Map,ee=[],te=[],g=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},_=e=>`${e}#${ne.value++}`,re=[],v=[],y=t_(e=>{let t=p.get(e)??fe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),ie=/* @__PURE__ */ new Map,ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=e=>{let t=l.get(e);if(t)return t;let r=ag(e,n.print,u,n.files,c);if(!r)return;ig.get(e)?.forEach(se);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>se(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{c.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:og.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:cg(e,t.name)??i.get(t.name)?.range})}),l.set(e,i),i},ce=e=>{if(jd.has(e)&&n.loadModule?.(e)!==void 0)return;let t=se(e),r=ig.get(e)??[];return t&&g(e,r),t&&r.includes(`Integers`)&&se(`Integers`),t},le=e=>(L_([...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]),...I_(e.instances)]),e.modules.forEach(le),e);le(r);let ue=(t,r)=>{let i=n.loadModule?.(t)??Ee.get(t)??Dp(n.source,t);if(i===void 0)throw e.P(t,r);let a=D_(i,t);if(a.name!==t)throw e.F([{location:`Unknown location`,message:`File name '${t}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return le(a)},de=t=>{let n=te.indexOf(t.name);if(n!==-1){let r=[...te.slice(n),t.name].map(e=>`${e}.tla`);throw new e.D(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];te.push(t.name),ee.push(r);let s=ve(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:v,levelChecks:o});if(ee.pop(),te.pop(),a.length>0)throw e.F(a,!1,void 0,v);let c=i.find(e=>r.has(e.name)),l=c&&d.get(c.name),u=l&&k_(c,l.module);if(u)throw e.F([u],!1,void 0,v);if(c)throw O_(c);return o.forEach(e=>e()),{linked:s,closure:r}},fe=(e,t)=>{let r=d.get(e);if(r)return g(e,h.get(e)??[]),r;let a=de(ue(e,t));return(ym(u.version).has(e)?ag(e,n.print,u,n.files,c):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(c.set(t.key,e),i.delete(t.key))}),d.set(e,a.linked),h.set(e,a.closure),g(e,a.closure),a.linked},b=(e,t,n,r,c)=>{let l=c?void 0:ce(e.module);if(l)return x(e,l);let u=c??fe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=E_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=To(xg(e,t),d,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=rs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Ao(t,p)])),variables:new Set(u.variables),getDefinition:e=>i.get(e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,c,l)=>{let u=_(`${c}@${t.name}`),f=l(u);return i.set(u,f),d.length>0&&s.add(f),e.name!==void 0&&ae.set(u,`${e.name}!${ae.get(n)??c}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:_});return S(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&ie.set(r,{name:n,location:e.location}),e.name!==void 0&&oe.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:a.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:Zo(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),pe=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),me=(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=pe(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Zo(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:ce(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=pe(n.arity);return C(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=r??fe(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=E_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>P_(f(e),p),h=d.map(t=>{let n=me(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),ee=[],te=rs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Zo(e.params,o),location:o,resolution:la}:Xo(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),isParameterized:e=>a.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${ee.length}`,a=r(i);return ee.push(a.kind===`Operator`?{...a,name:i}:M_(a,i)),i},createName:_}),g=new Set(d.map(e=>e.name)),v=[...c.exported].filter(([e])=>!g.has(e)).map(([t,n])=>{let r=te.getKey(n.key),i=pe(n.arity),a=[...e.params,...i];return C(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...ee,...v]},ge=e=>[...e].flatMap(([e,t])=>{let n=i.get(t.key);return n?[{...n,name:e}]:[]}),_e=/* @__PURE__ */ new Map,ve=(t,o)=>{let s=Td(t,n.loadClass?.(t.name),t===r);_e.set(t.name,s.overrides);let c=s.module,l=re.length,u=new Map([...Hh.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...o.symbols]),d=/* @__PURE__ */ new Map,h={location:bo,errors:[],warnings:[]},ee=[h],te=t=>t.forEach((t,n)=>{let r=g.get(n);if(!r){u.set(n,t),g.set(n,t);return}if(!r.range||!t.range||e.R(r.range)===e.R(t.range))return;let i=e.R(t.range),a=e.R(r.range);j_(r.kind)===j_(t.kind)?h.warnings.push({location:i,message:`Warning: the ${A_(r.kind)} of '${n}' conflicts with \nits ${A_(r.kind)} at ${a}.`}):h.errors.push({location:i,message:`The ${A_(t.kind)} of '${n}' conflicts with \nits ${A_(r.kind)} at ${a}.`})}),g=/* @__PURE__ */ new Map,ne=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,ie=[],ae=[...c.constants],se=c.variables.map(e=>e.name),le=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=o.modules.get(e),n=t?void 0:ce(e);if(n){te(n);return}let r=t??fe(e,c.name);ae.push(...r.constants.filter(e=>ae.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{se.includes(e)||(se.push(e),le.push(r.variableLocations[t]))}),te(r.exported),r.facts.forEach(e=>ne.add(e)),r.modules.forEach((e,t)=>_.set(t,e)),ie.push(r)});let ue=new Map(u),de=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],C=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});de.forEach(e=>g.set(e.name,C(e)));let pe=e=>({key:w(e),arity:ga(e),params:_a(e),kind:xo(c,e)?`Theorem`:`Definition`,range:e.location.range}),me=ae.length===0&&se.length===0,w=e=>c===r?e.name:`${e.name}@${o.id}`,T=/* @__PURE__ */ new Map,ye=()=>new Map([...o.modules,..._]),be=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&ha(e.location,t.location)},xe=e=>{let t=c.modules.find(t=>t.name===e.module);return t?be(t)?_.get(t.name):void 0:ye().get(e.module)},Se=e=>({imported:u,getInstance:e=>{let t=xe(e),n=t?void 0:ce(e.module);if(n)return{declarations:[],symbols:x(e,n),instancer:c.name};let r=t??fe(e.module,c.name),i=E_(r);return{declarations:i,symbols:S(e,r.exported,i,e=>e),instancer:c.name}},bound:ue,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:w,instanced:T,facts:ne,reports:ee,warnings:o.warnings}),E=e=>[...de.filter(t=>ha(t.location,e)).map(e=>[e.name,C(e)]),...c.definitions.filter(t=>ha(t.location,e)).map(e=>[e.name,pe(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),D=e=>{let t=ye(),n=t.get(e.name),r=n&&k_(e,n.module);if(n&&!r)throw O_(e);o.nested.push(e);let i={location:e.location,errors:[],warnings:[]};ee.push(i);let a=ve(e,{id:`${o.id}/${e.name}`,symbols:E(e.location),modules:t,nested:o.nested,errors:i.errors,warnings:i.warnings,levelChecks:o.levelChecks});r&&i.errors.push(r),n||_.set(e.name,a),f.has(e.name)||f.set(e.name,a)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=b(e,c,Se(c),me,ye().get(e.module));T.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||g.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>D(e)}))].sort((e,t)=>ha(e.location,t.location)?-1:1).forEach(e=>e.link());let Ce=Sg(ss(c,(e,t)=>he(e,t,c.name,xe(e))),ge(u));o.errors.push(...Do(Ce,Se(Ce))),Ce.definitions.forEach(e=>{let t=w(e);i.set(t,e),a.set(t,!me);let n=pe(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ha(r,e.location))&&(u.set(e.name,n),e.isLocal||g.set(e.name,n))});let we={module:Ce,constants:ae,variables:se,variableLocations:le,visible:u,exported:g,modules:_,extended:ie,facts:/* @__PURE__ */ new Set([...ne,...[...Ce.theorems,...Ce.assumptions].flatMap(e=>e.name??[])])};p.has(c.name)||p.set(c.name,we);let Te=re.splice(l).map(e=>({location:e.location,check:()=>y(e)}));return o.levelChecks.push(()=>$g(Ce,{constants:new Set(ae.map(e=>e.name)),variables:new Set(se),getDefinition:e=>i.get(u.get(e)?.key??e),getQualifiedName:e=>oe.get(u.get(e)?.key??e)},Te,v)),m.push(we),we},w=de(r).linked;v.length>0&&!n.isSanyReported&&n.print(e.z(v));let T=e=>w.visible.get(e)?.key??e;w.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)});let ye=[],be=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>be(e,t)),ye.push(...e.module.assumptions))};be(w,/* @__PURE__ */ new Set);let xe=w.constants.map(e=>e.name),Se=w.variables,E=e=>e.module===void 0?[e.name,T(e.name)]:e.module===r.name||xe.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],D=e=>{let t=i.get(e);return t?.kind===`Operator`?t.params.length:w.constants.find(t=>t.name===e)?.arity??0},Ce=/* @__PURE__ */ new Map,we=/* @__PURE__ */ new Set,Te=(e,t)=>{c.set(e,t),i.delete(e),Ce.delete(e),we.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=T_(e.value);$t(t),E(e).forEach(e=>{let n=D(e);n===0?Ce.set(e,t):Te(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let De=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=De.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.m(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(T_),T_(t.value)]),De.set(n,r)}),De.forEach(e=>E(e).forEach(t=>Te(t,N_(e.name,D(t)||e.rows[0][0].length,e.rows))));let Oe=new Map(t.substitutions.flatMap(e=>E(e).map(t=>[t,T(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,a=n.target;if(!xe.includes(r)&&!w.visible.has(r))throw new e.m(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===a))throw new e.m(`In the configuration file, the identifier ${a} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let o=T(a),s=i.get(o);if(!(s!==void 0||c.has(o)||Ce.has(o)||xe.includes(a)||Se.includes(a)))throw new e.m(`The configuration file substitutes for ${r} with the undefined identifier ${a}.`);if(s?.kind===`Operator`&&s.params.length!==(w.constants.find(e=>e.name===r)?.arity??w.visible.get(r)?.arity))throw new e.m(`The configuration file substitutes for ${r} with ${a} of different number of arguments.`)});let ke=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(E)),Ae=(e,t)=>{if(ke.has(e))return{key:e,prefix:t};let n=o.get(e);return n&&Ae(n.source,t+n.prefix)};o.forEach((e,t)=>{let n=Ae(e.source,e.prefix),r=i.get(t);if(!n||!r)return;let a=r.kind===`Operator`?r.params:[],o=C(t,n.key,a,a.slice(n.prefix),r.location);i.set(t,o),w.visible.forEach((e,n)=>{e.key===t&&n!==t&&i.set(n,o)})});let je=xe.filter(e=>!Ce.has(e)&&!Oe.has(e)&&!we.has(e));if(je.length>0&&!n.isUnconfigured){let t=x_(n.source,n.loadModule,`constant`).find(e=>je.includes(e))??je[0];throw new e.m(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&c.forEach((e,t)=>{let n=qh(e);n&&c.set(t,n)});let Me={runtime:u,definitions:i,builtins:c,constants:Ce,substitutions:Oe,instanceNames:ae,variables:Se,variableIndex:F_(Se,m.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:s,evaluators:/* @__PURE__ */ new WeakMap},O=Zg({constants:new Set(Ce.keys()),variables:/* @__PURE__ */ new Set([...Se,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>c.has(e))]),getDefinition:e=>rl(e,Me)}),Ne=t=>{try{H(t,{environment:Me,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.g)return t;throw t}};Oe.forEach((t,n)=>{let r=i.get(t),a=xe.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&O.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ne(r.body):void 0;if(a){let r=Hi(a)?``:` - specifically: ${a.message}`;throw new e.m(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),u.version!==`1.7.4`&&(u.isStarted=!0);let k=new Set(m.flatMap(e=>e.module.instances.map(e=>e.module))),A=S_(n.source,n.loadModule);return{environment:Me,assumptions:ye,variableLocations:w.variableLocations,instanceActions:ie,startupDefinitions:m.filter(e=>!k.has(e.module.name)||E_(e).length===0).flatMap(e=>A(e===w?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:w.constants,rootSymbols:w.visible,javaOverrides:m.flatMap(e=>_e.get(e.module.name)??[])}},z_={kind:`Boolean`,value:!0},B_={kind:`Boolean`,value:!1},V_=e=>e?z_:B_,H_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,U_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),W_=(e,t,n)=>({kind:e,operands:[t,n]}),G_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?G_(e,t.operands).operands:[t])}),K_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return K_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,K_(t)),0)}},q_=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 q_(e.body);case`And`:case`Or`:return e.operands.some(q_)}},J_=/* @__PURE__ */ new WeakMap,Y_={count:0},X_=e=>{let t=J_.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`#${Y_.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(X_).join(`,`)})`;default:return`${e.kind}(${X_(e.body)})`}})();return J_.set(e,n),n},Z_=(e,t)=>e===t||X_(e)===X_(t),Q_=(e,t)=>{let n=X_(t);return e.some(e=>e===t||X_(e)===n)},$_=e=>e===`And`?`Or`:`And`,ev=(e,t)=>{switch(e.kind){case`Boolean`:return t?V_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return ev(e.body,!t);case`And`:case`Or`:return G_(t?$_(e.kind):e.kind,e.operands.map(e=>ev(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,ev(e.body,t))}}},tv=e=>{switch(e.kind){case`Boolean`:return V_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return G_($_(e.kind),e.operands.map(tv));case`Always`:return $(`Eventually`,tv(e.body));case`Eventually`:return $(`Always`,tv(e.body));default:return $(`Not`,e)}},nv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=nv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return V_(t)}return n.length===0?V_(!t):n.length===1?n[0]:G_(e.kind,n)}case`Not`:{let t=nv(e.body);return t.kind===`Boolean`?V_(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=nv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},rv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,iv=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=iv(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.g(`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=>G_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=iv(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=rv(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:G_(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return G_(`Or`,n)}case`Not`:return H_(t.body)?t:iv(tv(t.body));default:return t}},av=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?av(e.operands[0]):G_(e.kind,e.operands.map(av));case`Not`:return e.body.kind===`Not`?av(e.body.body):$(`Not`,av(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,av(e.body));default:return e}},ov=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return ov(e.operands[0]);let t=Math.floor(e.operands.length/2);return W_(e.kind,ov(G_(e.kind,e.operands.slice(0,t))),ov(G_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,ov(e.body));default:return e}},sv=(e,t)=>{e.kind===`Eventually`&&!Q_(t,e)&&t.push(e),`body`in e&&sv(e.body,t),`operands`in e&&e.operands.forEach(e=>sv(e,t))},cv=e=>{let t=e.filter(U_),n=e.flatMap(e=>e.kind===`Not`&&U_(e.body)?[e.body]:[]);return!t.some(e=>Q_(n,e))},lv=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.g(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},uv=(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]}},dv=(e,t,n)=>e.flatMap(e=>{let r=uv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),fv=e=>[...new Set(e.map(X_))].sort().join(`|`),pv=(e,t)=>{let n=new Set(t.map(fv));return[...e.filter(e=>!n.has(fv(e))),...t]},mv=e=>{let t=lv(e),n=dv(t,`Always`,`And`),r=dv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=uv(t,`Eventually`,`Or`);if(n&&!(Q_(e,n.first)||Q_(e,n.second)))return pv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Q_(e,t.first)||Q_(e,t.second))&&!Q_(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!cv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=uv(t[e],`Always`,`And`);n&&(Q_(t,n.first)||t.push(n.first),Q_(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Q_(t,e.first)&&Q_(t,e.second)&&!Q_(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!cv(t)?[]:i(t)};return a(e)},hv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>K_(e)<=1)}),gv=e=>{let t=mv([e]).map(hv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=fv(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 mv(n)){let n=fv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(hv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},_v=(e,t)=>!Q_(e,t)||Q_(e,t.body),vv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&K_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=rv(t);if(r){let e=K_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(q_(t))throw new e.g(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},yv=(e,t)=>{let n=e.findIndex(e=>Z_(e,t));return n===-1?(e.push(t),e.length-1):n},bv=e=>{let t=iv(nv(ev(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=av(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])vv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:G_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Z_(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&ov(e.formula),n=[];t&&sv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>yv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>yv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>yv(i,e))}));return{tableau:t&&gv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},xv=()=>e.G(new e.g(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.U.livenessEvaluationFailure),Sv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Cv=/* @__PURE__ */ new WeakMap,wv=/* @__PURE__ */ new WeakSet,Tv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ev=(t,n)=>new e.g(`TLC cannot handle the temporal formula ${Lc(t)}${n===void 0?``:`:\n${n}`}`),Dv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Xc(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return 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=rl(e,n);if(t)return Ov(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:D(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Io(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 Sv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Ov=(e,t)=>{let n=Cv.get(e);if(n!==void 0)return n;Cv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Dv(e.body,void 0,t),...r.map(e=>Dv(e.set,void 0,t)));return Cv.set(e,i),i},kv=(t,n)=>{try{return gl(t,n)}catch(t){if(!(t instanceof e.g))throw t;if(!Hi(t))return;throw e.G(new e.g(`${e.M}${t.message}`),e.U.error)}},Av=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s)=>{let c=(e,t,n=s,c=a,l)=>Av(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,Lc(e)));if(t.kind===`Label`)return c(t.body,n);if(t.kind===`Let`)return c(t.body,jv(t,n,r));if(t.kind===`Identifier`){let i=D(t)?Xc(n,t.name):void 0;if(i?.kind===`Thunk`)return c(i.expression,i.scope);let o=r.constants.has(t.name)?void 0:rl(t.name,r);if(!i&&o?.kind===`Operator`&&o.params.length===0&&Ov(o,r)>0){if(a.has(o))throw e.L();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=Vl(t,l),n=D(t)?void 0:rl(t.operator,r);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&!o)return c(e.body,tu(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?kv(t.bounds,l):void 0;if(u&&d){let e=[];if(_l(t.bounds,d,n,n=>(e.push(...c(t.body,n,Lc(t.body))),!1)),e.length===0)throw xv();return e}return[{expression:t,scope:n,name:s}]},jv=(e,t,n)=>{let r=ru(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},Mv=(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.g(`TLC expected a boolean value, but did not find one. ${Rc(t)}`);return V_(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.L();o.depth++;let s=p(t,n);o.depth--;let c=K_(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=D(e)||rl(n,r)===void 0?Xc(t,n):void 0;if(o?.kind===`Thunk`&&wv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:D(e)?Hl(n,a):zl(n,r);if(c?.kind!==`Closure`)throw Ev(e);let u=e.kind===`Apply`?e.args:[],d=!D(e)&&rl(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,tu(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.E||r&&!i;throw!(n instanceof e.g)||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{vl(t.bounds,Tv(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.g)||r instanceof e.E)throw r;if(i<=2)return a(t,n,i);throw Ev(t,s&&!Hi(r)?r.message:void 0)}return o.length===0?V_(s):d(t,n,G_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=K_(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===`~`&&!D(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,jv(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,W_(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!D(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,W_(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,G_(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,W_(`Or`,W_(`And`,n,p(e.consequent,t)),W_(`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`,W_(`Or`,i,a))):W_(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Ev(e)}};return p(t,n)},Nv=(t,n,r,i,a)=>{let o=e=>Nv(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`?nl(H(t.expression,r),`a temporal property predicate`):Ec(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&&nl(H(t.unchanged,e),`a subscript`)?!1:nl(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 Nv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.g(`TLC cannot evaluate a temporal formula in a single step`)}},Pv=(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)=>Pv(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 Nv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Fv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Iv=(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},Lv=t=>e.G(new e.g(`${e.N}${t}`),e.U.error),Rv=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!A(e)||!A(i))throw Lv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},zv=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(zv);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Bv=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Vv=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.m(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Lv(`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)||!N(o))throw Lv(`The symmetry operator must specify a set of functions.`);let s=P(o).elements;if(!s.every(k))throw Lv(`The symmetry values must be function records.`);let c=s.map(Rv),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=zv(Bv(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Mi.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(Fv(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=Iv(n,e),r=Fv(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),ee=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!Bv(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||ee.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>A(e)&&h.has(e.name))})),f.size===0)return;let te=Math.max(256,Math.floor(4194304/f.size));return{permutations:[...f.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:te})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:te}},Hv=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Gv(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(Gv(e[r],t));return a}},Uv=(e,t)=>{let n=[],r=[];for(let i of e){let e=Gv(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(M);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(M(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},Wv=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Gv=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Wv(e);if(n===0||n>64)return Kv(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Kv(e,t),a=i!==e&&Ct(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},Kv=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Uv(e.elements,t);return n?ct(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=Hv(n.domain,t),i=Hv(n.range,t)??n.range;if(r){let e=ln(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?lt(n.domain,e.range):e}return i===n.range?n:lt(n.domain,i)}if(n===`Interval`||!O(e)||!N(e))return e;let r=P(e),i=Hv(r.elements,t);return i?nn(i):r},qv=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},Jv=(e,t,n)=>e.images[t]??=Gv(e.images[0],n.permutations[t-1]),Yv=(e,t,n,r)=>{let i=qv(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=M(Jv(i,t,r),Jv(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},Xv=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?Yv(i,t,n,r):0;if(o!==0)return o<0}return!1},Zv=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>Xv(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?Jv(qv(e,t),r,t):e)},Qv={line:0,column:0},$v=e=>({kind:`Identifier`,name:e,location:Qv}),ey=/* @__PURE__ */ new Set([`name`,`property`]),ty=(t,n,r)=>{let i=rl(n,r);if(!i)throw new e.m(`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.m(ey.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},ny=(t,n,r)=>{if(sl(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return H($v(t),wy(r,void 0,void 0))}catch(t){if(t instanceof e.g||e.H(t))return;throw t}},ry=(t,n,r)=>{let i=ty(t,n,r);if(ny(n,i,r)!==void 0)throw new e.m(`The ${t} ${n} cannot be a constant.`);return i},iy=(t,n,r)=>{let i=r.constants.has(n)?void 0:ty(t,n,r),a=i?ny(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.m(`The ${t} of ${n} is equal to ${L(a)}`);return a===void 0?i:void 0},ay=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},oy=(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})),Fl(e.startupDefinitions,r),t.invariants.forEach(e=>{iy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},sy=(t,n)=>{let r=Zg({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>rl(e,n)});return t.flatMap(t=>{let i=iy(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1765
|
+
`]]),Cm=(e=`master`)=>e===`1.7.4`?Sm:xm,wm=(t,n,r)=>new e.S(`Applying ${t} to the following value,\nwhich is not ${n}:\n${L(r)}`),Tm=e=>k(e)?I(e):void 0,Em=(e,t,n)=>{let r=R(e,t,n),i=Tm(r);if(!i)throw wm(n,`a function with a finite domain`,r);return i},Dm=(e,t,n)=>{let r=R(e,t,n),i=Tm(r);if(!i)throw Hr(t===0?`first`:`second`,n,`bag`,r);return i},Om=(e,t)=>{if(!O(e)||!N(e))throw t();return P(e).elements},km=e=>e.range.every(e=>typeof e==`number`&&e>0),Am=(e,t)=>{let n=e.domain.findIndex(e=>xt(e,t));return n===-1?void 0:e.range[n]},jm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Mm=jm(`BagDiff`,`tlc2.value.impl.Value`,2),Nm=jm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Pm=jm(`BagUnion`,`tlc2.value.impl.Value`,1),Fm=jm(`BagOfAll`,`tlc2.value.impl.Value`,2),Im=jm(`BagCup`,`tlc2.value.impl.Value`,2),Lm=jm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Rm=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${ci(e)}`;throw ui(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},zm=(e,t,n)=>{let r=Rm(e,n)+Rm(t,n);if(ni(r))throw ri(`${e}+${t}`);return r},Bm=(e,t,n,r)=>{let i=Am(n,e.domain[t]),a=Rm(e.range[t],r);return i===void 0?a:a-Rm(i,r)|0},Vm=(e,t)=>ln(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>xt(e[0],r));a?a[1]=zm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Hm=lt([],[]),Um=t=>[Qr(`EmptyBag`,Hm),z(`IsABag`,1,e=>{let t=Tm(R(e,0,`IsABag`));return t!==void 0&&km(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Em(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw wm(`BagCardinality`,`a bag`,t);return zm(e,n,Lm)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=Am(Em(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Hr(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=Am(Em(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Hr(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Dm(e,t,`(+)`);if(!km(n))throw Hr(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return Vm(t,Im)}),z(`\\ominus`,2,e=>{let t=Dm(e,0,`(-)`),n=Dm(e,1,`(-)`);return ln(t.domain.flatMap((e,r)=>{let i=Bm(t,r,n,Mm);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=Om(n,()=>wm(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Hm;let i=r.map(t=>{let r=Tm(t);if(!r)throw new e.S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(n)}`);return r});return Vm(i,Pm)}),z(`\\sqsubseteq`,2,e=>{let t=Em(e,0,`\\sqsubseteq`),n=Em(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Bm(t,r,n,Nm)<=0)}),$r(`BagOfAll`,2,t=>{let n=Zr(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.S(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(n.literalBody)}`);let r=R(t,1,`BagOfAll`),i=Tm(r);if(!i)throw Hr(`second`,`BagOfAll`,`function with a finite domain`,r);return Vm(i.domain.map((e,t)=>lt([n.call([e])],[i.range[t]])),Fm)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!k(r))throw new e.g(`DOMAIN expects a function but received ${L(r)}`);let i=I(r),a=nn(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.g(`Attempted to apply a function to ${L(i)}, which is not in its domain`);return nn(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>lt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>cr(Em(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Om(t,()=>wm(`BagToSet`,`a function with a finite domain`,t));return lt([...n],n.map(()=>1))})],Wm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Gm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Km=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,qm=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Jm=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Ym=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Xm=e=>{if(!k(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Zm=(e,t)=>ui(e,`Cannot convert value: unsupported value type tlc2.value.impl.${ci(t)}`),Qm=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),$m=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Zm(t,e);return`[${P(e).elements.map(e=>th(e,t)).join(`,`)}]`},eh=(e,t)=>{let n=I(e),r=Gn(n);return r?`[${r.map(e=>th(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Qm(typeof e==`string`?e:L(e))}:${th(n.range[r],t)}`).join(`,`)}}`},th=(e,t)=>typeof e==`string`?Qm(e):typeof e==`object`?e.kind===`ModelValue`?Qm(e.name):O(e)?$m(e,t):eh(e,t):String(e),nh=e=>{if(O(e))return $m(e,Wm);if(!k(e)||Xm(e))throw Zm(Wm,e);return eh(e,Wm)},rh=e=>{if(!k(e))throw Zm(Gm,e);return eh(e,Gm)},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))},ah=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Ze(e);if(Array.isArray(e))return yn(e.map(e=>ah(e,t)));if(typeof e==`object`&&e)return bn(Object.entries(e).map(([e,n])=>[Ze(e),ah(n,t)]));throw ui(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},oh=(e,t)=>{if(e.trim()===``)return ah(null,t);try{return ah(JSON.parse(e,(e,t,n)=>typeof t==`number`?ih(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?ui(t,e.message):e}},sh=(e,t)=>{if(typeof e!=`string`)throw ui(t,`Cannot cast tlc2.value.impl.${ci(e)} to tlc2.value.impl.StringValue`);return e},ch=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw ui(n,`${t} (No such file or directory)`);return r},lh=e=>[ei(`ToJson`,1,e=>Ze(th(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),ei(`ToJsonArray`,1,e=>Ze(nh(R(e,0,`ToJsonArray`)))),ei(`ToJsonObject`,1,e=>Ze(rh(R(e,0,`ToJsonObject`)))),ei(`JsonSerialize`,2,t=>{let n=sh(R(t,0,`JsonSerialize`),Km),r=R(t,1,`JsonSerialize`);if(!Gn(r)&&!Xm(r))throw Hr(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,th(r,Km)),!0}),ei(`ndJsonSerialize`,2,t=>{let n=sh(R(t,0,`ndJsonSerialize`),qm),r=R(t,1,`ndJsonSerialize`),i=Gn(r);if(!i)throw Hr(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${th(e,qm)}\n`).join(``)),!0}),ei(`JsonDeserialize`,1,t=>{let n=sh(R(t,0,`JsonDeserialize`),Jm);return oh(ch(e,n,Jm),Jm)}),ei(`ndJsonDeserialize`,1,t=>{let n=sh(R(t,0,`ndJsonDeserialize`),Ym);return yn(ch(e,n,Ym).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>oh(e,Ym)))})],uh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,dh=1e6,fh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Hr(t,n,`nonnegative integer`,e);return e},ph=(e,t,n,r)=>nn(Array.from({length:t},()=>nn(e.filter(()=>r.nextDouble()<n)))),mh=(e,t)=>{let n=`RandomSetOfSubsets`,r=fh(R(e,0,n),`first`,n),i=fh(R(e,1,n),`second`,n),a=R(e,2,n);if(!O(a)||!N(a))throw Hr(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw Hr(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Hr(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return ph(o,r,o.length===0?0:i/o.length,t.getRandom())},hh=e=>[ei(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw Hr(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw ui(uh,String(n));let r=R(t,1,`RandomSubset`);if(!O(r)||!F(r)&&!N(r))throw Hr(`second`,`RandomSubset`,`a finite set`,r);let i=pm(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>dh)throw ui(uh,`Attempted to construct a set with too many elements (>${dh}).`);return nn(mm(n,r,e.getRandom(),e.version))}),ei(`RandomSetOfSubsets`,3,t=>mh(t,e)),ei(`TestRandomSetOfSubsets`,3,t=>yn(Array.from({length:5},()=>P(mh(t,e)).elements.length)))],gh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,_h=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${gh})`,vh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${gh}) throws java.io.IOException`,yh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${gh})`,bh=e=>bn([[`name`,e??`UnnamedAction`],[`location`,bn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),xh=(e,t,n)=>{let r=e.map((e,t)=>yn([t+1,bn(Object.entries(e))])),i=r.slice(1).map((e,n)=>yn([r[n],t[n],e])),a=n?[yn([r[r.length-1],n.action,r[n.start]])]:[];return bn([[`action`,nn([...i,...a])],[`state`,nn(r)]])},Sh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return ym(e).get(t)},Ch=(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),L(i));else throw new e.S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},wh=e=>e.every(e=>e!==void 0),Th=(e,t)=>bn(t.variables.map((t,n)=>[t,e[n]])),Eh=(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&&!D(e)){if(t.variableIndex.has(r))return!0;let e=sl(r,t);if(e&&!n.has(e)&&(n.add(e),Eh(e.body,t,n)))return!0}return E(e).some(e=>Eh(e,t,n))},Dh=(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[z(`AssertEq`,2,e=>{let n=R(e,0,`AssertEq`),r=R(e,1,`AssertEq`),i=xt(n,r);return i||(t(L(`Assertion failed`,!0)),t(L(n,!0)),t(L(r,!0))),i}),_i(`AssertError`,2,t=>{let r=Zr(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw ui(_h,`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=vi(t,0,`AssertError`)();try{vi(t,1,`AssertError`)()}catch(t){if(t instanceof e.g)return Gi(t.message,n.isTool)===i;throw t}return!1}),ei(`TLCGetOrDefault`,2,e=>{let t=R(e,0,`TLCGetOrDefault`);return Sh(n,t)??R(e,1,`TLCGetOrDefault`)}),{...$r(`TLCGetAndSet`,4,e=>{let r=R(e,0,`TLCGetAndSet`),i=Sh(n,r)??R(e,3,`TLCGetAndSet`),a=Zr(e,1,`TLCGetAndSet`);return Ch(n,t,r,a.call([i,R(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},ei(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!wh(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw ui(vh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return yn(n.getBehavior(r).map(e=>Th(e,t.environment)))}),ei(`CounterExample`,0,()=>n.counterExample??bn([[`action`,nn([])],[`state`,nn([])]])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(!k(n)||!xt(cr(n),nn([`action`,`state`])))throw new e.g(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(n)}`);let r=P(or(n,`state`)).elements.map(e=>Gn(e)??[]);return yn(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,t=>{let n=R(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.S(`The argument of ModelValue should be a string, but instead it is:\n${L(n)}`);return st(n)}),_i(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),_i(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!wh(i))throw ui(yh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||ol(vi(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.k(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),_i(`TLCCache`,2,(e,t)=>{let n=Zr(e,0,`TLCCache`),i=Ar(vi(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Eh(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}),z(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Jp([R(e,0,`TLCFP`)])))),ei(`TLCEvalDefinition`,1,(t,n)=>{let r=R(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?sl(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.S(`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)})]},Oh=(e,t)=>[ei(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),ei(`_Counts`,0,()=>vm(t)),ei(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(vm(t),!0)),!1)}),ei(`_PrintCounts`,0,()=>(e(L(vm(t),!0)),!0))],kh=e=>String(e).padStart(2,`0`),Ah=e=>`${e.getUTCFullYear()}.${kh(e.getUTCMonth()+1)}.${kh(e.getUTCDate())}.${kh(e.getUTCHours())}${kh(e.getUTCMinutes())}${kh(e.getUTCSeconds())}`,jh=e=>ln([...e].map(([e,t])=>[e,yn([t])])),Mh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Nh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Ph=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Fh=(t,n,r)=>{if(t.version===`1.7.4`?!Nh.has(n)||!t.isStarted&&Ph.has(n):!t.isStarted&&Mh.has(n))throw new e.S(`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 bn([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return bn([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return bn([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,Ze(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Ze(Ah(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return bh(void 0);case`all`:return jh(t.registers);case`all:named`:return jh(ym(t))}if(n.startsWith(`s:`)){let r=ym(t).get(n);if(r===void 0)throw new e.S(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Ze(t.properties.get(n.slice(2))??n);throw new e.S(`TLCGet(${n}) was undefined.`)},Ih=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.S(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(n)}`);return Fh(t,n,r?.state)},Lh=e=>e.length===0?[[]]:e.flatMap((t,n)=>Lh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Rh=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Rh),e.kind===`Function`&&e.range.forEach(Rh))},zh=(t,n)=>[z(`Print`,2,e=>(t(`${Me(L(R(e,0,`Print`),!0,!0))} ${Me(L(R(e,1,`Print`),!0,!0))}`),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(Me(L(R(e,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,t=>{if(R(t,0,`Assert`)!==!0)throw new e.S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Me(L(R(t,1,`Assert`)))}`,e.U.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ln([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=Xr(e,0,`@@`),n=Xr(e,1,`@@`);return un([...Re(t),...Re(n)])}),z(`ToString`,1,e=>Ze(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return Rh(t),t}),z(`Permutations`,1,e=>{let t=Jr(e,0,`Permutations`);return nn(Lh(t).map(e=>ln(t.map((t,n)=>[t,e[n]]))))}),$r(`SortSeq`,2,e=>{let t=Zr(e,1,`SortSeq`);return yn(Yr(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`?di({...ei(`TLCGet`,1,(e,t)=>Ih(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):di(_i(`TLCGet`,1,(e,t)=>Ih(n,vi(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)`),ei(`TLCSet`,2,e=>{let r=R(e,0,`TLCSet`);return Ch(n,t,r,R(e,1,`TLCSet`)),!0}),Qr(`Any`,it),z(`RandomElement`,1,e=>gm(qr(e,0,`RandomElement`),n.getRandom()))],Bh=(e,t)=>e.every(e=>Yn(e,t)),Vh=nn([!1,!0]),Hh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return cn(Hh(e,t,r),Hh(e,r,n))},Uh=[`\\cup`,`\\cap`,`\\`],Wh=e=>typeof e==`object`&&e.kind===`MixedSet`,Gh=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return rn(r.filter(e=>Yn(e,n)===t))}if(r.length===0)return n;if(!Ne(n))return _t({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!Yn(e,t));return rn([...r,...i])},Kh=[Qr(`TRUE`,!0),Qr(`FALSE`,!1),Qr(`BOOLEAN`,Vh),Qr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ti(`=`,en),ti(`#`,(e,t)=>!en(e,t)),z(`~`,1,e=>!Gr(e,0,`~`)),z(`<=>`,2,e=>Gr(e,0,`<=>`)===Gr(e,1,`<=>`)),z(`/\\`,2,e=>Gr(e,0,`/\\`)&&Gr(e,1,`/\\`)),z(`\\/`,2,e=>Gr(e,0,`\\/`)||Gr(e,1,`\\/`)),z(`=>`,2,e=>!Gr(e,0,`=>`)||Gr(e,1,`=>`)),z(`\\in`,2,e=>Yn(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Yn(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=Kr(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?Bh(P(t.base).elements,n.base):Bh(P(t).elements,n)}),...Uh.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if(Ne(n)&&Ne(r)&&!Wh(n)&&!Wh(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?cn:e===`\\cap`?sn:on;return Jn((e,n)=>t(P(e),P(n)),(t,n)=>Gh(e,t,n),n,r)}return Ne(n)?Gh(e,n,r):e!==`\\`&&Ne(r)?Gh(e,r,n):_t({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=Kr(e,0,`UNION`),n=Pe(t)?t.elements.filter(Pe):[];if(!Pe(t)||n.length!==t.elements.length)return _t({kind:`Union`,base:t});if(Wh(t)||n.some(Wh)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Yn(t,e)||e.elements.push(t)})),rn(e.elements)}return n.length===0?an:Hh(n.map(P),0,n.length)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!k(n))throw new e.g(`DOMAIN expects a function but received ${L(n)}`);return cr(n)})],qh=pi(`Integers`,`Neg`,`IntValue`,1),Jh=t=>{let n=pi(t,`DotDot`,`IntervalValue`,2);return[mi(t,`+`,`Plus`,(e,t)=>e+t),mi(t,`-`,`Minus`,(e,t)=>e-t),mi(t,`*`,`Times`,(e,t)=>e*t),mi(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.S(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.S(`0^0 is undefined.`);return t**n}),mi(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.S(`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(ni(i))throw ri(`${n} \\div ${r}`);return i}),mi(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.S(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),z(`..`,2,e=>({kind:`Interval`,low:fi(R(e,0,`..`),n),high:fi(R(e,1,`..`),n)}))]},Yh=Jh(`Naturals`),Xh=Jh(`Integers`),Zh=e=>{let t=Yh.indexOf(e);return t===-1?void 0:Xh[t]},Qh=[Qr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Yh,gi(`<`,(e,t)=>e<t),gi(`>`,(e,t)=>e>t),gi(`<=`,(e,t)=>e<=t),gi(`>=`,(e,t)=>e>=t,`>`)],$h=[Qr(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Xh,gi(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=fi(R(e,0,`-`),qh);if(ni(-t))throw ri(`-${t}`);return-t})],eg=(t,n,r)=>{let i=R(t,n,r),a=Gn(i);if(!a)throw new e.S(`${r}\n${L(i)}`);return a},tg=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:eg(e,t,n)},ng=(e,t,n)=>typeof e==`string`?Ze(e.slice(t,n)):yn(e.slice(t,n)),rg=(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}:`,ag=(e,t)=>{let n=Ld.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?di(e,t):e}):t},og=t=>ag(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>tg(e,0,rg(``,`Len`)).length),z(`\\o`,2,t=>{let n=tg(t,0,ig(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=eg(t,1,ig(`t \\o s`,`sequence`));return yn([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.S(`${ig(`t \\o s`,`string`)}\n${L(r)}`);return Ze(n+r)}),z(`Append`,2,e=>yn([...eg(e,0,ig(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=eg(t,0,rg(``,`Head`));if(n.length===0)throw new e.S(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,t=>{let n=tg(t,0,rg(``,`Tail`));if(n.length===0)throw new e.S(`Attempted to apply Tail to the empty sequence.`);return ng(n,1)}),z(`SubSeq`,3,t=>{let n=tg(t,0,rg(`first `,`SubSeq`)),r=Wr(t,1,`SubSeq`),i=Wr(t,2,`SubSeq`);if(r>i)return ng(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.S(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return ng(n,r-1,i)}),$r(`SelectSeq`,2,e=>{let t=Zr(e,1,`SelectSeq`);return yn(eg(e,0,rg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw Hr(`second`,`SelectSeq`,`operator`,n);return n}))})]),sg=t=>ag(`FiniteSets`,[z(`IsFiniteSet`,1,t=>{let n=R(t,0,`IsFiniteSet`);if(O(n))return Un(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e.g(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${L(n)}\nis a finite set.`:`Attempted to check if the ${Fe(n)} ${L(n)} is a finite set.`)}),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!O(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.S(`Attempted to compute cardinality of the value\n${L(r)}`);return Vn(r,t)})]),cg=/* @__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`]]]),lg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Qh};case`Integers`:return{extends:[`Naturals`],operators:$h};case`Sequences`:return{extends:[],operators:og(n.version)};case`FiniteSets`:return{extends:[],operators:sg(n.version)};case`TLC`:return{extends:[],operators:ag(`TLC`,zh(t,n))};case`Randomization`:return{extends:[],operators:hh(n)};case`_Possible`:return{extends:[],operators:Oh(t,n)};case`Json`:return{extends:[],operators:lh(r)};case`Bags`:return{extends:[],operators:Um(i)};case`TLCExt`:return{extends:[],operators:Dh(t,n)};default:return}},ug=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}])),dg={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]}},fg=(e,t)=>{let n=dg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},pg=`$subexpression`,mg=(t,n)=>new e.D(`${t} at line ${n.line}, column ${n.column}`),hg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return hg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of E(e)){let e=hg(r,t,n);if(e)return e}},gg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),_g=(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 mg(`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 mg(`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:la},location:n}},vg=(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:la})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:la}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:la};return _g({...t,params:[...t.params,...r]},a)},yg=(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 mg(i,a);da.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.R(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 mg(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>No(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw mg(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=ga(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 mg(`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&&hg(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 mg(`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`||La(e.operand,1)!==0)throw mg(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=Va(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[La(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw mg(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=La(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw mg(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw mg(`Unexpected subexpression selector`,a);let i=r?r.sets:Ha(n),c=i?.[La(e.operand,i.length)];if(!c)throw mg(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return vg(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 mg(`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 vg(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw mg(`Subexpression selection failed`,a);return _g(o,s.current)},bg=(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 Ra(e,t,n)},xg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||E(e).some(xg),Sg=(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=Io(e,e=>Sg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Cg(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)=>Sg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Io(e,e=>Sg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?bg(a.name,[],void 0,t):a.kind===`Apply`?bg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=yg(o,t,a,r);return c!==a&&ua.add(c),c},Cg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Sg(e.expression,t,n,!0)}))}),wg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Tg=(e,t)=>Cg(e,wg(t.definitions),()=>!1),Eg=(e,t)=>{let n=wg([...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=>Sg(e,n,i),o=e=>i(e)||!n(e),s=e=>Sg(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 Cg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Cg(e,n,o):Fo(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=>Fo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Dg=(e,t)=>`${e}${t}`,Og=(e,t,n)=>`${e}${t}${n}`,kg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Ag=(e,t,n)=>`${e},${t},${n}`,jg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Mg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ng=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Pg=(e,t,n,r)=>({...jg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Fg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ig=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Lg=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,{...Pg(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Rg=Pg(`$Set`,0,[2],[1]),zg=Pg(`$Junction`,0,[3],[1]),Bg=Pg(`$Choose`,0,[2],[1]),Vg=Pg(`$Function`,0,[3],[1]),Hg=Pg(`$FcnApply`,0,[2,2],[1,1]),Ug=Pg(`$RcdSelect`,0,[2,0],[1,1]),Wg=Pg(`'`,2,[1],[0]),Gg=Pg(`ENABLED`,1,[2],[0]),Kg=Pg(`[]`,3,[3],[0]),qg=Pg(`$SquareAct`,2,[2,1],[0,0]),Jg=Pg(`$WF`,3,[1,2],[0,0]),Yg=Pg(`$TemporalExists`,3,[3],[0]),Xg=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Zg=e=>e.map(e=>({name:e,arity:0})),Qg=(t,n)=>n.location.range?e.I(`${t}.`,n.location.range):new e.D(`${t} at line ${n.location.line}, column ${n.location.column}`),$g=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),e_=e=>e.kind!==`Let`&&e.kind!==`Label`,t_=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:g(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=g(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Lg.get(e)??ug.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=jg(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(Og(e,n,t))}),t.data.constraints.forEach((e,t)=>Mg(r.constraints,t,e)),Ng(r.argConstraints,Dg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ng(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>Fg(t,r))throw new e.D(`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.D(`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(Ag(e,n,r)),c=jg(Math.max(t.level,...n.filter((e,n)=>Ig(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)=>{Ig(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)=>Mg(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Mg(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Mg(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Mg(c.constraints,e,Fg(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=>Mg(c.constraints,e,Fg(r,a)))}))}),t.argParams.forEach(e=>{let t=kg(e),n=o(t.operator)?.operator;n&&Mg(c.constraints,t.param,Fg(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ng(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>Ng(c.argConstraints,Dg(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Ng(c.argConstraints,Dg(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=kg(e),n=o(t.operator);n&&Ng(c.argConstraints,Dg(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(kg(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=kg(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(Og(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(Og(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(Og(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=te(`LAMBDA`,Zg(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=jg();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=Xg(n,Zg(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 Qg(`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 Qg(`Action used where only temporal formula or state predicate allowed`,e);$g.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&e_(n)&&n.kind!==r)throw Qg(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=g(e,n);t.constraints.forEach((e,t)=>Mg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ng(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.D)||n.sany?n:Qg(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return jg();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(zg,n)}case`Prime`:case`Unchanged`:return c(Wg,[e.expression],t);case`Enabled`:return c(Gg,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Kg,[n])}case`If`:return c(zg,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(zg,[...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(zg,[e.body],t,e.bounds.map(e=>e.set),Oa(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Qg(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Yg:zg,[e.body],t,[],e.names);case`Choose`:return c(Bg,[e.body],t,e.set?[e.set]:[],Da(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Rg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Rg,[e.predicate],t,[e.bound.set],Da(e.bound.pattern));case`SetMap`:return c(Rg,[e.expression],t,e.bounds.map(e=>e.set),Oa(e.bounds));case`FunctionConstruction`:return c(Vg,[e.body],t,e.bounds.map(e=>e.set),Oa(e.bounds));case`Record`:return c(Vg,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Rg,e.fields.map(e=>e.value),t);case`Except`:return c(Rg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Hg,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(Rg,e.args,t)}]);case`Bracket`:return jg();case`FieldAccess`:return a(Ug,[o(e.record,t),{data:jg()}]);case`BoxAction`:case`AngleAction`:return c(qg,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Jg,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return jg()}},ee=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>ee(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 E(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Xg(t,Zg(e.names))),i;default:return Io(e,(e,r)=>(a(e,n,Xg(t,Zg(r))),e)),i}},te=(e,t,n,r)=>{let i=Xg(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=ee(n,i),c={...jg(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(Dg(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(Og(e.name,n,t.name))).map(e=>Ag(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(kg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=kg(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},g=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...jg(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=te(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:g,toOperand:o}},n_=(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`?n_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=jg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Mg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ng(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},r_=(t,n,r,i)=>{let a=t_(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`?n_(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.R(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.R(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=Eo([...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`?n_(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.F(r)}})),...r],i);if(u.length>0)throw e.F(u,!1,void 0,i)},i_=(e,t)=>e.maxLevels[t]??3,a_=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=t_({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=>Mg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Mg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ng(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=kg(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Mg(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(n_(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.R(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(Dg(e.name,i));a!==void 0&&i_(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=kg(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=i_(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.F([...i.values()])}},o_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],s_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),c_=new Map(jd.flatMap(e=>e.map(t=>[t,e[0]]))),l_=e=>c_.get(e)??e,u_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},d_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(u_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},f_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),p_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:l_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:l_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},m_=(e,t)=>{let n=[];for(let r=t;;){let t=p_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},h_=e=>({line:e.line,column:e.column}),g_=(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=m_(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},__=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,v_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},y_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&__(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&__(e[n+1],e[n+2])?n+=__(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=>v_[e])}"`:r.text)}return t},b_=e=>e[2]?.text,x_=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},S_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>S_(e.modules,t)).find(Boolean),C_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(Fd.has(i)?t?.(i):void 0)??Id.get(i)??t?.(i)??jp(e,i),s=o===void 0?[]:ne(o),c=x_(s),l=c.get(b_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Np(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>S_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},w_=(e,t)=>{let n=C_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=m_(t,e+1);r.push({location:h_(t[e]),apply:e=>i.forEach(t=>e.put(f_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:h_(u),apply:t=>t.put(f_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&m_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),s_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(h_(u)),r.push({location:h_(u),apply:e=>e.put(f_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(f_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=l_(e.name);r.push({location:e.location,apply:n=>n.put(f_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(f_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(f_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>ha(e.location,t.location)?-1:+!!ha(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=d_();i.set(e??``,s),Ad.toReversed().forEach(e=>s.put(f_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},T_=(e,t,n)=>w_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),E_=(e,t)=>{let n=w_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},D_=(e,t)=>T_(e,t,`variable`),O_=(t,n,r)=>{let i=C_(t,r),a=/* @__PURE__ */ new Set,o=e=>{a.add(e)},s=e=>{e.kind===`ModelValue`&&o(e.name),e.kind===`String`&&o(e.value),e.kind===`Set`&&e.elements.forEach(s)};n.constants.forEach(e=>{e.args?.forEach(s),s(e.value)}),Md.forEach(o);let c=e=>{let t=i(e);return t.tokens.slice(t.start,t.end)},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=e=>{let t=u.get(e);if(t)return t;let n=g_(c(e),e,l);return u.set(e,n),n},f=e=>l.get(e)??d(e),p=/* @__PURE__ */ new Set,m=(e,t)=>l.has(t)||p.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(f),...e.instances.filter(t=>m(e,t)).map(f),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},ee=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!m(n,e));return i===void 0?h(n,r,t):[n,i]};return t},te=ee(e=>e.extends),g=ee(e=>e.instances),ne=/* @__PURE__ */ new Set([void 0]),_=/* @__PURE__ */ new Map;y_(c(void 0)).forEach((e,t)=>{t===3&&Pd.forEach(o),o(e)});let re=d(void 0);for(;;){let t=te(re,/* @__PURE__ */ new Set)??g(re,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(p.add(`${n.key}>${r}`),_.set(n.unit,[..._.get(n.unit)??[],r]),!ne.has(r)){if(ne.add(r),i(r).tokens.length===0){let t=n.unit??b_(i(void 0).tokens);throw e.P(r,t)}y_(c(r)).forEach(o)}}o_.forEach(o);let v=/* @__PURE__ */ new Set,y=e=>{if(v.has(e))return;v.add(e);let t=_.get(e)??[],n=d(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(y),c(e).forEach(e=>{e.kind===`String`&&o(e.text)})};return y(void 0),Nd.forEach(o),[...a]},k_=t=>{switch(t.kind){case`Number`:if(!j(t.value))throw e.G(new e.S(`Integer overflow: ${t.value} is outside TLC's 32-bit range`),e.U.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return st(t.name);case`Set`:return nn(t.elements.map(k_))}},A_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],j_=(t,n)=>{try{return Np(t)}catch(r){if(!(r instanceof e.D))throw r;let i=ap(t);throw i===void 0?r:e.F([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},M_=t=>new e.D(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),N_=(t,n)=>t.location.range&&n.location.range&&{location:e.R(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.R(n.location.range)}.`},P_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,F_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:P_(e),I_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Xo(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),L_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>L(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.g(`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`)&&xt(e,r)})});if(n)return n[1];throw new e.g(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},R_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||E(e).some(e=>R_(e,t)),z_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Go(e),n.get(e)??n.size)),n},B_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),V_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Yc(e);if(e.kind===`Number`&&!j(e.value))throw Xc(e);V_(e.kind===`Let`?[...E(e),...B_(e.instances??[])]:E(e))}),H_=(t,n)=>{let r=Np(n.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set,c=new Map(Kh.map(e=>[e.name,e])),l=/* @__PURE__ */ new Map,u=_m(t.checkDeadlock,n.seed);u.isWarningEnabled=n.isWarningEnabled??!0,u.isTool=n.isTool??!1,u.version=n.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=/* @__PURE__ */ new Map,ee=[],te=[],g=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},_=e=>`${e}#${ne.value++}`,re=[],v=[],y=a_(e=>{let t=p.get(e)??fe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),ie=/* @__PURE__ */ new Map,ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=e=>{let t=l.get(e);if(t)return t;let r=lg(e,n.print,u,n.files,c);if(!r)return;cg.get(e)?.forEach(se);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>se(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{c.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:ug.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:fg(e,t.name)??i.get(t.name)?.range})}),l.set(e,i),i},ce=e=>{if(Fd.has(e)&&n.loadModule?.(e)!==void 0)return;let t=se(e),r=cg.get(e)??[];return t&&g(e,r),t&&r.includes(`Integers`)&&se(`Integers`),t},le=e=>(V_([...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]),...B_(e.instances)]),e.modules.forEach(le),e);le(r);let ue=(t,r)=>{let i=n.loadModule?.(t)??Ee.get(t)??jp(n.source,t);if(i===void 0)throw e.P(t,r);let a=j_(i,t);if(a.name!==t)throw e.F([{location:`Unknown location`,message:`File name '${t}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return le(a)},de=t=>{let n=te.indexOf(t.name);if(n!==-1){let r=[...te.slice(n),t.name].map(e=>`${e}.tla`);throw new e.D(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];te.push(t.name),ee.push(r);let s=ve(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:v,levelChecks:o});if(ee.pop(),te.pop(),a.length>0)throw e.F(a,!1,void 0,v);let c=i.find(e=>r.has(e.name)),l=c&&d.get(c.name),u=l&&N_(c,l.module);if(u)throw e.F([u],!1,void 0,v);if(c)throw M_(c);return o.forEach(e=>e()),{linked:s,closure:r}},fe=(e,t)=>{let r=d.get(e);if(r)return g(e,h.get(e)??[]),r;let a=de(ue(e,t));return(Cm(u.version).has(e)?lg(e,n.print,u,n.files,c):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(c.set(t.key,e),i.delete(t.key))}),d.set(e,a.linked),h.set(e,a.closure),g(e,a.closure),a.linked},b=(e,t,n,r,c)=>{let l=c?void 0:ce(e.module);if(l)return x(e,l);let u=c??fe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=A_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=To(Tg(e,t),d,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=rs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Ao(t,p)])),variables:new Set(u.variables),getDefinition:e=>i.get(e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,c,l)=>{let u=_(`${c}@${t.name}`),f=l(u);return i.set(u,f),d.length>0&&s.add(f),e.name!==void 0&&ae.set(u,`${e.name}!${ae.get(n)??c}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:_});return S(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&ie.set(r,{name:n,location:e.location}),e.name!==void 0&&oe.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:a.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:Zo(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),pe=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),me=(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=pe(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Zo(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:ce(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=pe(n.arity);return C(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=r??fe(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=A_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>R_(f(e),p),h=d.map(t=>{let n=me(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),ee=[],te=rs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Zo(e.params,o),location:o,resolution:la}:Xo(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),isParameterized:e=>a.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${ee.length}`,a=r(i);return ee.push(a.kind===`Operator`?{...a,name:i}:I_(a,i)),i},createName:_}),g=new Set(d.map(e=>e.name)),v=[...c.exported].filter(([e])=>!g.has(e)).map(([t,n])=>{let r=te.getKey(n.key),i=pe(n.arity),a=[...e.params,...i];return C(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...ee,...v]},ge=e=>[...e].flatMap(([e,t])=>{let n=i.get(t.key);return n?[{...n,name:e}]:[]}),_e=/* @__PURE__ */ new Map,ve=(t,o)=>{let s=kd(t,n.loadClass?.(t.name),t===r);_e.set(t.name,s.overrides);let c=s.module,l=re.length,u=new Map([...Kh.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...o.symbols]),d=/* @__PURE__ */ new Map,h={location:bo,errors:[],warnings:[]},ee=[h],te=t=>t.forEach((t,n)=>{let r=g.get(n);if(!r){u.set(n,t),g.set(n,t);return}if(!r.range||!t.range||e.R(r.range)===e.R(t.range))return;let i=e.R(t.range),a=e.R(r.range);F_(r.kind)===F_(t.kind)?h.warnings.push({location:i,message:`Warning: the ${P_(r.kind)} of '${n}' conflicts with \nits ${P_(r.kind)} at ${a}.`}):h.errors.push({location:i,message:`The ${P_(t.kind)} of '${n}' conflicts with \nits ${P_(r.kind)} at ${a}.`})}),g=/* @__PURE__ */ new Map,ne=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,ie=[],ae=[...c.constants],se=c.variables.map(e=>e.name),le=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=o.modules.get(e),n=t?void 0:ce(e);if(n){te(n);return}let r=t??fe(e,c.name);ae.push(...r.constants.filter(e=>ae.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{se.includes(e)||(se.push(e),le.push(r.variableLocations[t]))}),te(r.exported),r.facts.forEach(e=>ne.add(e)),r.modules.forEach((e,t)=>_.set(t,e)),ie.push(r)});let ue=new Map(u),de=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],C=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});de.forEach(e=>g.set(e.name,C(e)));let pe=e=>({key:w(e),arity:ga(e),params:_a(e),kind:xo(c,e)?`Theorem`:`Definition`,range:e.location.range}),me=ae.length===0&&se.length===0,w=e=>c===r?e.name:`${e.name}@${o.id}`,T=/* @__PURE__ */ new Map,ye=()=>new Map([...o.modules,..._]),be=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&ha(e.location,t.location)},xe=e=>{let t=c.modules.find(t=>t.name===e.module);return t?be(t)?_.get(t.name):void 0:ye().get(e.module)},Se=e=>({imported:u,getInstance:e=>{let t=xe(e),n=t?void 0:ce(e.module);if(n)return{declarations:[],symbols:x(e,n),instancer:c.name};let r=t??fe(e.module,c.name),i=A_(r);return{declarations:i,symbols:S(e,r.exported,i,e=>e),instancer:c.name}},bound:ue,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:w,instanced:T,facts:ne,reports:ee,warnings:o.warnings}),E=e=>[...de.filter(t=>ha(t.location,e)).map(e=>[e.name,C(e)]),...c.definitions.filter(t=>ha(t.location,e)).map(e=>[e.name,pe(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),D=e=>{let t=ye(),n=t.get(e.name),r=n&&N_(e,n.module);if(n&&!r)throw M_(e);o.nested.push(e);let i={location:e.location,errors:[],warnings:[]};ee.push(i);let a=ve(e,{id:`${o.id}/${e.name}`,symbols:E(e.location),modules:t,nested:o.nested,errors:i.errors,warnings:i.warnings,levelChecks:o.levelChecks});r&&i.errors.push(r),n||_.set(e.name,a),f.has(e.name)||f.set(e.name,a)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=b(e,c,Se(c),me,ye().get(e.module));T.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||g.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>D(e)}))].sort((e,t)=>ha(e.location,t.location)?-1:1).forEach(e=>e.link());let Ce=Eg(ss(c,(e,t)=>he(e,t,c.name,xe(e))),ge(u));o.errors.push(...Do(Ce,Se(Ce))),Ce.definitions.forEach(e=>{let t=w(e);i.set(t,e),a.set(t,!me);let n=pe(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ha(r,e.location))&&(u.set(e.name,n),e.isLocal||g.set(e.name,n))});let we={module:Ce,constants:ae,variables:se,variableLocations:le,visible:u,exported:g,modules:_,extended:ie,facts:/* @__PURE__ */ new Set([...ne,...[...Ce.theorems,...Ce.assumptions].flatMap(e=>e.name??[])])};p.has(c.name)||p.set(c.name,we);let Te=re.splice(l).map(e=>({location:e.location,check:()=>y(e)}));return o.levelChecks.push(()=>r_(Ce,{constants:new Set(ae.map(e=>e.name)),variables:new Set(se),getDefinition:e=>i.get(u.get(e)?.key??e),getQualifiedName:e=>oe.get(u.get(e)?.key??e)},Te,v)),m.push(we),we},w=de(r).linked;v.length>0&&!n.isSanyReported&&n.print(e.z(v));let T=e=>w.visible.get(e)?.key??e;w.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)});let ye=[],be=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>be(e,t)),ye.push(...e.module.assumptions))};be(w,/* @__PURE__ */ new Set);let xe=w.constants.map(e=>e.name),Se=w.variables,E=e=>e.module===void 0?[e.name,T(e.name)]:e.module===r.name||xe.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],D=e=>{let t=i.get(e);return t?.kind===`Operator`?t.params.length:w.constants.find(t=>t.name===e)?.arity??0},Ce=/* @__PURE__ */ new Map,we=/* @__PURE__ */ new Set,Te=(e,t)=>{c.set(e,t),i.delete(e),Ce.delete(e),we.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=k_(e.value);$t(t),E(e).forEach(e=>{let n=D(e);n===0?Ce.set(e,t):Te(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let De=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=De.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.m(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(k_),k_(t.value)]),De.set(n,r)}),De.forEach(e=>E(e).forEach(t=>Te(t,L_(e.name,D(t)||e.rows[0][0].length,e.rows))));let Oe=new Map(t.substitutions.flatMap(e=>E(e).map(t=>[t,T(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,a=n.target;if(!xe.includes(r)&&!w.visible.has(r))throw new e.m(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===a))throw new e.m(`In the configuration file, the identifier ${a} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let o=T(a),s=i.get(o);if(!(s!==void 0||c.has(o)||Ce.has(o)||xe.includes(a)||Se.includes(a)))throw new e.m(`The configuration file substitutes for ${r} with the undefined identifier ${a}.`);if(s?.kind===`Operator`&&s.params.length!==(w.constants.find(e=>e.name===r)?.arity??w.visible.get(r)?.arity))throw new e.m(`The configuration file substitutes for ${r} with ${a} of different number of arguments.`)});let ke=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(E)),Ae=(e,t)=>{if(ke.has(e))return{key:e,prefix:t};let n=o.get(e);return n&&Ae(n.source,t+n.prefix)};o.forEach((e,t)=>{let n=Ae(e.source,e.prefix),r=i.get(t);if(!n||!r)return;let a=r.kind===`Operator`?r.params:[],o=C(t,n.key,a,a.slice(n.prefix),r.location);i.set(t,o),w.visible.forEach((e,n)=>{e.key===t&&n!==t&&i.set(n,o)})});let je=xe.filter(e=>!Ce.has(e)&&!Oe.has(e)&&!we.has(e));if(je.length>0&&!n.isUnconfigured){let t=T_(n.source,n.loadModule,`constant`).find(e=>je.includes(e))??je[0];throw new e.m(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&c.forEach((e,t)=>{let n=Zh(e);n&&c.set(t,n)});let Me={runtime:u,definitions:i,builtins:c,constants:Ce,substitutions:Oe,instanceNames:ae,variables:Se,variableIndex:z_(Se,m.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:s,evaluators:/* @__PURE__ */ new WeakMap},O=t_({constants:new Set(Ce.keys()),variables:/* @__PURE__ */ new Set([...Se,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>c.has(e))]),getDefinition:e=>sl(e,Me)}),Ne=t=>{try{H(t,{environment:Me,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.g)return t;throw t}};Oe.forEach((t,n)=>{let r=i.get(t),a=xe.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&O.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ne(r.body):void 0;if(a){let r=Hi(a)?``:` - specifically: ${a.message}`;throw new e.m(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),u.version!==`1.7.4`&&(u.isStarted=!0);let k=new Set(m.flatMap(e=>e.module.instances.map(e=>e.module))),A=E_(n.source,n.loadModule);return{environment:Me,assumptions:ye,variableLocations:w.variableLocations,instanceActions:ie,startupDefinitions:m.filter(e=>!k.has(e.module.name)||A_(e).length===0).flatMap(e=>A(e===w?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:w.constants,rootSymbols:w.visible,javaOverrides:m.flatMap(e=>_e.get(e.module.name)??[])}},U_={kind:`Boolean`,value:!0},W_={kind:`Boolean`,value:!1},G_=e=>e?U_:W_,K_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,q_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),J_=(e,t,n)=>({kind:e,operands:[t,n]}),Y_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Y_(e,t.operands).operands:[t])}),X_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return X_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,X_(t)),0)}},Z_=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 Z_(e.body);case`And`:case`Or`:return e.operands.some(Z_)}},Q_=/* @__PURE__ */ new WeakMap,$_={count:0},ev=e=>{let t=Q_.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`#${$_.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(ev).join(`,`)})`;default:return`${e.kind}(${ev(e.body)})`}})();return Q_.set(e,n),n},tv=(e,t)=>e===t||ev(e)===ev(t),nv=(e,t)=>{let n=ev(t);return e.some(e=>e===t||ev(e)===n)},rv=e=>e===`And`?`Or`:`And`,iv=(e,t)=>{switch(e.kind){case`Boolean`:return t?G_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return iv(e.body,!t);case`And`:case`Or`:return Y_(t?rv(e.kind):e.kind,e.operands.map(e=>iv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,iv(e.body,t))}}},av=e=>{switch(e.kind){case`Boolean`:return G_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Y_(rv(e.kind),e.operands.map(av));case`Always`:return $(`Eventually`,av(e.body));case`Eventually`:return $(`Always`,av(e.body));default:return $(`Not`,e)}},ov=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=ov(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return G_(t)}return n.length===0?G_(!t):n.length===1?n[0]:Y_(e.kind,n)}case`Not`:{let t=ov(e.body);return t.kind===`Boolean`?G_(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=ov(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},sv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,cv=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=cv(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.g(`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=>Y_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=cv(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=sv(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:Y_(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return Y_(`Or`,n)}case`Not`:return K_(t.body)?t:cv(av(t.body));default:return t}},lv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?lv(e.operands[0]):Y_(e.kind,e.operands.map(lv));case`Not`:return e.body.kind===`Not`?lv(e.body.body):$(`Not`,lv(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,lv(e.body));default:return e}},uv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return uv(e.operands[0]);let t=Math.floor(e.operands.length/2);return J_(e.kind,uv(Y_(e.kind,e.operands.slice(0,t))),uv(Y_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,uv(e.body));default:return e}},dv=(e,t)=>{e.kind===`Eventually`&&!nv(t,e)&&t.push(e),`body`in e&&dv(e.body,t),`operands`in e&&e.operands.forEach(e=>dv(e,t))},fv=e=>{let t=e.filter(q_),n=e.flatMap(e=>e.kind===`Not`&&q_(e.body)?[e.body]:[]);return!t.some(e=>nv(n,e))},pv=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.g(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},mv=(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]}},hv=(e,t,n)=>e.flatMap(e=>{let r=mv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),gv=e=>[...new Set(e.map(ev))].sort().join(`|`),_v=(e,t)=>{let n=new Set(t.map(gv));return[...e.filter(e=>!n.has(gv(e))),...t]},vv=e=>{let t=pv(e),n=hv(t,`Always`,`And`),r=hv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=mv(t,`Eventually`,`Or`);if(n&&!(nv(e,n.first)||nv(e,n.second)))return _v(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(nv(e,t.first)||nv(e,t.second))&&!nv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!fv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=mv(t[e],`Always`,`And`);n&&(nv(t,n.first)||t.push(n.first),nv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)nv(t,e.first)&&nv(t,e.second)&&!nv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!fv(t)?[]:i(t)};return a(e)},yv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>X_(e)<=1)}),bv=e=>{let t=vv([e]).map(yv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=gv(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 vv(n)){let n=gv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(yv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},xv=(e,t)=>!nv(e,t)||nv(e,t.body),Sv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&X_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=sv(t);if(r){let e=X_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(Z_(t))throw new e.g(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},Cv=(e,t)=>{let n=e.findIndex(e=>tv(e,t));return n===-1?(e.push(t),e.length-1):n},wv=e=>{let t=cv(ov(iv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=lv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Sv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Y_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:tv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&uv(e.formula),n=[];t&&dv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Cv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Cv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Cv(i,e))}));return{tableau:t&&bv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Tv=()=>e.G(new e.g(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.U.livenessEvaluationFailure),Ev=/* @__PURE__ */ new Set([`~>`,`-+->`]),Dv=/* @__PURE__ */ new WeakMap,Ov=/* @__PURE__ */ new WeakSet,kv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Av=(t,n)=>new e.g(`TLC cannot handle the temporal formula ${Vc(t)}${n===void 0?``:`:\n${n}`}`),jv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=el(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return jv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?jv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=sl(e,n);if(t)return Mv(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:D(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Io(e,(e,a)=>(i.value=Math.max(i.value,jv(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 Ev.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Mv=(e,t)=>{let n=Dv.get(e);if(n!==void 0)return n;Dv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(jv(e.body,void 0,t),...r.map(e=>jv(e.set,void 0,t)));return Dv.set(e,i),i},Nv=(t,n)=>{try{return bl(t,n)}catch(t){if(!(t instanceof e.g))throw t;if(!Hi(t))return;throw e.G(new e.g(`${e.M}${t.message}`),e.U.error)}},Pv=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s)=>{let c=(e,t,n=s,c=a,l)=>Pv(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,Vc(e)));if(t.kind===`Label`)return c(t.body,n);if(t.kind===`Let`)return c(t.body,Fv(t,n,r));if(t.kind===`Identifier`){let i=D(t)?el(n,t.name):void 0;if(i?.kind===`Thunk`)return c(i.expression,i.scope);let o=r.constants.has(t.name)?void 0:sl(t.name,r);if(!i&&o?.kind===`Operator`&&o.params.length===0&&Mv(o,r)>0){if(a.has(o))throw e.L();return c(o.body,void 0,o.name,/* @__PURE__ */ new Set([...a,o]),o)}}let l=kv(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||jv(t,n,r)===3)){let e=Gl(t,l),n=D(t)?void 0:sl(t.operator,r);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&!o)return c(e.body,au(e,t.args,l),t.operator,a,n)}let u=i&&t.kind===`Forall`&&t.bounds.every(e=>jv(e.set,n,r)===0),d=u?Nv(t.bounds,l):void 0;if(u&&d){let e=[];if(xl(t.bounds,d,n,n=>(e.push(...c(t.body,n,Vc(t.body))),!1)),e.length===0)throw Tv();return e}return[{expression:t,scope:n,name:s}]},Fv=(e,t,n)=>{let r=su(e.definitions,kv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Ov.add(e.binding);return r},Iv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?jv(t,n,r):a;if(o===0){let i=H(t,kv(r,n));if(typeof i!=`boolean`)throw new e.g(`TLC expected a boolean value, but did not find one. ${Hc(t)}`);return G_(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.L();o.depth++;let s=p(t,n);o.depth--;let c=X_(s);return c>2?s:a(r,i,c)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=kv(r,t),o=D(e)||sl(n,r)===void 0?el(t,n):void 0;if(o?.kind===`Thunk`&&Ov.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:D(e)?Kl(n,a):Ul(n,r);if(c?.kind!==`Closure`)throw Av(e);let u=e.kind===`Apply`?e.args:[],d=!D(e)&&sl(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,au(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.E||r&&!i;throw!(n instanceof e.g)||a?n:Av(t)}},u=(t,n)=>{let i=jv(t,n,r);if(!t.bounds.every(e=>jv(e.set,n,r)===0)){if(i<=2)return a(t,n,i);throw Av(t)}let o=[],s=t.kind===`Forall`;try{Sl(t.bounds,kv(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.g)||r instanceof e.E)throw r;if(i<=2)return a(t,n,i);throw Av(t,s&&!Hi(r)?r.message:void 0)}return o.length===0?G_(s):d(t,n,Y_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=X_(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===`~`&&!D(e)||e.operator===`=>`),p=(e,t)=>{let n=jv(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,Fv(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,J_(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!D(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,J_(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,Y_(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&jv(e.condition,t,r)===0){let n=H(e.condition,kv(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,J_(`Or`,J_(`And`,n,p(e.consequent,t)),J_(`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`,J_(`Or`,i,a))):J_(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Av(e)}};return p(t,n)},Lv=(t,n,r,i,a)=>{let o=e=>Lv(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`?ol(H(t.expression,r),`a temporal property predicate`):Ac(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&&ol(H(t.unchanged,e),`a subscript`)?!1:ol(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 Lv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.g(`TLC cannot evaluate a temporal formula in a single step`)}},Rv=(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)=>Rv(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 Lv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},zv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Bv=(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},Vv=t=>e.G(new e.g(`${e.N}${t}`),e.U.error),Hv=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!A(e)||!A(i))throw Vv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Uv=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Uv);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Wv=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Gv=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.m(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Vv(`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)||!N(o))throw Vv(`The symmetry operator must specify a set of functions.`);let s=P(o).elements;if(!s.every(k))throw Vv(`The symmetry values must be function records.`);let c=s.map(Hv),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=Uv(Wv(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Mi.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(zv(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=Bv(n,e),r=zv(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),ee=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!Wv(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||ee.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>A(e)&&h.has(e.name))})),f.size===0)return;let te=Math.max(256,Math.floor(4194304/f.size));return{permutations:[...f.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:te})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:te}},Kv=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Yv(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(Yv(e[r],t));return a}},qv=(e,t)=>{let n=[],r=[];for(let i of e){let e=Yv(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(M);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(M(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},Jv=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Yv=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Jv(e);if(n===0||n>64)return Xv(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Xv(e,t),a=i!==e&&Ct(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},Xv=(e,t)=>{let n=e.kind;if(n===`Set`){let n=qv(e.elements,t);return n?ct(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=Kv(n.domain,t),i=Kv(n.range,t)??n.range;if(r){let e=ln(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?lt(n.domain,e.range):e}return i===n.range?n:lt(n.domain,i)}if(n===`Interval`||!O(e)||!N(e))return e;let r=P(e),i=Kv(r.elements,t);return i?nn(i):r},Zv=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},Qv=(e,t,n)=>e.images[t]??=Yv(e.images[0],n.permutations[t-1]),$v=(e,t,n,r)=>{let i=Zv(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=M(Qv(i,t,r),Qv(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},ey=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?$v(i,t,n,r):0;if(o!==0)return o<0}return!1},ty=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>ey(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?Qv(Zv(e,t),r,t):e)},ny={line:0,column:0},ry=e=>({kind:`Identifier`,name:e,location:ny}),iy=/* @__PURE__ */ new Set([`name`,`property`]),ay=(t,n,r)=>{let i=sl(n,r);if(!i)throw new e.m(`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.m(iy.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},oy=(t,n,r)=>{if(dl(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return H(ry(t),Oy(r,void 0,void 0))}catch(t){if(t instanceof e.g||e.H(t))return;throw t}},sy=(t,n,r)=>{let i=ay(t,n,r);if(oy(n,i,r)!==void 0)throw new e.m(`The ${t} ${n} cannot be a constant.`);return i},cy=(t,n,r)=>{let i=r.constants.has(n)?void 0:ay(t,n,r),a=i?oy(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.m(`The ${t} of ${n} is equal to ${L(a)}`);return a===void 0?i:void 0},ly=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},uy=(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})),zl(e.startupDefinitions,r),t.invariants.forEach(e=>{cy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},dy=(t,n)=>{let r=t_({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>sl(e,n)});return t.flatMap(t=>{let i=cy(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1766
1766
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1767
1767
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1768
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.G(new e.m(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.U.safetyEvaluationFailure)}return[{name:t,expression:$v(t),scope:void 0}]})},cy=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>cy(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=rl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return cy(n.body,t)}return[e]},ly=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||Dv(i,t.scope,n)>0)return!1;let a=H(i,wy(n,void 0,void 0,t.scope));if(a===!1)throw new e.m(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.m(`The operator ${i.name}, which equals ${L(a)},\ncannot be used as a ${r}`);return!0},uy=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return ry(t,e,n),$v(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.m(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=ty(`name`,t.specification,n),s=ny(t.specification,o,n);if(s!==void 0)throw new e.m(`The value of ${t.specification} is equal to ${L(s)}`);if(Av(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(ly(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.G(new e.m(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.U.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.G(new e.g(`TLC cannot handle the temporal formula ${Lc(s.expression)}`),e.U.error);let c=Dv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.m(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.m(`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:Qv},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},dy=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=iy(`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`;Av(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(ly(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`&&!D(e)?rl(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.m(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},fy=(e,t,n)=>t.flatMap(t=>iy(e,t,n)?[{name:t,expression:$v(t),scope:void 0}]:[]),py=(e,t)=>{let n=rl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},my=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.m(`_POSSIBLE lists ${r} more than once`);ry(`possible`,r,n);let a=$v(r);if(Dv(a,void 0,n)===3)throw new e.m(`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}}),hy=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||D(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},gy=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=rl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},_y=(e,t)=>e.flatMap(e=>cy(e.expression,t).map(n=>{let r=e.scope===void 0?ca(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:hy(n,r,t),predicate:gy(e.expression,t)}})),vy=(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},yy=/[\u0100-\uffff]/,by=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),xy=e=>e.kind===`String`?yy.test(e.value):e.kind===`Set`&&e.elements.some(xy),Sy=e=>e.kind===`String`&&yy.test(e.value)||e.kind===`Apply`&&by.has(e.operator)||E(e).some(Sy),Cy=(e,t)=>e.constants.some(e=>xy(e.value)||(e.args??[]).some(xy))||[...t.definitions.values()].some(e=>Sy(e.body)||e.kind===`Function`&&e.bounds.some(e=>Sy(e.set))),wy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Ty=(e,t,n)=>nl(H(e,t),n),Ey=(t,n,r=Dy)=>{let i=H(t,n);if(typeof i!=`boolean`)throw new e.g(r(t,n.environment));return i},Dy=(e,t)=>{let n=e.kind===`Identifier`?rl(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`?Ic(i):Rc(r)}`},Oy=(e,t)=>Ey(e.expression,t,(n,r)=>(Ey(e.predicate,t),Dy(n,r))),ky=()=>{},Ay=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Ty(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),jy=(t,n,r)=>{try{return Ty(t,wy(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e.g)return{message:t.message};throw t}},My=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=jy(n.expression,t,`an assumption`);if(e)return{name:Lc(n.expression),trace:[],message:e.message}}},Ny=(t,n,r,i)=>{let a=sy(t.invariants,n),o=uy(t,n),s=dy(t,n,i),c=_y([...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.m(n.runtime.version===`1.7.4`?Ii:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.m(`The configuration file did not specify the next state predicate.`);let d=_y(fy(`constraint`,t.constraints,n),n),f=fy(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&ty(`rlreward`,t.rlReward,n),t.periodic!==void 0&&ty(`periodic`,t.periodic,n);let p=my(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:Vv(t.symmetry,n,t.substitutions);t.view!==void 0&&ty(`view function`,t.view,n);let h=t.view===void 0?void 0:{name:t.view,expression:$v(t.view),scope:void 0},ee=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Qv};return{...e,unchanged:t}}),te=e=>Dv(e.expression,void 0,n)>=2,g=p.filter(e=>!te(e)),ne=p.filter(te),_=n.runtime,re={indices:void 0},v=()=>{if(re.indices)return re.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return re.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),re.indices},y=(e,t)=>H(e,wy(n,t,void 0)),ie=e=>{let t=v(),n=m===void 0?e:Zv(e,m,t);return Up(h===void 0?t.map(e=>n[e]):[y(h.expression,n)])},ae=Cy(t,n);_.getFingerprint=ie;let oe=()=>{let e=p.find(e=>!_.possibleCounts.get(e.name));if(!e)return;let t=py(e.name,n),r=t?` at ${Ic(t)}`:``;return{name:e.name,code:Mi.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:Me(L(mm(_),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:v,getStoredFingerprints:(e,t)=>{if(h!==void 0||ae)return BigInt64Array.from(e,ie);let n=new BigInt64Array(t.length),r=Kp(v(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(ie(e))];let t=m===void 0?e:Zv(e,m,v());return h===void 0?t:[y(h.expression,t)]},findViolatedInvariant:(t,r)=>c.find(i=>{if(vy(i,t,r))return!1;try{let e=wy(n,t,void 0,i.scope),a=i.membership;return r&&a?!$n(t[a.variable],r[a.variable],H(a.set,e)):!Oy(i,e)}catch(t){throw r?Xi(e.G(t,e.U.safetyEvaluationFailure),Mi.invariantEvaluationFailed,`Evaluating invariant ${i.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Ey(n,wy(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=>Ey(e.predicate,wy(n,t,void 0,e.scope)))&&f.every(r=>Ey(r.expression,wy(n,e,t,r.scope))))||r())||l.every(e=>Ey(e.predicate,wy(n,t,void 0,e.scope))))&&ee.every(r=>Ey(r.box,wy(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>vy(r,e,t)||Oy(r,wy(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Ey(t.expression,wy(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>ee.find(r=>{try{return!Ey(r.action,wy(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Lc(r.box)}`)&&!Ty(r.unchanged,wy(n,e,t,r.scope),`a subscript`)}catch(e){throw Xi(Py(e),Mi.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>Ey(i.expression,wy(n,t,r),t=>`${e.N}${Dy(t,n)}`)),trackStatePossible:g.length===0?ky:e=>Ay(g,_,wy(n,e,void 0)),trackActionPossible:ne.length===0?ky:(e,t)=>Ay(ne,_,wy(n,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=rl(e,n);return t!==void 0&&n.definitionValues.has(t)});if(i!==void 0){if(r)return;throw e.G(new e.g(`${e.N}The post condition ${i} cannot be a constant.`),e.U.error)}let a=oe();if(a)return a;for(let e of t.postconditions){let t=jy($v(e),n,`a postcondition`);if(!t)continue;let r=py(e,n),i=r?` at ${Ic(r)}`:``;return t.message===void 0?{name:e,code:Mi.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Mi.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},Py=t=>t instanceof e.S?e.G(t,t.exitCode):t,Fy=(e,t)=>e*((t-e)/2**64),Iy=e=>e.includes(`.`)?e:`${e}.0`,Ly=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Iy(String(e));let[n,r]=e.toExponential().split(`e`);return`${Iy(n)}E${r.replace(`+`,``)}`},Ry=e=>e!==void 0&&e>=`0`&&e<=`9`,zy=e=>{if(e===0)return`0.0`;let t=Ly(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Ry(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(;Ry(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Ry(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Ry(t[n.next])&&Number(t[n.next])>=5&&(n.result=By(n.result));Ry(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},By=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${By(r)}.`:n===`9`?`${By(r)}0`:`${r}${Number(n)+1}`},Vy=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}`)},Hy=(e,t,n)=>{if(Fy(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},Uy=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}).`},Wy=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Gy=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^xr(e[t]),16777619),r=Math.imul(r^Or(e[t]),1540483477);t[0]=Wy(n)||1,t[1]=Wy(r)},Ky=()=>{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)}}},qy=(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}},Jy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Yy=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return qy(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Xy=e=>Atomics.load(e.used,0)*2>=e.slots.length,Zy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&qy(t,n);return{slots:t,used:e.used}},Qy=[void 0,`lambda`,`tuple`,`record`],$y=()=>{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=sr(e.domain);return t?(r(7),r(Qy.indexOf(ft(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Qy.indexOf(ft(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})}},eb=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 st(t.strings[n[r.index++]]);if(e===5)return ct(i(n[r.index++]));let a=Qy[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=_n({kind:`Interval`,low:e,high:e+t-1});return dt(lt(o,i(t)),a)}let o=n[r.index++],s=i(o);return dt(lt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Ic}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return X_}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return yn}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Up}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Je}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Nv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return Zi}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return G_}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Mv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return gh}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Qe}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return tp}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return xe}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return kp}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return _h}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return xr}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return tu}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return Dd}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return Se}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return vm}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return k}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return R_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return w_}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return yr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return C_}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return br}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return vl}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return _m}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Ct}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return xv}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Hi}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Dv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return fr}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return jp}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return E}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Dp}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return Xe}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Ap}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return D}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Lc}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return te}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Au}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return ry}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Ji}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Zy}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return zl}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return oy}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return aa}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Gy}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Oc}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Hy}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Is}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return rl}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Fy}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Mi}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return My}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Ny}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Jy}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Xc}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return _v}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return zr}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return bv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return nn}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return zy}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Ac}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return $v}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Fi}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return $y}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return sl}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Yy}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Dc}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Uy}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Ni}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return ru}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return he}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Ky}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return mu}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Xy}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return kc}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return eb}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return hu}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Vy}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Fs}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return wy}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return qi}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Pv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return na}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Py}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return ta}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return ay}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Vi}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return ym}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return bt}});
|
|
1768
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.G(new e.m(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.U.safetyEvaluationFailure)}return[{name:t,expression:ry(t),scope:void 0}]})},fy=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>fy(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=sl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return fy(n.body,t)}return[e]},py=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||jv(i,t.scope,n)>0)return!1;let a=H(i,Oy(n,void 0,void 0,t.scope));if(a===!1)throw new e.m(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.m(`The operator ${i.name}, which equals ${L(a)},\ncannot be used as a ${r}`);return!0},my=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return sy(t,e,n),ry(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.m(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=ay(`name`,t.specification,n),s=oy(t.specification,o,n);if(s!==void 0)throw new e.m(`The value of ${t.specification} is equal to ${L(s)}`);if(Pv(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(py(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.G(new e.m(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.U.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){i.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&jv(s.expression,o.scope,n)<2)throw e.G(new e.g(`TLC cannot handle the temporal formula ${Vc(s.expression)}`),e.U.error);let c=jv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.m(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.m(`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:ny},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},hy=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=cy(`property`,t,n);if(!a)return;jv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;Pv(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(py(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`&&jv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!D(e)?sl(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=jv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2)throw new e.m(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},gy=(e,t,n)=>t.flatMap(t=>cy(e,t,n)?[{name:t,expression:ry(t),scope:void 0}]:[]),_y=(e,t)=>{let n=sl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},vy=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.m(`_POSSIBLE lists ${r} more than once`);sy(`possible`,r,n);let a=ry(r);if(jv(a,void 0,n)===3)throw new e.m(`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}}),yy=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||D(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},by=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=sl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},xy=(e,t)=>e.flatMap(e=>fy(e.expression,t).map(n=>{let r=e.scope===void 0?ca(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:yy(n,r,t),predicate:by(e.expression,t)}})),Sy=(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},Cy=/[\u0100-\uffff]/,wy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Ty=e=>e.kind===`String`?Cy.test(e.value):e.kind===`Set`&&e.elements.some(Ty),Ey=e=>e.kind===`String`&&Cy.test(e.value)||e.kind===`Apply`&&wy.has(e.operator)||E(e).some(Ey),Dy=(e,t)=>e.constants.some(e=>Ty(e.value)||(e.args??[]).some(Ty))||[...t.definitions.values()].some(e=>Ey(e.body)||e.kind===`Function`&&e.bounds.some(e=>Ey(e.set))),Oy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ky=(e,t,n)=>ol(H(e,t),n),Ay=(t,n,r=jy)=>{let i=H(t,n);if(typeof i!=`boolean`)throw new e.g(r(t,n.environment));return i},jy=(e,t)=>{let n=e.kind===`Identifier`?sl(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`?Bc(i):Hc(r)}`},My=(e,t)=>Ay(e.expression,t,(n,r)=>(Ay(e.predicate,t),jy(n,r))),Ny=()=>{},Py=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ky(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Fy=(t,n,r)=>{try{return ky(t,Oy(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e.g)return{message:t.message};throw t}},Iy=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Fy(n.expression,t,`an assumption`);if(e)return{name:Vc(n.expression),trace:[],message:e.message}}},Ly=(t,n,r,i)=>{let a=dy(t.invariants,n),o=my(t,n),s=hy(t,n,i),c=xy([...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.m(n.runtime.version===`1.7.4`?Ii:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.m(`The configuration file did not specify the next state predicate.`);let d=xy(gy(`constraint`,t.constraints,n),n),f=gy(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&ay(`rlreward`,t.rlReward,n),t.periodic!==void 0&&ay(`periodic`,t.periodic,n);let p=vy(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:Gv(t.symmetry,n,t.substitutions);t.view!==void 0&&ay(`view function`,t.view,n);let h=t.view===void 0?void 0:{name:t.view,expression:ry(t.view),scope:void 0},ee=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:ny};return{...e,unchanged:t}}),te=e=>jv(e.expression,void 0,n)>=2,g=p.filter(e=>!te(e)),ne=p.filter(te),_=n.runtime,re={indices:void 0},v=()=>{if(re.indices)return re.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return re.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),re.indices},y=(e,t)=>H(e,Oy(n,t,void 0)),ie=e=>{let t=v(),n=m===void 0?e:ty(e,m,t);return Jp(h===void 0?t.map(e=>n[e]):[y(h.expression,n)])},ae=Dy(t,n),oe;_.getFingerprint=ie;let se=()=>{let e=p.find(e=>!_.possibleCounts.get(e.name));if(!e)return;let t=_y(e.name,n),r=t?` at ${Bc(t)}`:``;return{name:e.name,code:Mi.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:Me(L(vm(_),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:v,getStoredFingerprints:(e,t)=>h!==void 0||ae?BigInt64Array.from(e,ie):(oe??=Xp(v()),oe(t)),getFingerprintState:e=>{if(ae)return[String(ie(e))];let t=m===void 0?e:ty(e,m,v());return h===void 0?t:[y(h.expression,t)]},findViolatedInvariant:(t,r)=>c.find(i=>{if(Sy(i,t,r))return!1;try{let e=Oy(n,t,void 0,i.scope),a=i.membership;return r&&a?!$n(t[a.variable],r[a.variable],H(a.set,e)):!My(i,e)}catch(t){throw r?Xi(e.G(t,e.U.safetyEvaluationFailure),Mi.invariantEvaluationFailed,`Evaluating invariant ${i.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Ay(n,Oy(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=>Ay(e.predicate,Oy(n,t,void 0,e.scope)))&&f.every(r=>Ay(r.expression,Oy(n,e,t,r.scope))))||r())||l.every(e=>Ay(e.predicate,Oy(n,t,void 0,e.scope))))&&ee.every(r=>Ay(r.box,Oy(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>Sy(r,e,t)||My(r,Oy(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Ay(t.expression,Oy(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>ee.find(r=>{try{return!Ay(r.action,Oy(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Vc(r.box)}`)&&!ky(r.unchanged,Oy(n,e,t,r.scope),`a subscript`)}catch(e){throw Xi(Ry(e),Mi.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>Ay(i.expression,Oy(n,t,r),t=>`${e.N}${jy(t,n)}`)),trackStatePossible:g.length===0?Ny:e=>Py(g,_,Oy(n,e,void 0)),trackActionPossible:ne.length===0?Ny:(e,t)=>Py(ne,_,Oy(n,e,t)),findUnwitnessedPossible:se,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=sl(e,n);return t!==void 0&&n.definitionValues.has(t)});if(i!==void 0){if(r)return;throw e.G(new e.g(`${e.N}The post condition ${i} cannot be a constant.`),e.U.error)}let a=se();if(a)return a;for(let e of t.postconditions){let t=Fy(ry(e),n,`a postcondition`);if(!t)continue;let r=_y(e,n),i=r?` at ${Bc(r)}`:``;return t.message===void 0?{name:e,code:Mi.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Mi.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},Ry=t=>t instanceof e.S?e.G(t,t.exitCode):t,zy=(e,t)=>e*((t-e)/2**64),By=e=>e.includes(`.`)?e:`${e}.0`,Vy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return By(String(e));let[n,r]=e.toExponential().split(`e`);return`${By(n)}E${r.replace(`+`,``)}`},Hy=e=>e!==void 0&&e>=`0`&&e<=`9`,Uy=e=>{if(e===0)return`0.0`;let t=Vy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Hy(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(;Hy(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Hy(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Hy(t[n.next])&&Number(t[n.next])>=5&&(n.result=Wy(n.result));Hy(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Wy=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Wy(r)}.`:n===`9`?`${Wy(r)}0`:`${r}${Number(n)+1}`},Gy=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}`)},Ky=(e,t,n)=>{if(zy(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},qy=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}).`},Jy=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Yy=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^xr(e[t]),16777619),r=Math.imul(r^Or(e[t]),1540483477);t[0]=Jy(n)||1,t[1]=Jy(r)},Xy=()=>{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)}}},Zy=(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}},Qy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),$y=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Zy(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},eb=e=>Atomics.load(e.used,0)*2>=e.slots.length,tb=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Zy(t,n);return{slots:t,used:e.used}},nb=[void 0,`lambda`,`tuple`,`record`],rb=()=>{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=sr(e.domain);return t?(r(7),r(nb.indexOf(ft(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(nb.indexOf(ft(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})}},ib=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 st(t.strings[n[r.index++]]);if(e===5)return ct(i(n[r.index++]));let a=nb[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=_n({kind:`Interval`,low:e,high:e+t-1});return dt(lt(o,i(t)),a)}let o=n[r.index++],s=i(o);return dt(lt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Bc}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ev}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return yn}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Je}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Lv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return Zi}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Y_}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Iv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return bh}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Qe}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return ap}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return xe}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Np}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return xh}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return xr}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return au}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return jd}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return Se}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return Sm}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return k}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return H_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return O_}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return yr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return D_}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return br}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Sl}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return xm}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Ct}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Tv}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Hi}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return jv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return fr}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Fp}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return E}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return jp}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return Xe}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Pp}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return D}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Vc}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return te}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Pu}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return sy}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Ji}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return tb}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Ul}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return uy}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return aa}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Yy}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Mc}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Ky}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Is}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return sl}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return zy}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Mi}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Iy}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Ly}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Qy}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return el}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return xv}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return zr}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return wv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return nn}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Uy}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Pc}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return ry}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Fi}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return rb}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return dl}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return $y}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return jc}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return qy}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Ni}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return su}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return he}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Xy}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return vu}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return eb}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Nc}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return ib}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return yu}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Gy}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Fs}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return Oy}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return qi}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Rv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return na}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Ry}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return ta}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return ly}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Vi}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return Cm}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return bt}});
|