tla-ts 0.0.9-dev.4ce0657 → 0.0.9-dev.8298a52

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/transfer.js CHANGED
@@ -83,7 +83,7 @@ _TEPosition ==
83
83
  THEN _TETraceLength
84
84
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
85
85
 
86
- =============================================================================`,Qe=/* @__PURE__ */ new Map([[`Reals`,Ye],[`RealTime`,Xe],[`Toolbox`,Ze]]),$e={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:` `}},et=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},tt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),nt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),rt=e=>{let t=t=>{let n=me(e,t,et);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=me(e,t,tt);if(e.startsWith(`..`,n)&&tt(e[n+2]))return{kind:`Constant`,first:t,last:me(e,n+2,tt)-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=tt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:me(e,t+1,tt)-1,children:[]};if(nt(n))return{kind:`Constant`,first:t,last:me(e,t,nt)-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)},it=e=>{let t=e.length===0?void 0:rt(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=$e[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),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},at=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,A=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ot=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),j=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,st=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),ct=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,lt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,ut={isUsed:!1},dt=(e,t)=>(ut.isUsed=!0,e.writtenKeys=t,e),ft=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[xr(e.domain,t)]]),pt=(e,t,n)=>dt(Zn(e,t),n),mt=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(mt);e.writtenKeys=void 0,e.range.forEach(mt)}},ht=e=>e.every(e=>typeof e==`string`),gt=(e,t)=>e.length>0&&t.length>0&&ht(e)!==ht(t),_t=(e,t)=>{ut.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return gt(n,r)?vn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ft(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:Ft(t,n);if(r!==0)return r}return 0},vt=(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=Ft(n[e],r[e]);if(t!==0)return t}return 0},yt=e=>M(e)?e.type:void 0,bt=(e,t,n)=>{let r=yt(e),i=yt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(M(e)&&M(t)){if(r===void 0||i===void 0||r===i)return;throw new m(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new m(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new m(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},xt={ranks:Object.create(null),size:0},St=e=>{xt.ranks=Object.create(null),xt.size=0,It.clear();for(let t of e)Tt(t)},Ct={is174:!1},wt=e=>{Ct.is174=e===`1.7.4`},Tt=e=>(xt.ranks[e]===void 0&&(xt.ranks[e]=xt.size++),e),Et=()=>xt.size,Dt=e=>Object.keys(xt.ranks).find(t=>xt.ranks[t]===e),Ot=e=>xt.ranks[Tt(e)],kt=(e,t)=>{if(e===t)return 0;let n=xt.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},At=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),jt=(e,t)=>(At(e)||At(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Mt=(e,t,n)=>{if(!At(e))throw new m(`Attempted to ${n} the set ${L(N(e)?P(e):e,!0)} with the value:\n${L(t,!0)}`);if(!At(t))throw new m(`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new m(`Attempted to compare ${L(e,!0)} with the value\n${L(t,!0)}`)},Nt={kind:`InfiniteSet`,name:`Any`},Pt=e=>{throw new m(`Attempted to compare ANY with the value\n${L(e)}`)},Ft=(e,t)=>{if(e===t)return ut.isUsed&&mt(e),e===Nt?Pt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return _t(e,t);if(n===`Set`&&r===`Set`)return vt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&bt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return bt(e,t,!1),n===`ModelValue`?-1:1;if(e===Nt||t===Nt)return Pt(e===Nt?t:e);if(A(e)&&A(t)&&jt(e,t))return Mt(e,t,`compare`);let i=A(e);if(i!==A(t))throw new m(`Attempted to compare ${ct(e)} ${L(e)} with ${ct(t)} ${L(t)}`);return i?vt(P(e),P(t)):_t(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return kt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(bt(e,t,!1),M(e))return-1;if(M(t))return 1;throw new m(`Attempted to compare ${ct(e)} ${L(e)} with ${ct(t)} ${L(t)}`)},It=/* @__PURE__ */ new Map,Lt=e=>{let t=It.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Ot(e),hash:Vr(Hr(Ur(e),109)),fingerprint:Qr($r(e)^60)};return It.set(e,n),n},Rt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),zt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Bt={isPresent:!1},Vt=(e,t)=>(t===`lambda`&&(Bt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ht=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ut=e=>Vt(e,`lambda`),Wt=e=>at(e)&&e.isCached===!0,Gt={isPresent:!1},Kt=e=>(Gt.isPresent=!0,e),qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Jt=e=>{Gt.isPresent&&typeof e==`object`&&at(e)&&qt.has(e.kind)&&(e.isCached=!0)},Yt=e=>{(Bt.isPresent||Gt.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Yt),e.range.forEach(Yt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Yt):A(e)&&N(e)&&(Jt(e),P(e).elements.forEach(Yt))))},Xt=(e,t)=>{if(Jt(e),e===t)return ut.isUsed&&mt(e),e!==Nt||Pt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&bt(e,t,!0),Ft(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return _t(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return vt(e,t)===0;if(M(e)||M(t))return bt(e,t,!0),M(e)&&M(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=A(e)&&A(t)&&!(N(e)&&N(t));if(n&&jt(e,t))return Mt(e,t,`check equality of`)===0;if(n){if(!At(e)){let n=P(e);if(!At(t))return vt(n,P(t))===0}return ii(e)===ii(t)}return Ft(e,t)===0},Zt=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):ii(n)===ii(r);return n},Qt=Zt(!1),$t=Zt(!0),en=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},tn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||$t(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||$t(i[e],n))return i[e]}return n.kind===`Set`?en(n.elements,t):(en(n.domain,t),en(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}},nn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rn=e=>{if(!j(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:nn(t.domain)}},an=e=>{if(!j(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},on=(e,t)=>(bt(t,e,!1),1),sn=(e,t)=>(bt(t,e,!0),!1),cn=(e,t)=>(e.type!==void 0&&bt(e,t,!1),M(t)?e.rank-t.rank:-1),ln=(e,t)=>(e.type!==void 0&&bt(e,t,!0),M(t)&&e.name===t.name),un={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`}},dn=(e,t,n)=>{let r=un[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)}`},fn=(e,t,n)=>{let r=rn(n);if(!r){if(M(n))return on(n,t);throw new m(`Attempted to compare the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>pn(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return pn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new m(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${L(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},pn=(e,t)=>{for(let n=0;n<e.length;n++){let r=vn(e[n],t[n]);if(r!==0)return r}return 0},mn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=j(t)?Sr(t):void 0;return r?n.range.length-r.length||pn(n.range,r):fn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(M(t))return on(t,e);throw new m(`Attempted to compare record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length-r.domain.length||pn(n.domain,r.domain)||pn(n.range,r.range)}return fn({...n,low:nn(n.domain)},e,t)},hn=(e,t)=>At(e)||At(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),gn=(e,t)=>{let n=st(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},_n=(e,t)=>{if(hn(e,t))return Ft(e,t);if(!st(e))return _n(P(e),t);if(!A(t)){if(M(t))return on(t,e);throw new m(`Attempted to compare the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length-n.otherElements.length||pn(n.elements,n.otherElements)},vn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Ft(e,t);if(M(t))return on(t,e);throw new m(dn(e,t,!1))}return e.kind===`ModelValue`?cn(e,t):j(e)?mn(e,t):_n(e,t)},yn=(e,t)=>e.every((e,n)=>Cn(e,t[n])),bn=(e,t,n)=>{let r=rn(n);if(!r){if(M(n))return sn(n,t);throw new m(`Attempted to check equality of the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&yn(e.range,r.range);let i=e.low??r.low;return i===void 0?yn(e.domain,r.domain)&&yn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new m(`Attempted to compare an integer with non-integer:\n${L(e)}.`);return e===i+t})&&yn(e.range,r.range)},xn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=j(t)?Sr(t):void 0;return r?n.range.length===r.length&&yn(n.range,r):bn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(M(t))return sn(t,e);throw new m(`Attempted to check equality of record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length===r.domain.length&&yn(n.domain,r.domain)&&yn(n.range,r.range)}return bn({...n,low:nn(n.domain)},e,t)},Sn=(e,t)=>{if(hn(e,t))return Xt(e,t);if(!st(e))return Sn(P(e),t);if(!A(t)){if(M(t))return sn(t,e);throw new m(`Attempted to check equality of the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length===n.otherElements.length&&yn(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(M(t))return sn(t,e);throw new m(dn(e,t,!0))}return e.kind===`ModelValue`?ln(e,t):j(e)?xn(e,t):Sn(e,t)},wn=e=>{let t=[];for(let n of e){let e=En(n,t);e.isFound||t.splice(e.index,0,n)}return t},Tn=(e,t)=>{let n=wr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},En=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Tn(e,()=>vn(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}},Dn=(e,t)=>t.some(t=>Tn(t,()=>Cn(t,e))),On=/* @__PURE__ */ new WeakSet,kn=e=>{typeof e==`object`&&(e.kind===`Set`&&(On.add(e),e.elements.forEach(kn)),e.kind===`Function`&&(e.domain.forEach(kn),e.range.forEach(kn)))},An=(e,t)=>Tr(Xt,Cn,e,t),jn=e=>{for(let t=1;t<e.length;t++)if(Ft(e[t-1],e[t])>=0)return!1;return!0},Mn=e=>{for(let t=1;t<e.length;t++)Jt(e[t]);if(e.length<2||jn(e))return Rt(e);let t=[...e].sort(Ft),n=[t[0]];for(let e=1;e<t.length;e++)Ft(n[n.length-1],t[e])!==0&&n.push(t[e]);return Rt(n)},Nn=e=>Tr(Mn,e=>({kind:`MixedSet`,elements:e}),e,void 0),Pn=Rt([]),Fn=(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&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0||i.push(t)}return i.length===n.length?e:Rt(i)},In=(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&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Rt(i)},Ln=(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=Ft(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=Rt(i);if(e.hash!==0&&e.hash!==Kr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zr(a[n]);if(e===Kr)break;t=t+Wr(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+ei(a[e])|0;c.fingerprint=t}return c},Rn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ft(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ft(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return zt(n,r)},zn=e=>{let t=Rn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:dt(t,e.map(e=>e[0]))},Bn=[],Vn=/* @__PURE__ */ new Map,Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Bn[e]??Vn.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Vn.set(e,new WeakRef(n)):Bn[e]=n,n},Gn=e=>{if(vr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Bn[e.length]||e===Vn.get(e.length)?.deref()||Un.has(e)),qn=e=>{let t=P(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Vt(zt(Wn(e.length),e),`tuple`),Xn=e=>Vt(Rn(e),`record`),Zn=(e,t)=>Vt(zt(e,t),`record`),Qn=e=>A(e)&&!At(e),$n=(e,t=!1)=>`UNION(${L(e.base,t)})`,er=(e,t=e=>P(e).elements)=>{if(!Qn(e.base))throw new m(`Attempted to enumerate the nonenumerable set:\n${$n(e)}`);return t(e.base)},tr=(e,t,n)=>{if(Qn(e))return e;throw new m(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${$n(n)}`)},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)||nr(e.domain)===!0||nr(e)===!0;case`RecordSet`:return e.sets.every(N)||nr(e)===!0;case`ProductSet`:return e.factors.every(N)||nr(e)===!0;case`Union`:return N(e.base)&&dr(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}},nr=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=nr(e.domain);return t===void 0?void 0:!t&&nr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=nr(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}},rr=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},ir=(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},ar=e=>{if(typeof e!=`object`||e.kind!==`Subset`||At(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=[]:ir(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Rt(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)})},or=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Rt(r.map(t=>e[t])));while(ir(r,e.length))}return t},sr=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(At(a))throw new m(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},cr=(e,t=e=>P(e).elements)=>{if(typeof e!=`object`)throw new m(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return wn(e.elements);case`Interval`:{let t=Gn(e);return t!==Bn[t.length]&&Un.set(t,e),t}case`Subset`:{if(vr(e.base)===0)return or([]);if(!A(e.base))throw new m(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${it(L(e.base))}`);let t=P(e.base).elements;if(t.length>30)throw new m(_r(e));return or(t)}case`FunctionSet`:{if(!Ct.is174&&F(e))return[];if(At(e.domain))throw new m(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||Ct.is174)&&At(e.range))throw new m(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return rr(n.map(()=>r)).map(e=>zt(n,e))}case`RecordSet`:{if(!Ct.is174&&F(e))return[];let n=sr(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${L(t)}`);return rr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Ct.is174&&F(e))return[];let n=sr(e.factors,t,(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 rr(n).map(Yn)}case`FilteredSet`:if(!A(e.base)||At(e.base))throw new m(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return P(e.base).elements.filter(e.test);case`Union`:{let t=er(e).flatMap((t,n)=>P(tr(t,n,e)).elements);return P(Nn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Qn(e.left)||!Qn(e.right)))throw new m(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Qn(e.left)&&!Qn(e.right))throw new m(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Qn(e.left))throw new m(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Tr(e=>Ln(P(e.left),P(e.right)).elements,e=>wn(lr(e)),e,e);let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return P(n).elements.filter(t=>Er(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new m(`Expected a set but found ${L(e)}`)}},P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Rt(cr(e));let t=typeof e==`object`&&at(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=wr.sets;n?.push(e);let r=cr(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`)?Rt(r):Mn(r);return t&&(t.enumerated=i),i},lr=e=>[...P(e.left).elements,...P(e.right).elements],ur=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?Tr(e=>P(e).elements,e=>wn(Tn(e,()=>lr(e))),e,e):P(e).elements,dr=e=>{if(typeof e!=`object`||Wt(e))return P(e).elements;let t=wr.sets;t?.push(e);let n=hr(e);return t?.pop(),n},fr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,pr=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(pr);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(pr)&&e.range.every(pr);case`SetOperation`:return e.operator!==`\\cup`&&pr(e.left)&&pr(e.right);case`FilteredSet`:return pr(e.base);case`ProductSet`:return e.factors.every(pr);default:return!1}},mr=e=>typeof e!=`object`||Wt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?mr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||mr(e.left)||mr(e.right):fr(e)?.some(mr)??!1,hr=e=>{if(e.kind===`Union`)return er(e,dr).flatMap((t,n)=>dr(tr(t,n,e)));if(e.kind===`FilteredSet`&&!At(e.base))return dr(e.base).filter(e.test);if(fr(e)?.some(mr))return cr(e,dr);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Qn(e.left)||!Qn(e.right)?P(e).elements:[...dr(e.left),...dr(e.right)];let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Qn(n)?dr(n).filter(t=>Er(t,r)===(e.operator===`\\cap`)):P(e).elements},F=e=>{if(typeof e!=`object`||!A(e))throw new m(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new m(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(F);case`RecordSet`:return e.sets.some(F);case`FunctionSet`:return!F(e.domain)&&F(e.range);case`Union`:return er(e).every((t,n)=>F(tr(t,n,e)));default:return P(e).elements.length===0}},gr=(e,t,n)=>e.reduce((e,r)=>{let i=e*vr(r,t);if(i>2147483647)throw new m(n());return i},1),_r=e=>`Overflow when computing the number of elements in:\n${L(e)}`,vr=(e,t)=>{if(typeof e!=`object`)throw new m(`Attempted to compute the number of elements in the ${ct(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new m(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return vr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new m(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=vr(e.base,t);if(n>=31)throw new m(_r(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(F(e.domain))return 1;if(F(e.range))return 0;if(vr(e.range,t)===1)return 1}let n=vr(e.domain,t),r=vr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new m(_r(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&F(e)?0:gr(e.sets,t,()=>_r(e));case`ProductSet`:return t!==`1.7.4`&&F(e)?0:gr(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return Jt(e),P(e).elements.length}},yr=e=>`Attempted to check if the set ${L(e)}is finite.`,br=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new m(`Attempted to check if the ${ct(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new m(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return br(e.base)&&F(e.base);case`Subset`:return br(e.base);case`FunctionSet`:{let t=br(e.domain);if(t&&F(e.domain))return!0;let n=br(e.range);return n&&F(e.range)?!0:n&&(t||vr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!br(e))n.isAllFinite=!1;else if(F(e))return!0;return n.isAllFinite}case`Union`:if(!Qn(e.base))throw new m(`Attempted to check if the nonenumerable set:\n${$n(e)}\nis a finite set.`);return P(e.base).elements.every(br);case`SetOperation`:if(e.operator===`\\cup`)return br(e.left)&&br(e.right);if(e.operator===`\\cap`){if(!br(e.left)&&!br(e.right))throw new m(yr(e));return!0}if(br(e.left))return!0;if(!br(e.right))throw new m(yr(e));return!1;case`FilteredSet`:if(!br(e.base))throw new m(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},xr=(e,t,n=Ft)=>{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},Sr=e=>{if(typeof e!=`object`||!j(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Cr=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!j(t))return`${n} ${ct(t)} ${L(t)}`;let r=Ht(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)}`},wr={sets:void 0},Tr=(e,t,n,r)=>{let i=wr.sets,a=wr.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof m))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Er=(e,t)=>{let n=wr.sets;if(n===void 0)return kr(e,t);n.push(t);let r=kr(e,t);return n.pop(),r},Dr=(e,t)=>xr(t.elements,e)!==-1,Or=(e,t)=>On.has(t)?En(e,t.elements).isFound:Dn(e,t.elements),kr=(e,t)=>{if(!A(t))throw new m(Cr(e,t));switch(t.kind){case`Set`:return Jt(e),Tr(Dr,Or,e,t);case`MixedSet`:return Dn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!M(e))throw new m(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(M(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new m(`Attempted to check if the value:\n${L(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!A(e)||At(e))throw new m(`Attempted to check if the non-enumerable value\n${it(L(e))}\nis element of\n${it(L(t))}`);return P(e).elements.every(e=>Er(e,t.base));case`FunctionSet`:{if(!j(e)){if(M(e))return!1;throw new m(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${it(L(t))}`)}let n=I(e),r=nn(n.domain);return(r===void 0?An(t.domain,Rt(n.domain)):An({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Er(e,t.range))}case`RecordSet`:{let n=j(e)?I(e):void 0;if(!n||!ht(n.domain)){if(M(e))return!1;throw new m(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=xr(n.domain,e);return i!==-1&&Er(n.range[i],t.sets[r])})}case`ProductSet`:{let n=j(e)?Sr(e):void 0;if(n===void 0){if(j(e)&&I(e).domain.every(e=>typeof e==`number`)||M(e))return!1;throw new m(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Er(e,t.factors[n]))}case`FilteredSet`:return Er(e,t.base)&&t.test(e);case`Union`:if(!Qn(t.base))throw new m(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${$n(t)}`);return P(t.base).elements.some(t=>Er(e,t));case`SetOperation`:return t.operator===`\\cup`?Er(e,t.left)||Er(e,t.right):Er(e,t.left)&&Er(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Sr(e);if(n===void 0){if(M(e))return!1;throw new m(`Attempted to check if the value:\n${it(L(e))}\nis an element of ${it(L(t))}.`)}return n.every(e=>Er(e,t.base))}default:throw new m(Cr(e,t))}},Ar=(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?Er(e,n):e.range.every((e,r)=>Ar(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;N(e.domain)||vr(e.domain);let t=qn(e.domain);return e.enumerated=Vt(zt(t,t.map(t=>e.apply(t))),Ht(e)),e.enumerated}throw new m(`Expected a function but found ${L(e)}`)},jr=(e,t,n)=>{let r=it(L(e)),i=it(L(t)),a=n===`1.7.4`;switch(Ht(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.`}},Mr=(e,t)=>{if(!Ct.is174)return jr(e,t);let n=it(L(t));return Ht(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},Pr=e=>new m(`Attempted to apply function with integer domain to the non-integer argument ${it(L(e))}`),Fr=(e,t,n)=>{throw Ct.is174||e.length<32?e.forEach(e=>Cn(e,t)):xr(e,t,vn),n},Ir=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ht(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new m(n(e,t));if(a===void 0&&!Ct.is174&&Kn(r))throw Pr(t)}let i=Nr(r,t);return i===-1?Tr(xr,Fr,r,t):i},Lr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Er(t,e.domain))throw new m(Ht(e)===`lambda`?jr(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new m(`Attempted to apply ${L(e)}, which is not a function`);let r=n??jr,i=Ir(e,t,r);if(i===-1)throw new m(r(e,t));return e.range[i]},Rr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,zr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return Rr(t)??Rt(t)},Br=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!N(e.domain))){if(!Er(t,e.domain))return e;let r=n(e.apply(t));return Vt({kind:`LazyFunction`,domain:e.domain,apply:n=>An(t,n)?r:e.apply(n),source:e.source},Ht(e))}if(!j(e))throw new m(`Attempted to apply EXCEPT construct to the value ${it(L(e))}.`);let i=I(e),a=Ir(i,t,Mr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Vt(zt(i.domain,o),Ht(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Kr){let e=Zr(c);if(e!==Kr){let t=Zr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Gr(t,Zr(s))+Gr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ti(e,s)+ti(e,c)|0}return l},Vr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hr=(e,t)=>Math.imul(e^t,16777619),Ur=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vr(t)},Wr=e=>Vr(e+2654435769|0),Gr=(e,t)=>Vr(Math.imul(e,668265261)+t|0),Kr=795548749,qr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zr(t[e]);if(r===Kr)return Kr;n=n+Wr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Zr(e.domain[n]),i=Zr(e.range[n]);if(r===Kr||i===Kr)return Kr;t=t+Gr(r,i)|0}return t},Jr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new m(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(A(e)){P(e).elements.forEach(Jr);return}let t=I(e);t.domain.forEach(Jr),t.range.forEach(Jr)},Yr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Zr(e)===Kr&&Jr(e);return}catch(e){if(!(e instanceof m))throw e;return e}},Xr=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[]}},Zr=e=>typeof e==`number`?Vr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ur(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=qr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?N(e.domain)?Zr(I(e)):Kr:N(e)?Zr(P(e)):Kr,Qr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$r=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qr(t)},ei=e=>Qr(ri(e)+2135587861|0),ti=(e,t)=>Qr(Math.imul(ri(e),374761393)+ri(t)|0),ni=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ei(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ti(e.domain[n],e.range[n])|0;return t},ri=e=>typeof e==`number`?Qr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?$r(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ni(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ri(I(e)):N(e)?ri(P(e)):$r(ii(e)),ii=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ai(e),ai=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ii(e.base)}>`;if(e.kind===`FilteredSet`&&!N(e))throw new m(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(A(e))return N(e)?`{${P(e).elements.map(ii).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${ii(e)}:${ii(t.range[n])}`).join(`,`)})`},oi=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,si=e=>e.reduce((e,t)=>e===0?0:e*vr(t),1),ci=e=>{if(e.kind===`Subset`)return vr(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)&&vr(e.domain)===0)return Rt([zt([],[])]);let t=e.kind===`FunctionSet`?vr(e.range)**vr(e.domain):si(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Pn:t<=1999?P(e):void 0},li=(e,t)=>{if(t)return ci(e);if(N(e))try{return ci(e)}catch(e){if(e instanceof m)return;throw e}},ui=(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 $n(e,t)}},di=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),fi=e=>{if(N(e.domain))try{return I(e)}catch(e){if(e instanceof m)return;throw e}},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 oi(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=li(e,t);return n?r(n):ui(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?fi(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&&Ct.is174&&Ht(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Ht(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ht(e)===`record`||i.domain.every(e=>typeof e==`string`&&di(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ft(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},pi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${it(L(n))}\n`).join(``)},mi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),hi=(e,t)=>mi.has(e)?new m(t):new n(t),gi=(e,t,r,i)=>new n(`The ${e} argument of ${t} should be a ${r}, but instead it is:\n${L(i)}`),_i=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||_i(r))throw hi(n,`${n} expects a value as argument ${t+1}`);return r},vi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw hi(n,`${n} expects an integer but received ${L(r)}`);return r},yi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw hi(n,`${n} expects a boolean but received ${L(r)}`);return r},bi=(e,t,n)=>{let r=R(e,t,n);if(!A(r))throw hi(n,`${n} expects a set but received ${L(r)}`);return r},xi=(e,t,n)=>{let r=bi(e,t,n);if(!N(r))throw hi(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},Si=(e,t,n)=>P(xi(e,t,n)).elements,Ci=(e,t,n)=>{let r=R(e,t,n),i=Sr(r);if(!i)throw hi(n,`${n} expects a sequence but received ${L(r)}`);return i},wi=(e,t,n)=>{let r=R(e,t,n);if(!j(r))throw hi(n,`${n} expects a function but received ${L(r)}`);return I(r)},Ti=(e,t,n)=>{let r=e[t];if(r===void 0||!_i(r))throw hi(n,`${n} expects an operator as argument ${t+1}`);return r},Ei=(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}),Di=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ki=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ai=e=>e>2147483647||e<-2147483648,ji=e=>new n(`Overflow when computing ${e}`),Mi={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`},Ni={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Pi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Fi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ii=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ni[e.operator];if(e.kind!==`Function`)return Mi[e.kind];let t=Ht(e);return t===void 0?`FcnRcdValue`:Fi[t]},Li=e=>Pi[Ii(e)],Ri=(e,t)=>new m(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),zi=(e,t)=>{let r=r=>(...i)=>{let a=wr.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof m&&(e.isLazy===!0||!(r instanceof n))?(wr.sets&&(wr.sets.length=a),Ri(t,r.message)):r}};return{...e,evaluate:r(e.evaluate),evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Bi=(e,t)=>{if(typeof e!=`number`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.IntValue`);return e},Vi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Hi=(e,t,n,r)=>{let i=Vi(e,n,`IntValue`,2);return ki(t,(e,n)=>{let a=Bi(e,i),o=Bi(n,i),s=r(a,o);if(Ai(s))throw ji(`${a}${t}${o}`);return s})},Ui=(e,t,r)=>{if(typeof e!=`number`)throw new n(`The ${t} argument of ${r} should be an integer, but instead it is:\n${L(e)}`);return e},Wi=(e,t,n=e)=>ki(e,(e,r)=>t(Ui(e,`first`,n),Ui(r,`second`,n))),Gi=(e,t,n)=>({...Oi(e,t,n),isLazy:!0}),Ki=(e,t,n)=>{let r=Ti(e,t,n);return()=>r.call([])},qi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ji=()=>({bool:Lu,condition:(e,t)=>{if(typeof e!=`boolean`)throw bu(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw xu(t,n,e);return e},apply:Lr,expectFunction:Pu,tuple:Yn,set:Nn,record:Zn,writtenRecord:pt,equal:Xt,enumerate:Wu,unassigned:(e,t)=>{throw Ou(e,t)},primeOutsideAction:e=>{throw Au(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Fu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Mu(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Yi={value:void 0},Xi={isAllowed:void 0},Zi=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Je(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,V(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(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(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${oa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${oa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(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})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${oa(e,r[0],n)}, "the left side of =>") ? bool(${oa(e,r[1],n)}, "the right side of =>") : true)`;if(k(t))return ta(e,t,n);let i=md(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,wu(t))}(${oa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,Tu(t,i))}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Ud(r[0],a))return`${Qi(e,i.evaluateUnary)}(${oa(e,r[0],n)})`;let o=r.length===2&&Ud(r[0],a)&&Ud(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(k(e))return!1;let r=Td(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return aa(e.record);case`FunctionApplication`:return[e.function,...e.args].every(aa);default:return!1}},oa=(e,t,n)=>{let r=(t,r=n)=>oa(e,t,r);switch(t.kind){case`Number`:return lt(t.value)?String(t.value):ta(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(k(t))return ta(e,t,n);let i=Td(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(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)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Qd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ia(t.function,n,e.environment)?r(t.function):aa(t.function)?r(t.function,i):ta(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Qi(e,t)}))`,o=Cu(e.environment.runtime.version),s=o?`, ${Qi(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`${Qi(e,Su(t))}(${r(t.record)})`;case`Record`:{let i=of(t.fields);if(sf(i))return ta(e,t,n);let a=Qi(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}, ${Qi(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=Qi(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`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},sa=(e,t)=>{if(!qi.has(e.kind)||(Xi.isAllowed??=Zi(),!Xi.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=oa(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(`
86
+ =============================================================================`,Qe=/* @__PURE__ */ new Map([[`Reals`,Ye],[`RealTime`,Xe],[`Toolbox`,Ze]]),$e={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:` `}},et=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},tt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),nt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),rt=e=>{let t=t=>{let n=me(e,t,et);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=me(e,t,tt);if(e.startsWith(`..`,n)&&tt(e[n+2]))return{kind:`Constant`,first:t,last:me(e,n+2,tt)-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=tt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:me(e,t+1,tt)-1,children:[]};if(nt(n))return{kind:`Constant`,first:t,last:me(e,t,nt)-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)},it=e=>{let t=e.length===0?void 0:rt(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=$e[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),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},at=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,A=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ot=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),j=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,st=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),ct=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,lt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,ut={isUsed:!1},dt=(e,t)=>(ut.isUsed=!0,e.writtenKeys=t,e),ft=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[xr(e.domain,t)]]),pt=(e,t,n)=>dt(Zn(e,t),n),mt=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(mt);e.writtenKeys=void 0,e.range.forEach(mt)}},ht=e=>e.every(e=>typeof e==`string`),gt=(e,t)=>e.length>0&&t.length>0&&ht(e)!==ht(t),_t=(e,t)=>{ut.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return gt(n,r)?vn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ft(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:Ft(t,n);if(r!==0)return r}return 0},vt=(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=Ft(n[e],r[e]);if(t!==0)return t}return 0},yt=e=>M(e)?e.type:void 0,bt=(e,t,n)=>{let r=yt(e),i=yt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(M(e)&&M(t)){if(r===void 0||i===void 0||r===i)return;throw new m(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new m(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new m(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},xt={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},St=e=>{xt.ranks=Object.create(null),xt.size=0,xt.searchRank=void 0,xt.unorderedString=void 0,It.clear();for(let t of e)Dt(t)},Ct=()=>{xt.searchRank=xt.size},wt=()=>xt.unorderedString,Tt={is174:!1},Et=e=>{Tt.is174=e===`1.7.4`},Dt=e=>(xt.ranks[e]===void 0&&(xt.ranks[e]=xt.size++),e),Ot=e=>xt.ranks[Dt(e)],kt=(e,t)=>{if(e===t)return 0;let n=xt.ranks,r=n[e],i=n[t],a=xt.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(xt.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},At=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),jt=(e,t)=>(At(e)||At(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Mt=(e,t,n)=>{if(!At(e))throw new m(`Attempted to ${n} the set ${L(N(e)?P(e):e,!0)} with the value:\n${L(t,!0)}`);if(!At(t))throw new m(`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new m(`Attempted to compare ${L(e,!0)} with the value\n${L(t,!0)}`)},Nt={kind:`InfiniteSet`,name:`Any`},Pt=e=>{throw new m(`Attempted to compare ANY with the value\n${L(e)}`)},Ft=(e,t)=>{if(e===t)return ut.isUsed&&mt(e),e===Nt?Pt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return _t(e,t);if(n===`Set`&&r===`Set`)return vt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&bt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return bt(e,t,!1),n===`ModelValue`?-1:1;if(e===Nt||t===Nt)return Pt(e===Nt?t:e);if(A(e)&&A(t)&&jt(e,t))return Mt(e,t,`compare`);let i=A(e);if(i!==A(t))throw new m(`Attempted to compare ${ct(e)} ${L(e)} with ${ct(t)} ${L(t)}`);return i?vt(P(e),P(t)):_t(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return kt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(bt(e,t,!1),M(e))return-1;if(M(t))return 1;throw new m(`Attempted to compare ${ct(e)} ${L(e)} with ${ct(t)} ${L(t)}`)},It=/* @__PURE__ */ new Map,Lt=e=>{let t=It.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Ot(e),hash:Vr(Hr(Ur(e),109)),fingerprint:Qr($r(e)^60)};return It.set(e,n),n},Rt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),zt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Bt={isPresent:!1},Vt=(e,t)=>(t===`lambda`&&(Bt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ht=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ut=e=>Vt(e,`lambda`),Wt=e=>at(e)&&e.isCached===!0,Gt={isPresent:!1},Kt=e=>(Gt.isPresent=!0,e),qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Jt=e=>{Gt.isPresent&&typeof e==`object`&&at(e)&&qt.has(e.kind)&&(e.isCached=!0)},Yt=e=>{(Bt.isPresent||Gt.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Yt),e.range.forEach(Yt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Yt):A(e)&&N(e)&&(Jt(e),P(e).elements.forEach(Yt))))},Xt=(e,t)=>{if(Jt(e),e===t)return ut.isUsed&&mt(e),e!==Nt||Pt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&bt(e,t,!0),Ft(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return _t(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return vt(e,t)===0;if(M(e)||M(t))return bt(e,t,!0),M(e)&&M(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=A(e)&&A(t)&&!(N(e)&&N(t));if(n&&jt(e,t))return Mt(e,t,`check equality of`)===0;if(n){if(!At(e)){let n=P(e);if(!At(t))return vt(n,P(t))===0}return ii(e)===ii(t)}return Ft(e,t)===0},Zt=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):ii(n)===ii(r);return n},Qt=Zt(!1),$t=Zt(!0),en=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},tn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||$t(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||$t(i[e],n))return i[e]}return n.kind===`Set`?en(n.elements,t):(en(n.domain,t),en(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}},nn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rn=e=>{if(!j(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:nn(t.domain)}},an=e=>{if(!j(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},on=(e,t)=>(bt(t,e,!1),1),sn=(e,t)=>(bt(t,e,!0),!1),cn=(e,t)=>(e.type!==void 0&&bt(e,t,!1),M(t)?e.rank-t.rank:-1),ln=(e,t)=>(e.type!==void 0&&bt(e,t,!0),M(t)&&e.name===t.name),un={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`}},dn=(e,t,n)=>{let r=un[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)}`},fn=(e,t,n)=>{let r=rn(n);if(!r){if(M(n))return on(n,t);throw new m(`Attempted to compare the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>pn(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return pn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new m(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${L(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},pn=(e,t)=>{for(let n=0;n<e.length;n++){let r=vn(e[n],t[n]);if(r!==0)return r}return 0},mn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=j(t)?Sr(t):void 0;return r?n.range.length-r.length||pn(n.range,r):fn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(M(t))return on(t,e);throw new m(`Attempted to compare record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length-r.domain.length||pn(n.domain,r.domain)||pn(n.range,r.range)}return fn({...n,low:nn(n.domain)},e,t)},hn=(e,t)=>At(e)||At(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),gn=(e,t)=>{let n=st(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},_n=(e,t)=>{if(hn(e,t))return Ft(e,t);if(!st(e))return _n(P(e),t);if(!A(t)){if(M(t))return on(t,e);throw new m(`Attempted to compare the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length-n.otherElements.length||pn(n.elements,n.otherElements)},vn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Ft(e,t);if(M(t))return on(t,e);throw new m(dn(e,t,!1))}return e.kind===`ModelValue`?cn(e,t):j(e)?mn(e,t):_n(e,t)},yn=(e,t)=>e.every((e,n)=>Cn(e,t[n])),bn=(e,t,n)=>{let r=rn(n);if(!r){if(M(n))return sn(n,t);throw new m(`Attempted to check equality of the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&yn(e.range,r.range);let i=e.low??r.low;return i===void 0?yn(e.domain,r.domain)&&yn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new m(`Attempted to compare an integer with non-integer:\n${L(e)}.`);return e===i+t})&&yn(e.range,r.range)},xn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=j(t)?Sr(t):void 0;return r?n.range.length===r.length&&yn(n.range,r):bn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(M(t))return sn(t,e);throw new m(`Attempted to check equality of record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length===r.domain.length&&yn(n.domain,r.domain)&&yn(n.range,r.range)}return bn({...n,low:nn(n.domain)},e,t)},Sn=(e,t)=>{if(hn(e,t))return Xt(e,t);if(!st(e))return Sn(P(e),t);if(!A(t)){if(M(t))return sn(t,e);throw new m(`Attempted to check equality of the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length===n.otherElements.length&&yn(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(M(t))return sn(t,e);throw new m(dn(e,t,!0))}return e.kind===`ModelValue`?ln(e,t):j(e)?xn(e,t):Sn(e,t)},wn=e=>{let t=[];for(let n of e){let e=En(n,t);e.isFound||t.splice(e.index,0,n)}return t},Tn=(e,t)=>{let n=wr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},En=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Tn(e,()=>vn(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}},Dn=(e,t)=>t.some(t=>Tn(t,()=>Cn(t,e))),On=/* @__PURE__ */ new WeakSet,kn=e=>{typeof e==`object`&&(e.kind===`Set`&&(On.add(e),e.elements.forEach(kn)),e.kind===`Function`&&(e.domain.forEach(kn),e.range.forEach(kn)))},An=(e,t)=>Tr(Xt,Cn,e,t),jn=e=>{for(let t=1;t<e.length;t++)if(Ft(e[t-1],e[t])>=0)return!1;return!0},Mn=e=>{for(let t=1;t<e.length;t++)Jt(e[t]);if(e.length<2||jn(e))return Rt(e);let t=[...e].sort(Ft),n=[t[0]];for(let e=1;e<t.length;e++)Ft(n[n.length-1],t[e])!==0&&n.push(t[e]);return Rt(n)},Nn=e=>Tr(Mn,e=>({kind:`MixedSet`,elements:e}),e,void 0),Pn=Rt([]),Fn=(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&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0||i.push(t)}return i.length===n.length?e:Rt(i)},In=(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&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Rt(i)},Ln=(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=Ft(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=Rt(i);if(e.hash!==0&&e.hash!==Kr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zr(a[n]);if(e===Kr)break;t=t+Wr(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+ei(a[e])|0;c.fingerprint=t}return c},Rn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ft(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ft(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return zt(n,r)},zn=e=>{let t=Rn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:dt(t,e.map(e=>e[0]))},Bn=[],Vn=/* @__PURE__ */ new Map,Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Bn[e]??Vn.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Vn.set(e,new WeakRef(n)):Bn[e]=n,n},Gn=e=>{if(vr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Bn[e.length]||e===Vn.get(e.length)?.deref()||Un.has(e)),qn=e=>{let t=P(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Vt(zt(Wn(e.length),e),`tuple`),Xn=e=>Vt(Rn(e),`record`),Zn=(e,t)=>Vt(zt(e,t),`record`),Qn=e=>A(e)&&!At(e),$n=(e,t=!1)=>`UNION(${L(e.base,t)})`,er=(e,t=e=>P(e).elements)=>{if(!Qn(e.base))throw new m(`Attempted to enumerate the nonenumerable set:\n${$n(e)}`);return t(e.base)},tr=(e,t,n)=>{if(Qn(e))return e;throw new m(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${$n(n)}`)},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)||nr(e.domain)===!0||nr(e)===!0;case`RecordSet`:return e.sets.every(N)||nr(e)===!0;case`ProductSet`:return e.factors.every(N)||nr(e)===!0;case`Union`:return N(e.base)&&dr(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}},nr=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=nr(e.domain);return t===void 0?void 0:!t&&nr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=nr(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}},rr=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},ir=(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},ar=e=>{if(typeof e!=`object`||e.kind!==`Subset`||At(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=[]:ir(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Rt(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)})},or=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Rt(r.map(t=>e[t])));while(ir(r,e.length))}return t},sr=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(At(a))throw new m(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},cr=(e,t=e=>P(e).elements)=>{if(typeof e!=`object`)throw new m(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return wn(e.elements);case`Interval`:{let t=Gn(e);return t!==Bn[t.length]&&Un.set(t,e),t}case`Subset`:{if(vr(e.base)===0)return or([]);if(!A(e.base))throw new m(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${it(L(e.base))}`);let t=P(e.base).elements;if(t.length>30)throw new m(_r(e));return or(t)}case`FunctionSet`:{if(!Tt.is174&&F(e))return[];if(At(e.domain))throw new m(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||Tt.is174)&&At(e.range))throw new m(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return rr(n.map(()=>r)).map(e=>zt(n,e))}case`RecordSet`:{if(!Tt.is174&&F(e))return[];let n=sr(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${L(t)}`);return rr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Tt.is174&&F(e))return[];let n=sr(e.factors,t,(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 rr(n).map(Yn)}case`FilteredSet`:if(!A(e.base)||At(e.base))throw new m(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return P(e.base).elements.filter(e.test);case`Union`:{let t=er(e).flatMap((t,n)=>P(tr(t,n,e)).elements);return P(Nn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Qn(e.left)||!Qn(e.right)))throw new m(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Qn(e.left)&&!Qn(e.right))throw new m(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Qn(e.left))throw new m(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Tr(e=>Ln(P(e.left),P(e.right)).elements,e=>wn(lr(e)),e,e);let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return P(n).elements.filter(t=>Er(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new m(`Expected a set but found ${L(e)}`)}},P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Rt(cr(e));let t=typeof e==`object`&&at(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=wr.sets;n?.push(e);let r=cr(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`)?Rt(r):Mn(r);return t&&(t.enumerated=i),i},lr=e=>[...P(e.left).elements,...P(e.right).elements],ur=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?Tr(e=>P(e).elements,e=>wn(Tn(e,()=>lr(e))),e,e):P(e).elements,dr=e=>{if(typeof e!=`object`||Wt(e))return P(e).elements;let t=wr.sets;t?.push(e);let n=hr(e);return t?.pop(),n},fr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,pr=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(pr);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(pr)&&e.range.every(pr);case`SetOperation`:return e.operator!==`\\cup`&&pr(e.left)&&pr(e.right);case`FilteredSet`:return pr(e.base);case`ProductSet`:return e.factors.every(pr);default:return!1}},mr=e=>typeof e!=`object`||Wt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?mr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||mr(e.left)||mr(e.right):fr(e)?.some(mr)??!1,hr=e=>{if(e.kind===`Union`)return er(e,dr).flatMap((t,n)=>dr(tr(t,n,e)));if(e.kind===`FilteredSet`&&!At(e.base))return dr(e.base).filter(e.test);if(fr(e)?.some(mr))return cr(e,dr);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Qn(e.left)||!Qn(e.right)?P(e).elements:[...dr(e.left),...dr(e.right)];let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Qn(n)?dr(n).filter(t=>Er(t,r)===(e.operator===`\\cap`)):P(e).elements},F=e=>{if(typeof e!=`object`||!A(e))throw new m(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new m(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(F);case`RecordSet`:return e.sets.some(F);case`FunctionSet`:return!F(e.domain)&&F(e.range);case`Union`:return er(e).every((t,n)=>F(tr(t,n,e)));default:return P(e).elements.length===0}},gr=(e,t,n)=>e.reduce((e,r)=>{let i=e*vr(r,t);if(i>2147483647)throw new m(n());return i},1),_r=e=>`Overflow when computing the number of elements in:\n${L(e)}`,vr=(e,t)=>{if(typeof e!=`object`)throw new m(`Attempted to compute the number of elements in the ${ct(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new m(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return vr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new m(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=vr(e.base,t);if(n>=31)throw new m(_r(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(F(e.domain))return 1;if(F(e.range))return 0;if(vr(e.range,t)===1)return 1}let n=vr(e.domain,t),r=vr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new m(_r(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&F(e)?0:gr(e.sets,t,()=>_r(e));case`ProductSet`:return t!==`1.7.4`&&F(e)?0:gr(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return Jt(e),P(e).elements.length}},yr=e=>`Attempted to check if the set ${L(e)}is finite.`,br=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new m(`Attempted to check if the ${ct(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new m(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return br(e.base)&&F(e.base);case`Subset`:return br(e.base);case`FunctionSet`:{let t=br(e.domain);if(t&&F(e.domain))return!0;let n=br(e.range);return n&&F(e.range)?!0:n&&(t||vr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!br(e))n.isAllFinite=!1;else if(F(e))return!0;return n.isAllFinite}case`Union`:if(!Qn(e.base))throw new m(`Attempted to check if the nonenumerable set:\n${$n(e)}\nis a finite set.`);return P(e.base).elements.every(br);case`SetOperation`:if(e.operator===`\\cup`)return br(e.left)&&br(e.right);if(e.operator===`\\cap`){if(!br(e.left)&&!br(e.right))throw new m(yr(e));return!0}if(br(e.left))return!0;if(!br(e.right))throw new m(yr(e));return!1;case`FilteredSet`:if(!br(e.base))throw new m(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},xr=(e,t,n=Ft)=>{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},Sr=e=>{if(typeof e!=`object`||!j(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Cr=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!j(t))return`${n} ${ct(t)} ${L(t)}`;let r=Ht(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)}`},wr={sets:void 0},Tr=(e,t,n,r)=>{let i=wr.sets,a=wr.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof m))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Er=(e,t)=>{let n=wr.sets;if(n===void 0)return kr(e,t);n.push(t);let r=kr(e,t);return n.pop(),r},Dr=(e,t)=>xr(t.elements,e)!==-1,Or=(e,t)=>On.has(t)?En(e,t.elements).isFound:Dn(e,t.elements),kr=(e,t)=>{if(!A(t))throw new m(Cr(e,t));switch(t.kind){case`Set`:return Jt(e),Tr(Dr,Or,e,t);case`MixedSet`:return Dn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!M(e))throw new m(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(M(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new m(`Attempted to check if the value:\n${L(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!A(e)||At(e))throw new m(`Attempted to check if the non-enumerable value\n${it(L(e))}\nis element of\n${it(L(t))}`);return P(e).elements.every(e=>Er(e,t.base));case`FunctionSet`:{if(!j(e)){if(M(e))return!1;throw new m(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${it(L(t))}`)}let n=I(e),r=nn(n.domain);return(r===void 0?An(t.domain,Rt(n.domain)):An({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Er(e,t.range))}case`RecordSet`:{let n=j(e)?I(e):void 0;if(!n||!ht(n.domain)){if(M(e))return!1;throw new m(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=xr(n.domain,e);return i!==-1&&Er(n.range[i],t.sets[r])})}case`ProductSet`:{let n=j(e)?Sr(e):void 0;if(n===void 0){if(j(e)&&I(e).domain.every(e=>typeof e==`number`)||M(e))return!1;throw new m(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Er(e,t.factors[n]))}case`FilteredSet`:return Er(e,t.base)&&t.test(e);case`Union`:if(!Qn(t.base))throw new m(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${$n(t)}`);return P(t.base).elements.some(t=>Er(e,t));case`SetOperation`:return t.operator===`\\cup`?Er(e,t.left)||Er(e,t.right):Er(e,t.left)&&Er(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Sr(e);if(n===void 0){if(M(e))return!1;throw new m(`Attempted to check if the value:\n${it(L(e))}\nis an element of ${it(L(t))}.`)}return n.every(e=>Er(e,t.base))}default:throw new m(Cr(e,t))}},Ar=(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?Er(e,n):e.range.every((e,r)=>Ar(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;N(e.domain)||vr(e.domain);let t=qn(e.domain);return e.enumerated=Vt(zt(t,t.map(t=>e.apply(t))),Ht(e)),e.enumerated}throw new m(`Expected a function but found ${L(e)}`)},jr=(e,t,n)=>{let r=it(L(e)),i=it(L(t)),a=n===`1.7.4`;switch(Ht(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.`}},Mr=(e,t)=>{if(!Tt.is174)return jr(e,t);let n=it(L(t));return Ht(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},Pr=e=>new m(`Attempted to apply function with integer domain to the non-integer argument ${it(L(e))}`),Fr=(e,t,n)=>{throw Tt.is174||e.length<32?e.forEach(e=>Cn(e,t)):xr(e,t,vn),n},Ir=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ht(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new m(n(e,t));if(a===void 0&&!Tt.is174&&Kn(r))throw Pr(t)}let i=Nr(r,t);return i===-1?Tr(xr,Fr,r,t):i},Lr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Er(t,e.domain))throw new m(Ht(e)===`lambda`?jr(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new m(`Attempted to apply ${L(e)}, which is not a function`);let r=n??jr,i=Ir(e,t,r);if(i===-1)throw new m(r(e,t));return e.range[i]},Rr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,zr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return Rr(t)??Rt(t)},Br=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!N(e.domain))){if(!Er(t,e.domain))return e;let r=n(e.apply(t));return Vt({kind:`LazyFunction`,domain:e.domain,apply:n=>An(t,n)?r:e.apply(n),source:e.source},Ht(e))}if(!j(e))throw new m(`Attempted to apply EXCEPT construct to the value ${it(L(e))}.`);let i=I(e),a=Ir(i,t,Mr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Vt(zt(i.domain,o),Ht(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Kr){let e=Zr(c);if(e!==Kr){let t=Zr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Gr(t,Zr(s))+Gr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ti(e,s)+ti(e,c)|0}return l},Vr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hr=(e,t)=>Math.imul(e^t,16777619),Ur=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vr(t)},Wr=e=>Vr(e+2654435769|0),Gr=(e,t)=>Vr(Math.imul(e,668265261)+t|0),Kr=795548749,qr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zr(t[e]);if(r===Kr)return Kr;n=n+Wr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Zr(e.domain[n]),i=Zr(e.range[n]);if(r===Kr||i===Kr)return Kr;t=t+Gr(r,i)|0}return t},Jr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new m(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(A(e)){P(e).elements.forEach(Jr);return}let t=I(e);t.domain.forEach(Jr),t.range.forEach(Jr)},Yr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Zr(e)===Kr&&Jr(e);return}catch(e){if(!(e instanceof m))throw e;return e}},Xr=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[]}},Zr=e=>typeof e==`number`?Vr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ur(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=qr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?N(e.domain)?Zr(I(e)):Kr:N(e)?Zr(P(e)):Kr,Qr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$r=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qr(t)},ei=e=>Qr(ri(e)+2135587861|0),ti=(e,t)=>Qr(Math.imul(ri(e),374761393)+ri(t)|0),ni=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ei(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ti(e.domain[n],e.range[n])|0;return t},ri=e=>typeof e==`number`?Qr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?$r(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ni(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ri(I(e)):N(e)?ri(P(e)):$r(ii(e)),ii=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ai(e),ai=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ii(e.base)}>`;if(e.kind===`FilteredSet`&&!N(e))throw new m(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(A(e))return N(e)?`{${P(e).elements.map(ii).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${ii(e)}:${ii(t.range[n])}`).join(`,`)})`},oi=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,si=e=>e.reduce((e,t)=>e===0?0:e*vr(t),1),ci=e=>{if(e.kind===`Subset`)return vr(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)&&vr(e.domain)===0)return Rt([zt([],[])]);let t=e.kind===`FunctionSet`?vr(e.range)**vr(e.domain):si(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Pn:t<=1999?P(e):void 0},li=(e,t)=>{if(t)return ci(e);if(N(e))try{return ci(e)}catch(e){if(e instanceof m)return;throw e}},ui=(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 $n(e,t)}},di=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),fi=e=>{if(N(e.domain))try{return I(e)}catch(e){if(e instanceof m)return;throw e}},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 oi(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=li(e,t);return n?r(n):ui(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?fi(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&&Tt.is174&&Ht(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Ht(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ht(e)===`record`||i.domain.every(e=>typeof e==`string`&&di(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ft(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},pi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${it(L(n))}\n`).join(``)},mi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),hi=(e,t)=>mi.has(e)?new m(t):new n(t),gi=(e,t,r,i)=>new n(`The ${e} argument of ${t} should be a ${r}, but instead it is:\n${L(i)}`),_i=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||_i(r))throw hi(n,`${n} expects a value as argument ${t+1}`);return r},vi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw hi(n,`${n} expects an integer but received ${L(r)}`);return r},yi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw hi(n,`${n} expects a boolean but received ${L(r)}`);return r},bi=(e,t,n)=>{let r=R(e,t,n);if(!A(r))throw hi(n,`${n} expects a set but received ${L(r)}`);return r},xi=(e,t,n)=>{let r=bi(e,t,n);if(!N(r))throw hi(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},Si=(e,t,n)=>P(xi(e,t,n)).elements,Ci=(e,t,n)=>{let r=R(e,t,n),i=Sr(r);if(!i)throw hi(n,`${n} expects a sequence but received ${L(r)}`);return i},wi=(e,t,n)=>{let r=R(e,t,n);if(!j(r))throw hi(n,`${n} expects a function but received ${L(r)}`);return I(r)},Ti=(e,t,n)=>{let r=e[t];if(r===void 0||!_i(r))throw hi(n,`${n} expects an operator as argument ${t+1}`);return r},Ei=(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}),Di=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ki=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ai=e=>e>2147483647||e<-2147483648,ji=e=>new n(`Overflow when computing ${e}`),Mi={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`},Ni={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Pi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Fi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ii=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ni[e.operator];if(e.kind!==`Function`)return Mi[e.kind];let t=Ht(e);return t===void 0?`FcnRcdValue`:Fi[t]},Li=e=>Pi[Ii(e)],Ri=(e,t)=>new m(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),zi=(e,t)=>{let r=r=>(...i)=>{let a=wr.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof m&&(e.isLazy===!0||!(r instanceof n))?(wr.sets&&(wr.sets.length=a),Ri(t,r.message)):r}};return{...e,evaluate:r(e.evaluate),evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Bi=(e,t)=>{if(typeof e!=`number`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.IntValue`);return e},Vi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Hi=(e,t,n,r)=>{let i=Vi(e,n,`IntValue`,2);return ki(t,(e,n)=>{let a=Bi(e,i),o=Bi(n,i),s=r(a,o);if(Ai(s))throw ji(`${a}${t}${o}`);return s})},Ui=(e,t,r)=>{if(typeof e!=`number`)throw new n(`The ${t} argument of ${r} should be an integer, but instead it is:\n${L(e)}`);return e},Wi=(e,t,n=e)=>ki(e,(e,r)=>t(Ui(e,`first`,n),Ui(r,`second`,n))),Gi=(e,t,n)=>({...Oi(e,t,n),isLazy:!0}),Ki=(e,t,n)=>{let r=Ti(e,t,n);return()=>r.call([])},qi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ji=()=>({bool:Lu,condition:(e,t)=>{if(typeof e!=`boolean`)throw bu(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw xu(t,n,e);return e},apply:Lr,expectFunction:Pu,tuple:Yn,set:Nn,record:Zn,writtenRecord:pt,equal:Xt,enumerate:Wu,unassigned:(e,t)=>{throw Ou(e,t)},primeOutsideAction:e=>{throw Au(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Fu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Mu(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Yi={value:void 0},Xi={isAllowed:void 0},Zi=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Je(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,V(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(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(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${oa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${oa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(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})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${oa(e,r[0],n)}, "the left side of =>") ? bool(${oa(e,r[1],n)}, "the right side of =>") : true)`;if(k(t))return ta(e,t,n);let i=md(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,wu(t))}(${oa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,Tu(t,i))}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Ud(r[0],a))return`${Qi(e,i.evaluateUnary)}(${oa(e,r[0],n)})`;let o=r.length===2&&Ud(r[0],a)&&Ud(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(k(e))return!1;let r=Td(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return aa(e.record);case`FunctionApplication`:return[e.function,...e.args].every(aa);default:return!1}},oa=(e,t,n)=>{let r=(t,r=n)=>oa(e,t,r);switch(t.kind){case`Number`:return lt(t.value)?String(t.value):ta(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(k(t))return ta(e,t,n);let i=Td(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(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)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Qd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ia(t.function,n,e.environment)?r(t.function):aa(t.function)?r(t.function,i):ta(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Qi(e,t)}))`,o=Cu(e.environment.runtime.version),s=o?`, ${Qi(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`${Qi(e,Su(t))}(${r(t.record)})`;case`Record`:{let i=of(t.fields);if(sf(i))return ta(e,t,n);let a=Qi(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}, ${Qi(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=Qi(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`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},sa=(e,t)=>{if(!qi.has(e.kind)||(Xi.isAllowed??=Zi(),!Xi.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=oa(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
87
87
  `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Yi.value??=Ji();let o=Yi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ca={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},la={none:0,error:1,warning:3,state:4},ua={0:``,1:`Error: `,3:`Warning: `,4:`State `},da=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===la.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
88
88
  (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${ua[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},fa=`The configuration file did not specify the initial state predicate.
89
89
  Can also be caused by trying to run TLC on a specification from
@@ -1759,7 +1759,7 @@ _TEPosition ==
1759
1759
  ELSE TLCGet("level") + 1
1760
1760
 
1761
1761
  =============================================================================
1762
- `]]),Ch=(e=`master`)=>e===`1.7.4`?Sh:xh,wh=(e,t,r)=>new n(`Applying ${e} to the following value,\nwhich is not ${t}:\n${L(r)}`),Th=e=>j(e)?I(e):void 0,Eh=(e,t,n)=>{let r=R(e,t,n),i=Th(r);if(!i)throw wh(n,`a function with a finite domain`,r);return i},Dh=(e,t,n)=>{let r=R(e,t,n),i=Th(r);if(!i)throw gi(t===0?`first`:`second`,n,`bag`,r);return i},Oh=(e,t)=>{if(!A(e)||!N(e))throw t();return P(e).elements},kh=e=>e.range.every(e=>typeof e==`number`&&e>0),Ah=(e,t)=>{let n=e.domain.findIndex(e=>Xt(e,t));return n===-1?void 0:e.range[n]},jh=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Mh=jh(`BagDiff`,`tlc2.value.impl.Value`,2),Nh=jh(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Ph=jh(`BagUnion`,`tlc2.value.impl.Value`,1),Fh=jh(`BagOfAll`,`tlc2.value.impl.Value`,2),Ih=jh(`BagCup`,`tlc2.value.impl.Value`,2),Lh=jh(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Rh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ii(e)}`;throw Ri(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')`)},zh=(e,t,n)=>{let r=Rh(e,n)+Rh(t,n);if(Ai(r))throw ji(`${e}+${t}`);return r},Bh=(e,t,n,r)=>{let i=Ah(n,e.domain[t]),a=Rh(e.range[t],r);return i===void 0?a:a-Rh(i,r)|0},Vh=(e,t)=>Rn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Xt(e[0],r));a?a[1]=zh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Hh=zt([],[]),Uh=e=>[Ei(`EmptyBag`,Hh),z(`IsABag`,1,e=>{let t=Th(R(e,0,`IsABag`));return t!==void 0&&kh(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Eh(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw wh(`BagCardinality`,`a bag`,t);return zh(e,n,Lh)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=Ah(Eh(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw gi(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=Ah(Eh(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw gi(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Dh(e,t,`(+)`);if(!kh(n))throw gi(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return Vh(t,Ih)}),z(`\\ominus`,2,e=>{let t=Dh(e,0,`(-)`),n=Dh(e,1,`(-)`);return Rn(t.domain.flatMap((e,r)=>{let i=Bh(t,r,n,Mh);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,e=>{let t=R(e,0,`BagUnion`),r=Oh(t,()=>wh(`BagUnion`,`a finite enumerable set`,t));if(r.length<2)return r[0]??Hh;let i=r.map(e=>{let r=Th(e);if(!r)throw new n(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(t)}`);return r});return Vh(i,Ph)}),z(`\\sqsubseteq`,2,e=>{let t=Eh(e,0,`\\sqsubseteq`),n=Eh(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Bh(t,r,n,Nh)<=0)}),Di(`BagOfAll`,2,e=>{let t=Ti(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new n(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(t.literalBody)}`);let r=R(e,1,`BagOfAll`),i=Th(r);if(!i)throw gi(`second`,`BagOfAll`,`function with a finite domain`,r);return Vh(i.domain.map((e,n)=>zt([t.call([e])],[i.range[n]])),Fh)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!j(n))throw new m(`DOMAIN expects a function but received ${L(n)}`);let r=I(n),i=Mn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new m(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Mn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>zt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>zr(Eh(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Oh(t,()=>wh(`BagToSet`,`a function with a finite domain`,t));return zt([...n],n.map(()=>1))})],Wh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Gh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Kh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,qh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Jh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Yh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Xh=e=>{if(!j(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Zh=(e,t)=>Ri(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ii(t)}`),Qh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),$h=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Zh(t,e);return`[${P(e).elements.map(e=>tg(e,t)).join(`,`)}]`},eg=(e,t)=>{let n=I(e),r=Sr(n);return r?`[${r.map(e=>tg(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Qh(typeof e==`string`?e:L(e))}:${tg(n.range[r],t)}`).join(`,`)}}`},tg=(e,t)=>typeof e==`string`?Qh(e):typeof e==`object`?e.kind===`ModelValue`?Qh(e.name):A(e)?$h(e,t):eg(e,t):String(e),ng=e=>{if(A(e))return $h(e,Wh);if(!j(e)||Xh(e))throw Zh(Wh,e);return eg(e,Wh)},rg=e=>{if(!j(e))throw Zh(Gh,e);return eg(e,Gh)},ig=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))},ag=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Tt(e);if(Array.isArray(e))return Yn(e.map(e=>ag(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Tt(e),ag(n,t)]));throw Ri(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},og=(e,t)=>{if(e.trim()===``)return ag(null,t);try{return ag(JSON.parse(e,(e,t,n)=>typeof t==`number`?ig(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ri(t,e.message):e}},sg=(e,t)=>{if(typeof e!=`string`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.StringValue`);return e},cg=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ri(n,`${t} (No such file or directory)`);return r},lg=e=>[Oi(`ToJson`,1,e=>Tt(tg(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Oi(`ToJsonArray`,1,e=>Tt(ng(R(e,0,`ToJsonArray`)))),Oi(`ToJsonObject`,1,e=>Tt(rg(R(e,0,`ToJsonObject`)))),Oi(`JsonSerialize`,2,t=>{let n=sg(R(t,0,`JsonSerialize`),Kh),r=R(t,1,`JsonSerialize`);if(!Sr(r)&&!Xh(r))throw gi(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,tg(r,Kh)),!0}),Oi(`ndJsonSerialize`,2,t=>{let n=sg(R(t,0,`ndJsonSerialize`),qh),r=R(t,1,`ndJsonSerialize`),i=Sr(r);if(!i)throw gi(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${tg(e,qh)}\n`).join(``)),!0}),Oi(`JsonDeserialize`,1,t=>{let n=sg(R(t,0,`JsonDeserialize`),Jh);return og(cg(e,n,Jh),Jh)}),Oi(`ndJsonDeserialize`,1,t=>{let n=sg(R(t,0,`ndJsonDeserialize`),Yh);return Yn(cg(e,n,Yh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>og(e,Yh)))})],ug=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,dg=1e6,fg=(e,t,n)=>{if(typeof e!=`number`||e<0)throw gi(t,n,`nonnegative integer`,e);return e},pg=(e,t,n,r)=>Mn(Array.from({length:t},()=>Mn(e.filter(()=>r.nextDouble()<n)))),mg=(e,t)=>{let n=`RandomSetOfSubsets`,r=fg(R(e,0,n),`first`,n),i=fg(R(e,1,n),`second`,n),a=R(e,2,n);if(!A(a)||!N(a))throw gi(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw gi(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw gi(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return pg(o,r,o.length===0?0:i/o.length,t.getRandom())},hg=e=>[Oi(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw gi(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw Ri(ug,String(n));let r=R(t,1,`RandomSubset`);if(!A(r)||!F(r)&&!N(r))throw gi(`second`,`RandomSubset`,`a finite set`,r);let i=ph(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>dg)throw Ri(ug,`Attempted to construct a set with too many elements (>${dg}).`);return Mn(mh(n,r,e.getRandom(),e.version))}),Oi(`RandomSetOfSubsets`,3,t=>mg(t,e)),Oi(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>P(mg(t,e)).elements.length)))],gg=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,_g=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${gg})`,vg=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${gg}) throws java.io.IOException`,yg=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${gg})`,bg=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),xg=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(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 Xn([[`action`,Mn([...i,...a])],[`state`,Mn(r)]])},Sg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return yh(e).get(t)},Cg=(e,t,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new n(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},wg=e=>e.every(e=>e!==void 0),Tg=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),Eg=(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&&!k(e)){if(t.variableIndex.has(r))return!0;let e=Ru(r,t);if(e&&!n.has(e)&&(n.add(e),Eg(e.body,t,n)))return!0}return Je(e).some(e=>Eg(e,t,n))},Dg=(e,t)=>{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,t=>{let n=R(t,0,`AssertEq`),r=R(t,1,`AssertEq`),i=Xt(n,r);return i||(e(L(`Assertion failed`,!0)),e(L(n,!0)),e(L(r,!0))),i}),Gi(`AssertError`,2,e=>{let n=Ti(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ri(_g,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Ki(e,0,`AssertError`)();try{Ki(e,1,`AssertError`)()}catch(e){if(e instanceof m)return xa(e.message,t.isTool)===r;throw e}return!1}),Oi(`TLCGetOrDefault`,2,e=>{let n=R(e,0,`TLCGetOrDefault`);return Sg(t,n)??R(e,1,`TLCGetOrDefault`)}),{...Di(`TLCGetAndSet`,4,n=>{let r=R(n,0,`TLCGetAndSet`),i=Sg(t,r)??R(n,3,`TLCGetAndSet`),a=Ti(n,1,`TLCGetAndSet`);return Cg(t,e,r,a.call([i,R(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Oi(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!wg(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ri(vg,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(t.getBehavior(r).map(e=>Tg(e,n.environment)))}),Oi(`CounterExample`,0,()=>t.counterExample??Xn([[`action`,Mn([])],[`state`,Mn([])]])),z(`ToTrace`,1,e=>{let t=R(e,0,`ToTrace`);if(!j(t)||!Xt(zr(t),Mn([`action`,`state`])))throw new m(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(t)}`);let n=P(Lr(t,`state`)).elements.map(e=>Sr(e)??[]);return Yn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let t=R(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new n(`The argument of ModelValue should be a string, but instead it is:\n${L(t)}`);return Lt(t)}),Gi(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),Gi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!wg(r))throw Ri(yg,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Lu(Ki(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new _(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Gi(`TLCCache`,2,(e,t)=>{let n=Ti(e,0,`TLCCache`),i=ii(Ki(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Eg(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,Ym([R(e,0,`TLCFP`)])))),Oi(`TLCEvalDefinition`,1,(e,t)=>{let r=R(e,0,`TLCEvalDefinition`),i=typeof r==`string`&&t?Ru(r,t.environment):void 0;if(!i||typeof r!=`string`||!t)throw new n(`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 n(`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},t)})]},Og=(e,t)=>[Oi(`_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}),Oi(`_Counts`,0,()=>vh(t)),Oi(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(vh(t),!0)),!1)}),Oi(`_PrintCounts`,0,()=>(e(L(vh(t),!0)),!0))],kg=e=>String(e).padStart(2,`0`),Ag=e=>`${e.getUTCFullYear()}.${kg(e.getUTCMonth()+1)}.${kg(e.getUTCDate())}.${kg(e.getUTCHours())}${kg(e.getUTCMinutes())}${kg(e.getUTCSeconds())}`,jg=e=>Rn([...e].map(([e,t])=>[e,Yn([t])])),Mg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Ng=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Pg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Fg=(e,t,r)=>{if(e.version===`1.7.4`?!Ng.has(t)||!e.isStarted&&Pg.has(t):!e.isStarted&&Mg.has(t))throw new n(`TLCGet(${t}) was undefined.`);let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Tt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Tt(Ag(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return bg(void 0);case`all`:return jg(e.registers);case`all:named`:return jg(yh(e))}if(t.startsWith(`s:`)){let r=yh(e).get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(t.startsWith(`-D`))return Tt(e.properties.get(t.slice(2))??t);throw new n(`TLCGet(${t}) was undefined.`)},Ig=(e,t,r)=>{if(typeof t==`number`&&t>=0){let r=e.registers.get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(typeof t!=`string`)throw new n(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(t)}`);return Fg(e,t,r?.state)},Lg=e=>e.length===0?[[]]:e.flatMap((t,n)=>Lg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Rg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Rg),e.kind===`Function`&&e.range.forEach(Rg))},zg=(e,t)=>[z(`Print`,2,t=>(e(`${it(L(R(t,0,`Print`),!0,!0))} ${it(L(R(t,1,`Print`),!0,!0))}`),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(it(L(R(t,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new n(`The first argument of Assert evaluated to FALSE; the second argument was:\n${it(L(R(e,1,`Assert`)))}`,a.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Rn([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=wi(e,0,`@@`),n=wi(e,1,`@@`);return zn([...ft(t),...ft(n)])}),z(`ToString`,1,e=>Tt(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return Rg(t),t}),z(`Permutations`,1,e=>{let t=Si(e,0,`Permutations`);return Mn(Lg(t).map(e=>Rn(t.map((t,n)=>[t,e[n]]))))}),Di(`SortSeq`,2,e=>{let t=Ti(e,1,`SortSeq`);return Yn(Ci(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)]},[]))}),t.version===`1.7.4`?zi({...Oi(`TLCGet`,1,(e,n)=>Ig(t,R(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):zi(Gi(`TLCGet`,1,(e,n)=>Ig(t,Ki(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Oi(`TLCSet`,2,n=>{let r=R(n,0,`TLCSet`);return Cg(t,e,r,R(n,1,`TLCSet`)),!0}),Ei(`Any`,Nt),z(`RandomElement`,1,e=>gh(xi(e,0,`RandomElement`),t.getRandom()))],Bg=(e,t)=>e.every(e=>Er(e,t)),Vg=Mn([!1,!0]),Hg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Ln(Hg(e,t,r),Hg(e,r,n))},Ug=[`\\cup`,`\\cap`,`\\`],Wg=e=>typeof e==`object`&&e.kind===`MixedSet`,Gg=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return Nn(r.filter(e=>Er(e,n)===t))}if(r.length===0)return n;if(!ot(n))return Kt({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!Er(e,t));return Nn([...r,...i])},Kg=[Ei(`TRUE`,!0),Ei(`FALSE`,!1),Ei(`BOOLEAN`,Vg),Ei(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ki(`=`,An),ki(`#`,(e,t)=>!An(e,t)),z(`~`,1,e=>!yi(e,0,`~`)),z(`<=>`,2,e=>yi(e,0,`<=>`)===yi(e,1,`<=>`)),z(`/\\`,2,e=>yi(e,0,`/\\`)&&yi(e,1,`/\\`)),z(`\\/`,2,e=>yi(e,0,`\\/`)||yi(e,1,`\\/`)),z(`=>`,2,e=>!yi(e,0,`=>`)||yi(e,1,`=>`)),z(`\\in`,2,e=>Er(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Er(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=bi(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?Bg(P(t.base).elements,n.base):Bg(P(t).elements,n)}),...Ug.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if(ot(n)&&ot(r)&&!Wg(n)&&!Wg(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?Ln:e===`\\cap`?In:Fn;return Tr((e,n)=>t(P(e),P(n)),(t,n)=>Gg(e,t,n),n,r)}return ot(n)?Gg(e,n,r):e!==`\\`&&ot(r)?Gg(e,r,n):Kt({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=bi(e,0,`UNION`),n=st(t)?t.elements.filter(st):[];if(!st(t)||n.length!==t.elements.length)return Kt({kind:`Union`,base:t});if(Wg(t)||n.some(Wg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Er(t,e)||e.elements.push(t)})),Nn(e.elements)}return n.length===0?Pn:Hg(n.map(P),0,n.length)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!j(t))throw new m(`DOMAIN expects a function but received ${L(t)}`);return zr(t)})],qg=Vi(`Integers`,`Neg`,`IntValue`,1),Jg=e=>{let t=Vi(e,`DotDot`,`IntervalValue`,2);return[Hi(e,`+`,`Plus`,(e,t)=>e+t),Hi(e,`-`,`Minus`,(e,t)=>e-t),Hi(e,`*`,`Times`,(e,t)=>e*t),Hi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new n(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new n(`0^0 is undefined.`);return e**t}),Hi(e,`\\div`,`Divide`,(t,r)=>{if(r===0)throw new n(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/r)|0;return e<0&&Math.imul(e,r)!==t?e-1:e}let i=Math.floor(t/r);if(Ai(i))throw ji(`${t} \\div ${r}`);return i}),Hi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new n(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),z(`..`,2,e=>({kind:`Interval`,low:Bi(R(e,0,`..`),t),high:Bi(R(e,1,`..`),t)}))]},Yg=Jg(`Naturals`),Xg=Jg(`Integers`),Zg=e=>{let t=Yg.indexOf(e);return t===-1?void 0:Xg[t]},Qg=[Ei(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Yg,Wi(`<`,(e,t)=>e<t),Wi(`>`,(e,t)=>e>t),Wi(`<=`,(e,t)=>e<=t),Wi(`>=`,(e,t)=>e>=t,`>`)],$g=[Ei(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Xg,Wi(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=Bi(R(e,0,`-`),qg);if(Ai(-t))throw ji(`-${t}`);return-t})],e_=(e,t,r)=>{let i=R(e,t,r),a=Sr(i);if(!a)throw new n(`${r}\n${L(i)}`);return a},t_=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:e_(e,t,n)},n_=(e,t,n)=>typeof e==`string`?Tt(e.slice(t,n)):Yn(e.slice(t,n)),r_=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,i_=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,a_=(e,t)=>{let n=Af.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?zi(e,t):e}):t},o_=e=>a_(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>t_(e,0,r_(``,`Len`)).length),z(`\\o`,2,e=>{let t=t_(e,0,i_(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=e_(e,1,i_(`t \\o s`,`sequence`));return Yn([...t,...n])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new n(`${i_(`t \\o s`,`string`)}\n${L(r)}`);return Tt(t+r)}),z(`Append`,2,t=>Yn([...e_(t,0,i_(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let t=e_(e,0,r_(``,`Head`));if(t.length===0)throw new n(`Attempted to apply Head to the empty sequence.`);return t[0]}),z(`Tail`,1,e=>{let t=t_(e,0,r_(``,`Tail`));if(t.length===0)throw new n(`Attempted to apply Tail to the empty sequence.`);return n_(t,1)}),z(`SubSeq`,3,e=>{let t=t_(e,0,r_(`first `,`SubSeq`)),r=vi(e,1,`SubSeq`),i=vi(e,2,`SubSeq`);if(r>i)return n_(t,0,0);let a=r<1||r>t.length?{position:`second`,value:r}:i>t.length?{position:`third`,value:i}:void 0;if(a)throw new n(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return n_(t,r-1,i)}),Di(`SelectSeq`,2,e=>{let t=Ti(e,1,`SelectSeq`);return Yn(e_(e,0,r_(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw gi(`second`,`SelectSeq`,`operator`,n);return n}))})]),s_=e=>a_(`FiniteSets`,[z(`IsFiniteSet`,1,e=>{let t=R(e,0,`IsFiniteSet`);if(A(t))return br(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new m(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${L(t)}\nis a finite set.`:`Attempted to check if the ${ct(t)} ${L(t)} is a finite set.`)}),z(`Cardinality`,1,t=>{let r=R(t,0,`Cardinality`);if(!A(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new n(`Attempted to compute cardinality of the value\n${L(r)}`);return vr(r,e)})]),c_=/* @__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`]]]),l_=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Qg};case`Integers`:return{extends:[`Naturals`],operators:$g};case`Sequences`:return{extends:[],operators:o_(n.version)};case`FiniteSets`:return{extends:[],operators:s_(n.version)};case`TLC`:return{extends:[],operators:a_(`TLC`,zg(t,n))};case`Randomization`:return{extends:[],operators:hg(n)};case`_Possible`:return{extends:[],operators:Og(t,n)};case`Json`:return{extends:[],operators:lg(r)};case`Bags`:return{extends:[],operators:Uh(i)};case`TLCExt`:return{extends:[],operators:Dg(t,n)};default:return}},u_=`$subexpression`,d_=(e,t)=>new l(`${e} at line ${t.line}, column ${t.column}`),f_=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return f_(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Je(e)){let e=f_(r,t,n);if(e)return e}},p_=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),m_=(e,t)=>{let n=e.location,r=p_(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 d_(`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 d_(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:u_,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:u_,args:e.args,location:n,resolution:Ia},location:n}},h_=(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:Ia})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ia}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ia};return m_({...t,params:[...t.params,...r]},a)},g_=(e,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 d_(i,a);Ra.set(r,{args:e.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:t(n),message:i}}),s.isFailed=!0},l=t=>{let r=[],i=[];for(;s.index<e.length;){let o=e[s.index];if(o.kind!==`Name`)throw d_(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=t?t.find(e=>as(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw d_(`Unknown operator ${r.join(`!`)}`,a)},u=t=>{let n=l(t),u=n.definition,d=Ua(u),f=s.index===e.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 d_(`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<e.length&&!s.isFailed;){let t=e[s.index];if(t.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&f_(s.current,t.name,[]);if(!a)return c(n,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(!i&&t.args.length!==l.length)return c(n,`Label \`${t.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(...t.args),s.current=a.label.body,s.index++}},f=t=>{let n=s.current;if(!n)throw d_(`Subexpression selection failed`,a);if(t.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||uo(t.operand,1)!==0)throw d_(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=ho(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&o.args.push(...t.args),s.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[uo(t.operand,r.length)],o=e[s.index+1];if(!i||o?.kind!==`Operand`)throw d_(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=uo(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw d_(`Nonexistent CASE operand`,a);s.current=l;return}if(t.kind!==`Operand`)throw d_(`Unexpected subexpression selector`,a);let i=r?r.sets:go(n),c=i?.[uo(t.operand,i.length)];if(!c)throw d_(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return h_(p.definition,{...o,args:p.args});for(d();s.index<e.length&&!s.isFailed;){let t=e[s.index];if(t.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw d_(`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 h_(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(t),s.index++}if(s.isFailed)return r;if(!s.current)throw d_(`Subexpression selection failed`,a);return m_(o,s.current)},__=(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 fo(e,t,n)},v_=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Je(e).some(v_),y_=(e,t,n,r=!1)=>{if(!v_(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=cs(e,e=>y_(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>b_(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)=>y_(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:cs(e,e=>y_(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?__(a.name,[],void 0,t):a.kind===`Apply`?__(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=g_(o,t,a,r);return c!==a&&La.add(c),c},b_=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:y_(e.expression,t,n,!0)}))}),x_=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},S_=(e,t)=>b_(e,x_(t.definitions),()=>!1),C_=(e,t)=>{let n=x_([...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=>y_(e,n,i),o=e=>i(e)||!n(e),s=e=>y_(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 b_(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?b_(e,n,o):ss(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=>v_(e.body))||e.assumptions.some(e=>v_(e.expression))?{...p,definitions:e.definitions.map(e=>ss(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},w_=(e,t)=>e.maxLevels[t]??3,T_=e=>{let n=/* @__PURE__ */ new Map,r=t=>{let r=n.get(t);if(r)return r;let i=e(t),a=mc({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(t,a),a},i=/* @__PURE__ */ new Map,a=t=>{let n=i.get(t);if(n)return n;let a=e(t),o=r(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Gs(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Gs(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ks(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Hs(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)&&Gs(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(hc(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(t,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=t(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),l=e(n.module),u=a(n.module),d=r(n.instancer),f=/* @__PURE__ */ new Map;n.lets.forEach(e=>f.set(e.name,{kind:`Let`,definition:e,scope:f}));let p=[...l.constants.map(e=>({...e,maximumLevel:0})),...l.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=d.analyze(t,f);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=d.toOperand(t,f);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),m=(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(p.forEach(e=>{!u.isConstant&&e.level>e.maximumLevel&&s(m(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),p.forEach(e=>{let t=u.constraints.get(e.name);t!==void 0&&e.level>t&&s(m(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=u.argConstraints.get(Bs(e.name,i));a!==void 0&&w_(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}.`)})}),u.argParams.forEach(e=>{let t=Hs(e),r=p.find(e=>e.name===t.operator)?.operator,i=p.find(e=>e.name===t.param);if(!r||!i)return;let a=w_(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 c([...i.values()])}},E_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],D_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),O_=new Map(wf.flatMap(e=>e.map(t=>[t,e[0]]))),k_=e=>O_.get(e)??e,A_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},j_=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},M_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:A_(e)&2147483647,kind:t,isLocal:n}),N_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:k_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:k_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},P_=(e,t)=>{let n=[];for(let r=t;;){let t=N_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},F_=e=>({line:e.line,column:e.column}),I_=(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=P_(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},L_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,R_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},z_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&L_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&L_(e[n+1],e[n+2])?n+=L_(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=>R_[e])}"`:r.text)}return t},B_=e=>e[2]?.text,V_=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},H_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>H_(e.modules,t)).find(Boolean),U_=e=>{let t=e===void 0?[]:be(e),n={module:void 0};return{tokens:t,ranges:V_(t),getModule:()=>n.module??=e===void 0?wm(``):Tm(e,t)}},W_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=U_(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:(Of.has(i)?t?.(i):void 0)??kf.get(i)??t?.(i)??Sm(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(B_(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>H_(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},G_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=P_(t,e+1);i.push({location:F_(t[e]),apply:e=>r.forEach(t=>e.put(M_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:F_(u),apply:t=>t.put(M_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&P_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),D_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(F_(u)),i.push({location:F_(u),apply:e=>e.put(M_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(M_(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=k_(e.name);i.push({location:e.location,apply:n=>n.put(M_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(M_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(M_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=j_();n.set(i??``,o),Cf.toReversed().forEach(e=>o.put(M_(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},K_=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),Tf.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},o=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=I_(a(e),e,o);return c.set(e,n),n},u=e=>o.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>o.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;z_(a(void 0)).forEach((e,t)=>{t===3&&Df.forEach(r),r(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),v.set(n.unit,[...v.get(n.unit)??[],i]),!_.has(i)){if(_.add(i),e(i).tokens.length===0){let t=n.unit??B_(e(void 0).tokens);throw s(i,t)}z_(a(i)).forEach(r)}}E_.forEach(r);let b=/* @__PURE__ */ new Set,ee=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return ee(void 0),Ef.forEach(r),[...n]},q_=(e,t)=>{let n=W_(e,t),r=n.getParsed,i,a=()=>i??=G_(r);return{getStringOrder:e=>K_(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},J_=e=>{switch(e.kind){case`Number`:if(!lt(e.value))throw v(new n(`Integer overflow: ${e.value} is outside TLC's 32-bit range`),a.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Lt(e.name);case`Set`:return Mn(e.elements.map(J_))}},Y_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],X_=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof l))throw n;let r=Xp(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Z_=e=>new l(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Q_=(e,n)=>e.location.range&&n.location.range&&{location:t(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${t(n.location.range)}.`},$_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,ev=e=>e===`Theorem`?`ThmOrAssumpDefNode`:$_(e),tv=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Ts(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),nv=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new m(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Xt(t,r)})});if(t)return t[1];throw new m(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},rv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Je(e).some(e=>rv(e,t)),iv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(bs(e),n.get(e)??n.size)),n},av=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),ov=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Eu(e);if(e.kind===`Number`&&!lt(e.value))throw Du(e);ov(e.kind===`Let`?[...Je(e),...av(e.instances??[])]:Je(e))}),sv=(e,n)=>{let r=n.order??q_(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,p=new Map(Kg.map(e=>[e.name,e])),h=/* @__PURE__ */ new Map,_=_h(e.checkDeadlock,n.seed);_.isWarningEnabled=n.isWarningEnabled??!0,_.isTool=n.isTool??!1,_.version=n.version??`master`;let v=/* @__PURE__ */ new Map,y=/* @__PURE__ */ new Map,b=/* @__PURE__ */ new Map,ee=[],x=/* @__PURE__ */ new Map,te=[],ne=[],re=(e,t)=>te.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ie={value:0},ae=e=>`${e}#${ie.value++}`,oe=[],se=[],ce=T_(e=>{let t=b.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),le=/* @__PURE__ */ new Map,ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,S=e=>{let t=h.get(e);if(t)return t;let r=l_(e,n.print,_,n.files,p);if(!r)return;c_.get(e)?.forEach(S);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>S(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{p.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Ls.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:zs(e,t.name)??i.get(t.name)?.range})}),h.set(e,i),i},C=e=>{if(Of.has(e)&&n.loadModule?.(e)!==void 0)return;let t=S(e),r=c_.get(e)??[];return t&&re(e,r),t&&r.includes(`Integers`)&&S(`Integers`),t},w=e=>(ov([...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]),...av(e.instances)]),e.modules.forEach(w),e);w(i);let T=(e,t)=>{let i=n.loadModule?.(e)??Qe.get(e)??Sm(n.source,e);if(i===void 0)throw s(e,t);let a=X_(i,e,r);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return w(a)},fe=e=>{let t=ne.indexOf(e.name);if(t!==-1){let n=[...ne.slice(t),e.name].map(e=>`${e}.tla`);throw new l(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];ne.push(e.name),te.push(n);let o=Se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:se,levelChecks:a});if(te.pop(),ne.pop(),i.length>0)throw c(i,!1,void 0,se);let s=r.find(e=>n.has(e.name)),u=s&&v.get(s.name),d=u&&Q_(s,u.module);if(d)throw c([d],!1,void 0,se);if(s)throw Z_(s);return a.forEach(e=>e()),{linked:o,closure:n}},pe=(e,t)=>{let r=v.get(e);if(r)return re(e,x.get(e)??[]),r;let i=fe(T(e,t));return(Ch(_.version).has(e)?l_(e,n.print,_,n.files,p):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(p.set(t.key,e),a.delete(t.key))}),v.set(e,i.linked),x.set(e,i.closure),re(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let s=i?void 0:C(e.module);if(s)return he(e,s);let c=i??pe(e.module,t.name);c.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let l=Y_(c),f=`#${ie.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Qo(S_(e,t),l,t,n);oe.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=Ms({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,ns(t,p)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,s)=>{let c=ae(`${i}@${t.name}`),f=s(c);return a.set(c,f),l.length>0&&d.add(f),e.name!==void 0&&ue.set(c,`${e.name}!${ue.get(n)??i}`),o.set(c,!r),u.set(c,{source:n,prefix:e.params.length}),c},createName:ae});return ge(e,c.exported,l,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return l.length>0&&le.set(r,{name:n,location:e.location}),e.name!==void 0&&de.set(r,n),r})},he=(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}])),ge=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},_e=(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:Es(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ve=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ye=(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=ve(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Es(r,n),location:n}}},E=(e,t,n,r)=>{let i=e.location,s=r?void 0:C(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ve(n.arity);return _e(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${ie.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Y_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};oe.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>rv(f(e),p),h=d.map(t=>{let n=ye(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=Ms({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Es(e.params,i),location:i,resolution:Ia}:Ts(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:tv(a,i)),i},createName:ae}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=ve(n.arity),o=[...e.params,...a];return _e(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},be=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),xe=/* @__PURE__ */ new Map,Se=(e,r)=>{let s=Sf(e,n.loadClass?.(e.name),e===i);xe.set(e.name,s.overrides);let c=s.module,l=oe.length,u=new Map([...Kg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:qo,errors:[],warnings:[]},p=[f],m=e=>e.forEach((e,n)=>{let r=h.get(n);if(!r){u.set(n,e),h.set(n,e);return}if(!r.range||!e.range||t(r.range)===t(e.range))return;let i=t(e.range),a=t(r.range);ev(r.kind)===ev(e.kind)?f.warnings.push({location:i,message:`Warning: the ${$_(r.kind)} of '${n}' conflicts with \nits ${$_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${$_(e.kind)} of '${n}' conflicts with \nits ${$_(r.kind)} at ${a}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,v=[],x=[...c.constants],te=c.variables.map(e=>e.name),ne=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:C(e);if(n){m(n);return}let i=t??pe(e,c.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),ne.push(i.variableLocations[t]))}),m(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),v.push(i)});let re=new Map(u),ie=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],ae=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ie.forEach(e=>h.set(e.name,ae(e)));let le=e=>({key:S(e),arity:Ua(e),params:Wa(e),kind:Jo(c,e)?`Theorem`:`Definition`,range:e.location.range}),ue=x.length===0&&te.length===0,S=e=>c===i?e.name:`${e.name}@${r.id}`,w=/* @__PURE__ */ new Map,T=()=>new Map([...r.modules,..._]),fe=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&Ha(e.location,t.location)},_e=e=>{let t=c.modules.find(t=>t.name===e.module);return t?fe(t)?_.get(t.name):void 0:T().get(e.module)},ve=e=>({imported:u,getInstance:e=>{let t=_e(e),n=t?void 0:C(e.module);if(n)return{declarations:[],symbols:he(e,n),instancer:c.name};let r=t??pe(e.module,c.name),i=Y_(r);return{declarations:i,symbols:ge(e,r.exported,i,e=>e),instancer:c.name}},bound:re,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:S,instanced:w,facts:g,reports:p,warnings:r.warnings}),ye=e=>[...ie.filter(t=>Ha(t.location,e)).map(e=>[e.name,ae(e)]),...c.definitions.filter(t=>Ha(t.location,e)).map(e=>[e.name,le(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),Ce=e=>{let t=T(),n=t.get(e.name),i=n&&Q_(e,n.module);if(n&&!i)throw Z_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=Se(e,{id:`${r.id}/${e.name}`,symbols:ye(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||_.set(e.name,o),y.has(e.name)||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=me(e,c,ve(c),ue,T().get(e.module));w.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||h.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>Ce(e)}))].sort((e,t)=>Ha(e.location,t.location)?-1:1).forEach(e=>e.link());let D=C_(Is(c,(e,t)=>E(e,t,c.name,_e(e))),be(u));r.errors.push(...es(D,ve(D))),D.definitions.forEach(e=>{let t=S(e);a.set(t,e),o.set(t,!ue);let n=le(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||h.set(e.name,n))});let we={module:D,constants:x,variables:te,variableLocations:ne,visible:u,exported:h,modules:_,extended:v,facts:/* @__PURE__ */ new Set([...g,...[...D.theorems,...D.assumptions].flatMap(e=>e.name??[])])};b.has(c.name)||b.set(c.name,we);let Te=oe.splice(l).map(e=>({location:e.location,check:()=>ce(e)}));return r.levelChecks.push(()=>gc(D,{constants:new Set(x.map(e=>e.name)),variables:new Set(te),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>de.get(u.get(e)?.key??e)},Te,se)),ee.push(we),we},Ce=fe(i).linked;se.length>0&&!n.isSanyReported&&n.print(f(se));let D=e=>Ce.visible.get(e)?.key??e;Ce.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(Ce,/* @__PURE__ */ new Set);let Ee=Ce.constants.map(e=>e.name),De=Ce.variables,Oe=e=>e.module===void 0?[e.name,D(e.name)]:e.module===i.name||Ee.includes(e.name)?[]:[(v.get(e.module)??y.get(e.module))?.visible.get(e.name)?.key??e.name],ke=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:Ce.constants.find(t=>t.name===e)?.arity??0},Ae=/* @__PURE__ */ new Map,je=/* @__PURE__ */ new Set,Me=(e,t)=>{p.set(e,t),a.delete(e),Ae.delete(e),je.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=J_(e.value);kn(t),Oe(e).forEach(e=>{let n=ke(e);n===0?Ae.set(e,t):Me(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ne=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ne.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new g(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(J_),J_(e.value)]),Ne.set(t,n)}),Ne.forEach(e=>Oe(e).forEach(t=>Me(t,nv(e.name,ke(t)||e.rows[0][0].length,e.rows))));let Pe=new Map(e.substitutions.flatMap(e=>Oe(e).map(t=>[t,D(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!Ee.includes(n)&&!Ce.visible.has(n))throw new g(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new g(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let i=D(r),o=a.get(i);if(!(o!==void 0||p.has(i)||Ae.has(i)||Ee.includes(r)||De.includes(r)))throw new g(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(o?.kind===`Operator`&&o.params.length!==(Ce.constants.find(e=>e.name===n)?.arity??Ce.visible.get(n)?.arity))throw new g(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Fe=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Oe)),Ie=(e,t)=>{if(Fe.has(e))return{key:e,prefix:t};let n=u.get(e);return n&&Ie(n.source,t+n.prefix)};u.forEach((e,t)=>{let n=Ie(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=_e(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),Ce.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Le=Ee.filter(e=>!Ae.has(e)&&!Pe.has(e)&&!je.has(e));if(Le.length>0&&!n.isUnconfigured){let e=r.getDeclarationOrder(`constant`).find(e=>Le.includes(e))??Le[0];throw new g(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&p.forEach((e,t)=>{let n=Zg(e);n&&p.set(t,n)});let Re=iv(De,ee.flatMap(e=>e.module.variables.map(e=>e.name))),ze=Ac({definitions:a,substitutions:Pe,constants:Ae,variableIndex:Re,builtins:p,variables:De}),Be={runtime:_,definitions:a,builtins:p,constants:Ae,substitutions:Pe,instanceNames:ue,variables:De,variableIndex:Re,facts:ze,startupValues:Array.from({length:ze.ids.size},()=>void 0),substitutedDefinitions:d,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ve=mc({constants:new Set(Ae.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>p.has(e))]),getDefinition:e=>Ru(e,Be)}),O=e=>{try{H(e,{environment:Be,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof m)return e;throw e}};Pe.forEach((e,t)=>{let n=a.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ve.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?O(n.body):void 0;if(r){let n=va(r)?``:` - specifically: ${r.message}`;throw new g(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),_.version!==`1.7.4`&&(_.isStarted=!0);let He=new Set(ee.flatMap(e=>e.module.instances.map(e=>e.module))),Ue=r.createDefinitionOrder();return{environment:Be,assumptions:we,variableLocations:Ce.variableLocations,instanceActions:le,startupDefinitions:ee.filter(e=>!He.has(e.module.name)||Y_(e).length===0).flatMap(e=>Ue(e===Ce?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:Ce.constants,rootSymbols:Ce.visible,javaOverrides:ee.flatMap(e=>xe.get(e.module.name)??[])}},cv={kind:`Boolean`,value:!0},lv={kind:`Boolean`,value:!1},uv=e=>e?cv:lv,dv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,fv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),pv=(e,t,n)=>({kind:e,operands:[t,n]}),mv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?mv(e,t.operands).operands:[t])}),hv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return hv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,hv(t)),0)}},gv=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 gv(e.body);case`And`:case`Or`:return e.operands.some(gv)}},_v=/* @__PURE__ */ new WeakMap,vv={count:0},yv=e=>{let t=_v.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${vv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(yv).join(`,`)})`;default:return`${e.kind}(${yv(e.body)})`}})();return _v.set(e,n),n},bv=(e,t)=>e===t||yv(e)===yv(t),xv=(e,t)=>{let n=yv(t);return e.some(e=>e===t||yv(e)===n)},Sv=e=>e===`And`?`Or`:`And`,Cv=(e,t)=>{switch(e.kind){case`Boolean`:return t?uv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Cv(e.body,!t);case`And`:case`Or`:return mv(t?Sv(e.kind):e.kind,e.operands.map(e=>Cv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Cv(e.body,t))}}},wv=e=>{switch(e.kind){case`Boolean`:return uv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return mv(Sv(e.kind),e.operands.map(wv));case`Always`:return $(`Eventually`,wv(e.body));case`Eventually`:return $(`Always`,wv(e.body));default:return $(`Not`,e)}},Tv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Tv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return uv(t)}return n.length===0?uv(!t):n.length===1?n[0]:mv(e.kind,n)}case`Not`:{let t=Tv(e.body);return t.kind===`Boolean`?uv(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Tv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Ev=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Dv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Dv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new m(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>mv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Dv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Ev(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:mv(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return mv(`Or`,n)}case`Not`:return dv(e.body)?e:Dv(wv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ov(e.operands[0]):mv(e.kind,e.operands.map(Ov));case`Not`:return e.body.kind===`Not`?Ov(e.body.body):$(`Not`,Ov(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Ov(e.body));default:return e}},kv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return kv(e.operands[0]);let t=Math.floor(e.operands.length/2);return pv(e.kind,kv(mv(e.kind,e.operands.slice(0,t))),kv(mv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,kv(e.body));default:return e}},Av=(e,t)=>{e.kind===`Eventually`&&!xv(t,e)&&t.push(e),`body`in e&&Av(e.body,t),`operands`in e&&e.operands.forEach(e=>Av(e,t))},jv=e=>{let t=e.filter(fv),n=e.flatMap(e=>e.kind===`Not`&&fv(e.body)?[e.body]:[]);return!t.some(e=>xv(n,e))},Mv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new m(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Nv=(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]}},Pv=(e,t,n)=>e.flatMap(e=>{let r=Nv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Fv=e=>[...new Set(e.map(yv))].sort().join(`|`),Iv=(e,t)=>{let n=new Set(t.map(Fv));return[...e.filter(e=>!n.has(Fv(e))),...t]},Lv=e=>{let t=Mv(e),n=Pv(t,`Always`,`And`),r=Pv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Nv(t,`Eventually`,`Or`);if(n&&!(xv(e,n.first)||xv(e,n.second)))return Iv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(xv(e,t.first)||xv(e,t.second))&&!xv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!jv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Nv(t[e],`Always`,`And`);n&&(xv(t,n.first)||t.push(n.first),xv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)xv(t,e.first)&&xv(t,e.second)&&!xv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!jv(t)?[]:i(t)};return a(e)},Rv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>hv(e)<=1)}),zv=e=>{let t=Lv([e]).map(Rv),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 Lv(n)){let n=Fv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Rv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Bv=(e,t)=>!xv(e,t)||xv(e,t.body),Vv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&hv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Ev(e);if(n){let e=hv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(gv(e))throw new m(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Hv=(e,t)=>{let n=e.findIndex(e=>bv(e,t));return n===-1?(e.push(t),e.length-1):n},Uv=e=>{let t=Dv(Tv(Cv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ov(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Vv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:mv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:bv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&kv(e.formula),n=[];t&&Av(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Hv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Hv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Hv(i,e))}));return{tableau:t&&zv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Wv=()=>v(new m(`Temporal formula is a tautology (its negation is unsatisfiable).`),a.livenessEvaluationFailure),Gv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kv=/* @__PURE__ */ new WeakSet,qv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Jv=(e,t)=>new m(`TLC cannot handle the temporal formula ${vu(e)}${t===void 0?``:`:\n${t}`}`),Yv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ju(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return r.isReleased?0:Yv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Yv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Ru(e,n);if(t)return Ic(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:k(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return cs(e,(e,a)=>(i.value=Math.max(i.value,Yv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Gv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Xv=(e,t)=>{try{return qu(e,t)}catch(e){if(!(e instanceof m))throw e;if(!va(e))return;throw v(new m(`${u}${e.message}`),a.error)}},Zv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Zv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,vu(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Qv(e,t,n));if(e.kind===`Identifier`){let r=k(e)?ju(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Ru(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Ic(a,n)>0){if(i.has(a))throw x();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=qv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Yv(e,t,n)===3)){let t=hd(e,c),r=k(e)?void 0:Ru(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,Dd(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Yv(e.set,t,n)===0),u=l?Xv(e.bounds,c):void 0;if(l&&u){let n=[];if(Ju(e.bounds,u,t,t=>(n.push(...s(e.body,t,vu(e.body))),!1)),n.length===0)throw Wv();return n}return[{expression:e,scope:t,name:o}]},Qv=(e,t,n)=>{let r=jd(e.definitions,qv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kv.add(e.binding);return r},$v=(e,t,n)=>{let i=n.runtime.version===`1.7.4`,a=(e,t,r)=>{let a=r===0&&!i?Yv(e,t,n):r;if(a===0){let r=H(e,qv(n,t));if(typeof r!=`boolean`)throw new m(`TLC expected a boolean value, but did not find one. ${yu(e)}`);return uv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(e,t,n,r)=>{if(o.depth>=100)throw x();o.depth++;let i=p(e,t);o.depth--;let s=hv(i);return s>2?i:a(n,r,s)},c=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,a=qv(n,t),o=k(e)||Ru(r,n)===void 0?ju(t,r):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&Kv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:k(e)?gd(r,a):md(r,n);if(c?.kind!==`Closure`)throw Jv(e);let u=e.kind===`Apply`?e.args:[],d=!k(e)&&Ru(r,n)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,Dd(c,u,a),e,t)),d)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof r||n&&!i;throw!(t instanceof m)||a?t:Jv(e)}},u=(e,t)=>{let i=Yv(e,t,n);if(!e.bounds.every(e=>Yv(e.set,t,n)===0)){if(i<=2)return a(e,t,i);throw Jv(e)}let o=[],s=e.kind===`Forall`;try{Yu(e.bounds,qv(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof m)||n instanceof r)throw n;if(i<=2)return a(e,t,i);throw Jv(e,s&&!va(n)?n.message:void 0)}return o.length===0?uv(s):d(e,t,mv(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=hv(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===`~`&&!k(e)||e.operator===`=>`),p=(e,t)=>{let r=Yv(e,t,n);if(r<=2&&!f(e))return a(e,t,r);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Qv(e,t,n));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,pv(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!k(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,pv(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,mv(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Yv(e.condition,t,n)===0){let r=H(e.condition,qv(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let r=p(e.condition,t);return d(e,t,pv(`Or`,pv(`And`,r,p(e.consequent,t)),pv(`And`,$(`Not`,r),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`,pv(`Or`,i,a))):pv(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Jv(e)}};return p(e,t)},ey=(e,t,n,r,i)=>{let a=e=>ey(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?Lu(H(e.expression,a),`a temporal property predicate`):su(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Lu(H(e.unchanged,a),`a subscript`)?!1:Lu(H(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ey(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new m(`TLC cannot evaluate a temporal formula in a single step`)}},ty=(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)=>ty(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 ey(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ny=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),ry=(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},iy=e=>v(new m(`${i}${e}`),a.error),ay=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!M(e)||!M(i))throw iy(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},oy=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(oy);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},sy=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,cy=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new g(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw iy(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>H(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!A(a)||!N(a))throw iy(`The symmetry operator must specify a set of functions.`);let o=P(a).elements;if(!o.every(j))throw iy(`The symmetry values must be function records.`);let s=o.map(ay),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=oy(sy(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ca.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(ny(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=ry(n,e),r=ny(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!sy(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>M(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},ly=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=dy(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(dy(e[r],t));return a}},uy=(e,t)=>{let n=[],r=[];for(let i of e){let e=dy(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Ft);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Ft(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},dy=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=uy(e.elements,t);return n?Rt(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=ly(n.domain,t),i=ly(n.range,t)??n.range;if(r){let e=Rn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?zt(n.domain,e.range):e}return i===n.range?n:zt(n.domain,i)}if(n===`Interval`||!A(e)||!N(e))return e;let r=P(e),i=ly(r.elements,t);return i?Mn(i):r},fy=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=dy(e[o],i),a===0&&(a=Ft(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},py={line:0,column:0},my=e=>({kind:`Identifier`,name:e,location:py}),hy=/* @__PURE__ */ new Set([`name`,`property`]),gy=(e,t,n)=>{let r=Ru(t,n);if(!r)throw new g(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new g(hy.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},_y=(e,t,n)=>{if(Nc(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return H(my(e),zy(n,void 0,void 0))}catch(e){if(e instanceof m||p(e))return;throw e}},vy=(e,t,n)=>{let r=gy(e,t,n);if(_y(t,r,n)!==void 0)throw new g(`The ${e} ${t} cannot be a constant.`);return r},yy=(e,t,n)=>{let r=n.constants.has(t)?void 0:gy(e,t,n),i=r?_y(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new g(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},by=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},xy=(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})),dd(e.startupDefinitions,r),t.invariants.forEach(e=>{yy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Sy=(e,t)=>{let n=mc({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Ru(e,t)});return e.flatMap(e=>{let r=yy(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
1762
+ `]]),Ch=(e=`master`)=>e===`1.7.4`?Sh:xh,wh=(e,t,r)=>new n(`Applying ${e} to the following value,\nwhich is not ${t}:\n${L(r)}`),Th=e=>j(e)?I(e):void 0,Eh=(e,t,n)=>{let r=R(e,t,n),i=Th(r);if(!i)throw wh(n,`a function with a finite domain`,r);return i},Dh=(e,t,n)=>{let r=R(e,t,n),i=Th(r);if(!i)throw gi(t===0?`first`:`second`,n,`bag`,r);return i},Oh=(e,t)=>{if(!A(e)||!N(e))throw t();return P(e).elements},kh=e=>e.range.every(e=>typeof e==`number`&&e>0),Ah=(e,t)=>{let n=e.domain.findIndex(e=>Xt(e,t));return n===-1?void 0:e.range[n]},jh=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Mh=jh(`BagDiff`,`tlc2.value.impl.Value`,2),Nh=jh(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Ph=jh(`BagUnion`,`tlc2.value.impl.Value`,1),Fh=jh(`BagOfAll`,`tlc2.value.impl.Value`,2),Ih=jh(`BagCup`,`tlc2.value.impl.Value`,2),Lh=jh(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Rh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ii(e)}`;throw Ri(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')`)},zh=(e,t,n)=>{let r=Rh(e,n)+Rh(t,n);if(Ai(r))throw ji(`${e}+${t}`);return r},Bh=(e,t,n,r)=>{let i=Ah(n,e.domain[t]),a=Rh(e.range[t],r);return i===void 0?a:a-Rh(i,r)|0},Vh=(e,t)=>Rn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Xt(e[0],r));a?a[1]=zh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Hh=zt([],[]),Uh=e=>[Ei(`EmptyBag`,Hh),z(`IsABag`,1,e=>{let t=Th(R(e,0,`IsABag`));return t!==void 0&&kh(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Eh(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw wh(`BagCardinality`,`a bag`,t);return zh(e,n,Lh)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=Ah(Eh(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw gi(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=Ah(Eh(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw gi(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Dh(e,t,`(+)`);if(!kh(n))throw gi(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return Vh(t,Ih)}),z(`\\ominus`,2,e=>{let t=Dh(e,0,`(-)`),n=Dh(e,1,`(-)`);return Rn(t.domain.flatMap((e,r)=>{let i=Bh(t,r,n,Mh);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,e=>{let t=R(e,0,`BagUnion`),r=Oh(t,()=>wh(`BagUnion`,`a finite enumerable set`,t));if(r.length<2)return r[0]??Hh;let i=r.map(e=>{let r=Th(e);if(!r)throw new n(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(t)}`);return r});return Vh(i,Ph)}),z(`\\sqsubseteq`,2,e=>{let t=Eh(e,0,`\\sqsubseteq`),n=Eh(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Bh(t,r,n,Nh)<=0)}),Di(`BagOfAll`,2,e=>{let t=Ti(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new n(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(t.literalBody)}`);let r=R(e,1,`BagOfAll`),i=Th(r);if(!i)throw gi(`second`,`BagOfAll`,`function with a finite domain`,r);return Vh(i.domain.map((e,n)=>zt([t.call([e])],[i.range[n]])),Fh)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!j(n))throw new m(`DOMAIN expects a function but received ${L(n)}`);let r=I(n),i=Mn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new m(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Mn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>zt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>zr(Eh(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Oh(t,()=>wh(`BagToSet`,`a function with a finite domain`,t));return zt([...n],n.map(()=>1))})],Wh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Gh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Kh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,qh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Jh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Yh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Xh=e=>{if(!j(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Zh=(e,t)=>Ri(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ii(t)}`),Qh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),$h=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Zh(t,e);return`[${P(e).elements.map(e=>tg(e,t)).join(`,`)}]`},eg=(e,t)=>{let n=I(e),r=Sr(n);return r?`[${r.map(e=>tg(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Qh(typeof e==`string`?e:L(e))}:${tg(n.range[r],t)}`).join(`,`)}}`},tg=(e,t)=>typeof e==`string`?Qh(e):typeof e==`object`?e.kind===`ModelValue`?Qh(e.name):A(e)?$h(e,t):eg(e,t):String(e),ng=e=>{if(A(e))return $h(e,Wh);if(!j(e)||Xh(e))throw Zh(Wh,e);return eg(e,Wh)},rg=e=>{if(!j(e))throw Zh(Gh,e);return eg(e,Gh)},ig=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))},ag=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Dt(e);if(Array.isArray(e))return Yn(e.map(e=>ag(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Dt(e),ag(n,t)]));throw Ri(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},og=(e,t)=>{if(e.trim()===``)return ag(null,t);try{return ag(JSON.parse(e,(e,t,n)=>typeof t==`number`?ig(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ri(t,e.message):e}},sg=(e,t)=>{if(typeof e!=`string`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.StringValue`);return e},cg=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ri(n,`${t} (No such file or directory)`);return r},lg=e=>[Oi(`ToJson`,1,e=>Dt(tg(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Oi(`ToJsonArray`,1,e=>Dt(ng(R(e,0,`ToJsonArray`)))),Oi(`ToJsonObject`,1,e=>Dt(rg(R(e,0,`ToJsonObject`)))),Oi(`JsonSerialize`,2,t=>{let n=sg(R(t,0,`JsonSerialize`),Kh),r=R(t,1,`JsonSerialize`);if(!Sr(r)&&!Xh(r))throw gi(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,tg(r,Kh)),!0}),Oi(`ndJsonSerialize`,2,t=>{let n=sg(R(t,0,`ndJsonSerialize`),qh),r=R(t,1,`ndJsonSerialize`),i=Sr(r);if(!i)throw gi(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${tg(e,qh)}\n`).join(``)),!0}),Oi(`JsonDeserialize`,1,t=>{let n=sg(R(t,0,`JsonDeserialize`),Jh);return og(cg(e,n,Jh),Jh)}),Oi(`ndJsonDeserialize`,1,t=>{let n=sg(R(t,0,`ndJsonDeserialize`),Yh);return Yn(cg(e,n,Yh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>og(e,Yh)))})],ug=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,dg=1e6,fg=(e,t,n)=>{if(typeof e!=`number`||e<0)throw gi(t,n,`nonnegative integer`,e);return e},pg=(e,t,n,r)=>Mn(Array.from({length:t},()=>Mn(e.filter(()=>r.nextDouble()<n)))),mg=(e,t)=>{let n=`RandomSetOfSubsets`,r=fg(R(e,0,n),`first`,n),i=fg(R(e,1,n),`second`,n),a=R(e,2,n);if(!A(a)||!N(a))throw gi(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw gi(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw gi(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return pg(o,r,o.length===0?0:i/o.length,t.getRandom())},hg=e=>[Oi(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw gi(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw Ri(ug,String(n));let r=R(t,1,`RandomSubset`);if(!A(r)||!F(r)&&!N(r))throw gi(`second`,`RandomSubset`,`a finite set`,r);let i=ph(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>dg)throw Ri(ug,`Attempted to construct a set with too many elements (>${dg}).`);return Mn(mh(n,r,e.getRandom(),e.version))}),Oi(`RandomSetOfSubsets`,3,t=>mg(t,e)),Oi(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>P(mg(t,e)).elements.length)))],gg=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,_g=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${gg})`,vg=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${gg}) throws java.io.IOException`,yg=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${gg})`,bg=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),xg=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(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 Xn([[`action`,Mn([...i,...a])],[`state`,Mn(r)]])},Sg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return yh(e).get(t)},Cg=(e,t,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new n(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},wg=e=>e.every(e=>e!==void 0),Tg=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),Eg=(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&&!k(e)){if(t.variableIndex.has(r))return!0;let e=Ru(r,t);if(e&&!n.has(e)&&(n.add(e),Eg(e.body,t,n)))return!0}return Je(e).some(e=>Eg(e,t,n))},Dg=(e,t)=>{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,t=>{let n=R(t,0,`AssertEq`),r=R(t,1,`AssertEq`),i=Xt(n,r);return i||(e(L(`Assertion failed`,!0)),e(L(n,!0)),e(L(r,!0))),i}),Gi(`AssertError`,2,e=>{let n=Ti(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ri(_g,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Ki(e,0,`AssertError`)();try{Ki(e,1,`AssertError`)()}catch(e){if(e instanceof m)return xa(e.message,t.isTool)===r;throw e}return!1}),Oi(`TLCGetOrDefault`,2,e=>{let n=R(e,0,`TLCGetOrDefault`);return Sg(t,n)??R(e,1,`TLCGetOrDefault`)}),{...Di(`TLCGetAndSet`,4,n=>{let r=R(n,0,`TLCGetAndSet`),i=Sg(t,r)??R(n,3,`TLCGetAndSet`),a=Ti(n,1,`TLCGetAndSet`);return Cg(t,e,r,a.call([i,R(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Oi(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!wg(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ri(vg,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(t.getBehavior(r).map(e=>Tg(e,n.environment)))}),Oi(`CounterExample`,0,()=>t.counterExample??Xn([[`action`,Mn([])],[`state`,Mn([])]])),z(`ToTrace`,1,e=>{let t=R(e,0,`ToTrace`);if(!j(t)||!Xt(zr(t),Mn([`action`,`state`])))throw new m(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(t)}`);let n=P(Lr(t,`state`)).elements.map(e=>Sr(e)??[]);return Yn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let t=R(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new n(`The argument of ModelValue should be a string, but instead it is:\n${L(t)}`);return Lt(t)}),Gi(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),Gi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!wg(r))throw Ri(yg,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Lu(Ki(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new _(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Gi(`TLCCache`,2,(e,t)=>{let n=Ti(e,0,`TLCCache`),i=ii(Ki(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Eg(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,Ym([R(e,0,`TLCFP`)])))),Oi(`TLCEvalDefinition`,1,(e,t)=>{let r=R(e,0,`TLCEvalDefinition`),i=typeof r==`string`&&t?Ru(r,t.environment):void 0;if(!i||typeof r!=`string`||!t)throw new n(`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 n(`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},t)})]},Og=(e,t)=>[Oi(`_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}),Oi(`_Counts`,0,()=>vh(t)),Oi(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(vh(t),!0)),!1)}),Oi(`_PrintCounts`,0,()=>(e(L(vh(t),!0)),!0))],kg=e=>String(e).padStart(2,`0`),Ag=e=>`${e.getUTCFullYear()}.${kg(e.getUTCMonth()+1)}.${kg(e.getUTCDate())}.${kg(e.getUTCHours())}${kg(e.getUTCMinutes())}${kg(e.getUTCSeconds())}`,jg=e=>Rn([...e].map(([e,t])=>[e,Yn([t])])),Mg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Ng=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Pg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Fg=(e,t,r)=>{if(e.version===`1.7.4`?!Ng.has(t)||!e.isStarted&&Pg.has(t):!e.isStarted&&Mg.has(t))throw new n(`TLCGet(${t}) was undefined.`);let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Dt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Dt(Ag(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return bg(void 0);case`all`:return jg(e.registers);case`all:named`:return jg(yh(e))}if(t.startsWith(`s:`)){let r=yh(e).get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(t.startsWith(`-D`))return Dt(e.properties.get(t.slice(2))??t);throw new n(`TLCGet(${t}) was undefined.`)},Ig=(e,t,r)=>{if(typeof t==`number`&&t>=0){let r=e.registers.get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(typeof t!=`string`)throw new n(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(t)}`);return Fg(e,t,r?.state)},Lg=e=>e.length===0?[[]]:e.flatMap((t,n)=>Lg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Rg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Rg),e.kind===`Function`&&e.range.forEach(Rg))},zg=(e,t)=>[z(`Print`,2,t=>(e(`${it(L(R(t,0,`Print`),!0,!0))} ${it(L(R(t,1,`Print`),!0,!0))}`),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(it(L(R(t,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new n(`The first argument of Assert evaluated to FALSE; the second argument was:\n${it(L(R(e,1,`Assert`)))}`,a.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Rn([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=wi(e,0,`@@`),n=wi(e,1,`@@`);return zn([...ft(t),...ft(n)])}),z(`ToString`,1,e=>Dt(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return Rg(t),t}),z(`Permutations`,1,e=>{let t=Si(e,0,`Permutations`);return Mn(Lg(t).map(e=>Rn(t.map((t,n)=>[t,e[n]]))))}),Di(`SortSeq`,2,e=>{let t=Ti(e,1,`SortSeq`);return Yn(Ci(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)]},[]))}),t.version===`1.7.4`?zi({...Oi(`TLCGet`,1,(e,n)=>Ig(t,R(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):zi(Gi(`TLCGet`,1,(e,n)=>Ig(t,Ki(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Oi(`TLCSet`,2,n=>{let r=R(n,0,`TLCSet`);return Cg(t,e,r,R(n,1,`TLCSet`)),!0}),Ei(`Any`,Nt),z(`RandomElement`,1,e=>gh(xi(e,0,`RandomElement`),t.getRandom()))],Bg=(e,t)=>e.every(e=>Er(e,t)),Vg=Mn([!1,!0]),Hg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Ln(Hg(e,t,r),Hg(e,r,n))},Ug=[`\\cup`,`\\cap`,`\\`],Wg=e=>typeof e==`object`&&e.kind===`MixedSet`,Gg=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return Nn(r.filter(e=>Er(e,n)===t))}if(r.length===0)return n;if(!ot(n))return Kt({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!Er(e,t));return Nn([...r,...i])},Kg=[Ei(`TRUE`,!0),Ei(`FALSE`,!1),Ei(`BOOLEAN`,Vg),Ei(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ki(`=`,An),ki(`#`,(e,t)=>!An(e,t)),z(`~`,1,e=>!yi(e,0,`~`)),z(`<=>`,2,e=>yi(e,0,`<=>`)===yi(e,1,`<=>`)),z(`/\\`,2,e=>yi(e,0,`/\\`)&&yi(e,1,`/\\`)),z(`\\/`,2,e=>yi(e,0,`\\/`)||yi(e,1,`\\/`)),z(`=>`,2,e=>!yi(e,0,`=>`)||yi(e,1,`=>`)),z(`\\in`,2,e=>Er(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Er(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=bi(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?Bg(P(t.base).elements,n.base):Bg(P(t).elements,n)}),...Ug.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if(ot(n)&&ot(r)&&!Wg(n)&&!Wg(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?Ln:e===`\\cap`?In:Fn;return Tr((e,n)=>t(P(e),P(n)),(t,n)=>Gg(e,t,n),n,r)}return ot(n)?Gg(e,n,r):e!==`\\`&&ot(r)?Gg(e,r,n):Kt({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=bi(e,0,`UNION`),n=st(t)?t.elements.filter(st):[];if(!st(t)||n.length!==t.elements.length)return Kt({kind:`Union`,base:t});if(Wg(t)||n.some(Wg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Er(t,e)||e.elements.push(t)})),Nn(e.elements)}return n.length===0?Pn:Hg(n.map(P),0,n.length)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!j(t))throw new m(`DOMAIN expects a function but received ${L(t)}`);return zr(t)})],qg=Vi(`Integers`,`Neg`,`IntValue`,1),Jg=e=>{let t=Vi(e,`DotDot`,`IntervalValue`,2);return[Hi(e,`+`,`Plus`,(e,t)=>e+t),Hi(e,`-`,`Minus`,(e,t)=>e-t),Hi(e,`*`,`Times`,(e,t)=>e*t),Hi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new n(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new n(`0^0 is undefined.`);return e**t}),Hi(e,`\\div`,`Divide`,(t,r)=>{if(r===0)throw new n(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/r)|0;return e<0&&Math.imul(e,r)!==t?e-1:e}let i=Math.floor(t/r);if(Ai(i))throw ji(`${t} \\div ${r}`);return i}),Hi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new n(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),z(`..`,2,e=>({kind:`Interval`,low:Bi(R(e,0,`..`),t),high:Bi(R(e,1,`..`),t)}))]},Yg=Jg(`Naturals`),Xg=Jg(`Integers`),Zg=e=>{let t=Yg.indexOf(e);return t===-1?void 0:Xg[t]},Qg=[Ei(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Yg,Wi(`<`,(e,t)=>e<t),Wi(`>`,(e,t)=>e>t),Wi(`<=`,(e,t)=>e<=t),Wi(`>=`,(e,t)=>e>=t,`>`)],$g=[Ei(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Xg,Wi(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=Bi(R(e,0,`-`),qg);if(Ai(-t))throw ji(`-${t}`);return-t})],e_=(e,t,r)=>{let i=R(e,t,r),a=Sr(i);if(!a)throw new n(`${r}\n${L(i)}`);return a},t_=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:e_(e,t,n)},n_=(e,t,n)=>typeof e==`string`?Dt(e.slice(t,n)):Yn(e.slice(t,n)),r_=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,i_=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,a_=(e,t)=>{let n=Af.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?zi(e,t):e}):t},o_=e=>a_(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>t_(e,0,r_(``,`Len`)).length),z(`\\o`,2,e=>{let t=t_(e,0,i_(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=e_(e,1,i_(`t \\o s`,`sequence`));return Yn([...t,...n])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new n(`${i_(`t \\o s`,`string`)}\n${L(r)}`);return Dt(t+r)}),z(`Append`,2,t=>Yn([...e_(t,0,i_(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let t=e_(e,0,r_(``,`Head`));if(t.length===0)throw new n(`Attempted to apply Head to the empty sequence.`);return t[0]}),z(`Tail`,1,e=>{let t=t_(e,0,r_(``,`Tail`));if(t.length===0)throw new n(`Attempted to apply Tail to the empty sequence.`);return n_(t,1)}),z(`SubSeq`,3,e=>{let t=t_(e,0,r_(`first `,`SubSeq`)),r=vi(e,1,`SubSeq`),i=vi(e,2,`SubSeq`);if(r>i)return n_(t,0,0);let a=r<1||r>t.length?{position:`second`,value:r}:i>t.length?{position:`third`,value:i}:void 0;if(a)throw new n(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return n_(t,r-1,i)}),Di(`SelectSeq`,2,e=>{let t=Ti(e,1,`SelectSeq`);return Yn(e_(e,0,r_(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw gi(`second`,`SelectSeq`,`operator`,n);return n}))})]),s_=e=>a_(`FiniteSets`,[z(`IsFiniteSet`,1,e=>{let t=R(e,0,`IsFiniteSet`);if(A(t))return br(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new m(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${L(t)}\nis a finite set.`:`Attempted to check if the ${ct(t)} ${L(t)} is a finite set.`)}),z(`Cardinality`,1,t=>{let r=R(t,0,`Cardinality`);if(!A(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new n(`Attempted to compute cardinality of the value\n${L(r)}`);return vr(r,e)})]),c_=/* @__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`]]]),l_=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Qg};case`Integers`:return{extends:[`Naturals`],operators:$g};case`Sequences`:return{extends:[],operators:o_(n.version)};case`FiniteSets`:return{extends:[],operators:s_(n.version)};case`TLC`:return{extends:[],operators:a_(`TLC`,zg(t,n))};case`Randomization`:return{extends:[],operators:hg(n)};case`_Possible`:return{extends:[],operators:Og(t,n)};case`Json`:return{extends:[],operators:lg(r)};case`Bags`:return{extends:[],operators:Uh(i)};case`TLCExt`:return{extends:[],operators:Dg(t,n)};default:return}},u_=`$subexpression`,d_=(e,t)=>new l(`${e} at line ${t.line}, column ${t.column}`),f_=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return f_(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Je(e)){let e=f_(r,t,n);if(e)return e}},p_=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),m_=(e,t)=>{let n=e.location,r=p_(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 d_(`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 d_(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:u_,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:u_,args:e.args,location:n,resolution:Ia},location:n}},h_=(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:Ia})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ia}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ia};return m_({...t,params:[...t.params,...r]},a)},g_=(e,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 d_(i,a);Ra.set(r,{args:e.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:t(n),message:i}}),s.isFailed=!0},l=t=>{let r=[],i=[];for(;s.index<e.length;){let o=e[s.index];if(o.kind!==`Name`)throw d_(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=t?t.find(e=>as(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw d_(`Unknown operator ${r.join(`!`)}`,a)},u=t=>{let n=l(t),u=n.definition,d=Ua(u),f=s.index===e.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 d_(`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<e.length&&!s.isFailed;){let t=e[s.index];if(t.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&f_(s.current,t.name,[]);if(!a)return c(n,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(!i&&t.args.length!==l.length)return c(n,`Label \`${t.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(...t.args),s.current=a.label.body,s.index++}},f=t=>{let n=s.current;if(!n)throw d_(`Subexpression selection failed`,a);if(t.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||uo(t.operand,1)!==0)throw d_(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=ho(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&o.args.push(...t.args),s.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[uo(t.operand,r.length)],o=e[s.index+1];if(!i||o?.kind!==`Operand`)throw d_(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=uo(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw d_(`Nonexistent CASE operand`,a);s.current=l;return}if(t.kind!==`Operand`)throw d_(`Unexpected subexpression selector`,a);let i=r?r.sets:go(n),c=i?.[uo(t.operand,i.length)];if(!c)throw d_(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return h_(p.definition,{...o,args:p.args});for(d();s.index<e.length&&!s.isFailed;){let t=e[s.index];if(t.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw d_(`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 h_(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(t),s.index++}if(s.isFailed)return r;if(!s.current)throw d_(`Subexpression selection failed`,a);return m_(o,s.current)},__=(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 fo(e,t,n)},v_=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Je(e).some(v_),y_=(e,t,n,r=!1)=>{if(!v_(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=cs(e,e=>y_(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>b_(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)=>y_(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:cs(e,e=>y_(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?__(a.name,[],void 0,t):a.kind===`Apply`?__(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=g_(o,t,a,r);return c!==a&&La.add(c),c},b_=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:y_(e.expression,t,n,!0)}))}),x_=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},S_=(e,t)=>b_(e,x_(t.definitions),()=>!1),C_=(e,t)=>{let n=x_([...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=>y_(e,n,i),o=e=>i(e)||!n(e),s=e=>y_(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 b_(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?b_(e,n,o):ss(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=>v_(e.body))||e.assumptions.some(e=>v_(e.expression))?{...p,definitions:e.definitions.map(e=>ss(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},w_=(e,t)=>e.maxLevels[t]??3,T_=e=>{let n=/* @__PURE__ */ new Map,r=t=>{let r=n.get(t);if(r)return r;let i=e(t),a=mc({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(t,a),a},i=/* @__PURE__ */ new Map,a=t=>{let n=i.get(t);if(n)return n;let a=e(t),o=r(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Gs(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Gs(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ks(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Hs(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)&&Gs(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(hc(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(t,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=t(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),l=e(n.module),u=a(n.module),d=r(n.instancer),f=/* @__PURE__ */ new Map;n.lets.forEach(e=>f.set(e.name,{kind:`Let`,definition:e,scope:f}));let p=[...l.constants.map(e=>({...e,maximumLevel:0})),...l.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=d.analyze(t,f);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=d.toOperand(t,f);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),m=(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(p.forEach(e=>{!u.isConstant&&e.level>e.maximumLevel&&s(m(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),p.forEach(e=>{let t=u.constraints.get(e.name);t!==void 0&&e.level>t&&s(m(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=u.argConstraints.get(Bs(e.name,i));a!==void 0&&w_(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}.`)})}),u.argParams.forEach(e=>{let t=Hs(e),r=p.find(e=>e.name===t.operator)?.operator,i=p.find(e=>e.name===t.param);if(!r||!i)return;let a=w_(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 c([...i.values()])}},E_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],D_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),O_=new Map(wf.flatMap(e=>e.map(t=>[t,e[0]]))),k_=e=>O_.get(e)??e,A_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},j_=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},M_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:A_(e)&2147483647,kind:t,isLocal:n}),N_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:k_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:k_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},P_=(e,t)=>{let n=[];for(let r=t;;){let t=N_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},F_=e=>({line:e.line,column:e.column}),I_=(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=P_(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},L_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,R_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},z_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&L_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&L_(e[n+1],e[n+2])?n+=L_(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=>R_[e])}"`:r.text)}return t},B_=e=>e[2]?.text,V_=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},H_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>H_(e.modules,t)).find(Boolean),U_=e=>{let t=e===void 0?[]:be(e),n={module:void 0};return{tokens:t,ranges:V_(t),getModule:()=>n.module??=e===void 0?wm(``):Tm(e,t)}},W_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=U_(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:(Of.has(i)?t?.(i):void 0)??kf.get(i)??t?.(i)??Sm(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(B_(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>H_(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},G_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=P_(t,e+1);i.push({location:F_(t[e]),apply:e=>r.forEach(t=>e.put(M_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:F_(u),apply:t=>t.put(M_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&P_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),D_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(F_(u)),i.push({location:F_(u),apply:e=>e.put(M_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(M_(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=k_(e.name);i.push({location:e.location,apply:n=>n.put(M_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(M_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(M_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=j_();n.set(i??``,o),Cf.toReversed().forEach(e=>o.put(M_(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},K_=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),Tf.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},o=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=I_(a(e),e,o);return c.set(e,n),n},u=e=>o.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>o.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;z_(a(void 0)).forEach((e,t)=>{t===3&&Df.forEach(r),r(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),v.set(n.unit,[...v.get(n.unit)??[],i]),!_.has(i)){if(_.add(i),e(i).tokens.length===0){let t=n.unit??B_(e(void 0).tokens);throw s(i,t)}z_(a(i)).forEach(r)}}E_.forEach(r);let b=/* @__PURE__ */ new Set,ee=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return ee(void 0),Ef.forEach(r),[...n]},q_=(e,t)=>{let n=W_(e,t),r=n.getParsed,i,a=()=>i??=G_(r);return{getStringOrder:e=>K_(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},J_=e=>{switch(e.kind){case`Number`:if(!lt(e.value))throw v(new n(`Integer overflow: ${e.value} is outside TLC's 32-bit range`),a.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Lt(e.name);case`Set`:return Mn(e.elements.map(J_))}},Y_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],X_=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof l))throw n;let r=Xp(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Z_=e=>new l(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Q_=(e,n)=>e.location.range&&n.location.range&&{location:t(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${t(n.location.range)}.`},$_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,ev=e=>e===`Theorem`?`ThmOrAssumpDefNode`:$_(e),tv=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Ts(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),nv=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new m(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Xt(t,r)})});if(t)return t[1];throw new m(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},rv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Je(e).some(e=>rv(e,t)),iv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(bs(e),n.get(e)??n.size)),n},av=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),ov=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Eu(e);if(e.kind===`Number`&&!lt(e.value))throw Du(e);ov(e.kind===`Let`?[...Je(e),...av(e.instances??[])]:Je(e))}),sv=(e,n)=>{let r=n.order??q_(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,p=new Map(Kg.map(e=>[e.name,e])),h=/* @__PURE__ */ new Map,_=_h(e.checkDeadlock,n.seed);_.isWarningEnabled=n.isWarningEnabled??!0,_.isTool=n.isTool??!1,_.version=n.version??`master`;let v=/* @__PURE__ */ new Map,y=/* @__PURE__ */ new Map,b=/* @__PURE__ */ new Map,ee=[],x=/* @__PURE__ */ new Map,te=[],ne=[],re=(e,t)=>te.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ie={value:0},ae=e=>`${e}#${ie.value++}`,oe=[],se=[],ce=T_(e=>{let t=b.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),le=/* @__PURE__ */ new Map,ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,S=e=>{let t=h.get(e);if(t)return t;let r=l_(e,n.print,_,n.files,p);if(!r)return;c_.get(e)?.forEach(S);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>S(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{p.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Ls.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:zs(e,t.name)??i.get(t.name)?.range})}),h.set(e,i),i},C=e=>{if(Of.has(e)&&n.loadModule?.(e)!==void 0)return;let t=S(e),r=c_.get(e)??[];return t&&re(e,r),t&&r.includes(`Integers`)&&S(`Integers`),t},w=e=>(ov([...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]),...av(e.instances)]),e.modules.forEach(w),e);w(i);let T=(e,t)=>{let i=n.loadModule?.(e)??Qe.get(e)??Sm(n.source,e);if(i===void 0)throw s(e,t);let a=X_(i,e,r);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return w(a)},fe=e=>{let t=ne.indexOf(e.name);if(t!==-1){let n=[...ne.slice(t),e.name].map(e=>`${e}.tla`);throw new l(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];ne.push(e.name),te.push(n);let o=Se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:se,levelChecks:a});if(te.pop(),ne.pop(),i.length>0)throw c(i,!1,void 0,se);let s=r.find(e=>n.has(e.name)),u=s&&v.get(s.name),d=u&&Q_(s,u.module);if(d)throw c([d],!1,void 0,se);if(s)throw Z_(s);return a.forEach(e=>e()),{linked:o,closure:n}},pe=(e,t)=>{let r=v.get(e);if(r)return re(e,x.get(e)??[]),r;let i=fe(T(e,t));return(Ch(_.version).has(e)?l_(e,n.print,_,n.files,p):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(p.set(t.key,e),a.delete(t.key))}),v.set(e,i.linked),x.set(e,i.closure),re(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let s=i?void 0:C(e.module);if(s)return he(e,s);let c=i??pe(e.module,t.name);c.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let l=Y_(c),f=`#${ie.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Qo(S_(e,t),l,t,n);oe.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=Ms({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,ns(t,p)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,s)=>{let c=ae(`${i}@${t.name}`),f=s(c);return a.set(c,f),l.length>0&&d.add(f),e.name!==void 0&&ue.set(c,`${e.name}!${ue.get(n)??i}`),o.set(c,!r),u.set(c,{source:n,prefix:e.params.length}),c},createName:ae});return ge(e,c.exported,l,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return l.length>0&&le.set(r,{name:n,location:e.location}),e.name!==void 0&&de.set(r,n),r})},he=(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}])),ge=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},_e=(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:Es(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ve=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ye=(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=ve(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Es(r,n),location:n}}},E=(e,t,n,r)=>{let i=e.location,s=r?void 0:C(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ve(n.arity);return _e(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${ie.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Y_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};oe.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>rv(f(e),p),h=d.map(t=>{let n=ye(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=Ms({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Es(e.params,i),location:i,resolution:Ia}:Ts(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:tv(a,i)),i},createName:ae}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=ve(n.arity),o=[...e.params,...a];return _e(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},be=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),xe=/* @__PURE__ */ new Map,Se=(e,r)=>{let s=Sf(e,n.loadClass?.(e.name),e===i);xe.set(e.name,s.overrides);let c=s.module,l=oe.length,u=new Map([...Kg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:qo,errors:[],warnings:[]},p=[f],m=e=>e.forEach((e,n)=>{let r=h.get(n);if(!r){u.set(n,e),h.set(n,e);return}if(!r.range||!e.range||t(r.range)===t(e.range))return;let i=t(e.range),a=t(r.range);ev(r.kind)===ev(e.kind)?f.warnings.push({location:i,message:`Warning: the ${$_(r.kind)} of '${n}' conflicts with \nits ${$_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${$_(e.kind)} of '${n}' conflicts with \nits ${$_(r.kind)} at ${a}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,v=[],x=[...c.constants],te=c.variables.map(e=>e.name),ne=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:C(e);if(n){m(n);return}let i=t??pe(e,c.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),ne.push(i.variableLocations[t]))}),m(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),v.push(i)});let re=new Map(u),ie=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],ae=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ie.forEach(e=>h.set(e.name,ae(e)));let le=e=>({key:S(e),arity:Ua(e),params:Wa(e),kind:Jo(c,e)?`Theorem`:`Definition`,range:e.location.range}),ue=x.length===0&&te.length===0,S=e=>c===i?e.name:`${e.name}@${r.id}`,w=/* @__PURE__ */ new Map,T=()=>new Map([...r.modules,..._]),fe=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&Ha(e.location,t.location)},_e=e=>{let t=c.modules.find(t=>t.name===e.module);return t?fe(t)?_.get(t.name):void 0:T().get(e.module)},ve=e=>({imported:u,getInstance:e=>{let t=_e(e),n=t?void 0:C(e.module);if(n)return{declarations:[],symbols:he(e,n),instancer:c.name};let r=t??pe(e.module,c.name),i=Y_(r);return{declarations:i,symbols:ge(e,r.exported,i,e=>e),instancer:c.name}},bound:re,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:S,instanced:w,facts:g,reports:p,warnings:r.warnings}),ye=e=>[...ie.filter(t=>Ha(t.location,e)).map(e=>[e.name,ae(e)]),...c.definitions.filter(t=>Ha(t.location,e)).map(e=>[e.name,le(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),Ce=e=>{let t=T(),n=t.get(e.name),i=n&&Q_(e,n.module);if(n&&!i)throw Z_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=Se(e,{id:`${r.id}/${e.name}`,symbols:ye(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||_.set(e.name,o),y.has(e.name)||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=me(e,c,ve(c),ue,T().get(e.module));w.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||h.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>Ce(e)}))].sort((e,t)=>Ha(e.location,t.location)?-1:1).forEach(e=>e.link());let D=C_(Is(c,(e,t)=>E(e,t,c.name,_e(e))),be(u));r.errors.push(...es(D,ve(D))),D.definitions.forEach(e=>{let t=S(e);a.set(t,e),o.set(t,!ue);let n=le(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||h.set(e.name,n))});let we={module:D,constants:x,variables:te,variableLocations:ne,visible:u,exported:h,modules:_,extended:v,facts:/* @__PURE__ */ new Set([...g,...[...D.theorems,...D.assumptions].flatMap(e=>e.name??[])])};b.has(c.name)||b.set(c.name,we);let Te=oe.splice(l).map(e=>({location:e.location,check:()=>ce(e)}));return r.levelChecks.push(()=>gc(D,{constants:new Set(x.map(e=>e.name)),variables:new Set(te),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>de.get(u.get(e)?.key??e)},Te,se)),ee.push(we),we},Ce=fe(i).linked;se.length>0&&!n.isSanyReported&&n.print(f(se));let D=e=>Ce.visible.get(e)?.key??e;Ce.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(Ce,/* @__PURE__ */ new Set);let Ee=Ce.constants.map(e=>e.name),De=Ce.variables,Oe=e=>e.module===void 0?[e.name,D(e.name)]:e.module===i.name||Ee.includes(e.name)?[]:[(v.get(e.module)??y.get(e.module))?.visible.get(e.name)?.key??e.name],ke=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:Ce.constants.find(t=>t.name===e)?.arity??0},Ae=/* @__PURE__ */ new Map,je=/* @__PURE__ */ new Set,Me=(e,t)=>{p.set(e,t),a.delete(e),Ae.delete(e),je.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=J_(e.value);kn(t),Oe(e).forEach(e=>{let n=ke(e);n===0?Ae.set(e,t):Me(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ne=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ne.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new g(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(J_),J_(e.value)]),Ne.set(t,n)}),Ne.forEach(e=>Oe(e).forEach(t=>Me(t,nv(e.name,ke(t)||e.rows[0][0].length,e.rows))));let Pe=new Map(e.substitutions.flatMap(e=>Oe(e).map(t=>[t,D(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!Ee.includes(n)&&!Ce.visible.has(n))throw new g(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new g(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let i=D(r),o=a.get(i);if(!(o!==void 0||p.has(i)||Ae.has(i)||Ee.includes(r)||De.includes(r)))throw new g(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(o?.kind===`Operator`&&o.params.length!==(Ce.constants.find(e=>e.name===n)?.arity??Ce.visible.get(n)?.arity))throw new g(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Fe=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Oe)),Ie=(e,t)=>{if(Fe.has(e))return{key:e,prefix:t};let n=u.get(e);return n&&Ie(n.source,t+n.prefix)};u.forEach((e,t)=>{let n=Ie(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=_e(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),Ce.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Le=Ee.filter(e=>!Ae.has(e)&&!Pe.has(e)&&!je.has(e));if(Le.length>0&&!n.isUnconfigured){let e=r.getDeclarationOrder(`constant`).find(e=>Le.includes(e))??Le[0];throw new g(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&p.forEach((e,t)=>{let n=Zg(e);n&&p.set(t,n)});let Re=iv(De,ee.flatMap(e=>e.module.variables.map(e=>e.name))),ze=Ac({definitions:a,substitutions:Pe,constants:Ae,variableIndex:Re,builtins:p,variables:De}),Be={runtime:_,definitions:a,builtins:p,constants:Ae,substitutions:Pe,instanceNames:ue,variables:De,variableIndex:Re,facts:ze,startupValues:Array.from({length:ze.ids.size},()=>void 0),substitutedDefinitions:d,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ve=mc({constants:new Set(Ae.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>p.has(e))]),getDefinition:e=>Ru(e,Be)}),O=e=>{try{H(e,{environment:Be,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof m)return e;throw e}};Pe.forEach((e,t)=>{let n=a.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ve.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?O(n.body):void 0;if(r){let n=va(r)?``:` - specifically: ${r.message}`;throw new g(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),_.version!==`1.7.4`&&(_.isStarted=!0);let He=new Set(ee.flatMap(e=>e.module.instances.map(e=>e.module))),Ue=r.createDefinitionOrder();return{environment:Be,assumptions:we,variableLocations:Ce.variableLocations,instanceActions:le,startupDefinitions:ee.filter(e=>!He.has(e.module.name)||Y_(e).length===0).flatMap(e=>Ue(e===Ce?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:Ce.constants,rootSymbols:Ce.visible,javaOverrides:ee.flatMap(e=>xe.get(e.module.name)??[])}},cv={kind:`Boolean`,value:!0},lv={kind:`Boolean`,value:!1},uv=e=>e?cv:lv,dv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,fv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),pv=(e,t,n)=>({kind:e,operands:[t,n]}),mv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?mv(e,t.operands).operands:[t])}),hv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return hv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,hv(t)),0)}},gv=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 gv(e.body);case`And`:case`Or`:return e.operands.some(gv)}},_v=/* @__PURE__ */ new WeakMap,vv={count:0},yv=e=>{let t=_v.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${vv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(yv).join(`,`)})`;default:return`${e.kind}(${yv(e.body)})`}})();return _v.set(e,n),n},bv=(e,t)=>e===t||yv(e)===yv(t),xv=(e,t)=>{let n=yv(t);return e.some(e=>e===t||yv(e)===n)},Sv=e=>e===`And`?`Or`:`And`,Cv=(e,t)=>{switch(e.kind){case`Boolean`:return t?uv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Cv(e.body,!t);case`And`:case`Or`:return mv(t?Sv(e.kind):e.kind,e.operands.map(e=>Cv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Cv(e.body,t))}}},wv=e=>{switch(e.kind){case`Boolean`:return uv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return mv(Sv(e.kind),e.operands.map(wv));case`Always`:return $(`Eventually`,wv(e.body));case`Eventually`:return $(`Always`,wv(e.body));default:return $(`Not`,e)}},Tv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Tv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return uv(t)}return n.length===0?uv(!t):n.length===1?n[0]:mv(e.kind,n)}case`Not`:{let t=Tv(e.body);return t.kind===`Boolean`?uv(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Tv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Ev=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Dv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Dv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new m(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>mv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Dv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Ev(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:mv(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return mv(`Or`,n)}case`Not`:return dv(e.body)?e:Dv(wv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ov(e.operands[0]):mv(e.kind,e.operands.map(Ov));case`Not`:return e.body.kind===`Not`?Ov(e.body.body):$(`Not`,Ov(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Ov(e.body));default:return e}},kv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return kv(e.operands[0]);let t=Math.floor(e.operands.length/2);return pv(e.kind,kv(mv(e.kind,e.operands.slice(0,t))),kv(mv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,kv(e.body));default:return e}},Av=(e,t)=>{e.kind===`Eventually`&&!xv(t,e)&&t.push(e),`body`in e&&Av(e.body,t),`operands`in e&&e.operands.forEach(e=>Av(e,t))},jv=e=>{let t=e.filter(fv),n=e.flatMap(e=>e.kind===`Not`&&fv(e.body)?[e.body]:[]);return!t.some(e=>xv(n,e))},Mv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new m(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Nv=(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]}},Pv=(e,t,n)=>e.flatMap(e=>{let r=Nv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Fv=e=>[...new Set(e.map(yv))].sort().join(`|`),Iv=(e,t)=>{let n=new Set(t.map(Fv));return[...e.filter(e=>!n.has(Fv(e))),...t]},Lv=e=>{let t=Mv(e),n=Pv(t,`Always`,`And`),r=Pv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Nv(t,`Eventually`,`Or`);if(n&&!(xv(e,n.first)||xv(e,n.second)))return Iv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(xv(e,t.first)||xv(e,t.second))&&!xv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!jv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Nv(t[e],`Always`,`And`);n&&(xv(t,n.first)||t.push(n.first),xv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)xv(t,e.first)&&xv(t,e.second)&&!xv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!jv(t)?[]:i(t)};return a(e)},Rv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>hv(e)<=1)}),zv=e=>{let t=Lv([e]).map(Rv),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 Lv(n)){let n=Fv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Rv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Bv=(e,t)=>!xv(e,t)||xv(e,t.body),Vv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&hv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Ev(e);if(n){let e=hv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(gv(e))throw new m(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Hv=(e,t)=>{let n=e.findIndex(e=>bv(e,t));return n===-1?(e.push(t),e.length-1):n},Uv=e=>{let t=Dv(Tv(Cv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ov(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Vv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:mv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:bv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&kv(e.formula),n=[];t&&Av(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Hv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Hv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Hv(i,e))}));return{tableau:t&&zv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Wv=()=>v(new m(`Temporal formula is a tautology (its negation is unsatisfiable).`),a.livenessEvaluationFailure),Gv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kv=/* @__PURE__ */ new WeakSet,qv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Jv=(e,t)=>new m(`TLC cannot handle the temporal formula ${vu(e)}${t===void 0?``:`:\n${t}`}`),Yv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ju(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return r.isReleased?0:Yv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Yv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Ru(e,n);if(t)return Ic(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:k(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return cs(e,(e,a)=>(i.value=Math.max(i.value,Yv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Gv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Xv=(e,t)=>{try{return qu(e,t)}catch(e){if(!(e instanceof m))throw e;if(!va(e))return;throw v(new m(`${u}${e.message}`),a.error)}},Zv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Zv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,vu(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Qv(e,t,n));if(e.kind===`Identifier`){let r=k(e)?ju(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Ru(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Ic(a,n)>0){if(i.has(a))throw x();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=qv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Yv(e,t,n)===3)){let t=hd(e,c),r=k(e)?void 0:Ru(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,Dd(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Yv(e.set,t,n)===0),u=l?Xv(e.bounds,c):void 0;if(l&&u){let n=[];if(Ju(e.bounds,u,t,t=>(n.push(...s(e.body,t,vu(e.body))),!1)),n.length===0)throw Wv();return n}return[{expression:e,scope:t,name:o}]},Qv=(e,t,n)=>{let r=jd(e.definitions,qv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kv.add(e.binding);return r},$v=(e,t,n)=>{let i=n.runtime.version===`1.7.4`,a=(e,t,r)=>{let a=r===0&&!i?Yv(e,t,n):r;if(a===0){let r=H(e,qv(n,t));if(typeof r!=`boolean`)throw new m(`TLC expected a boolean value, but did not find one. ${yu(e)}`);return uv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(e,t,n,r)=>{if(o.depth>=100)throw x();o.depth++;let i=p(e,t);o.depth--;let s=hv(i);return s>2?i:a(n,r,s)},c=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,a=qv(n,t),o=k(e)||Ru(r,n)===void 0?ju(t,r):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&Kv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:k(e)?gd(r,a):md(r,n);if(c?.kind!==`Closure`)throw Jv(e);let u=e.kind===`Apply`?e.args:[],d=!k(e)&&Ru(r,n)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,Dd(c,u,a),e,t)),d)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof r||n&&!i;throw!(t instanceof m)||a?t:Jv(e)}},u=(e,t)=>{let i=Yv(e,t,n);if(!e.bounds.every(e=>Yv(e.set,t,n)===0)){if(i<=2)return a(e,t,i);throw Jv(e)}let o=[],s=e.kind===`Forall`;try{Yu(e.bounds,qv(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof m)||n instanceof r)throw n;if(i<=2)return a(e,t,i);throw Jv(e,s&&!va(n)?n.message:void 0)}return o.length===0?uv(s):d(e,t,mv(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=hv(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===`~`&&!k(e)||e.operator===`=>`),p=(e,t)=>{let r=Yv(e,t,n);if(r<=2&&!f(e))return a(e,t,r);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Qv(e,t,n));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,pv(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!k(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,pv(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,mv(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Yv(e.condition,t,n)===0){let r=H(e.condition,qv(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let r=p(e.condition,t);return d(e,t,pv(`Or`,pv(`And`,r,p(e.consequent,t)),pv(`And`,$(`Not`,r),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`,pv(`Or`,i,a))):pv(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Jv(e)}};return p(e,t)},ey=(e,t,n,r,i)=>{let a=e=>ey(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?Lu(H(e.expression,a),`a temporal property predicate`):su(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Lu(H(e.unchanged,a),`a subscript`)?!1:Lu(H(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ey(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new m(`TLC cannot evaluate a temporal formula in a single step`)}},ty=(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)=>ty(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 ey(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ny=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),ry=(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},iy=e=>v(new m(`${i}${e}`),a.error),ay=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!M(e)||!M(i))throw iy(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},oy=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(oy);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},sy=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,cy=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new g(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw iy(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>H(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!A(a)||!N(a))throw iy(`The symmetry operator must specify a set of functions.`);let o=P(a).elements;if(!o.every(j))throw iy(`The symmetry values must be function records.`);let s=o.map(ay),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=oy(sy(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ca.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(ny(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=ry(n,e),r=ny(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!sy(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>M(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},ly=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=dy(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(dy(e[r],t));return a}},uy=(e,t)=>{let n=[],r=[];for(let i of e){let e=dy(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Ft);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Ft(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},dy=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=uy(e.elements,t);return n?Rt(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=ly(n.domain,t),i=ly(n.range,t)??n.range;if(r){let e=Rn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?zt(n.domain,e.range):e}return i===n.range?n:zt(n.domain,i)}if(n===`Interval`||!A(e)||!N(e))return e;let r=P(e),i=ly(r.elements,t);return i?Mn(i):r},fy=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=dy(e[o],i),a===0&&(a=Ft(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},py={line:0,column:0},my=e=>({kind:`Identifier`,name:e,location:py}),hy=/* @__PURE__ */ new Set([`name`,`property`]),gy=(e,t,n)=>{let r=Ru(t,n);if(!r)throw new g(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new g(hy.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},_y=(e,t,n)=>{if(Nc(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return H(my(e),zy(n,void 0,void 0))}catch(e){if(e instanceof m||p(e))return;throw e}},vy=(e,t,n)=>{let r=gy(e,t,n);if(_y(t,r,n)!==void 0)throw new g(`The ${e} ${t} cannot be a constant.`);return r},yy=(e,t,n)=>{let r=n.constants.has(t)?void 0:gy(e,t,n),i=r?_y(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new g(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},by=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},xy=(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})),dd(e.startupDefinitions,r),t.invariants.forEach(e=>{yy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Sy=(e,t)=>{let n=mc({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Ru(e,t)});return e.flatMap(e=>{let r=yy(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
1763
1763
  Note that a bug can cause TLC to incorrectly report this error.
1764
1764
  If you believe your TLA+ or PlusCal specification to be correct,
1765
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw v(new g(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),a.safetyEvaluationFailure)}return[{name:e,expression:my(e),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=Ru(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Cy(n.body,t)}return[e]},wy=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Yv(r,e.scope,t)>0)return!1;let i=H(r,zy(t,void 0,void 0,e.scope));if(i===!1)throw new g(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new g(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},Ty=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return vy(n,e,t),my(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[]}}if(e.init!==void 0||e.next!==void 0)throw new g(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],i=[],o=gy(`name`,e.specification,t),s=_y(e.specification,o,t);if(s!==void 0)throw new g(`The value of ${e.specification} is equal to ${L(s)}`);if(Zv(o.body,void 0,t,!1).forEach(o=>{let s=o.expression;if(wy(o,t,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw v(new g(`TLC does not support temporal existential, nor universal, quantification over state variables.`),a.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){r.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Yv(s.expression,o.scope,t)<2)throw v(new m(`TLC cannot handle the temporal formula ${vu(s.expression)}`),a.error);let c=Yv(s,o.scope,t);if(c===3)i.push(o);else{if(c===2)throw new g(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(o)}}),r.length>1)throw new g(`The specification ${e.specification} must contain at most one [][Next]_vars`);let c=[...n,...r],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:n.length===0?void 0:{kind:`And`,operands:n.map(d),location:py},next:r.length===0?void 0:d(r[0],n.length),scope:u,temporals:i}},Ey=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=yy(`property`,e,t);if(!i)return;Yv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Zv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(wy(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Yv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!k(e)?Ru(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Yv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new g(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Dy=(e,t,n)=>t.flatMap(t=>yy(e,t,n)?[{name:t,expression:my(t),scope:void 0}]:[]),Oy=(e,t)=>{let n=Ru(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ky=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new g(`_POSSIBLE lists ${n} more than once`);vy(`possible`,n,t);let i=my(n);if(Yv(i,void 0,t)===3)throw new g(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Ay=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||k(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},jy=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Ru(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},My=(e,t)=>e.flatMap(e=>Cy(e.expression,t).map(n=>{let r=e.scope===void 0?Rc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Ay(n,r,t),predicate:jy(e.expression,t)}})),Ny=(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},Py=/[\u0100-\uffff]/,Fy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Iy=e=>e.kind===`String`?Py.test(e.value):e.kind===`Set`&&e.elements.some(Iy),Ly=e=>e.kind===`String`&&Py.test(e.value)||e.kind===`Apply`&&Fy.has(e.operator)||Je(e).some(Ly),Ry=(e,t)=>e.constants.some(e=>Iy(e.value)||(e.args??[]).some(Iy))||[...t.definitions.values()].some(e=>Ly(e.body)||e.kind===`Function`&&e.bounds.some(e=>Ly(e.set))),zy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),By=(e,t,n)=>Lu(H(e,t),n),Vy=(e,t,n=Hy)=>{let r=H(e,t);if(typeof r!=`boolean`)throw new m(n(e,t.environment));return r},Hy=(e,t)=>{let n=e.kind===`Identifier`?Ru(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`?_u(i):yu(r)}`},Uy=(e,t)=>Vy(e.expression,t,(n,r)=>(Vy(e.predicate,t),Hy(n,r))),Wy=()=>{},Gy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=By(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ky=(e,t,n)=>{try{return By(e,zy(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof m)return{message:e.message};throw e}},qy=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ky(n.expression,t,`an assumption`);if(e)return{name:vu(n.expression),trace:[],message:e.message}}},Jy=(e,t,n,r)=>{let o=Sy(e.invariants,t),s=Ty(e,t),c=Ey(e,t,r),l=My([...o,...c.invariants],t),u=[...new Map(l.map(e=>[e.predicate,e])).values()],d=l.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||t.variables.length>0))throw new g(t.runtime.version===`1.7.4`?fa:`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new g(`The configuration file did not specify the next state predicate.`);let f=My(Dy(`constraint`,e.constraints,t),t),p=Dy(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&gy(`rlreward`,e.rlReward,t),e.periodic!==void 0&&gy(`periodic`,e.periodic,t);let h=ky(e.possible,t);if(t.variables.length===0)return;let _=e.symmetry===void 0?void 0:cy(e.symmetry,t,e.substitutions);e.view!==void 0&&gy(`view function`,e.view,t);let y=e.view===void 0?void 0:{name:e.view,expression:my(e.view),scope:void 0},b=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:py};return{...e,unchanged:t}}),ee=e=>Yv(e.expression,void 0,t)>=2,x=h.filter(e=>!ee(e)),te=h.filter(ee),ne=t.runtime,re={indices:void 0},ie=()=>{if(re.indices)return re.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return re.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),re.indices},ae=(e,n)=>H(e,zy(t,n,void 0)),oe=e=>{let t=ie(),n=_===void 0?e:fy(e,_,t);return Ym(y===void 0?t.map(e=>n[e]):[ae(y.expression,n)])},se=/* @__PURE__ */ new WeakSet,ce=(e,n,r)=>{let i=r&&!se.has(r)?r:void 0;if(Ny(e,n,i))return!1;try{let r=zy(t,n,void 0,e.scope),a=e.membership;return i&&a?!Ar(n[a.variable],i[a.variable],H(a.set,r)):!Uy(e,r)}catch(t){throw r?Ea(v(t,a.safetyEvaluationFailure),ca.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},le=Ry(e,t);ne.getFingerprint=oe;let ue=()=>{let e=h.find(e=>!ne.possibleCounts.get(e.name));if(!e)return;let n=Oy(e.name,t),r=n?` at ${_u(n)}`:``;return{name:e.name,code:ca.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:it(L(vh(ne),!0))}};return{properties:c,spec:s,isSymmetric:_!==void 0,isConstrained:f.length>0||p.length>0,getTlcOrder:ie,getStoredFingerprints:(e,t)=>y!==void 0||le?BigInt64Array.from(e,oe):Xm(t,ie()),getFingerprintState:e=>{if(le)return[String(oe(e))];let t=_===void 0?e:fy(e,_,ie());return y===void 0?t:[ae(y.expression,t)]},findViolatedInvariant:(e,t)=>{let n=l.find(n=>ce(n,e,t));return n&&se.add(e),n},getViolatedInvariants:e=>{let t=u.filter(t=>l.some(n=>n.predicate===t.predicate&&ce(n,e,void 0)));return t.length>0&&se.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Vy(n,zy(t,e,void 0,r));f.every(e=>r(e.predicate,e.scope))&&n();let i=u.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=c.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(f.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope)))&&p.every(r=>Vy(r.expression,zy(n,e,t,r.scope))))||r())||u.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope))))&&b.every(r=>Vy(r.box,zy(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>f.every(r=>Ny(r,e,n)||Uy(r,zy(t,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(n=>!Vy(n.expression,zy(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>b.find(r=>{try{return!Vy(r.action,zy(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${vu(r.box)}`)&&!By(r.unchanged,zy(t,e,n,r.scope),`a subscript`)}catch(e){throw Ea(Yy(e),ca.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>p.every(r=>Vy(r.expression,zy(t,e,n),e=>`${i}${Hy(e,t)}`)),trackStatePossible:x.length===0?Wy:e=>Gy(x,ne,zy(t,e,void 0)),trackActionPossible:te.length===0?Wy:(e,n)=>Gy(te,ne,zy(t,e,n)),findUnwitnessedPossible:ue,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=Ru(e,t);return n!==void 0&&ud(n,t)!==void 0});if(r!==void 0){if(n)return;throw v(new m(`${i}The post condition ${r} cannot be a constant.`),a.error)}let o=ue();if(o)return o;for(let n of e.postconditions){let e=Ky(my(n),t,`a postcondition`);if(!e)continue;let r=Oy(n,t),i=r?` at ${_u(r)}`:``;return e.message===void 0?{name:n,code:ca.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:ca.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},Yy=e=>e instanceof n?v(e,e.exitCode):e,Xy=(e,t)=>e*((t-e)/2**64),Zy=e=>e.includes(`.`)?e:`${e}.0`,Qy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Zy(String(e));let[n,r]=e.toExponential().split(`e`);return`${Zy(n)}E${r.replace(`+`,``)}`},$y=e=>e!==void 0&&e>=`0`&&e<=`9`,eb=e=>{if(e===0)return`0.0`;let t=Qy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;$y(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(;$y(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;$y(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for($y(t[n.next])&&Number(t[n.next])>=5&&(n.result=tb(n.result));$y(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},tb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${tb(r)}.`:n===`9`?`${tb(r)}0`:`${r}${Number(n)+1}`},nb=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}`)},rb=(e,t,n)=>{if(Xy(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},ib=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}).`},ab=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},ob=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ri(e[t]),1540483477);t[0]=ab(n)||1,t[1]=ab(r)},sb=()=>{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)}}},cb=(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}},lb=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),ub=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return cb(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},db=e=>Atomics.load(e.used,0)*2>=e.slots.length,fb=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&cb(t,n);return{slots:t,used:e.used}},pb=[void 0,`lambda`,`tuple`,`record`],mb=()=>{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=Rr(e.domain);return t?(r(7),r(pb.indexOf(Ht(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(pb.indexOf(Ht(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})}},hb=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 Lt(t.strings[n[r.index++]]);if(e===5)return Rt(i(n[r.index++]));let a=pb[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Vt(zt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Vt(zt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Ru as $,yv as A,pi as At,Sm as B,St as Bt,ey as C,Ma as Ct,mv as D,Xn as Dt,$v as E,Lt as Et,xg as F,Et as Ft,wf as G,Ke as Gt,Dm as H,I as Ht,Sh as I,Zr as It,Bd as J,T as Jt,jd as K,qe as Kt,xh as L,j as Lt,sv as M,Yr as Mt,q_ as N,Xr as Nt,$ as O,Mn as Ot,bg as P,Dt as Pt,_u as Q,Ch as R,Qt as Rt,Wv as S,Da as St,Yv as T,tn as Tt,Em as U,Je as Ut,wm as V,wt as Vt,Xp as W,k as Wt,H as X,ge as Xt,vu as Y,pe as Yt,Yu as Z,be as Zt,vy as _,Ca as _t,fb as a,uu as at,xy as b,ja as bt,ob as c,pl as ct,rb as d,ca as dt,Fd as et,Xy as f,la as ft,qy as g,wa as gt,Jy as h,xa as ht,lb as i,cu as it,Bv as j,L as jt,Uv as k,Yn as kt,eb as l,ml as lt,my as m,ba as mt,mb as n,ju as nt,ub as o,lu as ot,ib as p,da as pt,Dd as q,ze as qt,sb as r,md as rt,db as s,du as st,hb as t,Pd as tt,nb as u,Nc as ut,zy as v,_a as vt,ty as w,Hr as wt,Yy as x,va as xt,by as y,Fa as yt,Ym as z,Yt as zt};
1765
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw v(new g(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),a.safetyEvaluationFailure)}return[{name:e,expression:my(e),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=Ru(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Cy(n.body,t)}return[e]},wy=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Yv(r,e.scope,t)>0)return!1;let i=H(r,zy(t,void 0,void 0,e.scope));if(i===!1)throw new g(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new g(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},Ty=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return vy(n,e,t),my(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[]}}if(e.init!==void 0||e.next!==void 0)throw new g(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],i=[],o=gy(`name`,e.specification,t),s=_y(e.specification,o,t);if(s!==void 0)throw new g(`The value of ${e.specification} is equal to ${L(s)}`);if(Zv(o.body,void 0,t,!1).forEach(o=>{let s=o.expression;if(wy(o,t,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw v(new g(`TLC does not support temporal existential, nor universal, quantification over state variables.`),a.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){r.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Yv(s.expression,o.scope,t)<2)throw v(new m(`TLC cannot handle the temporal formula ${vu(s.expression)}`),a.error);let c=Yv(s,o.scope,t);if(c===3)i.push(o);else{if(c===2)throw new g(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(o)}}),r.length>1)throw new g(`The specification ${e.specification} must contain at most one [][Next]_vars`);let c=[...n,...r],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:n.length===0?void 0:{kind:`And`,operands:n.map(d),location:py},next:r.length===0?void 0:d(r[0],n.length),scope:u,temporals:i}},Ey=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=yy(`property`,e,t);if(!i)return;Yv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Zv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(wy(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Yv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!k(e)?Ru(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Yv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new g(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Dy=(e,t,n)=>t.flatMap(t=>yy(e,t,n)?[{name:t,expression:my(t),scope:void 0}]:[]),Oy=(e,t)=>{let n=Ru(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ky=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new g(`_POSSIBLE lists ${n} more than once`);vy(`possible`,n,t);let i=my(n);if(Yv(i,void 0,t)===3)throw new g(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Ay=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||k(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},jy=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Ru(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},My=(e,t)=>e.flatMap(e=>Cy(e.expression,t).map(n=>{let r=e.scope===void 0?Rc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Ay(n,r,t),predicate:jy(e.expression,t)}})),Ny=(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},Py=/[\u0100-\uffff]/,Fy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Iy=e=>e.kind===`String`?Py.test(e.value):e.kind===`Set`&&e.elements.some(Iy),Ly=e=>e.kind===`String`&&Py.test(e.value)||e.kind===`Apply`&&Fy.has(e.operator)||Je(e).some(Ly),Ry=(e,t)=>e.constants.some(e=>Iy(e.value)||(e.args??[]).some(Iy))||[...t.definitions.values()].some(e=>Ly(e.body)||e.kind===`Function`&&e.bounds.some(e=>Ly(e.set))),zy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),By=(e,t,n)=>Lu(H(e,t),n),Vy=(e,t,n=Hy)=>{let r=H(e,t);if(typeof r!=`boolean`)throw new m(n(e,t.environment));return r},Hy=(e,t)=>{let n=e.kind===`Identifier`?Ru(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`?_u(i):yu(r)}`},Uy=(e,t)=>Vy(e.expression,t,(n,r)=>(Vy(e.predicate,t),Hy(n,r))),Wy=()=>{},Gy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=By(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ky=(e,t,n)=>{try{return By(e,zy(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof m)return{message:e.message};throw e}},qy=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ky(n.expression,t,`an assumption`);if(e)return{name:vu(n.expression),trace:[],message:e.message}}},Jy=(e,t,n,r)=>{let o=Sy(e.invariants,t),s=Ty(e,t),c=Ey(e,t,r),l=My([...o,...c.invariants],t),u=[...new Map(l.map(e=>[e.predicate,e])).values()],d=l.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||t.variables.length>0))throw new g(t.runtime.version===`1.7.4`?fa:`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new g(`The configuration file did not specify the next state predicate.`);let f=My(Dy(`constraint`,e.constraints,t),t),p=Dy(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&gy(`rlreward`,e.rlReward,t),e.periodic!==void 0&&gy(`periodic`,e.periodic,t);let h=ky(e.possible,t);if(t.variables.length===0)return;let _=e.symmetry===void 0?void 0:cy(e.symmetry,t,e.substitutions);e.view!==void 0&&gy(`view function`,e.view,t);let y=e.view===void 0?void 0:{name:e.view,expression:my(e.view),scope:void 0},b=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:py};return{...e,unchanged:t}}),ee=e=>Yv(e.expression,void 0,t)>=2,x=h.filter(e=>!ee(e)),te=h.filter(ee),ne=t.runtime,re={indices:void 0},ie=()=>{if(re.indices)return re.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return re.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),re.indices},ae=(e,n)=>H(e,zy(t,n,void 0)),oe=e=>{let t=ie(),n=_===void 0?e:fy(e,_,t);return Ym(y===void 0?t.map(e=>n[e]):[ae(y.expression,n)])},se=/* @__PURE__ */ new WeakSet,ce=(e,n,r)=>{let i=r&&!se.has(r)?r:void 0;if(Ny(e,n,i))return!1;try{let r=zy(t,n,void 0,e.scope),a=e.membership;return i&&a?!Ar(n[a.variable],i[a.variable],H(a.set,r)):!Uy(e,r)}catch(t){throw r?Ea(v(t,a.safetyEvaluationFailure),ca.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},le=Ry(e,t);ne.getFingerprint=oe;let ue=()=>{let e=h.find(e=>!ne.possibleCounts.get(e.name));if(!e)return;let n=Oy(e.name,t),r=n?` at ${_u(n)}`:``;return{name:e.name,code:ca.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:it(L(vh(ne),!0))}};return{properties:c,spec:s,isSymmetric:_!==void 0,isConstrained:f.length>0||p.length>0,getTlcOrder:ie,getStoredFingerprints:(e,t)=>y!==void 0||le?BigInt64Array.from(e,oe):Xm(t,ie()),getFingerprintState:e=>{if(le)return[String(oe(e))];let t=_===void 0?e:fy(e,_,ie());return y===void 0?t:[ae(y.expression,t)]},findViolatedInvariant:(e,t)=>{let n=l.find(n=>ce(n,e,t));return n&&se.add(e),n},getViolatedInvariants:e=>{let t=u.filter(t=>l.some(n=>n.predicate===t.predicate&&ce(n,e,void 0)));return t.length>0&&se.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Vy(n,zy(t,e,void 0,r));f.every(e=>r(e.predicate,e.scope))&&n();let i=u.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=c.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(f.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope)))&&p.every(r=>Vy(r.expression,zy(n,e,t,r.scope))))||r())||u.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope))))&&b.every(r=>Vy(r.box,zy(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>f.every(r=>Ny(r,e,n)||Uy(r,zy(t,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(n=>!Vy(n.expression,zy(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>b.find(r=>{try{return!Vy(r.action,zy(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${vu(r.box)}`)&&!By(r.unchanged,zy(t,e,n,r.scope),`a subscript`)}catch(e){throw Ea(Yy(e),ca.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>p.every(r=>Vy(r.expression,zy(t,e,n),e=>`${i}${Hy(e,t)}`)),trackStatePossible:x.length===0?Wy:e=>Gy(x,ne,zy(t,e,void 0)),trackActionPossible:te.length===0?Wy:(e,n)=>Gy(te,ne,zy(t,e,n)),findUnwitnessedPossible:ue,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=Ru(e,t);return n!==void 0&&ud(n,t)!==void 0});if(r!==void 0){if(n)return;throw v(new m(`${i}The post condition ${r} cannot be a constant.`),a.error)}let o=ue();if(o)return o;for(let n of e.postconditions){let e=Ky(my(n),t,`a postcondition`);if(!e)continue;let r=Oy(n,t),i=r?` at ${_u(r)}`:``;return e.message===void 0?{name:n,code:ca.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:ca.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},Yy=e=>e instanceof n?v(e,e.exitCode):e,Xy=(e,t)=>e*((t-e)/2**64),Zy=e=>e.includes(`.`)?e:`${e}.0`,Qy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Zy(String(e));let[n,r]=e.toExponential().split(`e`);return`${Zy(n)}E${r.replace(`+`,``)}`},$y=e=>e!==void 0&&e>=`0`&&e<=`9`,eb=e=>{if(e===0)return`0.0`;let t=Qy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;$y(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(;$y(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;$y(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for($y(t[n.next])&&Number(t[n.next])>=5&&(n.result=tb(n.result));$y(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},tb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${tb(r)}.`:n===`9`?`${tb(r)}0`:`${r}${Number(n)+1}`},nb=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}`)},rb=(e,t,n)=>{if(Xy(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},ib=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}).`},ab=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},ob=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ri(e[t]),1540483477);t[0]=ab(n)||1,t[1]=ab(r)},sb=()=>{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)}}},cb=(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}},lb=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),ub=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return cb(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},db=e=>Atomics.load(e.used,0)*2>=e.slots.length,fb=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&cb(t,n);return{slots:t,used:e.used}},pb=[void 0,`lambda`,`tuple`,`record`],mb=()=>{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=Rr(e.domain);return t?(r(7),r(pb.indexOf(Ht(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(pb.indexOf(Ht(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})}},hb=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 Lt(t.strings[n[r.index++]]);if(e===5)return Rt(i(n[r.index++]));let a=pb[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Vt(zt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Vt(zt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Ru as $,yv as A,pi as At,Sm as B,St as Bt,ey as C,Ma as Ct,mv as D,Xn as Dt,$v as E,Lt as Et,xg as F,wt as Ft,wf as G,Ke as Gt,Dm as H,I as Ht,Sh as I,Zr as It,Bd as J,T as Jt,jd as K,qe as Kt,xh as L,j as Lt,sv as M,Ct as Mt,q_ as N,Yr as Nt,$ as O,Mn as Ot,bg as P,Xr as Pt,_u as Q,Ch as R,Qt as Rt,Wv as S,Da as St,Yv as T,tn as Tt,Em as U,Je as Ut,wm as V,Et as Vt,Xp as W,k as Wt,H as X,ge as Xt,vu as Y,pe as Yt,Yu as Z,be as Zt,vy as _,Ca as _t,fb as a,uu as at,xy as b,ja as bt,ob as c,pl as ct,rb as d,ca as dt,Fd as et,Xy as f,la as ft,qy as g,wa as gt,Jy as h,xa as ht,lb as i,cu as it,Bv as j,L as jt,Uv as k,Yn as kt,eb as l,ml as lt,my as m,ba as mt,mb as n,ju as nt,ub as o,lu as ot,ib as p,da as pt,Dd as q,ze as qt,sb as r,md as rt,db as s,du as st,hb as t,Pd as tt,nb as u,Nc as ut,zy as v,_a as vt,ty as w,Hr as wt,Yy as x,va as xt,by as y,Fa as yt,Ym as z,Yt as zt};