tla-ts 0.0.10-dev.a17d6d9fa → 0.0.10-dev.a4b81b6d0

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.cjs CHANGED
@@ -9,17 +9,17 @@
9
9
  const e=require("./worker.cjs");let t=require("node:zlib");const n=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),r=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),i=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),a=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),o=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),s=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),c=e=>e.startsWith(`\\`)?parseInt(e.slice(2),s.get(e[1].toLowerCase())):Number(e),l=/-{4,} *MODULE\b/,u=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)u[n.charCodeAt(0)]|=e});const d=(e,t)=>e<128&&(u[e]&t)!==0,f=(e,t,n)=>{let r=t;for(;d(e.charCodeAt(r),n);)r++;return r},p=/* @__PURE__ */ new Map;a.forEach(e=>{let t=e.charCodeAt(0),n=p.get(t)??[];n.push(e),p.set(t,n)});const m=(e,t)=>{let n=p.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},h=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(o.has(n))return n;let r=e[t];return o.has(r)?r:void 0},g=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&d(e.charCodeAt(t+1),2)){let n=e.slice(t+1,f(e,t+1,2)),i=n.length;for(;i>0&&!r.has(n.slice(0,i));)i--;let a=r.get(n.slice(0,i));return{text:a??`\\`,length:a===void 0?1:i+1}}let a=h(e,t);if(a!==void 0)return{text:o.get(a)??``,length:a.length};let s=m(e,t);return s?{text:i.get(s)??s,length:s.length}:n===92?{text:`\\`,length:1}:void 0},_=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),v=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>o.has(e)||_.has(e));return n===void 0?void 0:{text:n,length:n.length}},y=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},b=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:f(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?f(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return y(e,s?o+1:o,e=>e===`.`)-t},ee=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,te={n:`
10
10
  `,t:` `,r:`\r`,f:`\f`},x=(e,t)=>t===9?e+8-e%8:e+1,S=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),ne=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=S.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=f(e,t+2,i);return a===t+2?0:a-t},re=(t,r=!1)=>{let i=l.exec(t);if(!i)throw new e.I(`Expected a module header such as ---- MODULE Name ----`);let a=[],o=/* @__PURE__ */ new Map,s=t.slice(0,i.index).split(`
11
11
  `),c=i.index,u=s.length,p=i.index-s[s.length-1].length,m=0,h=-1,v=0,ee=0,S=()=>{for((h!==p||v>c)&&(h=p,v=p,ee=0);v<c;v++)ee=x(ee,t.charCodeAt(v));return x(ee,t.charCodeAt(c))},re=(e,t,n,r)=>{let i=S();a.push({kind:e,text:t,spelling:r,line:u,column:i,endColumn:i+n-1}),c+=n},C=e=>{for(let n=0;n<e;n++)t.charCodeAt(c)===10&&(u++,p=c+1),c++},ie=n=>new e.I(`${n} at line ${u}, column ${S()}`,void 0,{reason:n,line:u,column:S(),isEnd:c>=t.length});for(;c<t.length;){let e=t.charCodeAt(c);if(e===10||e===32||e===9||e===13){C(1);continue}if(e===92&&t.charCodeAt(c+1)===42){C(y(t,c,e=>e!==`
12
- `&&e!==`\r`)-c);continue}if(e===40&&t.charCodeAt(c+1)===42){let e=0;do{if(c>=t.length)throw ie(`Unterminated comment`);t.startsWith(`(*`,c)?(e++,C(2)):t.startsWith(`*)`,c)?(e--,C(2)):C(1)}while(e>0);continue}if(e===45&&t.startsWith(`----`,c)){let e=y(t,c,e=>e===`-`)-c,n=y(t,c+e,e=>e===` `);t.startsWith(`MODULE`,n)&&m++,re(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,c)){if(re(`ModuleEnd`,`====`,y(t,c,e=>e===`=`)-c),m--,m<=0)break;continue}if(e===34){let e=u,n=S(),r=[];for(C(1);t.charCodeAt(c)!==34;){let e=t.charCodeAt(c);if(c>=t.length||e===10||e===13)throw ie(`Unterminated string`);if(e===92){let e=t[c+1];if(e===void 0||!`ntrf\\"`.includes(e))throw ie(`Invalid escape in string`);r.push(te[e]??e),C(2)}else r.push(t[c]),C(1)}C(1),a.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:S()-1});continue}let i=ne(t,c,r);if(i>0){re(`Number`,t.slice(c,c+i),i);continue}if(d(e,7)){let r=f(t,c,7),i=t.slice(c,r),a=f(t,c,1);if(a===r){let e=t.charCodeAt(r)===46?f(t,r+1,1):r,n=e>r+1,a=n?t.slice(c,e):i;re(n?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let n=e===95?`_`:t.slice(c,a);re(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){re(`Keyword`,i.slice(0,3),3);continue}let s=o.get(i)??i;o.set(s,s),re(n.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let s=t[c];if(e>=128&&_.has(s)){re(`Identifier`,o.get(s)??s,1),o.set(s,s);continue}if(e===60){let e=b(t,c,r);if(e>0){re(`Step`,t.slice(c,c+e),e);continue}}let l=g(t,c);if(l){let e=t.slice(c,c+l.length);re(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw ie(`Unexpected character ${JSON.stringify(s)}`)}let ae=S();return a.push({kind:`End`,text:``,line:u,column:ae,endColumn:ae}),a},C=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],ie=C.map(e=>e[0]),ae=new Map(ie.map((e,t)=>[e,t]).reverse()),w=t=>{let n=ae.get(t);if(n===void 0)throw new e.b(`Unknown SANY token kind ${t}`);return n},oe=new Map(C.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),se=Math.max(...[...oe.keys()].map(e=>e.length)),ce=Array.from({length:se},(e,t)=>se-t),le=/----+ *MODULE/y,ue=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],de=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),fe=de(String.raw`\.\/\\`),pe=de(String.raw`\.\\\/`),T=String.raw`<(?:[0-9]+|\+|\*)>`,E=[[`_BM0`,[le]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,fe],[`BOR`,pe],[`IDENTIFIER`,ue],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${T}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(T,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${T}(?:\*\.*|-\.*|\.+)`,`y`)]]],D=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[le]]],O=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[le]],[`BAND`,fe],[`BOR`,pe],[`IDENTIFIER`,ue]],k=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),me=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,he=(e,t,n)=>e.map(e=>({kind:w(e[0]),length:Math.max(...e[1].map(e=>k(e,t,n)))})).reduce(me,{kind:-1,length:0}),ge=(e,t)=>{let n=ce.find(n=>oe.has(e.slice(t,t+n))),r=he(E,e,t);return n===void 0?r:me(r,{kind:oe.get(e.slice(t,t+n))??-1,length:n})},_e=e=>e+8-e%8,ve=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
12
+ `&&e!==`\r`)-c);continue}if(e===40&&t.charCodeAt(c+1)===42){let e=0;do{if(c>=t.length)throw ie(`Unterminated comment`);t.startsWith(`(*`,c)?(e++,C(2)):t.startsWith(`*)`,c)?(e--,C(2)):C(1)}while(e>0);continue}if(e===45&&t.startsWith(`----`,c)){let e=y(t,c,e=>e===`-`)-c,n=y(t,c+e,e=>e===` `);t.startsWith(`MODULE`,n)&&m++,re(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,c)){if(re(`ModuleEnd`,`====`,y(t,c,e=>e===`=`)-c),m--,m<=0)break;continue}if(e===34){let e=u,n=S(),r=[];for(C(1);t.charCodeAt(c)!==34;){let e=t.charCodeAt(c);if(c>=t.length||e===10||e===13)throw ie(`Unterminated string`);if(e===92){let e=t[c+1];if(e===void 0||!`ntrf\\"`.includes(e))throw ie(`Invalid escape in string`);r.push(te[e]??e),C(2)}else r.push(t[c]),C(1)}C(1),a.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:S()-1});continue}let i=ne(t,c,r);if(i>0){re(`Number`,t.slice(c,c+i),i);continue}if(d(e,7)){let r=f(t,c,7),i=t.slice(c,r),a=f(t,c,1);if(a===r){let e=t.charCodeAt(r)===46?f(t,r+1,1):r,n=e>r+1,a=n?t.slice(c,e):i;re(n?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let n=e===95?`_`:t.slice(c,a);re(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){re(`Keyword`,i.slice(0,3),3);continue}let s=o.get(i)??i;o.set(s,s),re(n.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let s=t[c];if(e>=128&&_.has(s)){re(`Identifier`,o.get(s)??s,1),o.set(s,s);continue}if(e===60){let e=b(t,c,r);if(e>0){re(`Step`,t.slice(c,c+e),e);continue}}let l=g(t,c);if(l){let e=t.slice(c,c+l.length);re(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw ie(`Unexpected character ${JSON.stringify(s)}`)}let ae=S();return a.push({kind:`End`,text:``,line:u,column:ae,endColumn:ae}),a},C=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],ie=C.map(e=>e[0]),ae=new Map(ie.map((e,t)=>[e,t]).reverse()),w=t=>{let n=ae.get(t);if(n===void 0)throw new e.b(`Unknown SANY token kind ${t}`);return n},oe=new Map(C.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),se=Math.max(...[...oe.keys()].map(e=>e.length)),ce=Array.from({length:se},(e,t)=>se-t),le=/----+ *MODULE/y,ue=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],de=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),fe=de(String.raw`\.\/\\`),pe=de(String.raw`\.\\\/`),T=String.raw`<(?:[0-9]+|\+|\*)>`,E=[[`_BM0`,[le]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,fe],[`BOR`,pe],[`IDENTIFIER`,ue],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${T}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(T,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${T}(?:\*\.*|-\.*|\.+)`,`y`)]]],D=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[le]]],O=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[le]],[`BAND`,fe],[`BOR`,pe],[`IDENTIFIER`,ue]],me=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),he=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,ge=(e,t,n)=>e.map(e=>({kind:w(e[0]),length:Math.max(...e[1].map(e=>me(e,t,n)))})).reduce(he,{kind:-1,length:0}),_e=(e,t)=>{let n=ce.find(n=>oe.has(e.slice(t,t+n))),r=ge(E,e,t);return n===void 0?r:he(r,{kind:oe.get(e.slice(t,t+n))??-1,length:n})},ve=e=>e+8-e%8,ye=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
13
13
  `?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
14
- `?o=!0:s===` `&&(i=_e(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},ye=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,A=new Set([...oe.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),be=(e,t)=>{let n=0;for(;A.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,k(ye,e,t)))},xe=e=>{let t=ve(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(w(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?we(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
- `||e[a]===`\r`?we(o+1,0,void 0,i):we(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=he(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,ie[a.kind].startsWith(`_BM`)&&(r=`SPEC`),ie[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(D);if(r===`PRAGMA`)return c(O);for(;n<e.length;){let t=n;if(`
16
- \r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=ge(e,t);if(r.length===0){let n=be(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},Se=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ce=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Se.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),we=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ce(n)}" (${n.charCodeAt(0)}), `}after : "${Ce(r)}"`,Te=e=>{let t=xe(e);for(let e=t();typeof e!=`string`&&e.kind!==w(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?_e(e):e+1,e.beginColumn);return we(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Ee=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],De=/* @__PURE__ */ new Set([...Ee,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Oe=[`TYPE`,`TYPE_CONSTRAINT`],ke=/* @__PURE__ */ new Set([...Ee,...Oe]),Ae=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],je=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},Me=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:we(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:we(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
14
+ `?o=!0:s===` `&&(i=ve(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},be=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,k=new Set([...oe.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),xe=(e,t)=>{let n=0;for(;k.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,me(be,e,t)))},Se=e=>{let t=ye(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(w(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Te(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
+ `||e[a]===`\r`?Te(o+1,0,void 0,i):Te(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=ge(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,ie[a.kind].startsWith(`_BM`)&&(r=`SPEC`),ie[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(D);if(r===`PRAGMA`)return c(O);for(;n<e.length;){let t=n;if(`
16
+ \r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=_e(e,t);if(r.length===0){let n=xe(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},Ce=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),we=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ce.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Te=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${we(n)}" (${n.charCodeAt(0)}), `}after : "${we(r)}"`,Ee=e=>{let t=Se(e);for(let e=t();typeof e!=`string`&&e.kind!==w(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?ve(e):e+1,e.beginColumn);return Te(e.beginLine,n,e.image[t],e.image.slice(0,t))}},De=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Oe=/* @__PURE__ */ new Set([...De,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),ke=[`TYPE`,`TYPE_CONSTRAINT`],Ae=/* @__PURE__ */ new Set([...De,...ke]),je=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Me=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},Ne=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:Te(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:Te(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
18
18
  `);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
19
- `);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=je(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=ne(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=v(e,n)??g(e,n),m=Ae.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},Ne=(t,n)=>new e.v(`TLC found an error in the configuration file at line ${t}\n${n}`),Pe=(e,t)=>Ne(e,`The keyword ${t} appeared twice.`),Fe=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Ie=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),Le=(t,n=`master`)=>{let r=n===`1.7.4`?ke:De,i=Me(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let t=i[Math.min(a++,i.length-1)];if(t.kind===`Error`)throw new e.v(`TLC found an error in the configuration file:\n${t.text}`);return t},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw e.ot(new e.v(`${e.et(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),e.rt.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new e.v(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw Ne(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw Ne(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Ne(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Ne(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw Ne(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Ne(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw Ne(t,``);r=l()}if(r.text!==`=`)throw Ne(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?Fe.get(e):void 0,i=r.has(e)?Ie.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Ne(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw Pe(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Ne(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Pe(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!Oe.includes(e))throw Ne(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Pe(t,e);c.add(e),h=l()}}return o},Re=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],ze=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(Re),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},Be=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},j=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ve=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},He=e=>{let t=Ve(e);return t^t>>>16},Ue=e=>{let t=[...new Set(e)],n=2**Math.max(4,Math.ceil(Math.log2(t.length/.75)));return t.map((e,t)=>({name:e,index:t,bucket:He(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},We={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:` `}},Ge=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Ke=e=>e!==void 0&&/^\p{Nd}$/u.test(e),qe=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Je=e=>{let t=t=>{let n=y(e,t,Ge);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=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);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=t(i)}if(l!==void 0)return c.last=l,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=y(e,t,Ke);if(e.startsWith(`..`,n)&&Ke(e[n+2]))return{kind:`Constant`,first:t,last:y(e,n+2,Ke)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Ke(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:y(e,t+1,Ke)-1,children:[]};if(qe(n))return{kind:`Constant`,first:t,last:y(e,t,qe)-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)},M=e=>{let t=e.length===0?void 0:Je(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=We[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},Ye={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Xe={none:0,error:1,warning:3,state:4},Ze={0:``,1:`Error: `,3:`Warning: `,4:`State `},Qe=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Ze[n]}${r}`,$e=t=>{let n=/* @__PURE__ */ new Set;return{isTool:t.isTool,isDiffTrace:t.isDiffTrace??!1,version:t.version??`master`,print:(r,i,a)=>{let o=i===Xe.warning;if(o&&t.errorCodes?.includes(r))throw new e.H(r,a);if(o&&t.isWarningEnabled===!1||i!==Xe.error&&t.suppressedCodes?.includes(r))return;let s=o&&!t.isTool&&n.size===0?`
20
- (Use the -nowarning option to disable this warning.)`:``,c=Qe(t.isTool,r,i,`${a}${s}`);o&&n.has(c)||(o&&n.add(c),console.log(c))}}},et=`The configuration file did not specify the initial state predicate.
19
+ `);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=Me(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=ne(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=v(e,n)??g(e,n),m=je.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},Pe=(t,n)=>new e.v(`TLC found an error in the configuration file at line ${t}\n${n}`),Fe=(e,t)=>Pe(e,`The keyword ${t} appeared twice.`),Ie=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Le=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),Re=(t,n=`master`)=>{let r=n===`1.7.4`?Ae:Oe,i=Ne(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let t=i[Math.min(a++,i.length-1)];if(t.kind===`Error`)throw new e.v(`TLC found an error in the configuration file:\n${t.text}`);return t},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw e.ot(new e.v(`${e.et(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),e.rt.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new e.v(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw Pe(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw Pe(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Pe(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Pe(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw Pe(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Pe(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw Pe(t,``);r=l()}if(r.text!==`=`)throw Pe(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?Ie.get(e):void 0,i=r.has(e)?Le.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Pe(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw Fe(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Pe(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Fe(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!ke.includes(e))throw Pe(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Fe(t,e);c.add(e),h=l()}}return o},ze=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Be=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(ze),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},Ve=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},A=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,He=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Ue=e=>{let t=He(e);return t^t>>>16},We=e=>{let t=[...new Set(e)],n=2**Math.max(4,Math.ceil(Math.log2(t.length/.75)));return t.map((e,t)=>({name:e,index:t,bucket:Ue(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},Ge={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:` `}},Ke=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},qe=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Je=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Ye=e=>{let t=t=>{let n=y(e,t,Ke);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=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);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=t(i)}if(l!==void 0)return c.last=l,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=y(e,t,qe);if(e.startsWith(`..`,n)&&qe(e[n+2]))return{kind:`Constant`,first:t,last:y(e,n+2,qe)-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=qe(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:y(e,t+1,qe)-1,children:[]};if(Je(n))return{kind:`Constant`,first:t,last:y(e,t,Je)-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)},j=e=>{let t=e.length===0?void 0:Ye(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=Ge[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},Xe={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ze={none:0,error:1,warning:3,state:4},Qe={0:``,1:`Error: `,3:`Warning: `,4:`State `},$e=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Qe[n]}${r}`,et=t=>{let n=/* @__PURE__ */ new Set;return{isTool:t.isTool,isDiffTrace:t.isDiffTrace??!1,version:t.version??`master`,print:(r,i,a)=>{let o=i===Ze.warning;if(o&&t.errorCodes?.includes(r))throw new e.H(r,a);if(o&&t.isWarningEnabled===!1||i!==Ze.error&&t.suppressedCodes?.includes(r))return;let s=o&&!t.isTool&&n.size===0?`
20
+ (Use the -nowarning option to disable this warning.)`:``,c=$e(t.isTool,r,i,`${a}${s}`);o&&n.has(c)||(o&&n.add(c),console.log(c))}}},tt=`The configuration file did not specify the initial state predicate.
21
21
  Can also be caused by trying to run TLC on a specification from
22
- a module imported with a parameterized INSTANCE statement.`,tt=[[1005,e.u,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
22
+ a module imported with a parameterized INSTANCE statement.`,nt=[[1005,e.u,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
23
23
  %1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
24
24
  %2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
25
25
  %1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
@@ -44,7 +44,7 @@ element is not a bag:
44
44
  %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
45
45
  on the right-hand side of a <- after already appearing on the
46
46
  left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
47
- is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,et,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
47
+ is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,tt,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
48
48
  cannot be used as a %3%`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
49
49
  %1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
50
50
  but TLC can handle only specifications with one next-state relation.`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
@@ -64,16 +64,16 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
64
64
  Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
65
65
  It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
66
66
  %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
67
- `,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let nt;const rt=()=>nt??=tt.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),it=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,N=e=>it.test(e)?void 0:rt().find(t=>t.pattern.test(e))?.message,at=t=>t instanceof e.A||N(t.message)?.isEvalException===!0,ot=/* @__PURE__ */ new Map([[1e3,`
67
+ `,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let rt;const it=()=>rt??=nt.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),at=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,M=e=>at.test(e)?void 0:it().find(t=>t.pattern.test(e))?.message,ot=t=>t instanceof e.A||M(t.message)?.isEvalException===!0,st=/* @__PURE__ */ new Map([[1e3,`
68
68
  : `],[2105,`failed.
69
69
  `],[2154,`but it produced the following error:
70
70
  `],[2171,`Parsing or semantic analysis failed.`],[2213,`:
71
71
  `],[2281,` - specifically: `],[2405,`failed.
72
- `]]),st=(e,t,n)=>{let r=n?ot.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${ct(t.slice(a),n)}`},ct=(e,t)=>{let n=t?N(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Xe.none} @!@!@\n${st(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},lt=(e,t=2)=>String(e).padStart(t,`0`),ut=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${lt(r%24)}h`:e>36e5?`${lt(r%24)}h ${lt(n)}min`:e>6e4?`${lt(n)}min ${lt(t)}s`:`${lt(t)}s`},dt=e=>`${e.getFullYear()}-${lt(e.getMonth()+1)}-${lt(e.getDate())} ${lt(e.getHours())}:${lt(e.getMinutes())}:${lt(e.getSeconds())}`,ft=/* @__PURE__ */ new WeakMap,pt=(t,n,r)=>{if(!(t instanceof e.x))return t;let i=e.ot(new e.x(`${r}\n${t.message}`,t),e.$(t));return ft.set(i,{code:n,headline:r,inner:t}),i},mt=e=>ft.has(e),ht=e.et(`util.WrongInvocationException`),gt=e.K.slice(0,e.K.indexOf(`
73
- `)),_t=`${e.K}tlc2.tool.EvalException: `,vt=`${e.K}util.Assert$TLCRuntimeException: `,yt=e=>at(e)?_t:vt,bt=t=>{try{return t()}catch(t){throw t instanceof e.x?at(t)?new e.x(`${e.G}${t.message}`):N(t.message)?t:new e.x(`${e.K}${t.message}`):t}},xt=[_t,vt,e.K,e.G],St=(t,n)=>{let r=ft.get(t);if(r)return`${r.headline}\n${St(r.inner,n)}`;let i=t.message;if(t instanceof e.B)return i;let a=xt.find(e=>i.startsWith(e))??``;return`${a}${ct(i.slice(a.length),n)}`},Ct=(t,n)=>{let r=ft.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:St(t,!0)};if(t instanceof e.F)return{code:n?Ye.stackOverflow:Ye.general,message:i,toolMessage:i};if(n&&at(t))return{code:N(i)?.code??Ye.general,message:i,toolMessage:i};let a=n&&!i.startsWith(gt)&&!(t instanceof e.B),o=t instanceof e.P?ht:e.K,s=a?o:``;return{code:Ye.general,message:`${s}${i}`,toolMessage:`${s}${St(t,!0)}`}},wt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Tt=2147483647,Et=1e6;let Dt=Et;const Ot=()=>Dt,kt=()=>Math.max(Dt,10),At=()=>`Attempted to construct a set with too many elements (>${Dt}).`,jt=(t,n)=>{if(t.length===kt())throw new e.P(At());t.push(n)},Mt=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=kt(),Nt=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},Pt=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ft=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),It=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Lt=e=>typeof e==`object`&&e.kind===`ModelValue`,Rt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),zt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:Pt(e)?`set`:`function`,Bt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let Vt=!1;const Ht=(e,t)=>(Vt=!0,e.writtenKeys=t,e),Ut=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Wt=e=>Ut(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Gt=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Wt(e),Kt=(e,t,n,r)=>Ht(Rr(e,t.map(e=>n[e])),r),qt=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(qt);e.writtenKeys=void 0,e.range.forEach(qt)}},Jt=e=>e.every(e=>typeof e==`string`),Yt=(e,t)=>e.length>0&&t.length>0&&Jt(e)!==Jt(t),Xt=(e,t)=>{Vt&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Yt(n,r)?sr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Cn(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:Cn(t,n);if(r!==0)return r}return 0},Zt=(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=Cn(n[e],r[e]);if(t!==0)return t}return 0},Qt=e=>Lt(e)?e.type:void 0,$t=(t,n,r)=>{let i=Qt(t),a=Qt(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(Lt(t)&&Lt(n)){if(i===void 0||a===void 0||i===a)return;throw new e.x(`Attempted to ${o} the differently-typed model values ${M(L(t))} and ${M(L(n))}`)}throw i===void 0?new e.x(`Attempted to ${o} the typed model value ${M(L(n))} and the non-model value\n${M(L(t))}`):new e.x(`Attempted to ${o}${r?``:` the`} typed model value ${M(L(t))} and non-model value\n${M(L(n))}`)},en=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),tn=en(),nn=e=>{Object.assign(tn,en()),wn.clear();for(let t of e)pn(t)},rn=()=>{tn.searchRank=tn.size},an=()=>tn.unorderedString;let on=!1;const sn={isExpanded:!0,isViewPrinted:!1},cn=e=>{on=e.version===`1.7.4`,Dt=e.maxSetSize??Et,sn.isExpanded=e.isLazyValueExpanded??!0,sn.isViewPrinted=e.isViewPrinted??!1},ln=/* @__PURE__ */ new WeakMap,un=(e,t)=>(sn.isViewPrinted&&ln.set(e,t),e),dn=/* @__PURE__ */ new WeakMap,fn=(e,t)=>(dn.set(e,t),e),pn=e=>(tn.ranks[e]===void 0&&(tn.ranks[e]=tn.size++),e),mn=e=>tn.ranks[pn(e)],hn=(e,t)=>{if(e===t)return 0;let n=tn.ranks,r=n[e],i=n[t],a=tn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(tn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},gn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),_n=(e,t)=>(gn(e)||gn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),vn=(t,n)=>new e.x(gn(t)?`Attempted to compare overridden value ${M(L(t,!0))} with non-overridden value:\n${M(L(n))}`:`Attempted to compare ${zt(t)} ${L(t)} with ${zt(n)} ${L(n)}`),yn=(t,n,r)=>{if(!gn(t))throw new e.x(`Attempted to ${r} the set ${M(L(P(t)?F(t):t,!0))} with the value:\n${M(L(n,!0))}`);if(!gn(n))throw vn(t,n);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e.A(`Attempted to compare ${M(L(t,!0))} with the value\n${M(L(n,!0))}`)},bn={kind:`InfiniteSet`,name:`Any`},xn=t=>{throw new e.A(`Attempted to compare ANY with the value\n${M(L(t))}`)},Sn=e=>{Vt&&qt(e),e===bn&&xn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},Cn=(e,t)=>{if(e===t)return Sn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Xt(e,t);if(n===`Set`&&r===`Set`)return Zt(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&&$t(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return $t(e,t,!1),n===`ModelValue`?-1:1;if(e===bn||t===bn)return xn(e===bn?t:e);if(Pt(e)&&Pt(t)&&_n(e,t))return yn(e,t,`compare`);let i=Pt(e);if(i!==Pt(t))throw vn(e,t);if(n===`Interval`&&r===`Set`){let n=ci(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-ci(t);if(n!==0)return n}return i?Zt(F(e),F(t)):Xt(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return hn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if($t(e,t,!1),Lt(e))return-1;if(Lt(t))return 1;throw vn(e,t)},wn=/* @__PURE__ */ new Map,Tn=32768,En=t=>{let n=wn.get(t);if(n)return n;if(wn.size===Tn)throw new e.S(`TLC supports at most ${Tn} model values, but model value ${t} exceeds this limit.`);let r={kind:`ModelValue`,name:t,type:t.length>2&&t[1]===`_`?t[0]:void 0,rank:mn(t),hash:Vi(Hi(Ui(t),109)),fingerprint:Qi($i(t)^60)};return wn.set(t,r),r},Dn=()=>[...wn.values()],On=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),kn=e=>{let t=On(e);return t.isNormalized=!0,t},An=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let jn=!1;const Mn=(e,t)=>(t===`lambda`&&(jn=!0),t!==void 0&&(e.functionClass=t),e),Nn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Pn=e=>Mn(e,`lambda`),Fn=e=>wt(e)&&e.isCached===!0;let In=!1;const Ln=e=>(In=!0,e),Rn=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),zn=e=>{In&&typeof e==`object`&&wt(e)&&Rn.has(e.kind)&&(e.isCached=!0)},Bn=e=>{(jn||In)&&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(Bn),e.range.forEach(Bn)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Bn):Pt(e)&&P(e)&&(zn(e),F(e).elements.forEach(Bn))))},Vn=(e,t)=>{if(zn(e),e===t)return Sn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&$t(e,t,!0),Cn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Xt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Zt(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&ci(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==ci(t))return!1;if(Lt(e)||Lt(t))return e.kind===`LazyFunction`&&I(e),$t(e,t,!0),Lt(e)&&Lt(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Vn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=ai(e.domain),r=ai(t.domain);if(n||r)return n===r;let i=ai(e.range),a=ai(t.range);return i||a?i===a:Vn(e.domain,t.domain)&&Vn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(ai(e))return ai(t);if(ai(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]&&Vn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return ai(e)?ai(t):!ai(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Vn(e,t.factors[n]));let n=Pt(e)&&Pt(t)&&!(P(e)&&P(t));if(n&&_n(e,t))return yn(e,t,`check equality of`)===0;if(n){if(!gn(e)){let n=F(e);if(!gn(t))return Zt(n,F(t))===0}return ia(e)===ia(t)}return Cn(e,t)===0},Hn=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):ia(n)===ia(r);return n},Un=Hn(!1),Wn=Hn(!0),Gn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Kn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zi(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Wn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Wn(i[e],n))return i[e]}return n.kind===`Set`?Gn(n.elements,t):(Gn(n.domain,t),Gn(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}},qn=(e,t)=>t.length===0||Nn(e)===`tuple`?1:Ri(t)?.low,Jn=e=>{if(!It(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:qn(e,t.domain)}},Yn=e=>{if(!It(e))return;let t=I(e);return Jt(t.domain)?t:void 0},Xn=(e,t,n)=>($t(t,e,n),1),Zn={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`}},Qn=(e,t,n)=>{let r=Zn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${M(L(e))} with ${r.other}:\n${M(L(t))}`},$n=e=>e?`check equality of`:`compare`,er=(t,n,r,i)=>{let a=Jn(r);if(!a){if(Lt(r))return Xn(r,n,i);throw new e.x(`Attempted to ${$n(i)} the function ${M(L(n))} with the value:\n${M(L(r))}`)}if(t.range.length!==a.range.length)return t.range.length-a.range.length;let o=()=>tr(t.range,a.range,i);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&a.low!==void 0)return t.low===a.low?o():t.low-a.low;let s=t.low??a.low;if(s===void 0)return tr(t.domain,a.domain,i)||o();let c=t.low===void 0?t.domain:a.domain;for(let n=0;n<c.length;n++){let r=c[n];if(typeof r!=`number`)throw new e.x(`Attempted to compare ${i?`an `:``}integer with non-integer${i||t.low!==void 0?`:`:``}\n${M(L(r))}.`);let a=t.low===void 0?r-(s+n):s+n-r;if(a!==0)return a}return o()},tr=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=or(e[r],t[r],n);if(i!==0)return i}return 0},nr=(t,n,r)=>{let i=I(t);if(Nn(t)===`tuple`){let e=It(n)?pi(n):void 0;return e?i.range.length-e.length||tr(i.range,e,r):er({...i,low:1},t,n,r)}if(Nn(t)===`record`){let a=Yn(n);if(!a){if(Lt(n))return Xn(n,t,r);throw new e.x(`Attempted to ${$n(r)} record:\n${M(L(t))}\nwith non-record\n${M(L(n))}`)}return i.domain.length-a.domain.length||tr(i.domain,a.domain,r)||tr(i.range,a.range,r)}return er({...i,low:qn(t,i.domain)},t,n,r)},rr=(e,t)=>gn(e)||gn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),ir=(e,t)=>{let n=Rt(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},ar=(t,n,r)=>{if(rr(t,n))return r?+!Vn(t,n):Cn(t,n);if(!Rt(t))return ar(F(t),n,r);if(!Pt(n)){if(Lt(n))return Xn(n,t,r);throw new e.x(`Attempted to ${$n(r)} the set ${M(L(t))} with the value:\n${M(L(n))}`)}let i=ir(t,n);return i.elements.length-i.otherElements.length||tr(i.elements,i.otherElements,r)},or=(t,n,r)=>{if(typeof t!=`object`){if(typeof n==typeof t)return r?t===n?0:1:Cn(t,n);if(Lt(n))return Xn(n,t,r);throw new e.x(Qn(t,n,r))}return t.kind===`ModelValue`?(t.type!==void 0&&$t(t,n,r),Lt(n)?r?t.name===n.name?0:1:t.rank-n.rank:-1):It(t)?nr(t,n,r):ar(t,n,r)},sr=(e,t)=>or(e,t,!1),cr=(e,t)=>or(e,t,!0)===0,lr=e=>{let t=[];for(let n of e){let e=dr(n,t);e.isFound||t.splice(e.index,0,n)}return t},ur=(e,t)=>{let n=hi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},dr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=ur(e,()=>sr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},fr=(e,t)=>t.some(t=>ur(t,()=>cr(t,e))),pr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,mr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(mr)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(mr),e.range.forEach(mr)))},hr=e=>{if(!(typeof e!=`object`||Fn(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return hr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(hr(e.left),hr(e.right));case`FunctionSet`:return hr(e.domain),hr(e.range);case`RecordSet`:return e.sets.forEach(hr);case`ProductSet`:return e.factors.forEach(hr)}},gr=(e,t)=>gi(Vn,cr,e,t),_r=e=>{for(let t=1;t<e.length;t++)if(Cn(e[t-1],e[t])>=0)return!1;return!0},vr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},yr=e=>{for(let t=1;t<e.length;t++)zn(e[t]);if(e.length<2||_r(e))return On(e);let t=[...e].sort(Cn),n=[t[0]];for(let e=1;e<t.length;e++)Cn(n[n.length-1],t[e])!==0&&n.push(t[e]);return On(n)},br=e=>{if(vr(e))return On(e);let t=gi(yr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},xr=On([]),Sr=(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&&Cn(r[a],t)<0;)a++;a<r.length&&Cn(r[a],t)===0||i.push(t)}return i.length===n.length?e:On(i)},Cr=(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&&Cn(r[a],t)<0;)a++;a<r.length&&Cn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:On(i)},wr=(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=Cn(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=On(i);if(e.hash!==0&&e.hash!==Ki){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zi(a[n]);if(e===Ki)break;t=t+Wi(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+ea(a[e])|0;c.fingerprint=t}return c},Tr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Cn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Cn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return An(n,r)},Er=e=>{let t=Tr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:Ht(t,e.map(e=>e[0]))},Dr=[],Or=/* @__PURE__ */ new Map,kr=[],Ar=/* @__PURE__ */ new WeakMap,jr=e=>{let t=Dr[e]??Or.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Or.set(e,new WeakRef(n)):Dr[e]=n,n},Mr=e=>{if(ci(e),e.low===1&&e.high>=1)return jr(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Nr=e=>e.length>0&&(e===Dr[e.length]||e===Or.get(e.length)?.deref())||Ar.has(e),Pr=e=>{let t=F(e).elements;return Nr(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Fr=e=>{let t=kr[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return kr[e]=n,n},Ir=e=>Mn(An(jr(e.length),e),`tuple`),Lr=e=>Mn(Tr(e),`record`),Rr=(e,t)=>Mn(An(e,t),`record`),zr=e=>Pt(e)&&!gn(e),Br=(e,t=!1)=>`UNION(${L(e.base,t)})`,Vr=(t,n=e=>F(e).elements)=>{if(!zr(t.base))throw new e.x(`Attempted to enumerate the nonenumerable set:\n${Br(t)}`);return n(t.base)},Hr=(t,n,r)=>{if(zr(t))return t;throw new e.x(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${M(L(t))}\nwhen enumerating:\n${M(Br(r))}`)},P=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 P(e.base);case`FunctionSet`:return P(e.domain)&&P(e.range)||Ur(e.domain)===!0||Ur(e)===!0;case`RecordSet`:return e.sets.every(P)||Ur(e)===!0;case`ProductSet`:return e.factors.every(P)||Ur(e)===!0;case`Union`:return P(e.base)&&(Rt(e.base)?pr(e.base):ei(e.base)).every(P);case`SetOperation`:return e.operator===`\\cup`?P(e.left)&&P(e.right):e.operator===`\\cap`?P(e.left)||P(e.right):P(e.left);default:return!1}},Ur=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=Ur(e.domain);return t===void 0?void 0:!t&&Ur(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Ur(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return P(e)?F(e).elements.length===0:void 0;default:return}},Wr=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},Gr=(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},Kr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||gn(e.base))return;let t=F(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:Gr(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return On(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},qr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(On(r.map(t=>e[t])));while(Gr(r,e.length))}return t},Jr=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(gn(o))throw new e.x(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Yr=(t,n=e=>F(e).elements)=>{if(typeof t!=`object`)throw new e.x(`Expected a set but found ${L(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return lr(t.elements);case`Interval`:{let e=Mr(t);return e!==Dr[e.length]&&Ar.set(e,t),e}case`Subset`:{if(ci(t.base)===0)return qr([]);if(!Pt(t.base))throw new e.x(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${M(L(t.base))}`);let n=F(t.base).elements;if(n.length>30)throw new e.x(si(t));return qr(n)}case`FunctionSet`:{if(!on&&ai(t))return[];if(gn(t.domain))throw new e.x(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${M(L(t.domain))}\ncannot be enumerated.`);let r=Pr(t.domain);if((r.length>0||on)&&gn(t.range))throw new e.x(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${M(L(t.range))}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Wr(r.map(()=>i)).map(e=>An(r,e))}case`RecordSet`:{if(!on&&ai(t))return[];let e=Jr(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${M(L(e))}`);return Wr(e).map(e=>Lr(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!on&&ai(t))return[];let e=Jr(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${M(L(e))}`);return Wr(e).map(Ir)}case`FilteredSet`:if(!Pt(t.base)||gn(t.base))throw new e.x(`Attempted to enumerate { x \\in S : p(x) } when S:\n${M(L(t.base))}\nis not enumerable`);return F(br(ei(t.base).filter(e=>t.test(e,!1)))).elements;case`Union`:{let n=[];return Vr(t).forEach((r,i)=>{let a=Hr(r,i,t);if(Mt(a))throw new e.P(At());ei(a).forEach(e=>jt(n,e))}),F(br(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!zr(t.left)&&!zr(t.right))throw new e.x(`Attempted to enumerate S \\cap T when neither S:\n${M(L(t.left))}\nnor T:\n${M(L(t.right))}\nis enumerable`);if(t.operator===`\\`&&!zr(t.left))throw new e.x(`Attempted to enumerate S \\ T when S:\n${M(L(t.left))}\nis not enumerable.`);if(t.operator===`\\cup`)return F(br(Zr(t))).elements;let n=t.operator===`\\`||zr(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return Nt(typeof r==`object`&&r.kind===`Interval`?r:ei(r),e=>{vi(e,i)===(t.operator===`\\cap`)&&jt(a,e)}),F(br(a)).elements}case`InfiniteSet`:case`SequenceSet`:throw new e.x(`Attempted to enumerate the non-enumerable set ${L(t)}`);default:throw new e.x(`Expected a set but found ${L(t)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return On(Yr(e));let t=typeof e==`object`&&wt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=hi.sets;n?.push(e);let r=Yr(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`)?On(r):yr(r);return t&&(t.enumerated=i),i},Xr=e=>{if(!(typeof e!=`object`||Fn(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return zr(e.base)||F(e),Xr(e.base);case`Union`:if(!Rt(e.base)&&zr(e.base))return Xr(e.base);Vr(e).slice(0,1).forEach(t=>Xr(Hr(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!zr(e.left)&&F(e),e.operator!==`\\cup`||zr(e.left)&&zr(e.right)||F(e),e.operator!==`\\cap`||zr(e.left)?Xr(e.left):Xr(e.right),e.operator===`\\cup`&&Xr(e.right)}},Zr=t=>{if(!zr(t.left)||!zr(t.right))throw new e.x(`Attempted to enumerate S \\cup T when S:\n${M(L(t.left))}\nand T:\n${M(L(t.right))}\nare not both enumerable`);if(Xr(t.left),Xr(t.right),Mt(t.left))throw new e.P(At());let n=ei(t.left),r=Mt(t.right)?void 0:ei(t.right);if(!r||n.length+r.length>kt())throw new e.P(At());return[...n,...r]},Qr=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=ur(e,()=>Zr(e)),n=F(br(t)).elements;return e.enumerated=On(n),n},$r=(e,t)=>{if(typeof e!=`object`||Fn(e))return F(e).elements.some(t);let n=hi.sets;n?.push(e),Xr(e);let r=ii(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},ei=e=>{let t=[];return $r(e,e=>(t.push(e),!1)),t},ti=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ni=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ni);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ni)&&e.range.every(ni);case`SetOperation`:return e.operator!==`\\cup`&&ni(e.left)&&ni(e.right);case`FilteredSet`:return ni(e.base);case`ProductSet`:return e.factors.every(ni);default:return!1}},ri=e=>typeof e!=`object`||Fn(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ri(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ri(e.left)||ri(e.right):ti(e)?.some(ri)??!1,ii=(e,t)=>{if(e.kind===`Union`)return Vr(e,ei).some((n,r)=>$r(Hr(n,r,e),t));if(e.kind===`FilteredSet`&&zr(e.base))return $r(e.base,n=>e.test(n,!1)&&t(n));if(ti(e)?.some(ri))return Yr(e,ei).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!zr(e.left)||!zr(e.right)?F(e).elements.some(t):$r(e.left,t)||$r(e.right,t);let n=e.operator===`\\`||zr(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return zr(r)?$r(r,n=>vi(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},ai=t=>{if(typeof t!=`object`||!Pt(t))throw hi.sets?.push(t),new e.x(`Shouldn't call isEmpty() on value ${L(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e.x(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(ai);case`RecordSet`:return t.sets.some(ai);case`FunctionSet`:return!ai(t.domain)&&ai(t.range);case`Union`:return Vr(t).every((e,n)=>ai(Hr(e,n,t)));default:return F(t).elements.length===0}},oi=(t,n,r)=>t.reduce((t,i)=>{let a=t*ci(i,n);if(a>2147483647)throw new e.x(r());return a},1),si=e=>`Overflow when computing the number of elements in:\n${M(L(e))}`,ci=(t,n)=>{if(typeof t!=`object`)throw new e.x(`Attempted to compute the number of elements in the ${zt(t)} ${M(L(t))}.`);switch(t.kind){case`ModelValue`:throw new e.x(`Attempted to compute the number of elements in the model value ${M(L(t))}.`);case`Function`:return t.domain.length;case`LazyFunction`:return ci(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.x(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.x(`Attempted to compute the number of elements in the overridden value ${M(L(t))}.`);case`Subset`:{let r=ci(t.base,n);if(r>=31)throw new e.x(si(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(ai(t.domain))return 1;if(ai(t.range))return 0;if(ci(t.range,n)===1)return 1}let r=ci(t.domain,n),i=ci(t.range,n);if(i<=1)return r===0?1:i;let a=1;for(let n=0;n<r;n++)if(a*=i,a>2147483647)throw new e.x(si(t));return a}case`RecordSet`:return n!==`1.7.4`&&ai(t)?0:oi(t.sets,n,()=>si(t));case`ProductSet`:return n!==`1.7.4`&&ai(t)?0:oi(t.factors,n,()=>`Overflow when computing the number of elements in ${M(L(t))}`);default:return zn(t),F(t).elements.length}},li=e=>`Attempted to check if the set ${M(L(e))}is finite.`,ui=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.x(`Attempted to check if the ${zt(t)} ${M(L(t))} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.x(`Attempted to check if the function:\n${M(L(t))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return ui(t.base)&&ai(t.base);case`Subset`:return ui(t.base);case`FunctionSet`:{let e=ui(t.domain);if(e&&ai(t.domain))return!0;let n=ui(t.range);return n&&ai(t.range)?!0:n&&(e||ci(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!ui(t))n=!1;else if(ai(t))return!0;return n}case`Union`:if(!zr(t.base))throw new e.x(`Attempted to check if the nonenumerable set:\n${Br(t)}\nis a finite set.`);return F(t.base).elements.every(ui);case`SetOperation`:if(t.operator===`\\cup`)return ui(t.left)&&ui(t.right);if(t.operator===`\\cap`){if(!ui(t.left)&&!ui(t.right))throw new e.x(li(t));return!0}if(ui(t.left))return!0;if(!ui(t.right))throw new e.x(li(t));return!1;case`FilteredSet`:if(!ui(t.base))throw new e.x(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${M(L(t.base))}\nis finite.`);return!0}},di=(e,t,n=Cn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},fi=(t,n)=>{let r=t.elements;if(r.length>kt())throw new e.P(At());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=di(r,e);return!i[t]&&(i[t]=!0,!0)}),o=On(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},pi=t=>{if(typeof t!=`object`||!It(t))return;if(t.kind===`LazyFunction`&&(!Pt(t.domain)||gn(t.domain)))throw new e.x(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let n=I(t);return n.domain.every((e,t)=>e===t+1)?n.range:void 0},mi=(e,t)=>{let n=`Attempted to check if the value:\n${M(L(e))}\nis an element of the`;if(!It(t))return`${n} ${zt(t)} ${M(L(t))}`;let r=Nn(t);return r===`record`?`Attempted to check if element:\n${M(L(e))}\nis in the record:\n${M(L(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${M(L(t))}`},hi={sets:void 0},gi=(t,n,r,i)=>{let a=hi.sets,o=hi.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.x))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},_i=e=>(hi.sets??[]).slice(e).some(e=>typeof e==`object`&&hi.callStack?.sources.has(e)===!0),vi=(e,t)=>{let n=hi.sets;if(n===void 0)return Ci(e,t);n.push(t);let r=Ci(e,t);return n.pop(),r},yi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},bi=(e,t)=>di(t.elements,e)!==-1,xi=(e,t)=>t.isNormalized?dr(e,t.elements).isFound:fr(e,pr(t)),Si=(t,n)=>{if(t.type!==void 0)throw new e.x(`Attempted to check if the typed model value ${M(L(t))} is an element of\n${M(L(n))}`);return!1},Ci=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return yi(e,t)??wi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return wi(e,t)},wi=(t,n)=>{if(!Pt(n))throw new e.x(mi(t,n));switch(n.kind){case`Set`:return zn(t),gi(bi,xi,t,n);case`MixedSet`:return fr(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!Lt(t)||t.type!==void 0))throw new e.x(`Attempted to check if the value:\n${M(L(t))}\nis in the integer interval ${M(L(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(Lt(t))return Si(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.A(`Attempted to check if the value:\n${M(L(t))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!Pt(t)||gn(t))throw new e.x(`Attempted to check if the non-enumerable value\n${M(L(t))}\nis element of\n${M(L(n))}`);return F(t).elements.every(e=>vi(e,n.base));case`FunctionSet`:{if(!It(t)){if(Lt(t))return Si(t,n);throw new e.x(`Attempted to check if \n${L(t)}\nwhich is not a TLC function value, is in the set of functions:\n${M(L(n))}`)}let r=I(t),i=qn(t,r.domain);return(i===void 0?gr(n.domain,On(r.domain)):gr({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>vi(e,n.range))}case`RecordSet`:{let r=It(t)?I(t):void 0;if(!r||!Jt(r.domain)){if(Lt(t))return Si(t,n);throw new e.x(`Attempted to check if non-record\n${L(t)}\nis in the set of records:\n${M(L(n))}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=di(r.domain,e);return i!==-1&&vi(r.range[i],n.sets[t])})}case`ProductSet`:{let r=It(t)?pi(t):void 0;if(r===void 0){let r=It(t)&&I(t).domain.every(e=>typeof e==`number`);if(Lt(t))return Si(t,n);if(r)return!1;throw new e.x(`Attempted to check if non-tuple\n${M(L(t))}\nis in the set of tuples:\n${M(L(n))}`)}return r.length===n.factors.length&&r.every((e,t)=>vi(e,n.factors[t]))}case`FilteredSet`:try{return vi(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.x)||!at(r)?r:new e.x(`Cannot decide if element:\n${M(L(t))}\n is element of:\n${M(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!zr(n.base))throw new e.x(`Attempted to check if:\n ${M(L(t))}\nis an element of the non-enumerable set:\n ${M(Br(n))}`);let r=F(n.base).elements;return r.length>1&&r.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),r.some(e=>vi(t,e))}case`SetOperation`:return n.operator===`\\cup`?vi(t,n.left)||vi(t,n.right):vi(t,n.left)&&vi(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=pi(t);if(r===void 0){if(Lt(t))return Si(t,n);throw new e.A(`Attempted to check if the value:\n${M(L(t))}\nis an element of ${M(L(n))}.`)}return r.every(e=>vi(e,n.base))}default:throw new e.x(mi(t,n))}},Ti=(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?vi(e,n):e.range.every((e,r)=>Ti(e,t.range[r],n.range)),I=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;if(P(t.domain)||ci(t.domain),!Pt(t.domain))throw new e.x(`The domains of formal parameters must be enumerable.`);let n=Pr(t.domain);return t.enumerated=An(n,n.map(e=>t.apply(e))),t.enumerated}throw new e.x(`Expected a function but found ${L(t)}`)},Ei=(e,t,n)=>{let r=M(L(e)),i=M(L(t)),a=n===`1.7.4`;switch(Nn(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.`}},Di=(e,t)=>{if(!on)return Ei(e,t);let n=M(L(t));return Nn(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Oi=(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},ki=t=>new e.x(`Attempted to apply function with integer domain to the non-integer argument ${M(L(t))}`),Ai=(e,t)=>di(e.domain,t),ji=(e,t,n)=>{let r=Ut(e);throw on||r!==e.domain||r.length<32?r.forEach(e=>cr(e,t)):di(r,t,sr),n},Mi=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=Nn(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.x(r(t,n));if(o===void 0&&!on&&typeof n!=`number`&&Nr(i))throw ki(n)}let a=Oi(i,n);return a===-1?gi(Ai,ji,t,n):a},Ni=(e,t,n,r)=>`In applying the function\n${M(L(e))},\nthe ${t} is:\n${M(L(n))}\nwhich ${r}.\n`,Pi=(t,n)=>new e.x(Ni(t,`argument list`,n,`does not match its formal parameter`)),Fi=(t,n,r)=>{let i=t.domain,a=pi(r);if(a===void 0)throw Pi(t,r);if(typeof i!=`object`||i.kind!==`ProductSet`)throw new e.x(`Attempted to apply a function to ${L(r)}, which is not in its domain`);if(n.forEach((n,o)=>{if(o>=a.length)throw Pi(t,r);let s=a[o],c=`argument number ${o+1}`;if(!vi(s,i.factors[o]))throw new e.x(Ni(t,c,s,n===void 0?`is not in the function's domain ${L(i)}`:`is not in its domain`));if(n!==void 0&&pi(s)?.length!==n)throw new e.x(Ni(t,c,s,`does not match its formal parameter`))}),a.length>n.length)throw Pi(t,r)},Ii=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!vi(t,e.lambdaDomain),Li=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return Li(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return Fi(t,i,n),t.apply(n);if(!vi(n,t.domain))throw new e.x(Nn(t)===`lambda`?Ei(t,n):`Attempted to apply a function to ${L(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.x(`Attempted to apply ${L(t)}, which is not a function`);let i=r??Ei;if(Ii(t,n))throw new e.x(i(t,n));let a=Mi(t,n,i);if(a===-1)throw new e.x(i(t,n));return t.range[a]},Ri=e=>Nr(e)?Ar.get(e)??Fr(e.length):void 0,zi=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Ri(t.domain);if(n)return n;let r=On(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Bi=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(t.boundTupleLengths!==void 0&&pi(n)===void 0)throw Pi(t,n);if(!vi(n,t.domain))return t;let e=r(t.apply(n));return Mn({kind:`LazyFunction`,domain:t.domain,apply:r=>gr(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},Nn(t))}if(!It(t))throw new e.x(`Attempted to apply EXCEPT construct to the value ${M(L(t))}.`);let a=I(t);if(Ii(a,n))return a;let o=Mi(a,n,Di);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=Mn(An(a.domain,s),Nn(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==Ki){let e=Zi(l);if(e!==Ki){let t=Zi(a.domain[o]);u.hash=c===l?a.hash:a.hash-Gi(t,Zi(c))+Gi(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-ta(e,c)+ta(e,l)|0}return u},Vi=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hi=(e,t)=>Math.imul(e^t,16777619),Ui=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vi(t)},Wi=e=>Vi(e+2654435769|0),Gi=(e,t)=>Vi(Math.imul(e,668265261)+t|0),Ki=795548749,qi=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zi(t[e]);if(r===Ki)return Ki;n=n+Wi(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Zi(e.domain[n]),i=Zi(e.range[n]);if(r===Ki||i===Ki)return Ki;t=t+Gi(r,i)|0}return t},Ji=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.x(`TLC has found a state in which the value of a variable contains ${M(L(t))}`);if(Pt(t)){F(t).elements.forEach(Ji);return}let n=I(t);n.domain.forEach(Ji),n.range.forEach(Ji)},Yi=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Zi(t)===Ki&&Ji(t);return}catch(t){if(!(t instanceof e.x))throw t;return t}},Xi=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[]}},Zi=e=>typeof e==`number`?Vi(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ui(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=qi(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?Zi(I(e)):Ki:P(e)?Zi(F(e)):Ki,Qi=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$i=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qi(t)},ea=e=>Qi(ra(e)+2135587861|0),ta=(e,t)=>Qi(Math.imul(ra(e),374761393)+ra(t)|0),na=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ea(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ta(e.domain[n],e.range[n])|0;return t},ra=e=>typeof e==`number`?Qi(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?$i(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=na(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ra(I(e)):P(e)?ra(F(e)):$i(ia(e)),ia=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):aa(e),aa=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${ia(t.base)}>`;if(t.kind===`FilteredSet`&&!P(t))throw new e.x(`Attempted to compare the non-enumerable set ${L(t)} with another value`);if(Pt(t))return P(t)?`{${F(t).elements.map(ia).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${ia(e)}:${ia(n.range[t])}`).join(`,`)})`},oa={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},sa=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>oa[e])}"`,ca=1999,la=e=>e.reduce((e,t)=>e===0?0:e*ci(t),1),ua=e=>{if(e.kind===`Subset`)return ci(e.base)<=6?F(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return F(e);if(e.kind===`FunctionSet`){let t=ai(e.domain)?0:ci(e.domain);return(t===0?1:ci(e.range)**t)<=ca?F(e):void 0}return la(e.kind===`RecordSet`?e.sets:e.factors)<=ca?F(e):void 0},da=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&It(t.base)&&(t.base.kind===`Function`||P(t.base.domain)))return ua(t);if(P(t))try{return ua(t)}catch(t){if(t instanceof e.x)return;throw t}},fa=(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 Br(e,t)}},pa=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),ma=t=>{if(P(t.domain))try{return I(t)}catch(t){if(t instanceof e.x||e.nt(t))return;throw t}},ha=e=>{let t=[],n=[],r=[],i=(e,a,o)=>{if(typeof e!=`object`)return;let s=e=>i(e,a,!1);switch(e.kind){case`Set`:if(e.elements.forEach(s),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(s),F(e);return;case`Function`:{let t=a||Nn(e)===`lambda`;if(e.range.forEach(e=>i(e,t,o)),a||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:if(e.enumerated)return i(e.enumerated,!0,o);o&&r.push(e),s(e.domain);return;case`SetOperation`:s(e.left),s(e.right);return;case`FunctionSet`:s(e.domain),s(e.range);return;case`RecordSet`:e.sets.forEach(s);return;case`ProductSet`:e.factors.forEach(s);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:s(e.base);return;default:return}};try{return e.forEach(e=>i(e,!1,!0)),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),r.forEach(e=>{e.enumerated=void 0}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},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 sa(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(F(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=sn.isExpanded?da(e,t):void 0;return n?r(n):fa(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?sn.isExpanded||!e.source?ma(e):void 0: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&&on&&Nn(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Nn(e)!==`lambda`);if(i.domain.length===0&&Nn(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):Gt(i);return Nn(e)===`record`||i.domain.every(e=>typeof e==`string`&&pa(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},ga=(t,n)=>{if(t===void 0)return!1;try{return Vn(t,n)}catch(t){if(t instanceof e.x)return!1;throw t}},_a=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,va=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(_a,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
74
- `;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(Ve(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},ya=(t,n)=>{let r=n?void 0:ln.get(t);if(r)return r();let i=Object.entries(t),a=dn.get(t),o=a!==void 0&&`_format`in t,s=o?t._format:i.length===1?`%s = %s
72
+ `]]),ct=(e,t,n)=>{let r=n?st.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${lt(t.slice(a),n)}`},lt=(e,t)=>{let n=t?M(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ze.none} @!@!@\n${ct(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ut=(e,t=2)=>String(e).padStart(t,`0`),dt=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${ut(r%24)}h`:e>36e5?`${ut(r%24)}h ${ut(n)}min`:e>6e4?`${ut(n)}min ${ut(t)}s`:`${ut(t)}s`},ft=e=>`${e.getFullYear()}-${ut(e.getMonth()+1)}-${ut(e.getDate())} ${ut(e.getHours())}:${ut(e.getMinutes())}:${ut(e.getSeconds())}`,pt=/* @__PURE__ */ new WeakMap,mt=(t,n,r)=>{if(!(t instanceof e.x))return t;let i=e.ot(new e.x(`${r}\n${t.message}`,t),e.$(t));return pt.set(i,{code:n,headline:r,inner:t}),i},ht=e=>pt.has(e),gt=e.et(`util.WrongInvocationException`),_t=e.K.slice(0,e.K.indexOf(`
73
+ `)),vt=`${e.K}tlc2.tool.EvalException: `,yt=`${e.K}util.Assert$TLCRuntimeException: `,bt=e=>ot(e)?vt:yt,xt=t=>{try{return t()}catch(t){throw t instanceof e.x?ot(t)?new e.x(`${e.G}${t.message}`):M(t.message)?t:new e.x(`${e.K}${t.message}`):t}},St=[vt,yt,e.K,e.G],Ct=(t,n)=>{let r=pt.get(t);if(r)return`${r.headline}\n${Ct(r.inner,n)}`;let i=t.message;if(t instanceof e.B)return i;let a=St.find(e=>i.startsWith(e))??``;return`${a}${lt(i.slice(a.length),n)}`},wt=(t,n)=>{let r=pt.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:Ct(t,!0)};if(t instanceof e.F)return{code:n?Xe.stackOverflow:Xe.general,message:i,toolMessage:i};if(n&&ot(t))return{code:M(i)?.code??Xe.general,message:i,toolMessage:i};let a=n&&!i.startsWith(_t)&&!(t instanceof e.B),o=t instanceof e.P?gt:e.K,s=a?o:``;return{code:Xe.general,message:`${s}${i}`,toolMessage:`${s}${Ct(t,!0)}`}},Tt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Et=2147483647,Dt=1e6;let Ot=Dt;const kt=()=>Ot,At=()=>Math.max(Ot,10),jt=()=>`Attempted to construct a set with too many elements (>${Ot}).`,Mt=(t,n)=>{if(t.length===At())throw new e.P(jt());t.push(n)},Nt=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=At(),Pt=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},N=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ft=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),It=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Lt=e=>typeof e==`object`&&e.kind===`ModelValue`,Rt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),zt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:N(e)?`set`:`function`,Bt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let Vt=!1;const Ht=(e,t)=>(Vt=!0,e.writtenKeys=t,e),Ut=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Wt=e=>Ut(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Gt=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Wt(e),Kt=(e,t,n,r)=>Ht(Rr(e,t.map(e=>n[e])),r),qt=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(qt);e.writtenKeys=void 0,e.range.forEach(qt)}},Jt=e=>e.every(e=>typeof e==`string`),Yt=(e,t)=>e.length>0&&t.length>0&&Jt(e)!==Jt(t),Xt=(e,t)=>{Vt&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Yt(n,r)?sr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Cn(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:Cn(t,n);if(r!==0)return r}return 0},Zt=(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=Cn(n[e],r[e]);if(t!==0)return t}return 0},Qt=e=>Lt(e)?e.type:void 0,$t=(t,n,r)=>{let i=Qt(t),a=Qt(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(Lt(t)&&Lt(n)){if(i===void 0||a===void 0||i===a)return;throw new e.x(`Attempted to ${o} the differently-typed model values ${j(L(t))} and ${j(L(n))}`)}throw i===void 0?new e.x(`Attempted to ${o} the typed model value ${j(L(n))} and the non-model value\n${j(L(t))}`):new e.x(`Attempted to ${o}${r?``:` the`} typed model value ${j(L(t))} and non-model value\n${j(L(n))}`)},en=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),tn=en(),nn=e=>{Object.assign(tn,en()),wn.clear();for(let t of e)pn(t)},rn=()=>{tn.searchRank=tn.size},an=()=>tn.unorderedString;let on=!1;const sn={isExpanded:!0,isViewPrinted:!1},cn=e=>{on=e.version===`1.7.4`,Ot=e.maxSetSize??Dt,sn.isExpanded=e.isLazyValueExpanded??!0,sn.isViewPrinted=e.isViewPrinted??!1},ln=/* @__PURE__ */ new WeakMap,un=(e,t)=>(sn.isViewPrinted&&ln.set(e,t),e),dn=/* @__PURE__ */ new WeakMap,fn=(e,t)=>(dn.set(e,t),e),pn=e=>(tn.ranks[e]===void 0&&(tn.ranks[e]=tn.size++),e),mn=e=>tn.ranks[pn(e)],hn=(e,t)=>{if(e===t)return 0;let n=tn.ranks,r=n[e],i=n[t],a=tn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(tn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},gn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),_n=(e,t)=>(gn(e)||gn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),vn=(t,n)=>new e.x(gn(t)?`Attempted to compare overridden value ${j(L(t,!0))} with non-overridden value:\n${j(L(n))}`:`Attempted to compare ${zt(t)} ${L(t)} with ${zt(n)} ${L(n)}`),yn=(t,n,r)=>{if(!gn(t))throw new e.x(`Attempted to ${r} the set ${j(L(P(t)?F(t):t,!0))} with the value:\n${j(L(n,!0))}`);if(!gn(n))throw vn(t,n);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e.A(`Attempted to compare ${j(L(t,!0))} with the value\n${j(L(n,!0))}`)},bn={kind:`InfiniteSet`,name:`Any`},xn=t=>{throw new e.A(`Attempted to compare ANY with the value\n${j(L(t))}`)},Sn=e=>{Vt&&qt(e),e===bn&&xn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},Cn=(e,t)=>{if(e===t)return Sn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Xt(e,t);if(n===`Set`&&r===`Set`)return Zt(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&&$t(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return $t(e,t,!1),n===`ModelValue`?-1:1;if(e===bn||t===bn)return xn(e===bn?t:e);if(N(e)&&N(t)&&_n(e,t))return yn(e,t,`compare`);let i=N(e);if(i!==N(t))throw vn(e,t);if(n===`Interval`&&r===`Set`){let n=ci(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-ci(t);if(n!==0)return n}return i?Zt(F(e),F(t)):Xt(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return hn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if($t(e,t,!1),Lt(e))return-1;if(Lt(t))return 1;throw vn(e,t)},wn=/* @__PURE__ */ new Map,Tn=32768,En=t=>{let n=wn.get(t);if(n)return n;if(wn.size===Tn)throw new e.S(`TLC supports at most ${Tn} model values, but model value ${t} exceeds this limit.`);let r={kind:`ModelValue`,name:t,type:t.length>2&&t[1]===`_`?t[0]:void 0,rank:mn(t),hash:Vi(Hi(Ui(t),109)),fingerprint:Qi($i(t)^60)};return wn.set(t,r),r},Dn=()=>[...wn.values()],On=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),kn=e=>{let t=On(e);return t.isNormalized=!0,t},An=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let jn=!1;const Mn=(e,t)=>(t===`lambda`&&(jn=!0),t!==void 0&&(e.functionClass=t),e),Nn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Pn=e=>Mn(e,`lambda`),Fn=e=>Tt(e)&&e.isCached===!0;let In=!1;const Ln=e=>(In=!0,e),Rn=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),zn=e=>{In&&typeof e==`object`&&Tt(e)&&Rn.has(e.kind)&&(e.isCached=!0)},Bn=e=>{(jn||In)&&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(Bn),e.range.forEach(Bn)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Bn):N(e)&&P(e)&&(zn(e),F(e).elements.forEach(Bn))))},Vn=(e,t)=>{if(zn(e),e===t)return Sn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&$t(e,t,!0),Cn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Xt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Zt(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&ci(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==ci(t))return!1;if(Lt(e)||Lt(t))return e.kind===`LazyFunction`&&I(e),$t(e,t,!0),Lt(e)&&Lt(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Vn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=ai(e.domain),r=ai(t.domain);if(n||r)return n===r;let i=ai(e.range),a=ai(t.range);return i||a?i===a:Vn(e.domain,t.domain)&&Vn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(ai(e))return ai(t);if(ai(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]&&Vn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return ai(e)?ai(t):!ai(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Vn(e,t.factors[n]));let n=N(e)&&N(t)&&!(P(e)&&P(t));if(n&&_n(e,t))return yn(e,t,`check equality of`)===0;if(n){if(!gn(e)){let n=F(e);if(!gn(t))return Zt(n,F(t))===0}return ia(e)===ia(t)}return Cn(e,t)===0},Hn=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):ia(n)===ia(r);return n},Un=Hn(!1),Wn=Hn(!0),Gn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Kn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zi(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Wn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Wn(i[e],n))return i[e]}return n.kind===`Set`?Gn(n.elements,t):(Gn(n.domain,t),Gn(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}},qn=(e,t)=>t.length===0||Nn(e)===`tuple`?1:Ri(t)?.low,Jn=e=>{if(!It(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:qn(e,t.domain)}},Yn=e=>{if(!It(e))return;let t=I(e);return Jt(t.domain)?t:void 0},Xn=(e,t,n)=>($t(t,e,n),1),Zn={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`}},Qn=(e,t,n)=>{let r=Zn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${j(L(e))} with ${r.other}:\n${j(L(t))}`},$n=e=>e?`check equality of`:`compare`,er=(t,n,r,i)=>{let a=Jn(r);if(!a){if(Lt(r))return Xn(r,n,i);throw new e.x(`Attempted to ${$n(i)} the function ${j(L(n))} with the value:\n${j(L(r))}`)}if(t.range.length!==a.range.length)return t.range.length-a.range.length;let o=()=>tr(t.range,a.range,i);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&a.low!==void 0)return t.low===a.low?o():t.low-a.low;let s=t.low??a.low;if(s===void 0)return tr(t.domain,a.domain,i)||o();let c=t.low===void 0?t.domain:a.domain;for(let n=0;n<c.length;n++){let r=c[n];if(typeof r!=`number`)throw new e.x(`Attempted to compare ${i?`an `:``}integer with non-integer${i||t.low!==void 0?`:`:``}\n${j(L(r))}.`);let a=t.low===void 0?r-(s+n):s+n-r;if(a!==0)return a}return o()},tr=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=or(e[r],t[r],n);if(i!==0)return i}return 0},nr=(t,n,r)=>{let i=I(t);if(Nn(t)===`tuple`){let e=It(n)?pi(n):void 0;return e?i.range.length-e.length||tr(i.range,e,r):er({...i,low:1},t,n,r)}if(Nn(t)===`record`){let a=Yn(n);if(!a){if(Lt(n))return Xn(n,t,r);throw new e.x(`Attempted to ${$n(r)} record:\n${j(L(t))}\nwith non-record\n${j(L(n))}`)}return i.domain.length-a.domain.length||tr(i.domain,a.domain,r)||tr(i.range,a.range,r)}return er({...i,low:qn(t,i.domain)},t,n,r)},rr=(e,t)=>gn(e)||gn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),ir=(e,t)=>{let n=Rt(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},ar=(t,n,r)=>{if(rr(t,n))return r?+!Vn(t,n):Cn(t,n);if(!Rt(t))return ar(F(t),n,r);if(!N(n)){if(Lt(n))return Xn(n,t,r);throw new e.x(`Attempted to ${$n(r)} the set ${j(L(t))} with the value:\n${j(L(n))}`)}let i=ir(t,n);return i.elements.length-i.otherElements.length||tr(i.elements,i.otherElements,r)},or=(t,n,r)=>{if(typeof t!=`object`){if(typeof n==typeof t)return r?t===n?0:1:Cn(t,n);if(Lt(n))return Xn(n,t,r);throw new e.x(Qn(t,n,r))}return t.kind===`ModelValue`?(t.type!==void 0&&$t(t,n,r),Lt(n)?r?t.name===n.name?0:1:t.rank-n.rank:-1):It(t)?nr(t,n,r):ar(t,n,r)},sr=(e,t)=>or(e,t,!1),cr=(e,t)=>or(e,t,!0)===0,lr=e=>{let t=[];for(let n of e){let e=dr(n,t);e.isFound||t.splice(e.index,0,n)}return t},ur=(e,t)=>{let n=hi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},dr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=ur(e,()=>sr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},fr=(e,t)=>t.some(t=>ur(t,()=>cr(t,e))),pr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,mr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(mr)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(mr),e.range.forEach(mr)))},hr=e=>{if(!(typeof e!=`object`||Fn(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return hr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(hr(e.left),hr(e.right));case`FunctionSet`:return hr(e.domain),hr(e.range);case`RecordSet`:return e.sets.forEach(hr);case`ProductSet`:return e.factors.forEach(hr)}},gr=(e,t)=>gi(Vn,cr,e,t),_r=e=>{for(let t=1;t<e.length;t++)if(Cn(e[t-1],e[t])>=0)return!1;return!0},vr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},yr=e=>{for(let t=1;t<e.length;t++)zn(e[t]);if(e.length<2||_r(e))return On(e);let t=[...e].sort(Cn),n=[t[0]];for(let e=1;e<t.length;e++)Cn(n[n.length-1],t[e])!==0&&n.push(t[e]);return On(n)},br=e=>{if(vr(e))return On(e);let t=gi(yr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},xr=On([]),Sr=(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&&Cn(r[a],t)<0;)a++;a<r.length&&Cn(r[a],t)===0||i.push(t)}return i.length===n.length?e:On(i)},Cr=(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&&Cn(r[a],t)<0;)a++;a<r.length&&Cn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:On(i)},wr=(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=Cn(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=On(i);if(e.hash!==0&&e.hash!==Ki){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zi(a[n]);if(e===Ki)break;t=t+Wi(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+ea(a[e])|0;c.fingerprint=t}return c},Tr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Cn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Cn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return An(n,r)},Er=e=>{let t=Tr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:Ht(t,e.map(e=>e[0]))},Dr=[],Or=/* @__PURE__ */ new Map,kr=[],Ar=/* @__PURE__ */ new WeakMap,jr=e=>{let t=Dr[e]??Or.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Or.set(e,new WeakRef(n)):Dr[e]=n,n},Mr=e=>{if(ci(e),e.low===1&&e.high>=1)return jr(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Nr=e=>e.length>0&&(e===Dr[e.length]||e===Or.get(e.length)?.deref())||Ar.has(e),Pr=e=>{let t=F(e).elements;return Nr(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Fr=e=>{let t=kr[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return kr[e]=n,n},Ir=e=>Mn(An(jr(e.length),e),`tuple`),Lr=e=>Mn(Tr(e),`record`),Rr=(e,t)=>Mn(An(e,t),`record`),zr=e=>N(e)&&!gn(e),Br=(e,t=!1)=>`UNION(${L(e.base,t)})`,Vr=(t,n=e=>F(e).elements)=>{if(!zr(t.base))throw new e.x(`Attempted to enumerate the nonenumerable set:\n${Br(t)}`);return n(t.base)},Hr=(t,n,r)=>{if(zr(t))return t;throw new e.x(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${j(L(t))}\nwhen enumerating:\n${j(Br(r))}`)},P=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 P(e.base);case`FunctionSet`:return P(e.domain)&&P(e.range)||Ur(e.domain)===!0||Ur(e)===!0;case`RecordSet`:return e.sets.every(P)||Ur(e)===!0;case`ProductSet`:return e.factors.every(P)||Ur(e)===!0;case`Union`:return P(e.base)&&(Rt(e.base)?pr(e.base):ei(e.base)).every(P);case`SetOperation`:return e.operator===`\\cup`?P(e.left)&&P(e.right):e.operator===`\\cap`?P(e.left)||P(e.right):P(e.left);default:return!1}},Ur=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=Ur(e.domain);return t===void 0?void 0:!t&&Ur(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Ur(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return P(e)?F(e).elements.length===0:void 0;default:return}},Wr=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},Gr=(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},Kr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||gn(e.base))return;let t=F(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:Gr(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return On(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},qr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(On(r.map(t=>e[t])));while(Gr(r,e.length))}return t},Jr=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(gn(o))throw new e.x(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Yr=(t,n=e=>F(e).elements)=>{if(typeof t!=`object`)throw new e.x(`Expected a set but found ${L(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return lr(t.elements);case`Interval`:{let e=Mr(t);return e!==Dr[e.length]&&Ar.set(e,t),e}case`Subset`:{if(ci(t.base)===0)return qr([]);if(!N(t.base))throw new e.x(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${j(L(t.base))}`);let n=F(t.base).elements;if(n.length>30)throw new e.x(si(t));return qr(n)}case`FunctionSet`:{if(!on&&ai(t))return[];if(gn(t.domain))throw new e.x(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${j(L(t.domain))}\ncannot be enumerated.`);let r=Pr(t.domain);if((r.length>0||on)&&gn(t.range))throw new e.x(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${j(L(t.range))}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Wr(r.map(()=>i)).map(e=>An(r,e))}case`RecordSet`:{if(!on&&ai(t))return[];let e=Jr(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${j(L(e))}`);return Wr(e).map(e=>Lr(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!on&&ai(t))return[];let e=Jr(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${j(L(e))}`);return Wr(e).map(Ir)}case`FilteredSet`:if(!N(t.base)||gn(t.base))throw new e.x(`Attempted to enumerate { x \\in S : p(x) } when S:\n${j(L(t.base))}\nis not enumerable`);return F(br(ei(t.base).filter(e=>t.test(e,!1)))).elements;case`Union`:{let n=[];return Vr(t).forEach((r,i)=>{let a=Hr(r,i,t);if(Nt(a))throw new e.P(jt());ei(a).forEach(e=>Mt(n,e))}),F(br(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!zr(t.left)&&!zr(t.right))throw new e.x(`Attempted to enumerate S \\cap T when neither S:\n${j(L(t.left))}\nnor T:\n${j(L(t.right))}\nis enumerable`);if(t.operator===`\\`&&!zr(t.left))throw new e.x(`Attempted to enumerate S \\ T when S:\n${j(L(t.left))}\nis not enumerable.`);if(t.operator===`\\cup`)return F(br(Zr(t))).elements;let n=t.operator===`\\`||zr(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return Pt(typeof r==`object`&&r.kind===`Interval`?r:ei(r),e=>{vi(e,i)===(t.operator===`\\cap`)&&Mt(a,e)}),F(br(a)).elements}case`InfiniteSet`:case`SequenceSet`:throw new e.x(`Attempted to enumerate the non-enumerable set ${L(t)}`);default:throw new e.x(`Expected a set but found ${L(t)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return On(Yr(e));let t=typeof e==`object`&&Tt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=hi.sets;n?.push(e);let r=Yr(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`)?On(r):yr(r);return t&&(t.enumerated=i),i},Xr=e=>{if(!(typeof e!=`object`||Fn(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return zr(e.base)||F(e),Xr(e.base);case`Union`:if(!Rt(e.base)&&zr(e.base))return Xr(e.base);Vr(e).slice(0,1).forEach(t=>Xr(Hr(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!zr(e.left)&&F(e),e.operator!==`\\cup`||zr(e.left)&&zr(e.right)||F(e),e.operator!==`\\cap`||zr(e.left)?Xr(e.left):Xr(e.right),e.operator===`\\cup`&&Xr(e.right)}},Zr=t=>{if(!zr(t.left)||!zr(t.right))throw new e.x(`Attempted to enumerate S \\cup T when S:\n${j(L(t.left))}\nand T:\n${j(L(t.right))}\nare not both enumerable`);if(Xr(t.left),Xr(t.right),Nt(t.left))throw new e.P(jt());let n=ei(t.left),r=Nt(t.right)?void 0:ei(t.right);if(!r||n.length+r.length>At())throw new e.P(jt());return[...n,...r]},Qr=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=ur(e,()=>Zr(e)),n=F(br(t)).elements;return e.enumerated=On(n),n},$r=(e,t)=>{if(typeof e!=`object`||Fn(e))return F(e).elements.some(t);let n=hi.sets;n?.push(e),Xr(e);let r=ii(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},ei=e=>{let t=[];return $r(e,e=>(t.push(e),!1)),t},ti=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ni=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ni);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ni)&&e.range.every(ni);case`SetOperation`:return e.operator!==`\\cup`&&ni(e.left)&&ni(e.right);case`FilteredSet`:return ni(e.base);case`ProductSet`:return e.factors.every(ni);default:return!1}},ri=e=>typeof e!=`object`||Fn(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ri(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ri(e.left)||ri(e.right):ti(e)?.some(ri)??!1,ii=(e,t)=>{if(e.kind===`Union`)return Vr(e,ei).some((n,r)=>$r(Hr(n,r,e),t));if(e.kind===`FilteredSet`&&zr(e.base))return $r(e.base,n=>e.test(n,!1)&&t(n));if(ti(e)?.some(ri))return Yr(e,ei).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!zr(e.left)||!zr(e.right)?F(e).elements.some(t):$r(e.left,t)||$r(e.right,t);let n=e.operator===`\\`||zr(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return zr(r)?$r(r,n=>vi(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},ai=t=>{if(typeof t!=`object`||!N(t))throw hi.sets?.push(t),new e.x(`Shouldn't call isEmpty() on value ${L(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e.x(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(ai);case`RecordSet`:return t.sets.some(ai);case`FunctionSet`:return!ai(t.domain)&&ai(t.range);case`Union`:return Vr(t).every((e,n)=>ai(Hr(e,n,t)));default:return F(t).elements.length===0}},oi=(t,n,r)=>t.reduce((t,i)=>{let a=t*ci(i,n);if(a>2147483647)throw new e.x(r());return a},1),si=e=>`Overflow when computing the number of elements in:\n${j(L(e))}`,ci=(t,n)=>{if(typeof t!=`object`)throw new e.x(`Attempted to compute the number of elements in the ${zt(t)} ${j(L(t))}.`);switch(t.kind){case`ModelValue`:throw new e.x(`Attempted to compute the number of elements in the model value ${j(L(t))}.`);case`Function`:return t.domain.length;case`LazyFunction`:return ci(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.x(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.x(`Attempted to compute the number of elements in the overridden value ${j(L(t))}.`);case`Subset`:{let r=ci(t.base,n);if(r>=31)throw new e.x(si(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(ai(t.domain))return 1;if(ai(t.range))return 0;if(ci(t.range,n)===1)return 1}let r=ci(t.domain,n),i=ci(t.range,n);if(i<=1)return r===0?1:i;let a=1;for(let n=0;n<r;n++)if(a*=i,a>2147483647)throw new e.x(si(t));return a}case`RecordSet`:return n!==`1.7.4`&&ai(t)?0:oi(t.sets,n,()=>si(t));case`ProductSet`:return n!==`1.7.4`&&ai(t)?0:oi(t.factors,n,()=>`Overflow when computing the number of elements in ${j(L(t))}`);default:return zn(t),F(t).elements.length}},li=e=>`Attempted to check if the set ${j(L(e))}is finite.`,ui=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.x(`Attempted to check if the ${zt(t)} ${j(L(t))} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.x(`Attempted to check if the function:\n${j(L(t))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return ui(t.base)&&ai(t.base);case`Subset`:return ui(t.base);case`FunctionSet`:{let e=ui(t.domain);if(e&&ai(t.domain))return!0;let n=ui(t.range);return n&&ai(t.range)?!0:n&&(e||ci(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!ui(t))n=!1;else if(ai(t))return!0;return n}case`Union`:if(!zr(t.base))throw new e.x(`Attempted to check if the nonenumerable set:\n${Br(t)}\nis a finite set.`);return F(t.base).elements.every(ui);case`SetOperation`:if(t.operator===`\\cup`)return ui(t.left)&&ui(t.right);if(t.operator===`\\cap`){if(!ui(t.left)&&!ui(t.right))throw new e.x(li(t));return!0}if(ui(t.left))return!0;if(!ui(t.right))throw new e.x(li(t));return!1;case`FilteredSet`:if(!ui(t.base))throw new e.x(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${j(L(t.base))}\nis finite.`);return!0}},di=(e,t,n=Cn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},fi=(t,n)=>{let r=t.elements;if(r.length>At())throw new e.P(jt());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=di(r,e);return!i[t]&&(i[t]=!0,!0)}),o=On(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},pi=t=>{if(typeof t!=`object`||!It(t))return;if(t.kind===`LazyFunction`&&(!N(t.domain)||gn(t.domain)))throw new e.x(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let n=I(t);return n.domain.every((e,t)=>e===t+1)?n.range:void 0},mi=(e,t)=>{let n=`Attempted to check if the value:\n${j(L(e))}\nis an element of the`;if(!It(t))return`${n} ${zt(t)} ${j(L(t))}`;let r=Nn(t);return r===`record`?`Attempted to check if element:\n${j(L(e))}\nis in the record:\n${j(L(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${j(L(t))}`},hi={sets:void 0},gi=(t,n,r,i)=>{let a=hi.sets,o=hi.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.x))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},_i=e=>(hi.sets??[]).slice(e).some(e=>typeof e==`object`&&hi.callStack?.sources.has(e)===!0),vi=(e,t)=>{let n=hi.sets;if(n===void 0)return Ci(e,t);n.push(t);let r=Ci(e,t);return n.pop(),r},yi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},bi=(e,t)=>di(t.elements,e)!==-1,xi=(e,t)=>t.isNormalized?dr(e,t.elements).isFound:fr(e,pr(t)),Si=(t,n)=>{if(t.type!==void 0)throw new e.x(`Attempted to check if the typed model value ${j(L(t))} is an element of\n${j(L(n))}`);return!1},Ci=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return yi(e,t)??wi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return wi(e,t)},wi=(t,n)=>{if(!N(n))throw new e.x(mi(t,n));switch(n.kind){case`Set`:return zn(t),gi(bi,xi,t,n);case`MixedSet`:return fr(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!Lt(t)||t.type!==void 0))throw new e.x(`Attempted to check if the value:\n${j(L(t))}\nis in the integer interval ${j(L(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(Lt(t))return Si(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.A(`Attempted to check if the value:\n${j(L(t))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!N(t)||gn(t))throw new e.x(`Attempted to check if the non-enumerable value\n${j(L(t))}\nis element of\n${j(L(n))}`);return F(t).elements.every(e=>vi(e,n.base));case`FunctionSet`:{if(!It(t)){if(Lt(t))return Si(t,n);throw new e.x(`Attempted to check if \n${L(t)}\nwhich is not a TLC function value, is in the set of functions:\n${j(L(n))}`)}let r=I(t),i=qn(t,r.domain);return(i===void 0?gr(n.domain,On(r.domain)):gr({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>vi(e,n.range))}case`RecordSet`:{let r=It(t)?I(t):void 0;if(!r||!Jt(r.domain)){if(Lt(t))return Si(t,n);throw new e.x(`Attempted to check if non-record\n${L(t)}\nis in the set of records:\n${j(L(n))}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=di(r.domain,e);return i!==-1&&vi(r.range[i],n.sets[t])})}case`ProductSet`:{let r=It(t)?pi(t):void 0;if(r===void 0){let r=It(t)&&I(t).domain.every(e=>typeof e==`number`);if(Lt(t))return Si(t,n);if(r)return!1;throw new e.x(`Attempted to check if non-tuple\n${j(L(t))}\nis in the set of tuples:\n${j(L(n))}`)}return r.length===n.factors.length&&r.every((e,t)=>vi(e,n.factors[t]))}case`FilteredSet`:try{return vi(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.x)||!ot(r)?r:new e.x(`Cannot decide if element:\n${j(L(t))}\n is element of:\n${j(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!zr(n.base))throw new e.x(`Attempted to check if:\n ${j(L(t))}\nis an element of the non-enumerable set:\n ${j(Br(n))}`);let r=F(n.base).elements;return r.length>1&&r.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),r.some(e=>vi(t,e))}case`SetOperation`:return n.operator===`\\cup`?vi(t,n.left)||vi(t,n.right):vi(t,n.left)&&vi(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=pi(t);if(r===void 0){if(Lt(t))return Si(t,n);throw new e.A(`Attempted to check if the value:\n${j(L(t))}\nis an element of ${j(L(n))}.`)}return r.every(e=>vi(e,n.base))}default:throw new e.x(mi(t,n))}},Ti=(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?vi(e,n):e.range.every((e,r)=>Ti(e,t.range[r],n.range)),I=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;if(P(t.domain)||ci(t.domain),!N(t.domain))throw new e.x(`The domains of formal parameters must be enumerable.`);let n=Pr(t.domain);return t.enumerated=An(n,n.map(e=>t.apply(e))),t.enumerated}throw new e.x(`Expected a function but found ${L(t)}`)},Ei=(e,t,n)=>{let r=j(L(e)),i=j(L(t)),a=n===`1.7.4`;switch(Nn(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.`}},Di=(e,t)=>{if(!on)return Ei(e,t);let n=j(L(t));return Nn(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Oi=(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},ki=t=>new e.x(`Attempted to apply function with integer domain to the non-integer argument ${j(L(t))}`),Ai=(e,t)=>di(e.domain,t),ji=(e,t,n)=>{let r=Ut(e);throw on||r!==e.domain||r.length<32?r.forEach(e=>cr(e,t)):di(r,t,sr),n},Mi=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=Nn(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.x(r(t,n));if(o===void 0&&!on&&typeof n!=`number`&&Nr(i))throw ki(n)}let a=Oi(i,n);return a===-1?gi(Ai,ji,t,n):a},Ni=(e,t,n,r)=>`In applying the function\n${j(L(e))},\nthe ${t} is:\n${j(L(n))}\nwhich ${r}.\n`,Pi=(t,n)=>new e.x(Ni(t,`argument list`,n,`does not match its formal parameter`)),Fi=(t,n,r)=>{let i=t.domain,a=pi(r);if(a===void 0)throw Pi(t,r);if(typeof i!=`object`||i.kind!==`ProductSet`)throw new e.x(`Attempted to apply a function to ${L(r)}, which is not in its domain`);if(n.forEach((n,o)=>{if(o>=a.length)throw Pi(t,r);let s=a[o],c=`argument number ${o+1}`;if(!vi(s,i.factors[o]))throw new e.x(Ni(t,c,s,n===void 0?`is not in the function's domain ${L(i)}`:`is not in its domain`));if(n!==void 0&&pi(s)?.length!==n)throw new e.x(Ni(t,c,s,`does not match its formal parameter`))}),a.length>n.length)throw Pi(t,r)},Ii=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!vi(t,e.lambdaDomain),Li=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return Li(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return Fi(t,i,n),t.apply(n);if(!vi(n,t.domain))throw new e.x(Nn(t)===`lambda`?Ei(t,n):`Attempted to apply a function to ${L(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.x(`Attempted to apply ${L(t)}, which is not a function`);let i=r??Ei;if(Ii(t,n))throw new e.x(i(t,n));let a=Mi(t,n,i);if(a===-1)throw new e.x(i(t,n));return t.range[a]},Ri=e=>Nr(e)?Ar.get(e)??Fr(e.length):void 0,zi=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Ri(t.domain);if(n)return n;let r=On(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Bi=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(t.boundTupleLengths!==void 0&&pi(n)===void 0)throw Pi(t,n);if(!vi(n,t.domain))return t;let e=r(t.apply(n));return Mn({kind:`LazyFunction`,domain:t.domain,apply:r=>gr(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},Nn(t))}if(!It(t))throw new e.x(`Attempted to apply EXCEPT construct to the value ${j(L(t))}.`);let a=I(t);if(Ii(a,n))return a;let o=Mi(a,n,Di);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=Mn(An(a.domain,s),Nn(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==Ki){let e=Zi(l);if(e!==Ki){let t=Zi(a.domain[o]);u.hash=c===l?a.hash:a.hash-Gi(t,Zi(c))+Gi(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-ta(e,c)+ta(e,l)|0}return u},Vi=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hi=(e,t)=>Math.imul(e^t,16777619),Ui=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vi(t)},Wi=e=>Vi(e+2654435769|0),Gi=(e,t)=>Vi(Math.imul(e,668265261)+t|0),Ki=795548749,qi=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zi(t[e]);if(r===Ki)return Ki;n=n+Wi(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Zi(e.domain[n]),i=Zi(e.range[n]);if(r===Ki||i===Ki)return Ki;t=t+Gi(r,i)|0}return t},Ji=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.x(`TLC has found a state in which the value of a variable contains ${j(L(t))}`);if(N(t)){F(t).elements.forEach(Ji);return}let n=I(t);n.domain.forEach(Ji),n.range.forEach(Ji)},Yi=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Zi(t)===Ki&&Ji(t);return}catch(t){if(!(t instanceof e.x))throw t;return t}},Xi=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[]}},Zi=e=>typeof e==`number`?Vi(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ui(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=qi(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?Zi(I(e)):Ki:P(e)?Zi(F(e)):Ki,Qi=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$i=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qi(t)},ea=e=>Qi(ra(e)+2135587861|0),ta=(e,t)=>Qi(Math.imul(ra(e),374761393)+ra(t)|0),na=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ea(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ta(e.domain[n],e.range[n])|0;return t},ra=e=>typeof e==`number`?Qi(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?$i(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=na(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ra(I(e)):P(e)?ra(F(e)):$i(ia(e)),ia=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):aa(e),aa=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${ia(t.base)}>`;if(t.kind===`FilteredSet`&&!P(t))throw new e.x(`Attempted to compare the non-enumerable set ${L(t)} with another value`);if(N(t))return P(t)?`{${F(t).elements.map(ia).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${ia(e)}:${ia(n.range[t])}`).join(`,`)})`},oa={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},sa=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>oa[e])}"`,ca=1999,la=e=>e.reduce((e,t)=>e===0?0:e*ci(t),1),ua=e=>{if(e.kind===`Subset`)return ci(e.base)<=6?F(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return F(e);if(e.kind===`FunctionSet`){let t=ai(e.domain)?0:ci(e.domain);return(t===0?1:ci(e.range)**t)<=ca?F(e):void 0}return la(e.kind===`RecordSet`?e.sets:e.factors)<=ca?F(e):void 0},da=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&It(t.base)&&(t.base.kind===`Function`||P(t.base.domain)))return ua(t);if(P(t))try{return ua(t)}catch(t){if(t instanceof e.x)return;throw t}},fa=(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 Br(e,t)}},pa=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),ma=t=>{if(P(t.domain))try{return I(t)}catch(t){if(t instanceof e.x||e.nt(t))return;throw t}},ha=e=>{let t=[],n=[],r=[],i=(e,a,o)=>{if(typeof e!=`object`)return;let s=e=>i(e,a,!1);switch(e.kind){case`Set`:if(e.elements.forEach(s),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(s),F(e);return;case`Function`:{let t=a||Nn(e)===`lambda`;if(e.range.forEach(e=>i(e,t,o)),a||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:if(e.enumerated)return i(e.enumerated,!0,o);o&&r.push(e),s(e.domain);return;case`SetOperation`:s(e.left),s(e.right);return;case`FunctionSet`:s(e.domain),s(e.range);return;case`RecordSet`:e.sets.forEach(s);return;case`ProductSet`:e.factors.forEach(s);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:s(e.base);return;default:return}};try{return e.forEach(e=>i(e,!1,!0)),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),r.forEach(e=>{e.enumerated=void 0}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},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 sa(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(F(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=sn.isExpanded?da(e,t):void 0;return n?r(n):fa(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?sn.isExpanded||!e.source?ma(e):void 0: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&&on&&Nn(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Nn(e)!==`lambda`);if(i.domain.length===0&&Nn(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):Gt(i);return Nn(e)===`record`||i.domain.every(e=>typeof e==`string`&&pa(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},ga=(t,n)=>{if(t===void 0)return!1;try{return Vn(t,n)}catch(t){if(t instanceof e.x)return!1;throw t}},_a=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,va=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(_a,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
74
+ `;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(He(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},ya=(t,n)=>{let r=n?void 0:ln.get(t);if(r)return r();let i=Object.entries(t),a=dn.get(t),o=a!==void 0&&`_format`in t,s=o?t._format:i.length===1?`%s = %s
75
75
  `:`/\\ %s = %s
76
- `;if(typeof s!=`string`)throw new e._(`The _format field of the ALIAS ${a} is ${L(s)}, but it must be a string.`);return i.filter(e=>!(o&&e[0]===`_format`)).filter(e=>!n||!ga(n[e[0]],e[1])).map(t=>{let n=va(s,[t[0],M(L(t[1]))]);if(n===void 0)throw new e._(`The _format field of the ALIAS ${a} is ${L(s)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},ba=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let xa=ba[0];const Sa=()=>xa,Ca=/* @__PURE__ */ new Int32Array(256),wa=/* @__PURE__ */ new Int32Array(256),Ta=/* @__PURE__ */ new Int32Array(256),Ea=/* @__PURE__ */ new Int32Array(256),Da=/* @__PURE__ */ new Int32Array(256),Oa=/* @__PURE__ */ new Int32Array(256),ka=/* @__PURE__ */ new Int32Array(256),Aa=/* @__PURE__ */ new Int32Array(256);let ja=0,Ma=0,Na=0,Pa=0;const Fa=e=>{let t=(e^Pa)&255;Pa=(Pa>>>8|Na<<24)^Da[t],Na=Na>>>8^Ca[t]},Ia=e=>{let t=ba[e];xa=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Ca[e]=Number(BigInt.asIntN(32,t>>32n)),Da[e]=Number(BigInt.asIntN(32,t))}let i=[Ca,wa,Ta,Ea],a=[Da,Oa,ka,Aa];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Da[o],i[e][r]=t[r]>>>8^Ca[o]}}ja=Number(BigInt.asIntN(32,t>>32n)),Ma=Number(BigInt.asIntN(32,t))};Ia(0);const La=e=>{let t=Pa^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Pa=Na^Aa[n]^ka[r]^Oa[i]^Da[a],Na=Ea[n]^Ta[r]^wa[i]^Ca[a]},Ra=e=>{if(typeof e==`boolean`)return Fa(0),Fa(e?116:102),2;if(typeof e==`number`)return Fa(1),La(e),5;if(typeof e==`string`){Fa(3),La(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)La(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)Fa(e.charCodeAt(n));return 5+e.length}return Fa(21),La(mn(e.name)+1),5},za=e=>{let t=Na,n=Pa;Na=0,Pa=0;let r=[Ra(e),Na,Pa];return Na=t,Pa=n,r},Ba=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,Va=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,Ha={integer:e=>`${Ba(`1`)} ${Va(e)}`,boolean:e=>`${Ba(`0`)} ${Ba(`(${e} ? 116 : 102)`)}`,set:e=>`${Ba(`5`)} ${Va(e)}`,function:e=>`${Ba(`9`)} ${Va(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${Va(`0`)} } for (; r > 0; r--) { ${Ba(`0`)} } h ^= ${t}; l ^= ${n}; }`},Ua=()=>({H0:Ca,H1:wa,H2:Ta,H3:Ea,L0:Da,L1:Oa,L2:ka,L3:Aa,initialHigh:ja,initialLow:Ma}),Wa=(e,t)=>{let n=Na,r=Pa;Pa=e[0],Na=e[1],qa(t),e[0]=Pa,e[1]=Na,Na=n,Pa=r},Ga=e=>{Fa(5),La(e)},Ka=e=>{Fa(9),La(e)},qa=e=>{if(typeof e!=`object`||Lt(e))Ra(e);else if(It(e)){let t=I(e);Ka(t.domain.length);for(let e=0;e<t.domain.length;e++)qa(t.domain[e]),qa(t.range[e])}else{let t=F(e).elements;Ga(t.length);for(let e of t)qa(e)}},Ja=e=>{let t=Na,n=Pa;Na=ja,Pa=Ma;for(let t of e)qa(t);let r=BigInt(Na>>>0)<<32n|BigInt(Pa>>>0);return Na=t,Pa=n,r},Ya=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=Na,a=Pa;for(let n=0;n<e;n++)Na=ja,Pa=Ma,t(n),r[2*n]=Pa,r[2*n+1]=Na;return Na=i,Pa=a,n},Xa=(e,t)=>Ya(e.length,n=>{for(let r of t)qa(e[n][r])}),Za=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Qa=1024,$a=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*Qa),relations:[]}),eo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},to=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,no=(e,t,n,r,i)=>{let a=t===`next`?to(e,t,r):void 0;if(a!==void 0)return a;let o=eo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},ro=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,io=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=n.location.range;return!i||!a?`Action ${o?e.Z(o):`Unknown location`}`:ro(i.body.location.range,o)||!o?`${i.name} ${e.Z(a)}`:`${i.name} ${e.Z(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},ao=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,oo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,so=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},co=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(Ve(t.name)&2147483647)%e.length].unshift(t));t=e}t[(Ve(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},lo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),uo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),fo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),po=(e,t,n)=>{let r=new Set(n.map(ao)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(j(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Za.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=eo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(ao(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?fo(t.bounds):t.params.map(e=>e.name);m(t.body,uo(n,e.scope)),t.kind===`Function`&&lo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,uo(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,uo(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),co(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,oo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,so(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,oo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,uo(fo(e.bounds),t)),r(lo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,uo(fo(e.bounds),t)),r(lo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,uo(fo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,uo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,uo(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},mo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=mo(e,r,n);if(t!==-1)return t}}return-1},ho=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=mo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:mo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},go=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},_o=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},vo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},yo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},bo=(e,t)=>t.forEach((t,n)=>{let r=Ja([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*Qa+i;e.registers[o]=Math.max(e.registers[o],yo(a)+1)}),xo=(e,t)=>{let n=e.registers.subarray(t*Qa,(t+1)*Qa),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*Qa*Qa/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*Qa?a===0?i:Qa*Math.log(Qa/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},So=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Co=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>So(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},wo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},To=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Eo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Do=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},Oo=(t,n)=>{let r=[],i=/* @__PURE__ */ new Map,a=e=>{let n=[],r={primary:t.primary[e],secondary:t.secondary[e]};return(r.primary>0||r.secondary>0||To(t,e))&&wo(n,r),Eo(t,e).forEach(e=>a(e).forEach(e=>wo(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.Z(s):`Unknown location`,depth:i,count:a,cost:o})},s=(e,n)=>o(e,n,t.primary[e],t.secondary[e]),c=(e,n)=>{let r=Eo(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>wo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=To(t,e),f=e=>r.forEach(t=>c(t,e));if(t.isUnchanged[e]){let t=l.filter(e=>e.primary!==0||e.secondary!==0);t.length===0?s(e,n):o(e,n,Math.max(u.primary,Co(t).primary),0);return}if(l.length===0){(u.primary!==0||d)&&s(e,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let t=l[0],r=t.primary===0&&t.secondary===0;if(t.primary<u.primary){s(e,n),f(n+1);return}if(!d&&p&&!r){o(e,n,t.primary,t.secondary);return}if(p&&r){d&&s(e,n),f(d?n+1:n);return}if(u.primary===t.primary&&u.secondary===t.secondary){s(e,n);return}}let m=!p||d;m&&s(e,n),f(m?n+1:n)};return Eo(t,n).forEach(e=>{a(e),c(e,0)}),r},ko=[`init`,`next`,`invariant`,`constraint`,`implied`],Ao=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,jo=e=>ko.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Ao(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Ao(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Mo=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.Z(a):`Unknown location`}`,distinct:xo(t,i)}}),relations:jo(t).map(e=>({kind:e.kind,label:e.label,...Do(t,e),expressions:Oo(t,e.node)}))}),No=(e,t,n)=>{let r=to(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},Po=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Fo=(t,n)=>Po.has(t)?new e.x(n):new e.A(n),Io=(t,n,r,i)=>new e.A(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${M(L(i))}`),Lo=(t,n,r=t)=>{if(!Pt(t)||gn(t))throw new e.A(`Applying ${n} to the following value,\nwhich is not a finite set:\n${M(L(r))}`);return F(t)},Ro=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Ro(r))throw Fo(n,`${n} expects a value as argument ${t+1}`);return r},zo=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Fo(n,`${n} expects a boolean but received ${L(r)}`);return r},Bo=(e,t,n)=>{let r=e[t];if(r===void 0||!Ro(r))throw Fo(n,`${n} expects an operator as argument ${t+1}`);return r},Vo=(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}),Ho=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Uo=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Wo=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Go=e=>e>2147483647||e<-2147483648,Ko=t=>new e.A(`Overflow when computing ${t}`),qo={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`},Jo={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Yo={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`},Xo={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Zo=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Jo[e.operator];if(e.kind!==`Function`)return qo[e.kind];let t=Nn(e);return t===void 0?`FcnRcdValue`:Xo[t]},Qo=e=>Yo[Zo(e)],$o=(t,n)=>new e.x(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),es=(t,n)=>{let r=r=>(...i)=>{let a=hi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.x)||r instanceof e.y)throw r;let i=_i(a);throw hi.sets&&(hi.sets.length=a),t.isLazy!==!0&&r instanceof e.A&&!i?r:$o(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw $o(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},ts=(e,t)=>{if(typeof e!=`number`)throw $o(t,`Cannot cast tlc2.value.impl.${Zo(e)} to tlc2.value.impl.IntValue`);return e},ns=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,rs=(e,t,n,r)=>{let i=ns(e,n,`IntValue`,2);return Wo(t,(e,n)=>{let a=ts(n,i),o=ts(e,i),s=r(o,a);if(Go(s))throw Ko(`${o}${t}${a}`);return s})},is=(t,n,r)=>{if(typeof t!=`number`)throw new e.A(`The ${n} argument of ${r} should be an integer, but instead it is:\n${M(L(t))}`);return t},as=(e,t,n=e)=>Wo(e,(e,r)=>t(is(e,`first`,n),is(r,`second`,n))),os=(e,t,n)=>({...Uo(e,t,n),isLazy:!0}),ss=(e,t,n)=>{let r=Bo(e,t,n);return()=>r.call([])},cs=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),ls=()=>({implication:Fg,negate:Ig,equivalent:Lg,body:Rg,condition:(e,t)=>{if(typeof e!=`boolean`)throw vg(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw yg(t,n,e);return e},apply:Li,expectFunction:jg,tuple:Ir,set:br,record:Rr,writtenRecord:Kt,equal:Vn,enumerate:Gg,choiceElements:vv,noChoice:e=>{throw yv(e)},filterPredicate:_v,isReducible:Ft,finiteElements:e=>F(e).elements,addBounded:jt,normalizedSet:kn,isBeyondBound:Mt,cardinality:ci,functionDomain:Pr,sortedFunction:An,unassigned:(e,t)=>{throw Eg(e,t)},prime:V_,keepLazyContext:Mg,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>kg(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let us,ds;const fs=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},ps=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ms=e=>`local${e.counter++}`,hs=(e,t=/* @__PURE__ */ new Set)=>{let n=Be(e);return n!==void 0&&t.add(n),ze(e).forEach(e=>hs(e,t)),t},gs=(e,t,n,r=!1)=>{let i=hs(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=ps(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},_s=(e,t,n,r=!1)=>`${ps(e,X_(t,e.environment))}(${gs(e,t,n,r)})`,vs=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},ys=(e,t,n,r)=>{let i=ms(e),a=ms(e),o=ms(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},bs=(e,t,n)=>{let r=t.kind===`Forall`;return vs(e,n,n=>{let i=t.bounds.map(()=>ms(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${Ds(e,r.set,n)}, ${ps(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=ms(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Ds(e,t.body,n)}, ${ps(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>ys(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},xs=(e,t,n,r,i)=>vs(e,i,i=>{let a=ms(e),o=ms(e),s=ps(e,t),c=`choiceElements(${Ds(e,n,i)}, ${s}, ${ps(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Ds(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${ys(e,a,o,l)} return noChoice(${s});`}),Ss=(e,t,n,r)=>vs(e,r,r=>{let i=ms(e),a=ms(e),o=ms(e),s=ms(e),c=ps(e,t),l=`if (!isReducible(${i})) return ${ps(e,gv(t,e.environment))}(${i}, ${gs(e,t,r)});`,u=Ds(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${Ds(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${ys(e,a,s,d)} return normalizedSet(${o});`}),Cs=(e,t,n,r)=>vs(e,r,r=>{let i=ms(e),a=ms(e),o=ms(e),s=ms(e),c=ms(e),l=ms(e),u=ps(e,pv(t,e.environment)),d=gs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Ds(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Ds(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${ys(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ws=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Ds(e,r[0],n),a=Ds(e,r[1],n),o=ps(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Ds(e,r[0],n)}, ${ps(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Ds(e,r[0],n)}, ${Ds(e,r[1],n)}, ${ps(e,t)})`;if(j(t))return _s(e,t,n);let i=v_(t.operator,e.environment);if(i?.kind!==`Builtin`)return _s(e,t,n);if(i.name===`DOMAIN`)return`${ps(e,Sg(t))}(${Ds(e,r[0],n)})`;if(i.name===`TLCEval`)return _s(e,t,n,!0);if(i.name===`\\subseteq`&&r.length===2)return`${ps(e,Cg(t,i))}(${Ds(e,r[0],n)}, ${Ds(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&$_(r[0],a))return`${ps(e,i.evaluateUnary)}(${Ds(e,r[0],n)})`;let o=r.length===2&&$_(r[0],a)&&$_(r[1],a);return i.evaluateBinary&&o?`${ps(e,i.evaluateBinary)}(${Ds(e,r[0],n)}, ${Ds(e,r[1],n)})`:_s(e,t,n)},Ts=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(j(e))return!1;let r=k_(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Ts(e.expression,t,n);case`FieldAccess`:return Ts(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Ts(e,t,n));default:return!1}},Es=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Es(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Es);default:return!1}},Ds=(e,t,n)=>{let r=(t,r=n)=>Ds(e,t,r);switch(t.kind){case`Number`:return Bt(t.value)?String(t.value):_s(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(j(t))return _s(e,t,n);let i=k_(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ps(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ps(e,i.value):_s(e,t,n)}case`Apply`:return ws(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=ps(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)}, ${ps(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{cv(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Ts(t.function,n,e.environment)?r(t.function):Es(t.function)?r(t.function,i):_s(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ps(e,t)}))`,o=xg(e.environment.runtime.version),s=o?`, ${ps(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`${ps(e,bg(t))}(${r(t.record)})`;case`Record`:{let i=xv(t.fields);if(Sv(i))return _s(e,t,n);let a=ps(e,i.map(e=>e.name)),o=`[${t.fields.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}, ${ps(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${ps(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?_s(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?bs(e,t,n):_s(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?xs(e,t,t.set,t.pattern.name,n):_s(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!fv(t)?Cs(e,t,r.pattern.name,n):_s(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Ss(e,t,t.bound.pattern.name,n):_s(e,t,n);default:return _s(e,t,n)}},Os=(e,t)=>{if(!cs.has(e.kind)||(ds??=fs(),!ds))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ds(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(`
76
+ `;if(typeof s!=`string`)throw new e._(`The _format field of the ALIAS ${a} is ${L(s)}, but it must be a string.`);return i.filter(e=>!(o&&e[0]===`_format`)).filter(e=>!n||!ga(n[e[0]],e[1])).map(t=>{let n=va(s,[t[0],j(L(t[1]))]);if(n===void 0)throw new e._(`The _format field of the ALIAS ${a} is ${L(s)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},ba=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let xa=ba[0];const Sa=()=>xa,Ca=/* @__PURE__ */ new Int32Array(256),wa=/* @__PURE__ */ new Int32Array(256),Ta=/* @__PURE__ */ new Int32Array(256),Ea=/* @__PURE__ */ new Int32Array(256),Da=/* @__PURE__ */ new Int32Array(256),Oa=/* @__PURE__ */ new Int32Array(256),ka=/* @__PURE__ */ new Int32Array(256),Aa=/* @__PURE__ */ new Int32Array(256);let ja=0,Ma=0,Na=0,Pa=0;const Fa=e=>{let t=(e^Pa)&255;Pa=(Pa>>>8|Na<<24)^Da[t],Na=Na>>>8^Ca[t]},Ia=e=>{let t=ba[e];xa=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Ca[e]=Number(BigInt.asIntN(32,t>>32n)),Da[e]=Number(BigInt.asIntN(32,t))}let i=[Ca,wa,Ta,Ea],a=[Da,Oa,ka,Aa];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Da[o],i[e][r]=t[r]>>>8^Ca[o]}}ja=Number(BigInt.asIntN(32,t>>32n)),Ma=Number(BigInt.asIntN(32,t))};Ia(0);const La=e=>{let t=Pa^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Pa=Na^Aa[n]^ka[r]^Oa[i]^Da[a],Na=Ea[n]^Ta[r]^wa[i]^Ca[a]},Ra=e=>{if(typeof e==`boolean`)return Fa(0),Fa(e?116:102),2;if(typeof e==`number`)return Fa(1),La(e),5;if(typeof e==`string`){Fa(3),La(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)La(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)Fa(e.charCodeAt(n));return 5+e.length}return Fa(21),La(mn(e.name)+1),5},za=e=>{let t=Na,n=Pa;Na=0,Pa=0;let r=[Ra(e),Na,Pa];return Na=t,Pa=n,r},Ba=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,Va=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,Ha={integer:e=>`${Ba(`1`)} ${Va(e)}`,boolean:e=>`${Ba(`0`)} ${Ba(`(${e} ? 116 : 102)`)}`,set:e=>`${Ba(`5`)} ${Va(e)}`,function:e=>`${Ba(`9`)} ${Va(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${Va(`0`)} } for (; r > 0; r--) { ${Ba(`0`)} } h ^= ${t}; l ^= ${n}; }`},Ua=()=>({H0:Ca,H1:wa,H2:Ta,H3:Ea,L0:Da,L1:Oa,L2:ka,L3:Aa,initialHigh:ja,initialLow:Ma}),Wa=(e,t)=>{let n=Na,r=Pa;Pa=e[0],Na=e[1],qa(t),e[0]=Pa,e[1]=Na,Na=n,Pa=r},Ga=e=>{Fa(5),La(e)},Ka=e=>{Fa(9),La(e)},qa=e=>{if(typeof e!=`object`||Lt(e))Ra(e);else if(It(e)){let t=I(e);Ka(t.domain.length);for(let e=0;e<t.domain.length;e++)qa(t.domain[e]),qa(t.range[e])}else{let t=F(e).elements;Ga(t.length);for(let e of t)qa(e)}},Ja=e=>{let t=Na,n=Pa;Na=ja,Pa=Ma;for(let t of e)qa(t);let r=BigInt(Na>>>0)<<32n|BigInt(Pa>>>0);return Na=t,Pa=n,r},Ya=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=Na,a=Pa;for(let n=0;n<e;n++)Na=ja,Pa=Ma,t(n),r[2*n]=Pa,r[2*n+1]=Na;return Na=i,Pa=a,n},Xa=(e,t)=>Ya(e.length,n=>{for(let r of t)qa(e[n][r])}),Za=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Qa=1024,$a=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*Qa),relations:[]}),eo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},to=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,no=(e,t,n,r,i)=>{let a=t===`next`?to(e,t,r):void 0;if(a!==void 0)return a;let o=eo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},ro=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,io=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=n.location.range;return!i||!a?`Action ${o?e.Z(o):`Unknown location`}`:ro(i.body.location.range,o)||!o?`${i.name} ${e.Z(a)}`:`${i.name} ${e.Z(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},ao=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,oo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,so=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},co=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(He(t.name)&2147483647)%e.length].unshift(t));t=e}t[(He(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},lo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),uo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),fo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),po=(e,t,n)=>{let r=new Set(n.map(ao)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(A(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Za.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=eo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(ao(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?fo(t.bounds):t.params.map(e=>e.name);m(t.body,uo(n,e.scope)),t.kind===`Function`&&lo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,uo(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,uo(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),co(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,oo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,so(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,oo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,uo(fo(e.bounds),t)),r(lo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,uo(fo(e.bounds),t)),r(lo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,uo(fo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,uo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,uo(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},mo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=mo(e,r,n);if(t!==-1)return t}}return-1},ho=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=mo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:mo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},go=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},_o=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},vo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},yo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},bo=(e,t)=>t.forEach((t,n)=>{let r=Ja([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*Qa+i;e.registers[o]=Math.max(e.registers[o],yo(a)+1)}),xo=(e,t)=>{let n=e.registers.subarray(t*Qa,(t+1)*Qa),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*Qa*Qa/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*Qa?a===0?i:Qa*Math.log(Qa/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},So=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Co=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>So(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},wo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},To=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Eo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Do=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},Oo=(t,n)=>{let r=[],i=/* @__PURE__ */ new Map,a=e=>{let n=[],r={primary:t.primary[e],secondary:t.secondary[e]};return(r.primary>0||r.secondary>0||To(t,e))&&wo(n,r),Eo(t,e).forEach(e=>a(e).forEach(e=>wo(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.Z(s):`Unknown location`,depth:i,count:a,cost:o})},s=(e,n)=>o(e,n,t.primary[e],t.secondary[e]),c=(e,n)=>{let r=Eo(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>wo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=To(t,e),f=e=>r.forEach(t=>c(t,e));if(t.isUnchanged[e]){let t=l.filter(e=>e.primary!==0||e.secondary!==0);t.length===0?s(e,n):o(e,n,Math.max(u.primary,Co(t).primary),0);return}if(l.length===0){(u.primary!==0||d)&&s(e,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let t=l[0],r=t.primary===0&&t.secondary===0;if(t.primary<u.primary){s(e,n),f(n+1);return}if(!d&&p&&!r){o(e,n,t.primary,t.secondary);return}if(p&&r){d&&s(e,n),f(d?n+1:n);return}if(u.primary===t.primary&&u.secondary===t.secondary){s(e,n);return}}let m=!p||d;m&&s(e,n),f(m?n+1:n)};return Eo(t,n).forEach(e=>{a(e),c(e,0)}),r},ko=[`init`,`next`,`invariant`,`constraint`,`implied`],Ao=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,jo=e=>ko.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Ao(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Ao(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Mo=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.Z(a):`Unknown location`}`,distinct:xo(t,i)}}),relations:jo(t).map(e=>({kind:e.kind,label:e.label,...Do(t,e),expressions:Oo(t,e.node)}))}),No=(e,t,n)=>{let r=to(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},Po=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Fo=(t,n)=>Po.has(t)?new e.x(n):new e.A(n),Io=(t,n,r,i)=>new e.A(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${j(L(i))}`),Lo=(t,n,r=t)=>{if(!N(t)||gn(t))throw new e.A(`Applying ${n} to the following value,\nwhich is not a finite set:\n${j(L(r))}`);return F(t)},Ro=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Ro(r))throw Fo(n,`${n} expects a value as argument ${t+1}`);return r},zo=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Fo(n,`${n} expects a boolean but received ${L(r)}`);return r},Bo=(e,t,n)=>{let r=e[t];if(r===void 0||!Ro(r))throw Fo(n,`${n} expects an operator as argument ${t+1}`);return r},Vo=(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}),Ho=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Uo=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Wo=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Go=e=>e>2147483647||e<-2147483648,Ko=t=>new e.A(`Overflow when computing ${t}`),qo={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`},Jo={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Yo={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`},Xo={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Zo=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Jo[e.operator];if(e.kind!==`Function`)return qo[e.kind];let t=Nn(e);return t===void 0?`FcnRcdValue`:Xo[t]},Qo=e=>Yo[Zo(e)],$o=(t,n)=>new e.x(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),es=(t,n)=>{let r=r=>(...i)=>{let a=hi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.x)||r instanceof e.y)throw r;let i=_i(a);throw hi.sets&&(hi.sets.length=a),t.isLazy!==!0&&r instanceof e.A&&!i?r:$o(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw $o(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},ts=(e,t)=>{if(typeof e!=`number`)throw $o(t,`Cannot cast tlc2.value.impl.${Zo(e)} to tlc2.value.impl.IntValue`);return e},ns=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,rs=(e,t,n,r)=>{let i=ns(e,n,`IntValue`,2);return Wo(t,(e,n)=>{let a=ts(n,i),o=ts(e,i),s=r(o,a);if(Go(s))throw Ko(`${o}${t}${a}`);return s})},is=(t,n,r)=>{if(typeof t!=`number`)throw new e.A(`The ${n} argument of ${r} should be an integer, but instead it is:\n${j(L(t))}`);return t},as=(e,t,n=e)=>Wo(e,(e,r)=>t(is(e,`first`,n),is(r,`second`,n))),os=(e,t,n)=>({...Uo(e,t,n),isLazy:!0}),ss=(e,t,n)=>{let r=Bo(e,t,n);return()=>r.call([])},cs=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),ls=()=>({implication:Lg,negate:Rg,equivalent:zg,body:Bg,condition:(e,t)=>{if(typeof e!=`boolean`)throw bg(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw xg(t,n,e);return e},apply:Li,expectFunction:Ng,tuple:Ir,set:br,record:Rr,writtenRecord:Kt,equal:Vn,enumerate:qg,choiceElements:Sv,noChoice:e=>{throw Cv(e)},filterPredicate:xv,isReducible:Ft,finiteElements:e=>F(e).elements,addBounded:Mt,normalizedSet:kn,isBeyondBound:Nt,cardinality:ci,functionDomain:Pr,sortedFunction:An,unassigned:(e,t)=>{throw Og(e,t)},prime:U_,keepLazyContext:Pg,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>jg(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let us,ds;const fs=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},ps=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ms=e=>`local${e.counter++}`,hs=(e,t=/* @__PURE__ */ new Set)=>{let n=Ve(e);return n!==void 0&&t.add(n),Be(e).forEach(e=>hs(e,t)),t},gs=(e,t,n,r=!1)=>{let i=hs(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=ps(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},_s=(e,t,n,r=!1)=>`${ps(e,Q_(t,e.environment))}(${gs(e,t,n,r)})`,vs=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},ys=(e,t,n,r)=>{let i=ms(e),a=ms(e),o=ms(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},bs=(e,t,n)=>{let r=t.kind===`Forall`;return vs(e,n,n=>{let i=t.bounds.map(()=>ms(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${Ds(e,r.set,n)}, ${ps(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=ms(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Ds(e,t.body,n)}, ${ps(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>ys(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},xs=(e,t,n,r,i)=>vs(e,i,i=>{let a=ms(e),o=ms(e),s=ps(e,t),c=`choiceElements(${Ds(e,n,i)}, ${s}, ${ps(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Ds(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${ys(e,a,o,l)} return noChoice(${s});`}),Ss=(e,t,n,r)=>vs(e,r,r=>{let i=ms(e),a=ms(e),o=ms(e),s=ms(e),c=ps(e,t),l=`if (!isReducible(${i})) return ${ps(e,vv(t,e.environment))}(${i}, ${gs(e,t,r)});`,u=Ds(e,t.bound.set,r);r.locals.set(n,s);let d=bv(t,e.environment)?` else break;`:``,f=`if (filterPredicate(${Ds(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});${d}`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${ys(e,a,s,f)} return normalizedSet(${o});`}),Cs=(e,t,n,r)=>vs(e,r,r=>{let i=ms(e),a=ms(e),o=ms(e),s=ms(e),c=ms(e),l=ms(e),u=ps(e,hv(t,e.environment)),d=gs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Ds(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Ds(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${ys(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ws=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Ds(e,r[0],n),a=Ds(e,r[1],n),o=ps(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Ds(e,r[0],n)}, ${ps(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Ds(e,r[0],n)}, ${Ds(e,r[1],n)}, ${ps(e,t)})`;if(A(t))return _s(e,t,n);let i=b_(t.operator,e.environment);if(i?.kind!==`Builtin`)return _s(e,t,n);if(i.name===`DOMAIN`)return`${ps(e,wg(t))}(${Ds(e,r[0],n)})`;if(i.name===`TLCEval`)return _s(e,t,n,!0);if(i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2)return`${ps(e,Tg(t,i.evaluateBinary))}(${Ds(e,r[0],n)}, ${Ds(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&tv(r[0],a))return`${ps(e,i.evaluateUnary)}(${Ds(e,r[0],n)})`;let o=r.length===2&&tv(r[0],a)&&tv(r[1],a);return i.evaluateBinary&&o?`${ps(e,i.evaluateBinary)}(${Ds(e,r[0],n)}, ${Ds(e,r[1],n)})`:_s(e,t,n)},Ts=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(A(e))return!1;let r=j_(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Ts(e.expression,t,n);case`FieldAccess`:return Ts(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Ts(e,t,n));default:return!1}},Es=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Es(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Es);default:return!1}},Ds=(e,t,n)=>{let r=(t,r=n)=>Ds(e,t,r);switch(t.kind){case`Number`:return Bt(t.value)?String(t.value):_s(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(A(t))return _s(e,t,n);let i=j_(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ps(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ps(e,i.value):_s(e,t,n)}case`Apply`:return ws(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=ps(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)}, ${ps(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{uv(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Ts(t.function,n,e.environment)?r(t.function):Es(t.function)?r(t.function,i):_s(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ps(e,t)}))`,o=Cg(e.environment.runtime.version),s=o?`, ${ps(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`${ps(e,Sg(t))}(${r(t.record)})`;case`Record`:{let i=Tv(t.fields);if(Ev(i))return _s(e,t,n);let a=ps(e,i.map(e=>e.name)),o=`[${t.fields.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}, ${ps(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${ps(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?_s(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?bs(e,t,n):_s(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?xs(e,t,t.set,t.pattern.name,n):_s(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!mv(t)?Cs(e,t,r.pattern.name,n):_s(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Ss(e,t,t.bound.pattern.name,n):_s(e,t,n);default:return _s(e,t,n)}},Os=(e,t)=>{if(!cs.has(e.kind)||(ds??=fs(),!ds))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ds(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
77
77
  `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return us??=ls(),Function(...Object.keys(us),...i,a)(...Object.values(us),...n.references)},ks=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),As=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],js=new Map(As.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),Ms=e=>e.split(`!`).map(e=>js.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),Ns=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Ps=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),Fs=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Is=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
78
78
  Nat == { }
79
79
  a+b == {a, b}
@@ -390,9 +390,9 @@ _CheckName(name) ==
390
390
  => (PrintT(counts) /\\ FALSE)
391
391
  _PrintCounts == PrintT(_Counts)
392
392
  =============================================================================
393
- `]]),Ls=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),Rs={kind:`Local`},zs=`$subexpression`,Bs=/* @__PURE__ */ new WeakSet,Vs=/* @__PURE__ */ new WeakMap,Hs=/* @__PURE__ */ new WeakMap,Us=/* @__PURE__ */ new WeakMap,Ws=/* @__PURE__ */ new WeakMap,Gs=/* @__PURE__ */ new WeakMap,Ks=/* @__PURE__ */ new WeakMap,qs=/* @__PURE__ */ new WeakSet,Js=/* @__PURE__ */ new WeakSet,Ys=e=>Js.has(e)||Xs(Gs.get(e))!==void 0,Xs=e=>e?.find(e=>e.isEmpty?Ys(e.node):qs.has(e.node))?.error,Zs=/* @__PURE__ */ new WeakMap,Qs=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},$s=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),ec=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,tc=(e,t)=>ec(e,t)?-1:+!!ec(t,e),nc=e=>e.kind===`Operator`?e.params.length:0,rc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ic=e=>e.name.includes(`!`),ac=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},oc=(e,t,n)=>{let r=t.bindings.get(e);return r&&ec(r.position,t.location)&&(!n||ec(r.position,n.start))?r:void 0},sc=(t,n)=>t!==void 0&&n!==void 0&&e.Z(t)===e.Z(n),cc=(t,n,r,i)=>{if(n===void 0)return!0;if(sc(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.Z(a),s=n.range&&e.Z(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${Ms(t)} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${Ms(t)}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${Ms(t)}. \nThis duplicates the one at ${s}.`}),!1},lc=(e,t,n,r)=>cc(t,ac(e,t)??oc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,uc=(e,t,n)=>{cc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},dc=(e,t,n,r)=>t.reduce((e,t,i)=>lc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),fc=(e,t,n)=>t.reduce((e,t)=>lc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),pc=e=>e.kind===`Name`?[e.name]:e.names,mc=e=>e.flatMap(e=>pc(e.pattern)),hc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?oc(e,t,void 0)!==void 0:ec(n.location,t.location))?n:void 0},gc=(e,t)=>{let n=hc(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??nc(n),params:r?.params??rc(n),kind:`Definition`,range:n.location.range}}let r=oc(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},_c=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,vc=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,yc=(e,t,n)=>ac(t,e)??gc(e,n),bc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),xc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:bc(e.location,e.spelling??t)},Sc=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},Cc=`In module --TLA+ BUILTINS--`,wc=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),Tc=(t,n,r)=>r.errors.push({location:e.Z(n),message:`Cannot take subexpression of \`${Ms(t)}'.`}),Ec=e=>!/^[\p{L}\d_]/u.test(e),Dc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Oc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,kc=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Ac=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?kc(e.name,[],void 0):kc(e.operator,e.args,e.argumentCounts),jc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Mc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:mc(e.bounds),body:e.body,sets:jc(e.bounds)};case`SetMap`:return{names:mc(e.bounds),body:e.expression,sets:jc(e.bounds)};case`SetFilter`:return{names:pc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:pc(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Nc=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Pc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Fc=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ic=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Ic(e.body,t):ze(e).reduce((e,n)=>e??Ic(n,t),void 0)},Lc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Lc(i,t,n||Fc(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ic(e.set,t):Ic(e,t)},Rc=e=>e.kind===`Label`?Rc(e.body):e,zc=e=>typeof e==`number`?`argument selector ${e}`:e,Bc=`within the scope of a declaration
394
- from outside that declaration's scope.`,Vc=(t,n,r,i,a)=>{let o=(n,r)=>{let a=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;a&&i.errors.push({location:e.Z(a),message:r})},s=r.isSuffices===r.isInProof,c=r.statement,l={node:c,isGoal:!0,isSufficesOpen:r.isSuffices},u=0,d=0;for(let[e,t]of n.slice(1).entries()){let r=e+1,i=l.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return i.kind!==`NewSymbol`&&i.kind!==`AssumeProve`&&Rc(i).kind===`Let`?i:o(r-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],a=r===1?e.map((e,n)=>({position:n,label:Lc(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?Ic(i.body,t.name):void 0};if(!a?.label)return o(r,`Cannot find label \`${t.name}'.`);if(r===1&&c.kind===`AssumeProve`&&Fc(c,a.position)&&s)return o(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${Bc}`);if(t.args.length!==a.label.params.length)return o(r,`Label \`${t.name}' used with wrong number of arguments.`);l.node=a.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(t.kind===`Colon`)return i;let a=t.kind===`Operand`?zc(t.operand):t.kind===`At`?`@`:`!(...)`,f=e=>t.kind===`Operand`?Oc(t.operand,e):-1,p=`An unexpected null node specified by '${a}'.\nThis is probably due to a previous error.`;if(l.isSufficesOpen){if(f(1)!==0)return o(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${a}'.`);l.isSufficesOpen=!1;continue}if(i.kind===`NewSymbol`)return i;if(i.kind!==`AssumeProve`){let e=Rc(i);if(qs.has(e))return o(r,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(r,`Selecting subexpression of expression that has none.`);if(Ys(e))return o(r,`Choosing operand \`${a}' of subexpression with no operands.`);let n=Mc(e);if(n&&t.kind!==`Operand`){let e=t.kind===`Bound`?t.args.length:0;if(t.kind===`Bound`&&e!==n.names.length)return o(r,`Selector with ${e} argument(s) used for quantifier with ${n.names.length} bound identifier(s).`);u+=n.names.length,d+=e,l.node=n.body,l.isGoal=!1;continue}let s=n?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:Nc(e);if(!c)return i;let m=e.kind===`Except`,h=f(m?e.updates.length+1:c.length);if(h===-1)return o(r,`Nonexistent operand specified by \`${a}'.`);if(m&&h>0)return o(r,`Selecting subexpression of an EXCEPT not yet implemented.`);if(l.node=c[h],l.isGoal=!1,qs.has(l.node))return o(r,p);continue}let m=[...i.assumptions,i.conclusion],h=f(m.length);if(h===-1)return o(r,`Nonexistent operand specified by \`${a}'.`);if(Fc(i,h)&&(!l.isGoal||s))return o(r,`Accessing ASSUME/PROVE clause ${Bc}`);let g=m[h];if(g.kind===`NewSymbol`&&r!==n.length-1)return o(r,`Selected a subexpression of a NEW clause of an ASSUME.`);if(l.node=g,l.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&qs.has(g))return o(r,p)}return l.node.kind===`AssumeProve`?a?l.node:o(void 0,`Selected ASSUME/PROVE instead of expression.`):l.node.kind===`NewSymbol`?a?l.node:o(void 0,`Selected a NEW declaration as an expression or operator.`):u===d?l.node:o(void 0,`Expected ${u} arguments but found ${d}.`)},Hc=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.Z(t.location.range),message:r}),!0)},Uc=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.Z(i),o=t.params.filter((i,a)=>{let o=ac(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.Z(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},Wc=(e,t,n,r)=>{if(!Pc(e))return!1;let i=Ac(e),a=i[0],o=i.length>1&&a.kind===`Name`?ac(t,a.name)?.goal??vc(a.name,n):void 0;return o&&{node:Vc(e,i,o,n,r)}},Gc=(t,n,r,i)=>{let a=t.location;if(il(t,r,i))return;let o=Zs.get(t);if(o!==void 0)return o;if(Qs(n))return t.kind===`Apply`?t.args.length:0;let s=ac(r,n);if(s?.isNonFact){i.errors.push({location:e.Z(xc(t,n)),message:`Step number of non-expression step used as an expression.`});return}let c=s?.goal?.keyword;if(c){i.errors.push({location:e.Z(xc(t,n)),message:`${c} proof step selected instead of expression.`});return}if(Wc(t,r,i,!1)||Dc(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=Rs),s)return s.arity;let l=gc(n,i);if(l)return t.kind===`Identifier`?t.name=l.key:t.operator=l.key,Zs.set(t,l.arity),l.arity;let u=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``,d=u===``?void 0:ac(r,u)??gc(u,i);if(d&&!wc.has(d.kind)){Tc(u,t.kind!==`OperatorReference`&&t.selectorRanges?.[0]||xc(t,n),i);return}if(t.kind!==`OperatorReference`&&u!==``&&ol(u,t.kind===`Apply`&&t.argumentCounts?t.args.slice(0,t.argumentCounts[0]):[],t.selectorRanges?.[0],(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??a.range,r,i))return;if(d||u!==``&&_c(u,i))return t.kind===`Apply`?t.args.length:0;let f=Sc(t),p=t.kind===`OperatorReference`||f!==void 0;if(!Ec(n)||Dc(n)||!p){i.errors.push({location:e.Z(xc(t,n)),message:`Unknown operator: \`${Ms(n)}'.`});return}let m=t.spelling??n;i.errors.push({location:e.Z(f===`prefix`&&m===`-.`?bc(a,`-`):xc(t,n)),message:`Could not find declaration or definition of symbol '${m}'.`}),f&&qs.add(t),f&&a.range&&i.errors.push({location:e.Z(a.range),message:`Couldn't resolve ${f} operator symbol \`${m}'.`})},Kc=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>dc(e,pc(t.pattern),t.pattern.ranges,n),t)),qc=(e,t)=>e.kind===`Identifier`&&e.name===t&&j(e)||ze(e).some(e=>qc(e,t)),Jc=(e,t)=>{e.kind===`FunctionConstruction`&&qc(e.body,t)&&(e.isRecursive=!0),ze(e).forEach(e=>Jc(e,t))},Yc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?mc(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.Z(s),message:t})},l=t.kind===`Function`?Kc(t.bounds,n,a):fc(n,t.params,a),u=ac(l,o)??oc(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${Ms(o)} defined at wrong LET/IN level.`):u&&!d?c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${Ms(o)} already defined or declared.`):u&&t.kind===`Function`&&u.arity>0?c(`Function ${Ms(o)} has operator arguments in its RECURSIVE declaration.`):u&&t.kind===`Operator`&&(u.arity!==t.params.length||t.params.some(e=>e.arity>0))&&c(`Definition of ${Ms(o)} has different arity than its RECURSIVE declaration.`),u&&d&&t.kind===`Operator`&&(u.params=rc(t)),t.kind===`Function`?(B(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),Jc(t.body,o),t.isSelfReferential=qc(t.body,o)):B(t.body,l,a),u&&d?((t.kind===`Operator`||u.arity===0)&&(u.isPending=!1,u.range=s),!1):t.kind===`Function`?u===void 0:cc(o,ac(n,o)??oc(o,a,s),{kind:`Definition`,arity:nc(t),range:s},a)},Xc=(t,n,r,i=[],a=[])=>{let o=/* @__PURE__ */ new Set,s=t.filter(e=>e.isRecursive&&a.every(t=>t.name!==e.name)).reduce((e,t)=>{if(ac(e,t.name)?.isPending)return e;let n={name:t.name,arity:nc(t),params:rc(t),kind:`Definition`,parent:e,isPending:!0};return o.add(n),n},n),c=/* @__PURE__ */ new Map,l=(e,t)=>{let n={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=cc(t.name,ac(e,t.name)??oc(t.name,r,n.range),n,r)?{...n,name:t.name,parent:e,isPending:!0}:void 0;return i&&o.add(i),c.set(t,i),i??e},u=[...r.isGenerated?[]:i,...a].toSorted((e,t)=>tc(e.location,t.location)),d=(e,t)=>{let n=u.findIndex(e=>!t(e));return u.splice(0,n===-1?u.length:n).reduce((e,t)=>`kind`in t?gl(t,e,r):l(e,t),e)},f=d(t.reduce((e,t)=>{let n=Qs(t.name)?e:d(e,e=>!ec(t.location,e.location)),a={name:t.name,arity:nc(t),kind:`Definition`,range:t.location.range,parent:n};if(ic(t))return{...a,params:rc(t)};let s=i.some(e=>e.location===t.location),c=r.isGenerated||t.isLocal||Qs(t.name),l=s?{...r,isGenerated:!0,errors:[],warnings:[]}:c?{...r,isGenerated:c}:r;return Yc(t,n,l,o)?{...a,params:rc(t)}:n},s),()=>!0);return c.forEach((t,n)=>{let i=n.location.range;i&&!r.isGenerated&&(!t||t.isPending)&&r.errors.push({location:e.Z(i),message:`Symbol ${Ms(n.name)} declared in RECURSIVE statement but not defined.`})}),f},Zc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ac(t,r)??oc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},Qc=(t,n,r)=>{if(!Pc(t))return!1;let i=Ac(t),a=i.findIndex(e=>e.kind!==`Name`),o=Zc(i.slice(0,a===-1?i.length:a).flatMap(e=>e.kind===`Name`?[e.name]:[]).join(`!`),n,r),s=i[0],c=s.kind===`Name`?s.args.length:0;if(!o||c===o.arity)return!1;let l=(t.kind===`Identifier`?void 0:t.argumentRanges?.[0])??t.location.range;return l&&r.errors.push({location:e.Z(l),message:`The operator ${o.name} requires ${o.arity} arguments.`}),!0},$c=(t,n,r,i,a)=>{let o=t?.kind===`Definition`?t.params:void 0;return!t||!o||o.length===t.arity?!1:(i&&!a.isGenerated&&a.errors.push({location:e.Z(i),message:`Wrong number of arguments (${r}) given to operator '${Ms(n)}', \nwhich requires ${o.length} arguments.`}),!0)},el=(t,n,r)=>{let i=t.location.range,a=t=>{i&&r.errors.push({location:e.Z(i),message:t})},o=Hs.get(t);if(t.kind===`Lambda`&&t.operator!==void 0)a(`The operator ${Ms(t.operator)} requires 1 arguments.`);else if(o)r.errors.push(o);else if(t.kind===`Lambda`&&i)qs.add(t),a(`LAMBDA expression used where an expression is required.`);else if(t.kind===`OperatorReference`){let e=Gc(t,t.operator,n,r);e!==void 0&&a(`The operator ${Ms(t.operator)} requires ${e} arguments.`)}else B(t,n,r)},tl=(t,n,r,i,a,o,s)=>{let c=(t,n)=>{t&&s.errors.push({location:e.Z(t),message:n})},l=(t,l)=>{let u=Zc(i,o,s)?.range??yc(i,o,s)?.range;u&&c(a,`Operator with incorrect arity passed as argument. \nOperator '${Ms(t)}' of arity ${l} is argument number ${r+1} (counting from 1) to operator \`${e.Z(u)}', \nbut an operator of arity ${n} was expected.`)},u=t.location.range;if(n===0)return el(t,o,s),!0;if(t.kind===`Lambda`){Bs.has(t)?B(t,o,s):al(t,o,s);let e=t.params.length===n;return!e&&Bs.has(t)?c(u,`Expected arity ${n} but found operator of arity ${t.params.length}.`):!e&&u&&t.operator===void 0?c(a,`Lambda expression with arity ${t.params.length} used as argument ${r+1} of operator \`${i}', \nbut an operator of arity ${n} is required.`):!e&&t.operator!==void 0&&l(t.operator,t.params.length),e}if(t.kind===`Subexpression`)return B(t,o,s),!0;if(t.kind===`Apply`&&t.argumentCounts?.at(-1)===0){let e=t.argumentCounts.findIndex(e=>e>0);return c(t.selectorRanges?.[e],`Selector \`${t.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(t.kind!==`Identifier`&&t.kind!==`OperatorReference`)return c(u,`An expression appears as argument number ${r+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let d=t.kind===`Identifier`?t.name:t.operator,f=yc(d,o,s)?.params??[],p=Gc(t,d,o,s);return t.kind===`Identifier`&&p!==void 0&&p!==n&&c(xc(t,d),`Expected arity ${n} but found operator of arity ${p}.`),t.kind===`OperatorReference`&&p!==void 0&&p!==n&&l(d,p),p===n&&f.every(e=>e===0)},nl=(t,n,r)=>{let i=t.operator,a=yc(i,n,r),o=Qc(t,n,r)?void 0:Gc(t,i,n,r);if(o!==void 0&&o!==t.args.length&&r.errors.push({location:e.Z(t.argumentsRange??xc(t,i)),message:`The operator ${Ms(i)} requires ${o-(Zc(i,n,r)?.arity??0)} arguments.`}),o!==t.args.length){Js.add(t);return}let s=a&&(a.kind===`Definition`?a.params:t.args.map(()=>0));if(s===void 0){t.args.forEach(e=>rl(e,n,r));return}let c=t.selectorRanges?.at(-1)??xc(t,i),l=i===zs,u=t.args.slice(0,s.length).map((e,t)=>{let a=l?Ws.get(e):void 0;return tl(e,s[t],a?.index??t,a?.operator??i,a?.range??c,n,l?{...r,isGenerated:!1}:r)});$c(a,i,t.args.length,t.location.range,r)||u.forEach((n,a)=>{!n&&t.location.range&&r.errors.push({location:e.Z(t.location.range),message:`Argument number ${a+1} to operator '${l?`LAMBDA`:i}' \nshould be a ${s[a]}-parameter operator.`})})},rl=(e,t,n)=>{e.kind===`Identifier`?Gc(e,e.name,t,n):B(e,t,n)},il=(e,t,n)=>{let r=Vs.get(e);return r?(r.applications.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>tl(r,e.params[i],i,e.operator,e.range,t,n))),n.errors.push(Xs(r.nulls)??r.error),!0):!1},al=(e,t,n)=>B(e.body,dc(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),B=(t,n,r)=>{if(Bs.has(t)&&!r.isGenerated){let e=Xs(Gs.get(t));if(e){r.errors.push(e);return}let i=Ks.get(t);if(i){Object.assign(t,i);let e=Zs.get(i);e!==void 0&&Zs.set(t,e)}B(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!r.isInExcept&&t.location.range&&(Js.add(t),r.errors.push({location:e.Z(t.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let i=t.name,a=Qc(t,n,r)?void 0:Gc(t,i,n,r);if(a===0){let e=yc(i,n,r),a=e?.kind;(a===`Variable`||a===`Theorem`||a?.startsWith(`New`)||_c(i,r))&&Js.add(t),$c(e,i,0,xc(t,i),r);return}a!==void 0&&r.errors.push({location:e.Z(xc(t,i)),message:`The operator ${Ms(i)} requires ${a} arguments.`}),Js.add(t);return}case`OperatorReference`:Gc(t,t.operator,n,r);return;case`Apply`:nl(t,n,r);return;case`Lambda`:Bs.has(t)?al(t,n,r):t.location.range&&(qs.add(t),r.errors.push({location:e.Z(t.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&B(t.other,n,r);return;case`Let`:B(t.body,Xc(t.definitions,n,r,t.instances,t.recursive),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(t.body,Kc(t.bounds,n,r),a(mc(t.bounds)));return;case`UnboundedQuantifier`:B(t.body,dc(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&B(t.set,n,r),B(t.body,dc(n,pc(t.pattern),t.pattern.ranges,r),a(pc(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:B(t.predicate,Kc([t.bound],n,r),a(pc(t.bound.pattern)));return;case`SetMap`:B(t.expression,Kc(t.bounds,n,r),a(mc(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.Z(i.location.range??bc(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:B(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(Hc(t,r))return;B(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),Uc(t,n,r);return;case`Subexpression`:sl(t,n,r)&&Js.add(t);return}},ol=(t,n,r,i,a,o)=>{let s=ac(a,t)??oc(t,o,void 0);return!s?.isPending||!r||!i?!1:n.length===s.arity?(n.forEach(e=>B(e,a,o)),o.errors.push({location:e.Z(r),message:`Subexpression of \`${t}' used inside the operator's definition.`}),!0):(o.errors.push({location:e.Z(i),message:`The operator ${t} requires ${s.arity} arguments.`}),!0)},sl=(t,n,r)=>{if(Qc(t,n,r)||il(t,n,r))return!0;let i=t.selectors[0],a=t.selectorRanges?.[0],o=t.selectors.findIndex(e=>e.kind!==`Name`),s=t.selectors.slice(0,o).flatMap(e=>e.kind===`Name`?[e.name]:[]),c=s.findIndex((e,t)=>t>0&&gc(s.slice(0,t+1).join(`!`),r)),l=s.length>1&&(ac(n,s[0])??oc(s[0],r,void 0))?.kind===`Instance`,u=t.selectorRanges?.[o-1];if(l&&c===-1&&a&&u)return r.errors.push({location:e.Z({module:a.module,start:a.start,end:u.end}),message:`Unknown operator: \`${Ms(s.join(`!`))}'.`}),!0;let d=s.slice(0,c+1).join(`!`),f=c>0?gc(d,r):void 0,p=t.selectors.slice(0,c+1).flatMap(e=>`args`in e?e.args:[]).length,m=t.argumentRanges?.[c]??t.location.range;if(f&&f.arity!==p&&m)return r.errors.push({location:e.Z(m),message:`The operator ${Ms(d)} requires ${f.arity} arguments.`}),!0;if(i.kind===`Name`&&t.selectors[1].kind!==`Name`&&a){let t=ac(n,i.name),o=t??gc(i.name,r);if(o===void 0&&!_c(i.name,r)||o?.kind===`Instance`)return r.errors.push({location:e.Z(a),message:`Unknown operator: \`${Ms(i.name)}'.`}),!0;if(o&&(!wc.has(o.kind)||t?.isNonFact))return Tc(i.name,a,r),!0}if(i.kind===`Name`&&ol(i.name,i.args,a,t.argumentRanges?.[0]??t.location.range,n,r))return!0;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>rl(e,n,r));let h=Wc(t,n,r,!1);return h?h.node===void 0:!1},cl=(t,n,r,i)=>{if(t.kind===`ModuleFact`)return;if(t.kind===`ExceptAt`&&t.location.range)return i.errors.push({location:e.Z(t.location.range),message:"Unknown operator: `@'."}),Cc;let a=ul(t,n,r,i);if(Qc(t,r,i))return a;let o=Wc(t,r,i,!0);if(o){let n=o.node?.kind;return n===void 0?Cc:n===`AssumeProve`||n===`NewSymbol`?void 0:t.location.range&&e.Z(t.location.range)}if(t.kind===`Subexpression`)return sl(t,r,i)?Cc:a;let s=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;return t.kind===`Identifier`&&ac(r,s)?.isNonFact?(i.errors.push({location:e.Z(xc(t,s)),message:`Step number of non-fact used as a fact`}),Cc):(!_c(s,i)&&!ac(r,s)?.goal&&B(t,r,i),a)},ll=(t,n,r)=>{let i=t.location.range,a=t.kind===`Identifier`?t.name:t.kind===`OperatorReference`?t.operator:``;if(a===``||!i)return!0;let o=ac(n,a)??gc(a,r)??oc(a,r,i);return o===void 0&&(_c(a,r)||Dc(a))||(o===void 0&&r.errors.push({location:e.Z(i),message:`Unknown operator: \`${Ms(a)}'.`}),o&&wc.has(o.kind)&&!Dc(a))?!0:(r.errors.push({location:e.Z(i),message:`DEF clause entry should describe a defined operator.`}),!1)},ul=(t,n,r,i)=>{let a=t.location.range&&e.Z(t.location.range);if(Bs.has(t))return n.location.range&&e.Z(n.location.range);if(Vs.has(t)||t.kind===`ExceptAt`)return Cc;switch(t.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let e=Ac(t)[0];if(t.kind===`Subexpression`||e.kind!==`Name`)return;let n=t.kind===`Identifier`?t.name:t.operator,o=ac(r,e.name)?.goal??vc(e.name,i);if(_c(n,i)||o||Dc(n)&&ac(r,n))return;let s=yc(n,r,i),c=t.kind===`Apply`?t.args.length:0;return s?.arity===c?a:Cc}default:return a}},dl=(t,n,r)=>{let i=Us.get(t.facts)??t.facts,a=t.facts.map((e,t)=>cl(e,i[t],n,r)),o=t.defs.filter(e=>ll(e,n,r)).length;a.forEach(e=>{e&&t.kind===`Hide`&&r.errors.push({location:e,message:`The only expression allowed as a fact in a HIDE is
395
- the name of a theorem, assumption, or step.`})});let s=t.location.range;t.facts.length+o===0&&s&&r.errors.push({location:e.Z(s),message:t.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},fl=(e,t,n)=>(e.set&&B(e.set,t,n),lc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),pl=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:fl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?pl(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},ml=(e,t,n)=>e.kind===`AssumeProve`?pl(e,t,n):(B(e,t,n),t),hl=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&dl(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>vl(t,e,r),t)},gl=(e,t,n)=>{let r=wl(e,t,n);return e.name===void 0?r:lc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},_l=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:jc(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},vl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=_l(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=ml(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return hl(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return hl(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return dl(r,t,n),s(t);case`Instance`:return s(gl(r,t,i));case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?gl(t,e,i):Xc([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),hl(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),o(t);case`Take`:return o(dc(Kc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=dc(Kc(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,a,{...i,labelParams:[...i.labelParams,...mc(r.bounds),...r.names]}),hl(e.proof,o(t),n),o(a)}default:return hl(e.proof,o(t),n),o(t)}},yl=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ml(e.statement,void 0,t);e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),hl(e.proof,n,t),r&&(r.isInProof=!1)},bl={line:0,column:0},xl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Sl=(e,t)=>{let n=new Map([...$s,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Cl=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(e,t)=>a.errors.push({location:t,message:`An operator must be substituted for symbol '${Ms(e.name)}', and it must have arity ${e.arity}.`}),c=(t,n)=>{let r=n.location.range;if(t.arity===0){el(n,o,a);return}if(n.kind===`Lambda`){al(n,o,a),n.params.length!==t.arity&&r&&s(t,e.Z(r));return}if(n.kind===`OperatorReference`){let i=Gc(n,n.operator,o,a);i===void 0?s(t,Cc):i!==t.arity&&r&&s(t,e.Z(r));return}if(n.kind!==`Identifier`){r&&a.errors.push({location:e.Z(r),message:`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${Ms(t.name)}'.`}),s(t,Cc);return}let i=Gc(n,n.name,o,a);i!==void 0&&i!==t.arity&&a.errors.push({location:e.Z(xc(n,n.name)),message:`Expected arity ${t.arity} but found operator of arity ${i}.`}),i!==t.arity&&s(t,Cc)},l=t.location.range,u=n.filter(e=>ac(o,e.name)!==void 0||gc(e.name,a)!==void 0).map(e=>({declaration:e,expression:{kind:`Identifier`,name:e.name,location:t.location}}));u.filter(e=>e.declaration.arity===0).forEach(t=>{let n=Gc(t.expression,t.declaration.name,o,a);n&&l&&a.errors.push({location:e.Z(l),message:`Wrong number of arguments (0) given to operator '${Ms(t.declaration.name)}', \nwhich requires ${n} arguments.`})});let d=/* @__PURE__ */ new Map;return t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.Z(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;c(i,o);let s=o.location.range;d.has(r)?s&&a.errors.push({location:e.Z(s),message:`Multiple substitutions for symbol '${r}' in substitution.`}):d.set(r,o)}),u.filter(e=>!d.has(e.declaration.name)).forEach(t=>{(t.declaration.arity===0?0:Gc(t.expression,t.declaration.name,o,a))!==t.declaration.arity&&l&&s(t.declaration,e.Z(l)),d.set(t.declaration.name,t.expression)}),n.filter(e=>!d.has(e.name)).forEach(t=>{let n=t.location.range;l&&n&&a.errors.push({location:e.Z(l),message:`Substitution missing for symbol ${Ms(t.name)} declared at ${e.Z(n)} \nand instantiated in module ${r}.`})}),d},wl=(e,t,n)=>{let r=n.getInstance(e);return Cl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>lc(e,t[0],t[1],n),t)},Tl=(e,t,n,r)=>{let i=Sl(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),Cl(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??bl}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},El=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>tc(e.location,t.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.I)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Dl=(t,n)=>{let r=Sl(t,n.imported),i=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),a=new Map([...$s,...n.bound].map(e=>[e[0],{...e[1],position:bl}])),o=/* @__PURE__ */ new Set,s=[],c=(e,t,o,s)=>({location:e,check:(c,l)=>s({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:n.facts,goals:i,bindings:a,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),l=(e,t)=>e.map(e=>c(e.location,void 0,!1,n=>uc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return El([...t.units.flatMap(t=>{let n=t.kind===`Variables`?{type:`A VARIABLE declaration`,location:t.location}:t.kind===`Constants`?{type:`A declaration`,location:t.location}:t.kind===`Module`?{type:`A MODULE `,location:t.module.location}:t.kind===`Theorem`?{type:`A THEOREM`,location:t.theorem.location}:t.kind===`Assumption`?{type:`An ASSUME`,location:t.assumption.location}:t.kind===`Use`?{type:`A USE or HIDE`,location:t.use.location}:void 0,r=n?.location.range;return!n||!r?[]:[{location:n.location,check:t=>{s.some(e=>e.binding?.isPending)&&t.push({location:e.Z(r),message:`${n.type} may not appear within a recursive definition section.`})}}]}),...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(t.constants,`Constant`),...l(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>c(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=cc(e.name,a.get(e.name),n,t);r&&(a.set(e.name,n),o.add(n)),s.push({declaration:e,binding:r?n:void 0})})),...t.definitions.map(e=>c(e.location,e,!0,n=>{xl(t,e)?B(e.body,void 0,n):Yc(e,void 0,n,o)&&a.set(e.name,{kind:`Definition`,arity:nc(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>c(e.location,void 0,!1,t=>{fc(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>uc(n,e,t)),e.name!==void 0&&uc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},t)})),...t.assumptions.map(e=>c(e.location,void 0,e.name!==void 0,t=>{B(e.expression,void 0,t),e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...t.theorems.map(e=>c(e.location,void 0,e.name!==void 0,t=>yl(e,t))),...t.uses.map(e=>c(e.location,void 0,!1,t=>dl(e,void 0,t))),{location:t.location.range?.end??t.location,check:t=>s.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.Z(r),message:`Symbol ${Ms(n.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Ol=/* @__PURE__ */ new WeakSet,kl=/* @__PURE__ */ new WeakMap,Al=(e,t)=>{if(t.length===0)return e;let n={...e};return Ol.has(e)&&Ol.add(n),kl.set(n,[...t,...kl.get(e)??[]]),n},jl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Ll(e,(e,r)=>jl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&j(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&j(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Ml=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Nl=/* @__PURE__ */ new WeakMap,Pl=e=>Nl.get(e)??e.name,Fl=(e,t)=>(Pl(t)!==e.name&&Nl.set(e,Pl(t)),e),Il=(e,t)=>Fl(e.kind===`Function`?{...e,bounds:Ml(e.bounds,e=>t(e,[])),body:t(e.body,mc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Ll=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Il(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Ml(e.bounds,n),body:t(e.body,mc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,pc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,pc(e.bound.pattern))};case`SetMap`:return{...e,bounds:Ml(e.bounds,n),expression:t(e.expression,mc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Rl=(e,t)=>{Ll(e,(e,n)=>(t(e,n),e))},zl=`LAMBDA`,Bl=e=>`${e}@SUBSTITUTION`,Vl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Vl),Hl=(e,t)=>{if(e.kind!==`Identifier`)return!Vl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=j(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Vl(n.body)},Ul=(e,t=/* @__PURE__ */ new Set)=>{let n=Be(e),r=n===void 0||t.has(n)?[]:[n];return Rl(e,(e,n)=>r.push(...Ul(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Wl=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Gl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Kl=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ql=(e,t)=>e.map(e=>({pattern:Kl(e.pattern,t),set:e.set})),Jl=(e,t)=>e.kind===`Function`?{...e,bounds:ql(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Yl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Fl({...Jl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ql(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Kl(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Kl(e.bound.pattern,n),set:e.bound.set}};default:return e}},Xl=e=>`${e}@ENABLED`,Zl=(e,t)=>e.modes.get(t)??e,Ql=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!j(e)&&t.instantiation.variables.has(e.name),$l=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>$l(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ql(e,t,n))return[e.name];let r=j(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?$l(r.body,t,/* @__PURE__ */ new Map):void 0},eu=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ql(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Xl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ou(e.expression,Zl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ou(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ou(e.subscript,Zl(t,`Primed`),n),location:r},ou(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=$l(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Xl(r),location:e.location},location:e.location},ou({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},tu=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Rs}),nu=(e,t)=>e.map(e=>tu(e.name,t)),ru=(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:nu(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),iu=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...nu(t,r),...i.map(e=>tu(e,r))],location:r},location:r}},au=(e,t)=>e.instantiation.isParameterized(t)?cu(e,t):void 0,ou=(t,n,r)=>{let i=e=>ou(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!j(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:ou(t.expression,Zl(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:ou(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},Zl(n,`Enabled`),r)};let c=eu(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!Hl(e,a)))return Al(e,[t]);if(e&&r){let n=Bl(t.name);return r.set(n,e),tu(n,t.location)}let i=au(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&nc(s)>0?iu(i,o,nc(s),t.location):{kind:`Apply`,operator:i,args:nu(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Ol.has(t),l=e=>(c&&Ol.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:zl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:zl,args:r,resolution:Rs},location:t.location};if(s)throw new e.I(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=au(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...nu(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=a.substitutions.get(t.operator);if(e?.kind===`Identifier`||e?.kind===`OperatorReference`||e?.kind===`Lambda`)return Al(e,[t]);let r=au(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?iu(r,o,nc(i),t.location):{...t,operator:r}}let l=Wl(n),u=Ll(t,(e,t)=>t.length===0?i(e):ou(e,n,Gl(r,t,l)));return Yl(u,r,l)},su=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:tu(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},cu=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Wl(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Jl(Il(i,(e,t)=>ou(e,s,Gl(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&kl.set(l,[u,...kl.get(i.body)??[]]),su({...c,body:l},r.params,i.location)}):t},lu=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Ul(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>au(i,e)??e,getQualifiedKey:t=>{let n=au(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>su(r,e.params,r.location)):t}}},uu=e=>e.kind===`Let`&&e.instances!==void 0||ze(e).some(uu),du=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Ll(e,e=>du(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ec(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},fu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,pu=(e,t)=>e.definitions.some(e=>uu(e.body))||e.assumptions.some(e=>uu(e.expression))||e.theorems.some(e=>{let t=fu(e);return t!==void 0&&uu(t)})?{...e,definitions:e.definitions.map(e=>Il(e,e=>du(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:du(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=fu(e);return n===void 0?e:{...e,statement:du(n,t,[])}})}:e,mu=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),hu={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},gu=(e,t)=>{let n=hu[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},_u=(e,t)=>`${e}${t}`,vu=(e,t,n)=>`${e}${t}${n}`,yu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},bu=(e,t,n)=>`${e},${t},${n}`,xu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Su=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Cu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),wu=(e,t)=>{t.constraints.forEach((t,n)=>Su(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Cu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},V=(e,t,n,r)=>({...xu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Tu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Eu=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Du=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(e=>[e[0],{...V(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),Ou=V(`'`,2,[1],[0]),ku=V(`UNCHANGED`,2,[1],[0]),Au=V(`ENABLED`,1,[2],[0]),ju=V(`[]`,3,[3],[0]),Mu=V(`<>`,3,[3],[0]),Nu=V(`$ConjList`,0,[3],[1]),Pu=V(`$DisjList`,0,[3],[1]),Fu=V(`$IfThenElse`,0,[3],[1]),Iu=V(`$Case`,0,[3],[1]),Lu=V(`$BoundedForall`,0,[3],[1]),Ru=V(`$BoundedExists`,0,[3],[1]),zu=V(`$UnboundedForall`,0,[3],[1]),Bu=V(`$UnboundedExists`,0,[3],[1]),Vu=V(`$TemporalForall`,3,[3],[0]),Hu=V(`$TemporalExists`,3,[3],[0]),Uu=V(`$BoundedChoose`,0,[2],[1]),Wu=V(`$UnboundedChoose`,0,[2],[1]),Gu=V(`$SetEnumerate`,0,[2],[1]),Ku=V(`$Tuple`,0,[2],[1]),qu=V(`$SetOfFcns`,0,[2],[1]),Ju=V(`$CartesianProd`,0,[2],[1]),Yu=V(`$SubsetOf`,0,[2],[1]),Xu=V(`$SetOfAll`,0,[2],[1]),Zu=V(`$FcnConstructor`,0,[3],[1]),Qu=V(`$RcdConstructor`,0,[3],[1]),$u=V(`$SetOfRcds`,0,[2],[1]),ed=V(`$Except`,0,[2],[1]),td=V(`$Pair`,0,[3],[1]),nd=V(`$Seq`,0,[2],[1]),rd=V(`$FcnApply`,0,[2,2],[1,1]),id=V(`$RcdSelect`,0,[2,0],[1,1]),ad=V(`$SquareAct`,2,[2,1],[0,0]),od=V(`$AngleAct`,2,[2,1],[0,0]),sd=V(`$WF`,3,[1,2],[0,0]),cd=V(`$SF`,3,[1,2],[0,0]),ld=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),ud=e=>e.map(e=>({name:e,arity:0})),dd=(t,n)=>n.location.range?e.Y(`${t}.`,n.location.range):new e.I(`${t} at line ${n.location.line}, column ${n.location.column}`),fd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),pd=e=>e.kind!==`Let`&&e.kind!==`Label`,md=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=v(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Du.get(e)??mu.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=xu(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(vu(e,n,t))}),Cu(r.argConstraints,_u(e,n),t.data.level),wu(r,t.data)}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);n.forEach((n,r)=>{if(n.kind===`Value`&&n.data.level>Tu(t,r))throw new e.I(`Level error in applying operator ${Ms(t.name)}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)});let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(bu(e,n,r)),c=xu(Math.max(t.level,...n.filter((e,n)=>Eu(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Eu(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Su(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Su(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Su(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Su(c.constraints,e,Tu(t,n))})),n.forEach((e,t)=>{if(e.kind!==`Operator`)return;let r=e.data;n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Su(c.constraints,e,Tu(r,a)))}))}),t.argParams.forEach(e=>{let t=yu(e),n=o(t.operator);n?.kind===`Operator`&&Su(c.constraints,t.param,Tu(n.data,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Cu(c.argConstraints,t,e))),n.forEach((e,r)=>{if(e.kind!==`Declared`)return;let i=e.declared;Array.from({length:i.arity},(e,n)=>Cu(c.argConstraints,_u(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Cu(c.argConstraints,_u(i.name,a),e.data.level)}))}),t.argParams.forEach(e=>{let t=yu(e),n=o(t.operator);n&&Cu(c.argConstraints,_u(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(yu(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=yu(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(vu(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(vu(t.operator,t.index,e)))}}),n.forEach((e,t)=>{if(e.kind!==`Declared`)return;let r=e.declared;n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(vu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,ud(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=xu();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:xu()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(t,n,r,i=[],o=mc(i))=>{let c=s(n,ld(r,ud(o))),l=i.map(e=>m(e.set,r)),u=a(t,c,l,o),d=i[l.findIndex(e=>e.level>2)]?.pattern;if(d){let n=d.ranges?.[0];throw new e.I(`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${n?e.Z(n):pc(d)[0]} \nexceeds the maximum level allowed by the operator`)}return u},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t,n)=>{let r=e.map(e=>e.data.level);if(r.includes(2)&&r.includes(3))throw dd(`${n} has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw dd(`Action used where only temporal formula or state predicate allowed`,e);fd.has(e.operator)&&u(t,e,Ms(e.operator))},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&pd(n)&&n.kind!==r)throw dd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>wu(i,v(e,n))),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.I)||n.sany?n:dd(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return xu();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t),r=e.kind===`And`;return u(n,e,e.isBulleted?`${r?`Conjunction`:`Disjunction`} list`:r?`\\land`:`\\lor`),a(r?Nu:Pu,n)}case`Prime`:return c(Ou,[e.expression],t);case`Unchanged`:return c(ku,[e.expression],t);case`Enabled`:return c(Au,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(e.kind===`Always`?ju:Mu,[n])}case`If`:return c(Fu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Iu,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(e.kind===`Forall`?Lu:Ru,[e.body],t,e.bounds),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw dd(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?e.quantifier===`Forall`?Vu:Hu:e.quantifier===`Forall`?zu:Bu,[e.body],t,[],e.names);case`Choose`:return c(e.set?Uu:Wu,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],pc(e.pattern));case`SetEnumeration`:return c(Gu,e.elements,t);case`Tuple`:return c(Ku,e.elements,t);case`FunctionSet`:return c(qu,[e.domain,e.range],t);case`Product`:return c(Ju,e.factors,t);case`SetFilter`:return c(Yu,[e.predicate],t,[e.bound]);case`SetMap`:return c(Xu,[e.expression],t,e.bounds);case`FunctionConstruction`:return c(Zu,[e.body],t,e.bounds);case`Record`:return c(Qu,e.fields.map(e=>e.value),t);case`RecordSet`:return c($u,e.fields.map(e=>e.value),t);case`Except`:return a(ed,[o(e.function,t),...e.updates.map(e=>({kind:`Value`,data:a(td,[{kind:`Value`,data:a(nd,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:xu()}:e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(Ku,e.args,t)}))},o(e.value,t)])}))]);case`FunctionApplication`:return a(rd,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(Ku,e.args,t)}]);case`Bracket`:return xu();case`FieldAccess`:return a(id,[o(e.record,t),{kind:`Value`,data:xu()}]);case`BoxAction`:case`AngleAction`:return c(e.kind===`BoxAction`?ad:od,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(e.kind===`WeakFairness`?sd:cd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return xu()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return ze(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,ld(t,ud(e.names))),i;default:return Rl(e,(e,r)=>a(e,n,ld(t,ud(r)))),i}},_=(e,t,n,r)=>{let i=ld(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...xu(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(_u(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(vu(e.name,n,t.name))).map(e=>bu(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(yu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=yu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...xu(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},hd=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?hd(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=xu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),wu(a,e)}),a},gd=(t,n,r,i)=>{let a=md(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?hd(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.Z(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.Z(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=El([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(t=>({location:t.location,check:()=>{let n=a.analyze(t.expression,/* @__PURE__ */ new Map).level,r=t.location.range;if(n!==0&&r)throw e.Y(`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${n}.`,r)}})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?hd(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.J(r)}})),...r],i);if(u.length>0)throw e.J(u,!1,void 0,i)},_d=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),vd=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),yd=/* @__PURE__ */ new Set([..._d,...vd,`Enabled`]),bd=/* @__PURE__ */ new Set([`~>`,`-+->`]),xd=/* @__PURE__ */ new Set([...bd,`\\cdot`]),Sd=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Cd=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),wd=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),Td=(e,t)=>Sd.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ed=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(_d.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(vd.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&bd.has(e.operator))return 224},o=(e,n,s)=>{let c=e.kind,l=s?1:513;(yd.has(c)||c===`UnboundedQuantifier`&&e.isTemporal===!0||c===`Apply`&&xd.has(e.operator))&&(r[0]|=l),yd.has(c)&&(r[0]|=16);let u=a(e);n&&u!==void 0&&(r[0]|=u);let d=n&&u===void 0,f=Be(e);if(f!==void 0&&j(e)&&t.variableIndex.has(f)&&(s||(r[0]|=512),d&&(r[0]|=32)),f!==void 0&&!j(e)){let e=t.substitutions.get(f)??f,n=t.definitions.get(e),a=t.constants.has(f),o=t.variableIndex.get(f);if((o!==void 0||t.builtins.get(f)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=l),o!==void 0&&(d&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:d,isOperatorArgument:s||c===`OperatorReference`||c===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{Td(f,t)&&(r[0]|=2|(f===`Assert`?0:4)),Cd.has(f)&&(r[0]|=8),wd.has(f)&&(r[0]|=256),!a&&Td(e,t)&&(r[0]|=16);let n=t.builtins.get(e);d&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}ze(e).forEach(e=>o(e,d,s||c===`Lambda`))};return e.forEach(e=>o(e,!0,!1)),{row:r,edges:i}},Dd=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Od=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),kd=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Ed(Re(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Dd(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Dd(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=Dd(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!Od(t[e],l[e*r]|p[e*r])))),h=Dd(a,r,m,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&270:e),words:r}},Ad=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?jd(Re(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},jd=(e,t)=>{let n=t.facts.words,r=Ed(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Ad(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Od(e.callee,r[0])||(i[0]|=r[0]&270)}),i},Md=(e,t)=>!(Ad(e,t)[0]&513),Nd=(e,t)=>!(Ad(e,t)[0]&512),Pd={any:2,repeated:4,streamed:8,replayed:260},Fd=(e,t,n)=>(jd(e,t)[0]&Pd[n])!==0,Id=(e,t,n=`any`)=>(Ad(e,t)[0]&Pd[n])!==0,Ld=(e,t)=>{let n=Ad(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Rd=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},zd=(e,t)=>{let n=jd([e],t);return n[0]&16?void 0:Rd(n)},Bd=(e,t)=>!!(jd([e],t)[0]&1),Vd=(t,n,r)=>new e.A(`Applying ${t} to the following value,\nwhich is not ${n}:\n${M(L(r))}`),Hd=e=>It(e)?I(e):void 0,Ud=`a function with a finite domain`,Wd=(e,t,n)=>{let r=R(e,t,n),i=Hd(r);if(!i)throw Vd(n,Ud,r);return i},Gd=(e,t)=>{let n=R(e,1,t),r=Hd(n),i=r&&Yd(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Io(`second`,t,`bag`,n);return i},Kd=(e,t,n)=>{let r=t[n];if(!r||!Jd(r))throw Io(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},qd=(e,t)=>{if(!Pt(e)||!P(e))throw t();return F(e).elements},Jd=e=>e.range.every(e=>typeof e==`number`&&e>0),Yd=(e,t)=>{let n=e.domain.findIndex(e=>gr(t,e));return n===-1?void 0:e.range[n]},Xd=(e,t)=>{if(typeof e==`number`)return e;throw t()},Zd=(e,t,n)=>{let r=Xd(e,n)+Xd(t,n);if(Go(r))throw Ko(`${e}+${t}`);return r},Qd=(e,t,n,r,i)=>{let a=Xd(e.range[t],r),o=Yd(n,e.domain[t]);if(o===void 0)return a;let s=a-Xd(o,i);if(Go(s))throw Ko(`${a}-${o}`);return s},$d=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>gr(t,e[0]));a?a[1]=Zd(a[1],n,r):e.push([t,n])},ef=e=>e.domain.map((t,n)=>[t,e.range[n]]),tf=An([],[]),nf=t=>[Vo(`EmptyBag`,tf),z(`IsABag`,1,e=>{let t=Hd(R(e,0,`IsABag`));return t!==void 0&&Jd(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=Wd(e,0,`BagCardinality`),r=()=>Vd(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return Zd(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=Gd(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Gd(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>Hd(R(e,t,`(+)`))),n=Kd(e,t,0),r=Kd(e,t,1),i=ef(n),a=()=>Io(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>$d(i,e,r.range[t],a,n.domain.length)),Tr(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=Hd(t),i=Hd(n);if(!r)throw Io(`first`,`(-)`,`bag`,t);if(!i)throw Io(`second`,`(-)`,`bag`,n);let a=()=>Io(`first`,`(-)`,`bag`,t),o=()=>Io(`second`,`(-)`,`bag`,n);return Tr(r.domain.flatMap((e,t)=>{let n=Qd(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=qd(n,()=>Vd(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??tf;let i=()=>new e.A(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${M(L(n))}`),a=e=>{let t=Hd(e);if(!t)throw i();return t},o=ef(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>$d(o,e,t.range[n],i))}),Tr(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=Hd(t),i=Hd(n);if(!r)throw Vd(`\\sqsubseteq`,Ud,t);if(!i)throw Vd(`\\sqsubseteq`,Ud,n);let a=()=>Vd(`\\sqsubseteq`,`a bag`,t),o=()=>Vd(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Yd(i,e);return Xd(r.range[t],a)<=(n===void 0?0:Xd(n,o))})}),Ho(`BagOfAll`,2,e=>{let t=Bo(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=Hd(n);if(!r)throw Io(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>Io(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>$d(i,t.call([e]),r.range[n],a)),Tr(i)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!It(r))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${Qo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=I(r),a=F(br(i.range)).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.x(`Attempted to apply a function to ${L(i)}, which is not in its domain`);return yr(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>An(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>zi(Wd(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=qd(t,()=>Vd(`BagToSet`,Ud,t));return An([...n],n.map(()=>1))})],rf={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},af={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},of=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],sf=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
393
+ `]]),Ls=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),Rs={kind:`Local`},zs=`$subexpression`,Bs=/* @__PURE__ */ new WeakSet,Vs=/* @__PURE__ */ new WeakMap,Hs=/* @__PURE__ */ new WeakMap,Us=/* @__PURE__ */ new WeakMap,Ws=/* @__PURE__ */ new WeakMap,Gs=/* @__PURE__ */ new WeakMap,Ks=/* @__PURE__ */ new WeakMap,qs=/* @__PURE__ */ new WeakSet,Js=/* @__PURE__ */ new WeakSet,Ys=e=>Js.has(e)||Xs(Gs.get(e))!==void 0,Xs=e=>e?.find(e=>e.isEmpty?Ys(e.node):qs.has(e.node))?.error,Zs=/* @__PURE__ */ new WeakMap,Qs=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},$s=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),ec=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,tc=(e,t)=>ec(e,t)?-1:+!!ec(t,e),nc=e=>e.kind===`Operator`?e.params.length:0,rc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ic=e=>e.name.includes(`!`),ac=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},oc=(e,t,n)=>{let r=t.bindings.get(e);return r&&ec(r.position,t.location)&&(!n||ec(r.position,n.start))?r:void 0},sc=(t,n)=>t!==void 0&&n!==void 0&&e.Z(t)===e.Z(n),cc=(t,n,r,i)=>{if(n===void 0)return!0;if(sc(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.Z(a),s=n.range&&e.Z(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${Ms(t)} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${Ms(t)}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${Ms(t)}. \nThis duplicates the one at ${s}.`}),!1},lc=(e,t,n,r)=>cc(t,ac(e,t)??oc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,uc=(e,t,n)=>{cc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},dc=(e,t,n,r)=>t.reduce((e,t,i)=>lc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),fc=(e,t,n)=>t.reduce((e,t)=>lc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),pc=e=>e.kind===`Name`?[e.name]:e.names,mc=e=>e.flatMap(e=>pc(e.pattern)),hc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?oc(e,t,void 0)!==void 0:ec(n.location,t.location))?n:void 0},gc=(e,t)=>{let n=hc(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??nc(n),params:r?.params??rc(n),kind:`Definition`,range:n.location.range}}let r=oc(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},_c=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,vc=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,yc=(e,t,n)=>ac(t,e)??gc(e,n),bc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),xc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:bc(e.location,e.spelling??t)},Sc=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},Cc=`In module --TLA+ BUILTINS--`,wc=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),Tc=(t,n,r)=>r.errors.push({location:e.Z(n),message:`Cannot take subexpression of \`${Ms(t)}'.`}),Ec=e=>!/^[\p{L}\d_]/u.test(e),Dc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Oc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,kc=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Ac=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?kc(e.name,[],void 0):kc(e.operator,e.args,e.argumentCounts),jc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Mc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:mc(e.bounds),body:e.body,sets:jc(e.bounds)};case`SetMap`:return{names:mc(e.bounds),body:e.expression,sets:jc(e.bounds)};case`SetFilter`:return{names:pc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:pc(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Nc=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Pc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Fc=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ic=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Ic(e.body,t):Be(e).reduce((e,n)=>e??Ic(n,t),void 0)},Lc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Lc(i,t,n||Fc(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ic(e.set,t):Ic(e,t)},Rc=e=>e.kind===`Label`?Rc(e.body):e,zc=e=>typeof e==`number`?`argument selector ${e}`:e,Bc=`within the scope of a declaration
394
+ from outside that declaration's scope.`,Vc=(t,n,r,i,a)=>{let o=(n,r)=>{let a=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;a&&i.errors.push({location:e.Z(a),message:r})},s=r.isSuffices===r.isInProof,c=r.statement,l={node:c,isGoal:!0,isSufficesOpen:r.isSuffices},u=0,d=0;for(let[e,t]of n.slice(1).entries()){let r=e+1,i=l.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return i.kind!==`NewSymbol`&&i.kind!==`AssumeProve`&&Rc(i).kind===`Let`?i:o(r-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],a=r===1?e.map((e,n)=>({position:n,label:Lc(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?Ic(i.body,t.name):void 0};if(!a?.label)return o(r,`Cannot find label \`${t.name}'.`);if(r===1&&c.kind===`AssumeProve`&&Fc(c,a.position)&&s)return o(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${Bc}`);if(t.args.length!==a.label.params.length)return o(r,`Label \`${t.name}' used with wrong number of arguments.`);l.node=a.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(t.kind===`Colon`)return i;let a=t.kind===`Operand`?zc(t.operand):t.kind===`At`?`@`:`!(...)`,f=e=>t.kind===`Operand`?Oc(t.operand,e):-1,p=`An unexpected null node specified by '${a}'.\nThis is probably due to a previous error.`;if(l.isSufficesOpen){if(f(1)!==0)return o(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${a}'.`);l.isSufficesOpen=!1;continue}if(i.kind===`NewSymbol`)return i;if(i.kind!==`AssumeProve`){let e=Rc(i);if(qs.has(e))return o(r,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(r,`Selecting subexpression of expression that has none.`);if(Ys(e))return o(r,`Choosing operand \`${a}' of subexpression with no operands.`);let n=Mc(e);if(n&&t.kind!==`Operand`){let e=t.kind===`Bound`?t.args.length:0;if(t.kind===`Bound`&&e!==n.names.length)return o(r,`Selector with ${e} argument(s) used for quantifier with ${n.names.length} bound identifier(s).`);u+=n.names.length,d+=e,l.node=n.body,l.isGoal=!1;continue}let s=n?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:Nc(e);if(!c)return i;let m=e.kind===`Except`,h=f(m?e.updates.length+1:c.length);if(h===-1)return o(r,`Nonexistent operand specified by \`${a}'.`);if(m&&h>0)return o(r,`Selecting subexpression of an EXCEPT not yet implemented.`);if(l.node=c[h],l.isGoal=!1,qs.has(l.node))return o(r,p);continue}let m=[...i.assumptions,i.conclusion],h=f(m.length);if(h===-1)return o(r,`Nonexistent operand specified by \`${a}'.`);if(Fc(i,h)&&(!l.isGoal||s))return o(r,`Accessing ASSUME/PROVE clause ${Bc}`);let g=m[h];if(g.kind===`NewSymbol`&&r!==n.length-1)return o(r,`Selected a subexpression of a NEW clause of an ASSUME.`);if(l.node=g,l.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&qs.has(g))return o(r,p)}return l.node.kind===`AssumeProve`?a?l.node:o(void 0,`Selected ASSUME/PROVE instead of expression.`):l.node.kind===`NewSymbol`?a?l.node:o(void 0,`Selected a NEW declaration as an expression or operator.`):u===d?l.node:o(void 0,`Expected ${u} arguments but found ${d}.`)},Hc=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.Z(t.location.range),message:r}),!0)},Uc=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.Z(i),o=t.params.filter((i,a)=>{let o=ac(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.Z(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},Wc=(e,t,n,r)=>{if(!Pc(e))return!1;let i=Ac(e),a=i[0],o=i.length>1&&a.kind===`Name`?ac(t,a.name)?.goal??vc(a.name,n):void 0;return o&&{node:Vc(e,i,o,n,r)}},Gc=(t,n,r,i)=>{let a=t.location;if(il(t,r,i))return;let o=Zs.get(t);if(o!==void 0)return o;if(Qs(n))return t.kind===`Apply`?t.args.length:0;let s=ac(r,n);if(s?.isNonFact){i.errors.push({location:e.Z(xc(t,n)),message:`Step number of non-expression step used as an expression.`});return}let c=s?.goal?.keyword;if(c){i.errors.push({location:e.Z(xc(t,n)),message:`${c} proof step selected instead of expression.`});return}if(Wc(t,r,i,!1)||Dc(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=Rs),s)return s.arity;let l=gc(n,i);if(l)return t.kind===`Identifier`?t.name=l.key:t.operator=l.key,Zs.set(t,l.arity),l.arity;let u=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``,d=u===``?void 0:ac(r,u)??gc(u,i);if(d&&!wc.has(d.kind)){Tc(u,t.kind!==`OperatorReference`&&t.selectorRanges?.[0]||xc(t,n),i);return}if(t.kind!==`OperatorReference`&&u!==``&&ol(u,t.kind===`Apply`&&t.argumentCounts?t.args.slice(0,t.argumentCounts[0]):[],t.selectorRanges?.[0],(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??a.range,r,i))return;if(d||u!==``&&_c(u,i))return t.kind===`Apply`?t.args.length:0;let f=Sc(t),p=t.kind===`OperatorReference`||f!==void 0;if(!Ec(n)||Dc(n)||!p){i.errors.push({location:e.Z(xc(t,n)),message:`Unknown operator: \`${Ms(n)}'.`});return}let m=t.spelling??n;i.errors.push({location:e.Z(f===`prefix`&&m===`-.`?bc(a,`-`):xc(t,n)),message:`Could not find declaration or definition of symbol '${m}'.`}),f&&qs.add(t),f&&a.range&&i.errors.push({location:e.Z(a.range),message:`Couldn't resolve ${f} operator symbol \`${m}'.`})},Kc=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>dc(e,pc(t.pattern),t.pattern.ranges,n),t)),qc=(e,t)=>e.kind===`Identifier`&&e.name===t&&A(e)||Be(e).some(e=>qc(e,t)),Jc=(e,t)=>{e.kind===`FunctionConstruction`&&qc(e.body,t)&&(e.isRecursive=!0),Be(e).forEach(e=>Jc(e,t))},Yc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?mc(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.Z(s),message:t})},l=t.kind===`Function`?Kc(t.bounds,n,a):fc(n,t.params,a),u=ac(l,o)??oc(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${Ms(o)} defined at wrong LET/IN level.`):u&&!d?c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${Ms(o)} already defined or declared.`):u&&t.kind===`Function`&&u.arity>0?c(`Function ${Ms(o)} has operator arguments in its RECURSIVE declaration.`):u&&t.kind===`Operator`&&(u.arity!==t.params.length||t.params.some(e=>e.arity>0))&&c(`Definition of ${Ms(o)} has different arity than its RECURSIVE declaration.`),u&&d&&t.kind===`Operator`&&(u.params=rc(t)),t.kind===`Function`?(B(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),Jc(t.body,o),t.isSelfReferential=qc(t.body,o)):B(t.body,l,a),u&&d?((t.kind===`Operator`||u.arity===0)&&(u.isPending=!1,u.range=s),!1):t.kind===`Function`?u===void 0:cc(o,ac(n,o)??oc(o,a,s),{kind:`Definition`,arity:nc(t),range:s},a)},Xc=(t,n,r,i=[],a=[])=>{let o=/* @__PURE__ */ new Set,s=t.filter(e=>e.isRecursive&&a.every(t=>t.name!==e.name)).reduce((e,t)=>{if(ac(e,t.name)?.isPending)return e;let n={name:t.name,arity:nc(t),params:rc(t),kind:`Definition`,parent:e,isPending:!0};return o.add(n),n},n),c=/* @__PURE__ */ new Map,l=(e,t)=>{let n={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=cc(t.name,ac(e,t.name)??oc(t.name,r,n.range),n,r)?{...n,name:t.name,parent:e,isPending:!0}:void 0;return i&&o.add(i),c.set(t,i),i??e},u=[...r.isGenerated?[]:i,...a].toSorted((e,t)=>tc(e.location,t.location)),d=(e,t)=>{let n=u.findIndex(e=>!t(e));return u.splice(0,n===-1?u.length:n).reduce((e,t)=>`kind`in t?gl(t,e,r):l(e,t),e)},f=d(t.reduce((e,t)=>{let n=Qs(t.name)?e:d(e,e=>!ec(t.location,e.location)),a={name:t.name,arity:nc(t),kind:`Definition`,range:t.location.range,parent:n};if(ic(t))return{...a,params:rc(t)};let s=i.some(e=>e.location===t.location),c=r.isGenerated||t.isLocal||Qs(t.name),l=s?{...r,isGenerated:!0,errors:[],warnings:[]}:c?{...r,isGenerated:c}:r;return Yc(t,n,l,o)?{...a,params:rc(t)}:n},s),()=>!0);return c.forEach((t,n)=>{let i=n.location.range;i&&!r.isGenerated&&(!t||t.isPending)&&r.errors.push({location:e.Z(i),message:`Symbol ${Ms(n.name)} declared in RECURSIVE statement but not defined.`})}),f},Zc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ac(t,r)??oc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},Qc=(t,n,r)=>{if(!Pc(t))return!1;let i=Ac(t),a=i.findIndex(e=>e.kind!==`Name`),o=Zc(i.slice(0,a===-1?i.length:a).flatMap(e=>e.kind===`Name`?[e.name]:[]).join(`!`),n,r),s=i[0],c=s.kind===`Name`?s.args.length:0;if(!o||c===o.arity)return!1;let l=(t.kind===`Identifier`?void 0:t.argumentRanges?.[0])??t.location.range;return l&&r.errors.push({location:e.Z(l),message:`The operator ${o.name} requires ${o.arity} arguments.`}),!0},$c=(t,n,r,i,a)=>{let o=t?.kind===`Definition`?t.params:void 0;return!t||!o||o.length===t.arity?!1:(i&&!a.isGenerated&&a.errors.push({location:e.Z(i),message:`Wrong number of arguments (${r}) given to operator '${Ms(n)}', \nwhich requires ${o.length} arguments.`}),!0)},el=(t,n,r)=>{let i=t.location.range,a=t=>{i&&r.errors.push({location:e.Z(i),message:t})},o=Hs.get(t);if(t.kind===`Lambda`&&t.operator!==void 0)a(`The operator ${Ms(t.operator)} requires 1 arguments.`);else if(o)r.errors.push(o);else if(t.kind===`Lambda`&&i)qs.add(t),a(`LAMBDA expression used where an expression is required.`);else if(t.kind===`OperatorReference`){let e=Gc(t,t.operator,n,r);e!==void 0&&a(`The operator ${Ms(t.operator)} requires ${e} arguments.`)}else B(t,n,r)},tl=(t,n,r,i,a,o,s)=>{let c=(t,n)=>{t&&s.errors.push({location:e.Z(t),message:n})},l=(t,l)=>{let u=Zc(i,o,s)?.range??yc(i,o,s)?.range;u&&c(a,`Operator with incorrect arity passed as argument. \nOperator '${Ms(t)}' of arity ${l} is argument number ${r+1} (counting from 1) to operator \`${e.Z(u)}', \nbut an operator of arity ${n} was expected.`)},u=t.location.range;if(n===0)return el(t,o,s),!0;if(t.kind===`Lambda`){Bs.has(t)?B(t,o,s):al(t,o,s);let e=t.params.length===n;return!e&&Bs.has(t)?c(u,`Expected arity ${n} but found operator of arity ${t.params.length}.`):!e&&u&&t.operator===void 0?c(a,`Lambda expression with arity ${t.params.length} used as argument ${r+1} of operator \`${i}', \nbut an operator of arity ${n} is required.`):!e&&t.operator!==void 0&&l(t.operator,t.params.length),e}if(t.kind===`Subexpression`)return B(t,o,s),!0;if(t.kind===`Apply`&&t.argumentCounts?.at(-1)===0){let e=t.argumentCounts.findIndex(e=>e>0);return c(t.selectorRanges?.[e],`Selector \`${t.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(t.kind!==`Identifier`&&t.kind!==`OperatorReference`)return c(u,`An expression appears as argument number ${r+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let d=t.kind===`Identifier`?t.name:t.operator,f=yc(d,o,s)?.params??[],p=Gc(t,d,o,s);return t.kind===`Identifier`&&p!==void 0&&p!==n&&c(xc(t,d),`Expected arity ${n} but found operator of arity ${p}.`),t.kind===`OperatorReference`&&p!==void 0&&p!==n&&l(d,p),p===n&&f.every(e=>e===0)},nl=(t,n,r)=>{let i=t.operator,a=yc(i,n,r),o=Qc(t,n,r)?void 0:Gc(t,i,n,r);if(o!==void 0&&o!==t.args.length&&r.errors.push({location:e.Z(t.argumentsRange??xc(t,i)),message:`The operator ${Ms(i)} requires ${o-(Zc(i,n,r)?.arity??0)} arguments.`}),o!==t.args.length){Js.add(t);return}let s=a&&(a.kind===`Definition`?a.params:t.args.map(()=>0));if(s===void 0){t.args.forEach(e=>rl(e,n,r));return}let c=t.selectorRanges?.at(-1)??xc(t,i),l=i===zs,u=t.args.slice(0,s.length).map((e,t)=>{let a=l?Ws.get(e):void 0;return tl(e,s[t],a?.index??t,a?.operator??i,a?.range??c,n,l?{...r,isGenerated:!1}:r)});$c(a,i,t.args.length,t.location.range,r)||u.forEach((n,a)=>{!n&&t.location.range&&r.errors.push({location:e.Z(t.location.range),message:`Argument number ${a+1} to operator '${l?`LAMBDA`:i}' \nshould be a ${s[a]}-parameter operator.`})})},rl=(e,t,n)=>{e.kind===`Identifier`?Gc(e,e.name,t,n):B(e,t,n)},il=(e,t,n)=>{let r=Vs.get(e);return r?(r.applications.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>tl(r,e.params[i],i,e.operator,e.range,t,n))),n.errors.push(Xs(r.nulls)??r.error),!0):!1},al=(e,t,n)=>B(e.body,dc(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),B=(t,n,r)=>{if(Bs.has(t)&&!r.isGenerated){let e=Xs(Gs.get(t));if(e){r.errors.push(e);return}let i=Ks.get(t);if(i){Object.assign(t,i);let e=Zs.get(i);e!==void 0&&Zs.set(t,e)}B(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!r.isInExcept&&t.location.range&&(Js.add(t),r.errors.push({location:e.Z(t.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let i=t.name,a=Qc(t,n,r)?void 0:Gc(t,i,n,r);if(a===0){let e=yc(i,n,r),a=e?.kind;(a===`Variable`||a===`Theorem`||a?.startsWith(`New`)||_c(i,r))&&Js.add(t),$c(e,i,0,xc(t,i),r);return}a!==void 0&&r.errors.push({location:e.Z(xc(t,i)),message:`The operator ${Ms(i)} requires ${a} arguments.`}),Js.add(t);return}case`OperatorReference`:Gc(t,t.operator,n,r);return;case`Apply`:nl(t,n,r);return;case`Lambda`:Bs.has(t)?al(t,n,r):t.location.range&&(qs.add(t),r.errors.push({location:e.Z(t.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&B(t.other,n,r);return;case`Let`:B(t.body,Xc(t.definitions,n,r,t.instances,t.recursive),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(t.body,Kc(t.bounds,n,r),a(mc(t.bounds)));return;case`UnboundedQuantifier`:B(t.body,dc(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&B(t.set,n,r),B(t.body,dc(n,pc(t.pattern),t.pattern.ranges,r),a(pc(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:B(t.predicate,Kc([t.bound],n,r),a(pc(t.bound.pattern)));return;case`SetMap`:B(t.expression,Kc(t.bounds,n,r),a(mc(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.Z(i.location.range??bc(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:B(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(Hc(t,r))return;B(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),Uc(t,n,r);return;case`Subexpression`:sl(t,n,r)&&Js.add(t);return}},ol=(t,n,r,i,a,o)=>{let s=ac(a,t)??oc(t,o,void 0);return!s?.isPending||!r||!i?!1:n.length===s.arity?(n.forEach(e=>B(e,a,o)),o.errors.push({location:e.Z(r),message:`Subexpression of \`${t}' used inside the operator's definition.`}),!0):(o.errors.push({location:e.Z(i),message:`The operator ${t} requires ${s.arity} arguments.`}),!0)},sl=(t,n,r)=>{if(Qc(t,n,r)||il(t,n,r))return!0;let i=t.selectors[0],a=t.selectorRanges?.[0],o=t.selectors.findIndex(e=>e.kind!==`Name`),s=t.selectors.slice(0,o).flatMap(e=>e.kind===`Name`?[e.name]:[]),c=s.findIndex((e,t)=>t>0&&gc(s.slice(0,t+1).join(`!`),r)),l=s.length>1&&(ac(n,s[0])??oc(s[0],r,void 0))?.kind===`Instance`,u=t.selectorRanges?.[o-1];if(l&&c===-1&&a&&u)return r.errors.push({location:e.Z({module:a.module,start:a.start,end:u.end}),message:`Unknown operator: \`${Ms(s.join(`!`))}'.`}),!0;let d=s.slice(0,c+1).join(`!`),f=c>0?gc(d,r):void 0,p=t.selectors.slice(0,c+1).flatMap(e=>`args`in e?e.args:[]).length,m=t.argumentRanges?.[c]??t.location.range;if(f&&f.arity!==p&&m)return r.errors.push({location:e.Z(m),message:`The operator ${Ms(d)} requires ${f.arity} arguments.`}),!0;if(i.kind===`Name`&&t.selectors[1].kind!==`Name`&&a){let t=ac(n,i.name),o=t??gc(i.name,r);if(o===void 0&&!_c(i.name,r)||o?.kind===`Instance`)return r.errors.push({location:e.Z(a),message:`Unknown operator: \`${Ms(i.name)}'.`}),!0;if(o&&(!wc.has(o.kind)||t?.isNonFact))return Tc(i.name,a,r),!0}if(i.kind===`Name`&&ol(i.name,i.args,a,t.argumentRanges?.[0]??t.location.range,n,r))return!0;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>rl(e,n,r));let h=Wc(t,n,r,!1);return h?h.node===void 0:!1},cl=(t,n,r,i)=>{if(t.kind===`ModuleFact`)return;if(t.kind===`ExceptAt`&&t.location.range)return i.errors.push({location:e.Z(t.location.range),message:"Unknown operator: `@'."}),Cc;let a=ul(t,n,r,i);if(Qc(t,r,i))return a;let o=Wc(t,r,i,!0);if(o){let n=o.node?.kind;return n===void 0?Cc:n===`AssumeProve`||n===`NewSymbol`?void 0:t.location.range&&e.Z(t.location.range)}if(t.kind===`Subexpression`)return sl(t,r,i)?Cc:a;let s=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;return t.kind===`Identifier`&&ac(r,s)?.isNonFact?(i.errors.push({location:e.Z(xc(t,s)),message:`Step number of non-fact used as a fact`}),Cc):(!_c(s,i)&&!ac(r,s)?.goal&&B(t,r,i),a)},ll=(t,n,r)=>{let i=t.location.range,a=t.kind===`Identifier`?t.name:t.kind===`OperatorReference`?t.operator:``;if(a===``||!i)return!0;let o=ac(n,a)??gc(a,r)??oc(a,r,i);return o===void 0&&(_c(a,r)||Dc(a))||(o===void 0&&r.errors.push({location:e.Z(i),message:`Unknown operator: \`${Ms(a)}'.`}),o&&wc.has(o.kind)&&!Dc(a))?!0:(r.errors.push({location:e.Z(i),message:`DEF clause entry should describe a defined operator.`}),!1)},ul=(t,n,r,i)=>{let a=t.location.range&&e.Z(t.location.range);if(Bs.has(t))return n.location.range&&e.Z(n.location.range);if(Vs.has(t)||t.kind===`ExceptAt`)return Cc;switch(t.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let e=Ac(t)[0];if(t.kind===`Subexpression`||e.kind!==`Name`)return;let n=t.kind===`Identifier`?t.name:t.operator,o=ac(r,e.name)?.goal??vc(e.name,i);if(_c(n,i)||o||Dc(n)&&ac(r,n))return;let s=yc(n,r,i),c=t.kind===`Apply`?t.args.length:0;return s?.arity===c?a:Cc}default:return a}},dl=(t,n,r)=>{let i=Us.get(t.facts)??t.facts,a=t.facts.map((e,t)=>cl(e,i[t],n,r)),o=t.defs.filter(e=>ll(e,n,r)).length;a.forEach(e=>{e&&t.kind===`Hide`&&r.errors.push({location:e,message:`The only expression allowed as a fact in a HIDE is
395
+ the name of a theorem, assumption, or step.`})});let s=t.location.range;t.facts.length+o===0&&s&&r.errors.push({location:e.Z(s),message:t.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},fl=(e,t,n)=>(e.set&&B(e.set,t,n),lc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),pl=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:fl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?pl(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},ml=(e,t,n)=>e.kind===`AssumeProve`?pl(e,t,n):(B(e,t,n),t),hl=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&dl(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>vl(t,e,r),t)},gl=(e,t,n)=>{let r=wl(e,t,n);return e.name===void 0?r:lc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},_l=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:jc(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},vl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=_l(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=ml(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return hl(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return hl(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return dl(r,t,n),s(t);case`Instance`:return s(gl(r,t,i));case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?gl(t,e,i):Xc([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),hl(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),o(t);case`Take`:return o(dc(Kc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=dc(Kc(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,a,{...i,labelParams:[...i.labelParams,...mc(r.bounds),...r.names]}),hl(e.proof,o(t),n),o(a)}default:return hl(e.proof,o(t),n),o(t)}},yl=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ml(e.statement,void 0,t);e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),hl(e.proof,n,t),r&&(r.isInProof=!1)},bl={line:0,column:0},xl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Sl=(e,t)=>{let n=new Map([...$s,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Cl=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(e,t)=>a.errors.push({location:t,message:`An operator must be substituted for symbol '${Ms(e.name)}', and it must have arity ${e.arity}.`}),c=(t,n)=>{let r=n.location.range;if(t.arity===0){el(n,o,a);return}if(n.kind===`Lambda`){al(n,o,a),n.params.length!==t.arity&&r&&s(t,e.Z(r));return}if(n.kind===`OperatorReference`){let i=Gc(n,n.operator,o,a);i===void 0?s(t,Cc):i!==t.arity&&r&&s(t,e.Z(r));return}if(n.kind!==`Identifier`){r&&a.errors.push({location:e.Z(r),message:`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${Ms(t.name)}'.`}),s(t,Cc);return}let i=Gc(n,n.name,o,a);i!==void 0&&i!==t.arity&&a.errors.push({location:e.Z(xc(n,n.name)),message:`Expected arity ${t.arity} but found operator of arity ${i}.`}),i!==t.arity&&s(t,Cc)},l=t.location.range,u=n.filter(e=>ac(o,e.name)!==void 0||gc(e.name,a)!==void 0).map(e=>({declaration:e,expression:{kind:`Identifier`,name:e.name,location:t.location}}));u.filter(e=>e.declaration.arity===0).forEach(t=>{let n=Gc(t.expression,t.declaration.name,o,a);n&&l&&a.errors.push({location:e.Z(l),message:`Wrong number of arguments (0) given to operator '${Ms(t.declaration.name)}', \nwhich requires ${n} arguments.`})});let d=/* @__PURE__ */ new Map;return t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.Z(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;c(i,o);let s=o.location.range;d.has(r)?s&&a.errors.push({location:e.Z(s),message:`Multiple substitutions for symbol '${r}' in substitution.`}):d.set(r,o)}),u.filter(e=>!d.has(e.declaration.name)).forEach(t=>{(t.declaration.arity===0?0:Gc(t.expression,t.declaration.name,o,a))!==t.declaration.arity&&l&&s(t.declaration,e.Z(l)),d.set(t.declaration.name,t.expression)}),n.filter(e=>!d.has(e.name)).forEach(t=>{let n=t.location.range;l&&n&&a.errors.push({location:e.Z(l),message:`Substitution missing for symbol ${Ms(t.name)} declared at ${e.Z(n)} \nand instantiated in module ${r}.`})}),d},wl=(e,t,n)=>{let r=n.getInstance(e);return Cl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>lc(e,t[0],t[1],n),t)},Tl=(e,t,n,r)=>{let i=Sl(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),Cl(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??bl}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},El=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>tc(e.location,t.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.I)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Dl=(t,n)=>{let r=Sl(t,n.imported),i=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),a=new Map([...$s,...n.bound].map(e=>[e[0],{...e[1],position:bl}])),o=/* @__PURE__ */ new Set,s=[],c=(e,t,o,s)=>({location:e,check:(c,l)=>s({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:n.facts,goals:i,bindings:a,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),l=(e,t)=>e.map(e=>c(e.location,void 0,!1,n=>uc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return El([...t.units.flatMap(t=>{let n=t.kind===`Variables`?{type:`A VARIABLE declaration`,location:t.location}:t.kind===`Constants`?{type:`A declaration`,location:t.location}:t.kind===`Module`?{type:`A MODULE `,location:t.module.location}:t.kind===`Theorem`?{type:`A THEOREM`,location:t.theorem.location}:t.kind===`Assumption`?{type:`An ASSUME`,location:t.assumption.location}:t.kind===`Use`?{type:`A USE or HIDE`,location:t.use.location}:void 0,r=n?.location.range;return!n||!r?[]:[{location:n.location,check:t=>{s.some(e=>e.binding?.isPending)&&t.push({location:e.Z(r),message:`${n.type} may not appear within a recursive definition section.`})}}]}),...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(t.constants,`Constant`),...l(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>c(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=cc(e.name,a.get(e.name),n,t);r&&(a.set(e.name,n),o.add(n)),s.push({declaration:e,binding:r?n:void 0})})),...t.definitions.map(e=>c(e.location,e,!0,n=>{xl(t,e)?B(e.body,void 0,n):Yc(e,void 0,n,o)&&a.set(e.name,{kind:`Definition`,arity:nc(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>c(e.location,void 0,!1,t=>{fc(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>uc(n,e,t)),e.name!==void 0&&uc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},t)})),...t.assumptions.map(e=>c(e.location,void 0,e.name!==void 0,t=>{B(e.expression,void 0,t),e.name!==void 0&&uc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...t.theorems.map(e=>c(e.location,void 0,e.name!==void 0,t=>yl(e,t))),...t.uses.map(e=>c(e.location,void 0,!1,t=>dl(e,void 0,t))),{location:t.location.range?.end??t.location,check:t=>s.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.Z(r),message:`Symbol ${Ms(n.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Ol=/* @__PURE__ */ new WeakSet,kl=/* @__PURE__ */ new WeakMap,Al=(e,t)=>{if(t.length===0)return e;let n={...e};return Ol.has(e)&&Ol.add(n),kl.set(n,[...t,...kl.get(e)??[]]),n},jl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Ll(e,(e,r)=>jl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&A(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&A(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Ml=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Nl=/* @__PURE__ */ new WeakMap,Pl=e=>Nl.get(e)??e.name,Fl=(e,t)=>(Pl(t)!==e.name&&Nl.set(e,Pl(t)),e),Il=(e,t)=>Fl(e.kind===`Function`?{...e,bounds:Ml(e.bounds,e=>t(e,[])),body:t(e.body,mc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Ll=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Il(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Ml(e.bounds,n),body:t(e.body,mc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,pc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,pc(e.bound.pattern))};case`SetMap`:return{...e,bounds:Ml(e.bounds,n),expression:t(e.expression,mc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Rl=(e,t)=>{Ll(e,(e,n)=>(t(e,n),e))},zl=`LAMBDA`,Bl=e=>`${e}@SUBSTITUTION`,Vl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Vl),Hl=(e,t)=>{if(e.kind!==`Identifier`)return!Vl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=A(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Vl(n.body)},Ul=(e,t=/* @__PURE__ */ new Set)=>{let n=Ve(e),r=n===void 0||t.has(n)?[]:[n];return Rl(e,(e,n)=>r.push(...Ul(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Wl=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Gl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Kl=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ql=(e,t)=>e.map(e=>({pattern:Kl(e.pattern,t),set:e.set})),Jl=(e,t)=>e.kind===`Function`?{...e,bounds:ql(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Yl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Fl({...Jl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ql(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Kl(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Kl(e.bound.pattern,n),set:e.bound.set}};default:return e}},Xl=e=>`${e}@ENABLED`,Zl=(e,t)=>e.modes.get(t)??e,Ql=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!A(e)&&t.instantiation.variables.has(e.name),$l=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>$l(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ql(e,t,n))return[e.name];let r=A(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?$l(r.body,t,/* @__PURE__ */ new Map):void 0},eu=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ql(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Xl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ou(e.expression,Zl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ou(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ou(e.subscript,Zl(t,`Primed`),n),location:r},ou(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=$l(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Xl(r),location:e.location},location:e.location},ou({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},tu=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Rs}),nu=(e,t)=>e.map(e=>tu(e.name,t)),ru=(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:nu(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),iu=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...nu(t,r),...i.map(e=>tu(e,r))],location:r},location:r}},au=(e,t)=>e.instantiation.isParameterized(t)?cu(e,t):void 0,ou=(t,n,r)=>{let i=e=>ou(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!A(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:ou(t.expression,Zl(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:ou(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},Zl(n,`Enabled`),r)};let c=eu(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!Hl(e,a)))return Al(e,[t]);if(e&&r){let n=Bl(t.name);return r.set(n,e),tu(n,t.location)}let i=au(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&nc(s)>0?iu(i,o,nc(s),t.location):{kind:`Apply`,operator:i,args:nu(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||Ol.has(t),l=e=>(c&&Ol.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:zl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:zl,args:r,resolution:Rs},location:t.location};if(s)throw new e.I(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=au(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...nu(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=a.substitutions.get(t.operator);if(e?.kind===`Identifier`||e?.kind===`OperatorReference`||e?.kind===`Lambda`)return Al(e,[t]);let r=au(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?iu(r,o,nc(i),t.location):{...t,operator:r}}let l=Wl(n),u=Ll(t,(e,t)=>t.length===0?i(e):ou(e,n,Gl(r,t,l)));return Yl(u,r,l)},su=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:tu(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},cu=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Wl(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Jl(Il(i,(e,t)=>ou(e,s,Gl(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&kl.set(l,[u,...kl.get(i.body)??[]]),su({...c,body:l},r.params,i.location)}):t},lu=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Ul(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>au(i,e)??e,getQualifiedKey:t=>{let n=au(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>su(r,e.params,r.location)):t}}},uu=e=>e.kind===`Let`&&e.instances!==void 0||Be(e).some(uu),du=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Ll(e,e=>du(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ec(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},fu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,pu=(e,t)=>e.definitions.some(e=>uu(e.body))||e.assumptions.some(e=>uu(e.expression))||e.theorems.some(e=>{let t=fu(e);return t!==void 0&&uu(t)})?{...e,definitions:e.definitions.map(e=>Il(e,e=>du(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:du(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=fu(e);return n===void 0?e:{...e,statement:du(n,t,[])}})}:e,mu=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),hu={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},gu=(e,t)=>{let n=hu[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},_u=(e,t)=>`${e}${t}`,vu=(e,t,n)=>`${e}${t}${n}`,yu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},bu=(e,t,n)=>`${e},${t},${n}`,xu=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Su=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Cu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),wu=(e,t)=>{t.constraints.forEach((t,n)=>Su(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Cu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},V=(e,t,n,r)=>({...xu(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Tu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Eu=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Du=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(e=>[e[0],{...V(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),Ou=V(`'`,2,[1],[0]),ku=V(`UNCHANGED`,2,[1],[0]),Au=V(`ENABLED`,1,[2],[0]),ju=V(`[]`,3,[3],[0]),Mu=V(`<>`,3,[3],[0]),Nu=V(`$ConjList`,0,[3],[1]),Pu=V(`$DisjList`,0,[3],[1]),Fu=V(`$IfThenElse`,0,[3],[1]),Iu=V(`$Case`,0,[3],[1]),Lu=V(`$BoundedForall`,0,[3],[1]),Ru=V(`$BoundedExists`,0,[3],[1]),zu=V(`$UnboundedForall`,0,[3],[1]),Bu=V(`$UnboundedExists`,0,[3],[1]),Vu=V(`$TemporalForall`,3,[3],[0]),Hu=V(`$TemporalExists`,3,[3],[0]),Uu=V(`$BoundedChoose`,0,[2],[1]),Wu=V(`$UnboundedChoose`,0,[2],[1]),Gu=V(`$SetEnumerate`,0,[2],[1]),Ku=V(`$Tuple`,0,[2],[1]),qu=V(`$SetOfFcns`,0,[2],[1]),Ju=V(`$CartesianProd`,0,[2],[1]),Yu=V(`$SubsetOf`,0,[2],[1]),Xu=V(`$SetOfAll`,0,[2],[1]),Zu=V(`$FcnConstructor`,0,[3],[1]),Qu=V(`$RcdConstructor`,0,[3],[1]),$u=V(`$SetOfRcds`,0,[2],[1]),ed=V(`$Except`,0,[2],[1]),td=V(`$Pair`,0,[3],[1]),nd=V(`$Seq`,0,[2],[1]),rd=V(`$FcnApply`,0,[2,2],[1,1]),id=V(`$RcdSelect`,0,[2,0],[1,1]),ad=V(`$SquareAct`,2,[2,1],[0,0]),od=V(`$AngleAct`,2,[2,1],[0,0]),sd=V(`$WF`,3,[1,2],[0,0]),cd=V(`$SF`,3,[1,2],[0,0]),ld=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),ud=e=>e.map(e=>({name:e,arity:0})),dd=(t,n)=>n.location.range?e.Y(`${t}.`,n.location.range):new e.I(`${t} at line ${n.location.line}, column ${n.location.column}`),fd=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),pd=e=>e.kind!==`Let`&&e.kind!==`Label`,md=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=v(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Du.get(e)??mu.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=xu(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(vu(e,n,t))}),Cu(r.argConstraints,_u(e,n),t.data.level),wu(r,t.data)}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);n.forEach((n,r)=>{if(n.kind===`Value`&&n.data.level>Tu(t,r))throw new e.I(`Level error in applying operator ${Ms(t.name)}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)});let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(bu(e,n,r)),c=xu(Math.max(t.level,...n.filter((e,n)=>Eu(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Eu(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Su(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Su(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Su(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Su(c.constraints,e,Tu(t,n))})),n.forEach((e,t)=>{if(e.kind!==`Operator`)return;let r=e.data;n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Su(c.constraints,e,Tu(r,a)))}))}),t.argParams.forEach(e=>{let t=yu(e),n=o(t.operator);n?.kind===`Operator`&&Su(c.constraints,t.param,Tu(n.data,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Cu(c.argConstraints,t,e))),n.forEach((e,r)=>{if(e.kind!==`Declared`)return;let i=e.declared;Array.from({length:i.arity},(e,n)=>Cu(c.argConstraints,_u(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Cu(c.argConstraints,_u(i.name,a),e.data.level)}))}),t.argParams.forEach(e=>{let t=yu(e),n=o(t.operator);n&&Cu(c.argConstraints,_u(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(yu(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=yu(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(vu(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(vu(t.operator,t.index,e)))}}),n.forEach((e,t)=>{if(e.kind!==`Declared`)return;let r=e.declared;n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(vu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,ud(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=xu();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:xu()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(t,n,r,i=[],o=mc(i))=>{let c=s(n,ld(r,ud(o))),l=i.map(e=>m(e.set,r)),u=a(t,c,l,o),d=i[l.findIndex(e=>e.level>2)]?.pattern;if(d){let n=d.ranges?.[0];throw new e.I(`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${n?e.Z(n):pc(d)[0]} \nexceeds the maximum level allowed by the operator`)}return u},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t,n)=>{let r=e.map(e=>e.data.level);if(r.includes(2)&&r.includes(3))throw dd(`${n} has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw dd(`Action used where only temporal formula or state predicate allowed`,e);fd.has(e.operator)&&u(t,e,Ms(e.operator))},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&pd(n)&&n.kind!==r)throw dd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>wu(i,v(e,n))),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.I)||n.sany?n:dd(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return xu();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t),r=e.kind===`And`;return u(n,e,e.isBulleted?`${r?`Conjunction`:`Disjunction`} list`:r?`\\land`:`\\lor`),a(r?Nu:Pu,n)}case`Prime`:return c(Ou,[e.expression],t);case`Unchanged`:return c(ku,[e.expression],t);case`Enabled`:return c(Au,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(e.kind===`Always`?ju:Mu,[n])}case`If`:return c(Fu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Iu,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(e.kind===`Forall`?Lu:Ru,[e.body],t,e.bounds),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw dd(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?e.quantifier===`Forall`?Vu:Hu:e.quantifier===`Forall`?zu:Bu,[e.body],t,[],e.names);case`Choose`:return c(e.set?Uu:Wu,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],pc(e.pattern));case`SetEnumeration`:return c(Gu,e.elements,t);case`Tuple`:return c(Ku,e.elements,t);case`FunctionSet`:return c(qu,[e.domain,e.range],t);case`Product`:return c(Ju,e.factors,t);case`SetFilter`:return c(Yu,[e.predicate],t,[e.bound]);case`SetMap`:return c(Xu,[e.expression],t,e.bounds);case`FunctionConstruction`:return c(Zu,[e.body],t,e.bounds);case`Record`:return c(Qu,e.fields.map(e=>e.value),t);case`RecordSet`:return c($u,e.fields.map(e=>e.value),t);case`Except`:return a(ed,[o(e.function,t),...e.updates.map(e=>({kind:`Value`,data:a(td,[{kind:`Value`,data:a(nd,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:xu()}:e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(Ku,e.args,t)}))},o(e.value,t)])}))]);case`FunctionApplication`:return a(rd,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(Ku,e.args,t)}]);case`Bracket`:return xu();case`FieldAccess`:return a(id,[o(e.record,t),{kind:`Value`,data:xu()}]);case`BoxAction`:case`AngleAction`:return c(e.kind===`BoxAction`?ad:od,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(e.kind===`WeakFairness`?sd:cd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return xu()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Be(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,ld(t,ud(e.names))),i;default:return Rl(e,(e,r)=>a(e,n,ld(t,ud(r)))),i}},_=(e,t,n,r)=>{let i=ld(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...xu(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(_u(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(vu(e.name,n,t.name))).map(e=>bu(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(yu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=yu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...xu(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},hd=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?hd(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=xu(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),wu(a,e)}),a},gd=(t,n,r,i)=>{let a=md(n),o=e=>Math.max(0,...e.map(e=>a.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?hd(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.Z(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.Z(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=El([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(t=>({location:t.location,check:()=>{let n=a.analyze(t.expression,/* @__PURE__ */ new Map).level,r=t.location.range;if(n!==0&&r)throw e.Y(`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${n}.`,r)}})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?hd(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.J(r)}})),...r],i);if(u.length>0)throw e.J(u,!1,void 0,i)},_d=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),vd=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),yd=/* @__PURE__ */ new Set([..._d,...vd,`Enabled`]),bd=/* @__PURE__ */ new Set([`~>`,`-+->`]),xd=/* @__PURE__ */ new Set([...bd,`\\cdot`]),Sd=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Cd=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),wd=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),Td=(e,t)=>Sd.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ed=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(_d.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(vd.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&bd.has(e.operator))return 224},o=(e,n,s)=>{let c=e.kind,l=s?1:513;(yd.has(c)||c===`UnboundedQuantifier`&&e.isTemporal===!0||c===`Apply`&&xd.has(e.operator))&&(r[0]|=l),yd.has(c)&&(r[0]|=16);let u=a(e);n&&u!==void 0&&(r[0]|=u);let d=n&&u===void 0,f=Ve(e);if(f!==void 0&&A(e)&&t.variableIndex.has(f)&&(s||(r[0]|=512),d&&(r[0]|=32)),f!==void 0&&!A(e)){let e=t.substitutions.get(f)??f,n=t.definitions.get(e),a=t.constants.has(f),o=t.variableIndex.get(f);if((o!==void 0||t.builtins.get(f)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=l),o!==void 0&&(d&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:d,isOperatorArgument:s||c===`OperatorReference`||c===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{Td(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),Cd.has(e)&&(r[0]|=8),wd.has(e)&&(r[0]|=256),!a&&Td(e,t)&&(r[0]|=16);let n=t.builtins.get(e);d&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}Be(e).forEach(e=>o(e,d,s||c===`Lambda`))};return e.forEach(e=>o(e,!0,!1)),{row:r,edges:i}},Dd=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Od=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),kd=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Ed(ze(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Dd(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Dd(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=Dd(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!Od(t[e],l[e*r]|p[e*r])))),h=Dd(a,r,m,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&270:e),words:r}},Ad=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?jd(ze(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},jd=(e,t)=>{let n=t.facts.words,r=Ed(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Ad(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Od(e.callee,r[0])||(i[0]|=r[0]&270)}),i},Md=(e,t)=>!(Ad(e,t)[0]&513),Nd=(e,t)=>!(Ad(e,t)[0]&512),Pd={any:2,repeated:4,streamed:8,replayed:260,varying:258},Fd=(e,t,n)=>(jd(e,t)[0]&Pd[n])!==0,Id=(e,t,n=`any`)=>(Ad(e,t)[0]&Pd[n])!==0,Ld=(e,t)=>{let n=Ad(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Rd=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},zd=(e,t)=>{let n=jd([e],t);return n[0]&16?void 0:Rd(n)},Bd=(e,t)=>!!(jd([e],t)[0]&1),Vd=(t,n,r)=>new e.A(`Applying ${t} to the following value,\nwhich is not ${n}:\n${j(L(r))}`),Hd=e=>It(e)?I(e):void 0,Ud=`a function with a finite domain`,Wd=(e,t,n)=>{let r=R(e,t,n),i=Hd(r);if(!i)throw Vd(n,Ud,r);return i},Gd=(e,t)=>{let n=R(e,1,t),r=Hd(n),i=r&&Yd(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Io(`second`,t,`bag`,n);return i},Kd=(e,t,n)=>{let r=t[n];if(!r||!Jd(r))throw Io(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},qd=(e,t)=>{if(!N(e)||!P(e))throw t();return F(e).elements},Jd=e=>e.range.every(e=>typeof e==`number`&&e>0),Yd=(e,t)=>{let n=e.domain.findIndex(e=>gr(t,e));return n===-1?void 0:e.range[n]},Xd=(e,t)=>{if(typeof e==`number`)return e;throw t()},Zd=(e,t,n)=>{let r=Xd(e,n)+Xd(t,n);if(Go(r))throw Ko(`${e}+${t}`);return r},Qd=(e,t,n,r,i)=>{let a=Xd(e.range[t],r),o=Yd(n,e.domain[t]);if(o===void 0)return a;let s=a-Xd(o,i);if(Go(s))throw Ko(`${a}-${o}`);return s},$d=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>gr(t,e[0]));a?a[1]=Zd(a[1],n,r):e.push([t,n])},ef=e=>e.domain.map((t,n)=>[t,e.range[n]]),tf=An([],[]),nf=t=>[Vo(`EmptyBag`,tf),z(`IsABag`,1,e=>{let t=Hd(R(e,0,`IsABag`));return t!==void 0&&Jd(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=Wd(e,0,`BagCardinality`),r=()=>Vd(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return Zd(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=Gd(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Gd(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>Hd(R(e,t,`(+)`))),n=Kd(e,t,0),r=Kd(e,t,1),i=ef(n),a=()=>Io(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>$d(i,e,r.range[t],a,n.domain.length)),Tr(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=Hd(t),i=Hd(n);if(!r)throw Io(`first`,`(-)`,`bag`,t);if(!i)throw Io(`second`,`(-)`,`bag`,n);let a=()=>Io(`first`,`(-)`,`bag`,t),o=()=>Io(`second`,`(-)`,`bag`,n);return Tr(r.domain.flatMap((e,t)=>{let n=Qd(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=qd(n,()=>Vd(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??tf;let i=()=>new e.A(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${j(L(n))}`),a=e=>{let t=Hd(e);if(!t)throw i();return t},o=ef(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>$d(o,e,t.range[n],i))}),Tr(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=Hd(t),i=Hd(n);if(!r)throw Vd(`\\sqsubseteq`,Ud,t);if(!i)throw Vd(`\\sqsubseteq`,Ud,n);let a=()=>Vd(`\\sqsubseteq`,`a bag`,t),o=()=>Vd(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Yd(i,e);return Xd(r.range[t],a)<=(n===void 0?0:Xd(n,o))})}),Ho(`BagOfAll`,2,e=>{let t=Bo(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=Hd(n);if(!r)throw Io(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>Io(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>$d(i,t.call([e]),r.range[n],a)),Tr(i)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!It(r))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${Qo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=I(r),a=F(br(i.range)).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.x(`Attempted to apply a function to ${L(i)}, which is not in its domain`);return yr(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>An(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>zi(Wd(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=qd(t,()=>Vd(`BagToSet`,Ud,t));return An([...n],n.map(()=>1))})],rf={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},af={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},of=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],sf=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
396
396
  `],[`r`,`\r`],[`f`,`\f`]]),cf=1024,lf=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=H.none,c=0,l=[rf.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===rf.emptyArray||e===rf.nonemptyArray?`[${d[t]}]`:e===rf.emptyDocument||e===rf.nonemptyDocument?``:`.${u[t]??``}`).join(``)}`,p=()=>` at line ${i+1} column ${r-a+1} path ${f()}`,m=t=>new e.x(`com.google.gson.stream.MalformedJsonException: ${t}${p()}
397
397
  See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),h=()=>new e.x(`java.io.EOFException: End of input${p()}`),g=()=>{if(!o)throw m(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},_=e=>`/\\;#=`.includes(e)?(g(),!1):!`{}[]:, \f\r
398
398
  `.includes(e),v=()=>{for(;r<t.length;){let e=t[r++];if(e===`
@@ -401,7 +401,7 @@ See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`)
401
401
  `)i++,a=r;else if(e===`/`){if(r===t.length)return e;g();let n=t[r];if(n!==`*`&&n!==`/`)return e;if(r++,n===`/`)v();else if(y(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),v();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},ee=()=>{let e=b();if(e===void 0)throw h();return e},te=()=>{let e=of.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return H.none;let n=e.lower.length;for(let i=0;i<n;i++){let n=t[r+i];if(n!==e.lower[i]&&n!==e.upper[i])return H.none}return r+n<t.length&&_(t[r+n])?H.none:(r+=n,e.token)},x=()=>{let e=af.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===cf)return H.none;let a=t[r+i];if(a===`-`){if(e===af.none)e=af.sign;else if(e===af.exponentE)e=af.exponentSign;else return H.none}else if(a===`+`){if(e!==af.exponentE)return H.none;e=af.exponentSign}else if(a===`e`||a===`E`){if(e!==af.digit&&e!==af.fractionDigit)return H.none;e=af.exponentE}else if(a===`.`){if(e!==af.digit)return H.none;e=af.decimal}else if(a<`0`||a>`9`){if(_(a))return H.none;break}else if(e===af.sign||e===af.none)n=a===`0`,e=af.digit;else if(e===af.digit){if(n)return H.none}else e===af.decimal?e=af.fractionDigit:(e===af.exponentE||e===af.exponentSign)&&(e=af.exponentDigit)}return i===cf||e!==af.digit&&e!==af.fractionDigit&&e!==af.exponentDigit?H.none:(c=i,H.number)},S=()=>{let e=l.length-1,n=l[e];if(n===rf.emptyArray)l[e]=rf.nonemptyArray;else if(n===rf.nonemptyArray){let e=ee();if(e===`]`)return H.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===rf.emptyObject||n===rf.nonemptyObject){if(l[e]=rf.danglingName,n===rf.nonemptyObject){let e=ee();if(e===`}`)return H.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=ee();if(t===`"`)return H.doubleQuotedName;if(t===`'`)return g(),H.singleQuotedName;if(t===`}`){if(n!==rf.nonemptyObject)return H.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return H.unquotedName;throw m(`Expected name`)}else if(n===rf.danglingName){l[e]=rf.nonemptyObject;let n=ee();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===rf.emptyDocument){if(b()===void 0)return H.eof;r--,t.startsWith(`)]}'
402
402
  `,r)&&(r+=5),l[e]=rf.nonemptyDocument}else if(n===rf.nonemptyDocument){if(b()===void 0)return H.eof;g(),r--}let i=b();if(i===void 0){if(n===rf.emptyDocument)return H.eof;throw h()}if(i===`]`&&n===rf.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==rf.emptyArray&&n!==rf.nonemptyArray)throw m(`Unexpected value`);return g(),r--,H.null}if(i===`'`)return g(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;r--;let a=te();if(a!==H.none)return a;let o=x();if(o!==H.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),H.unquoted},ne=()=>(s===H.none&&(s=S()),s),re=()=>{if(r===t.length)throw m(`Unterminated escape sequence`);let e=t[r++];if(e===`u`){if(r+4>t.length)throw m(`Unterminated escape sequence`);let e=t.slice(r,r+4);if(!/^[\da-fA-F]{4}$/.test(e))throw m(`Malformed Unicode escape \\u${e}`);return r+=4,String.fromCharCode(Number.parseInt(e,16))}let n=sf.get(e);if(n!==void 0)return n;if(e===`
403
403
  `)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},C=e=>{let n=``,o=r;for(;r<t.length;){let s=t[r++];if(s===e)return n+t.slice(o,r-1);s===`\\`?(n+=t.slice(o,r-1)+re(),o=r):s===`
404
- `&&(i++,a=r)}throw m(`Unterminated string`)},ie=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},ae=t=>{if(l.length-1>=255)throw new e.x(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${p()}`);l.push(t),u.push(void 0),d.push(0),s=H.none},w=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=H.none},oe=()=>{let e=ne();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},se=()=>{let e=ne(),t=e===H.unquotedName?ie():C(e===H.singleQuotedName?`'`:`"`);return s=H.none,u[l.length-1]=t,t},ce=e=>e===H.true||e===H.false?e===H.true:e===H.null?null:e===H.number?(r+=c,{literal:t.slice(r-c,r)}):e===H.unquoted?ie():C(e===H.singleQuoted?`'`:`"`),le=()=>{let e=ne();if(e===H.beginArray){ae(rf.emptyArray);let e=[];for(;oe();)e.push(le());return w(),e}if(e===H.beginObject){ae(rf.emptyObject);let e=/* @__PURE__ */ new Map;for(;oe();)e.set(se(),le());return w(),e}let t=ce(e);return s=H.none,d[l.length-1]++,t};if(ne()===H.eof)return null;let ue=le();return o=!1,ue!==null&&ne(),ue},uf=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),df=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),ff=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),pf=e=>{if(!It(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Lr(n):void 0},mf=(t,n)=>{let r=`tlc2.value.impl.${Zo(t)}`,i=`tlc2.value.impl.${n}`;return new e.x(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},hf=t=>new e.x(`Cannot convert value: unsupported value type tlc2.value.impl.${Zo(t)}`),gf=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),_f=e=>`[${e.map(xf).join(`,`)}]`,vf=e=>`{${Gt(e).map(e=>`${gf(typeof e[0]==`string`?e[0]:L(e[0]))}:${xf(e[1])}`).join(`,`)}}`,yf=e=>{let t=I(e),n=pi(t);return n?_f(n):vf(t)},bf=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,xf=e=>typeof e==`string`?gf(e):typeof e==`object`?e.kind===`ModelValue`?gf(e.name):Zo(e)===`RecordValue`?vf(I(e)):Sf(e):String(e),Sf=e=>{let t=Zo(e);if(t===`TupleValue`)return _f(I(e).range);if(bf(t))return yf(e);if(zr(e))return _f(F(e).elements);throw hf(e)},Cf=e=>e.map(e=>`${xf(e)}\n`).join(``),wf=e=>{let t=Zo(e);if(t===`RecordValue`)return vf(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${xf(e)}`).join(`,`)}}`;if(bf(t))return yf(e);throw hf(e)},Tf=t=>{if(t===null)throw new e.x(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return pn(t);if(Array.isArray(t))return Ir(t.map(Tf));if(t instanceof Map)return Lr([...t].map(e=>[pn(e[0]),Tf(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||Go(n))throw new e.x(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},Ef=t=>{if(typeof t!=`string`)throw new e.x(`Cannot cast tlc2.value.impl.${Zo(t)} to tlc2.value.impl.StringValue`);return t},Df=(e,t)=>{let n=Li(e,t);if(typeof n!=`string`)throw mf(n,`StringValue`);return n},Of=t=>{if(!df.has(t.toLowerCase()))throw ff.has(t.toLowerCase())?new e.V(`IOUtils!Serialize does not support the charset ${t}`):new e.x(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},kf=(t,n,r,i)=>{let a=r.find(e=>!uf.has(e));if(a!==void 0)throw new e.x(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.x(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.x(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.V(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.x(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.x(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Af=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},jf=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.x(`${n} (No such file or directory)`);return r},Mf=e=>[es(Uo(`ToJson`,1,e=>pn(xf(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),es(Uo(`ToJsonArray`,1,e=>pn(Sf(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),es(Uo(`ToJsonObject`,1,e=>pn(wf(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),es(Uo(`JsonSerialize`,2,t=>{let n=Ef(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!pi(r)&&!pf(r))throw Io(`second`,`JsonSerialize`,`sequence or record`,r);return Af(e,n),e.writeFile?.(n,xf(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),es(Uo(`ndJsonSerialize`,2,t=>{let n=Ef(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=pi(r);if(!i)throw Io(`second`,`ndJsonSerialize`,`sequence`,r);return Af(e,n),e.writeFile?.(n,Cf(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),es(Uo(`JsonDeserialize`,1,t=>Tf(lf(jf(e,Ef(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),es(Uo(`ndJsonDeserialize`,1,t=>Ir(jf(e,Ef(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Tf(lf(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Nf=(e,t)=>[es(os(`Serialize`,3,(n,r)=>{let i=ss(n,2,`Serialize`)(),a=pf(i);if(!a)throw Io(`third`,`ndJsonSerialize`,`sequence`,i);if(Df(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=ss(n,0,`Serialize`)(),s=pi(o);if(!s)throw Io(`first`,`Serialize`,`sequence`,o);let c=ss(n,1,`Serialize`)();if(typeof c!=`string`)throw Io(`second`,`ndJsonSerialize`,`sequence`,c);let l=Li(a,`openOptions`);if(Zo(l)!==`TupleValue`)throw mf(l,`TupleValue`);let u=Df(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw mf(e,`StringValue`);return e});return Of(u),kf(e,c,d,Cf(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],Pf={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Ff=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=Dn(),s=e=>n.push(e&255),c=e=>{s(e>>8),s(e)},l=e=>{c(e>>16),c(e)},u=e=>e>32767?l(-e):c(e),d=e=>{s(Pf.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(Pf.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(Pf.boolean),s(+!!e);return}if(typeof e==`number`){s(Pf.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(Pf.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(Pf.interval),l(e.low),l(e.high);return}let t=r.get(e);if(t!==void 0){f(t);return}if(r.set(e,a++),Pt(e)){let t=F(e).elements;s(Pf.set),l(t.length),t.forEach(p);return}let n=I(e),m=Nn(e);m===`tuple`?(s(Pf.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(Pf.record),l(n.domain.length),n.domain.forEach((e,t)=>{let r=String(e),o=i.get(r);o===void 0?(i.set(r,a++),d(r)):f(o),p(n.range[t])})):(s(Pf.function),u(n.domain.length),s(1),n.domain.forEach((e,t)=>{p(e),p(n.range[t])}))};return p(e),(0,t.gzipSync)(Uint8Array.from(n))},If=e=>[es(Uo(`_TLCTraceSerialize`,2,t=>{let n=Ef(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Ff(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],Lf=25214903917n,Rf=(1n<<48n)-1n,zf=e=>{let t=(BigInt.asUintN(64,e)^Lf)&Rf,n=e=>(t=t*Lf+11n&Rf,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Lf)&Rf},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Bf=[],Vf=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Hf=()=>{for(let e=1277011;Bf.length<1341;e++)Vf(e)&&Bf.push(e);return Bf},Uf=e=>{let t=Hf(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Wf=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},Gf=e=>{for(let t=Math.max(e,9);;t++){let e=Wf(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},Kf=(e,t,n)=>{if(t<=0)return[];let r=Gf(t),i=BigInt(n.nextInt(t)),a=BigInt(Uf(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},qf=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Tt),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Jf=(1n<<63n)-1n-24n,Yf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Jf*BigInt(n)+i)%t;return r<0n?r+t:r})},Xf=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Zf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Pr(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>An(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>Lr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:Ir}}},Qf=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,$f=(e,t,n,r)=>{if(ai(t))return[];let i=r===`1.7.4`?qf:Kf;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Qf(t,r)?void 0:Zf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?Yf(e,t,n):i(e,Number(t),n)).map(e=>a.create(Xf(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},ep=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Lo(t.domain,`RandomElement`,t).elements];return An(e,e.map(()=>ep(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Lr(t.names.map((e,r)=>[e,ep(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Ir(t.factors.map(e=>ep(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.x(`Attempted to retrieve out-of-bounds element from the interval value ${M(L(t))}.`);return t.low+i}let r=Lo(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.x(`Index ${i} out of bounds for length ${r.length}`);return r[i]},tp=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Io(t,n,`nonnegative integer`,e);return e},np=(e,t,n,r)=>yr(Array.from({length:t},()=>yr(e.filter(()=>r.nextDouble()<n)))),rp=(e,t)=>{let n=`RandomSetOfSubsets`,r=tp(R(e,0,n),`first`,n),i=tp(R(e,1,n),`second`,n),a=R(e,2,n);if(!Pt(a)||!P(a))throw Io(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw Io(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Io(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return np(o,r,o.length===0?0:i/o.length,t.getRandom())},ip=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,ap=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,op=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(ip.test(t))return Number(t.replace(/[fFdD]$/,``));let n=ap.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},sp=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=tp(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw Io(`second`,n,`string literal representing a probability`,i);let a=op(i);if(a===void 0||a<0||a>1)throw Io(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!Pt(o)||gn(o)||!ui(o))throw Io(`third`,n,`finite set`,o);let s=ci(o);if(32-Math.clz32(r)>s&&r>1<<s)throw Io(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return np(F(o).elements,r,a,e.getRandom())}),cp=t=>[es(z(`RandomSubset`,2,n=>{let r=tp(R(n,0,`RandomSubset`),`first`,`RandomSubset`),i=R(n,1,`RandomSubset`);if(!zr(i)||!ui(i))throw Io(`second`,`RandomSubset`,`a finite set`,i);let a=Qf(i,t.version);if(a&&a.reduce((e,t)=>e*F(t).elements.length,1)>kt())throw new e.x(At());return yr($f(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,e=>rp(e,t)),z(`TestRandomSetOfSubsets`,3,e=>Ir(Array.from({length:5},()=>F(rp(e,t)).elements.length)))],lp=(e,t=0n)=>{let n=zf(t),r=zf(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Lr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ja,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},reseedRandom:()=>{i=void 0},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},up=e=>Tr([...e.possibleCounts].map(e=>[e[0],e[1]])),dp=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,up(e)]]),fp=e=>Lr([[`name`,e??`UnnamedAction`],[`location`,Lr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),pp=/* @__PURE__ */ new WeakSet,mp=e=>Mn(Er(e),`record`),hp=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(pn);let r=[[`action`,yr(e)],[`state`,yr(t)]],i=mp(n?r:[...r,[`console`,!1]]);return pp.add(i),i},gp=(e,t,n,r=!0)=>{let i=e.map((e,t)=>Ir([t+1,Lr(Object.entries(e))])),a=i.slice(1).map((e,n)=>Ir([i[n],t[n],e])),o=n?[Ir([i[i.length-1],n.action,i[n.start]])]:[];return hp([...a,...o],i,r)},_p=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return dp(e).get(t)},vp=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0||!t.pause)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),L(i));else throw new e.A(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${M(L(r))}`)},yp=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),bp=e=>e.every(e=>e!==void 0),xp=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!j(e);if(i&&t.variableIndex.has(r))return 1;let a=ze(e).map(e=>xp(e,t,n)),o=i?zg(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(xp(o.body,t,n))),Math.max(0,...a)},Sp=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[os(`AssertError`,2,t=>{let r=Bo(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.x(`In computing AssertError, a non-string expression (${yp(r)}) was used as the err of an AssertError(err, exp).`);let i=ss(t,0,`AssertError`)();try{ss(t,1,`AssertError`)()}catch(t){if(t instanceof e.x)return ct(t.message,n.isTool)===i;throw t}return!1}),Uo(`TLCGetOrDefault`,2,e=>_p(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),Uo(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!bp(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.x(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?Ir(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Lr(i===void 0?t:[[`_action`,i],...t])})):Ir([Lr([])])}),Uo(`CounterExample`,0,()=>n.counterExample??hp([],[])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(typeof n!=`object`||!pp.has(n))throw new e.A(`The argument of ToTrace should be a CounterExample, but instead it is:\n${M(L(n))}`);let r=F(Li(n,`state`)).elements.map(e=>pi(e)??[]);return Ir(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,t=>{let n=R(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.A(`The argument of ModelValue should be a string, but instead it is:\n${M(L(n))}`);return En(n)}),os(`TLCDefer`,1,(e,t)=>{let r=Bo(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...os(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!bp(a)||i?.next&&n.isSeen(a)))return!0;let o=Bo(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.x(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Qo(s)}) was used as the condition of an IF.\n${o.expression?yp(o.expression):``}`);if(s||!i?.next||!bp(a)||!i.state||!bp(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=e=>t(Qe(n.isTool,Ye.moduleOverrideStdout,Xe.none,e));for(;;){u(`Extend behavior of length ${n.getLevel(c)} with a "${l?.name}" step [<Action ${l?.location.range&&e.Z(l.location.range)}>]? (Yes/no/explored/states/diff):`);let t=n.readLine?.();if(t===void 0)throw new e.y;if(/^[\0-\x20]*$/.test(t)||t.toLowerCase().startsWith(`y`))return!0;if(t[0]===`s`)u(`${ya(n.toRecord(c)).trimEnd()}\n~>\n${ya(n.toRecord(a)).trimEnd()}`);else if(t[0]===`d`)u(ya(n.toRecord(a),n.toRecord(c)));else if(t[0]===`e`){if(n.markExplored)return n.markExplored(a),!0;if(n.getSimulationValue===void 0)throw new e.V(`tla-ts can't mark a state explored while it searches depth first.`);u(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(t[0]===`n`)return!1}}),isActionLevel:!0},os(`TLCCache`,2,(e,t)=>{let i=Bo(e,0,`TLCCache`),o=ia(ss(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=xp(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Yi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ja([t])))}),os(`TLCEvalDefinition`,1,(t,n)=>{let r=ss(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.A(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${M(L(r))}`);let i=n?zg(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new e.A(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${M(L(r))}`);if(i.kind===`Operator`&&i.params.length>0){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.A(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},Cp=(e,t)=>[Uo(`_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}),Uo(`_Counts`,0,()=>up(t)),Uo(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(up(t),!0)),!1)}),Uo(`_PrintCounts`,0,()=>(e(L(up(t),!0)),!0))],wp=e=>`${e.getUTCFullYear()}.${lt(e.getUTCMonth()+1)}.${lt(e.getUTCDate())}.${lt(e.getUTCHours())}${lt(e.getUTCMinutes())}${lt(e.getUTCSeconds())}`,Tp=e=>Tr([...e].map(e=>[e[0],Ir([e[1]])])),Ep=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Dp=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Op=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),kp=(t,n,r)=>{if(t.version===`1.7.4`?!Dp.has(n)||!t.isStarted&&Op.has(n):!t.isStarted&&Ep.has(n))throw new e.A(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return a;case`stats`:return mp([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return mp([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,Sa()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return mp([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,pn(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,pn(wp(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return fp(void 0);case`all`:return Tp(t.registers);case`all:named`:return Tp(dp(t))}if(n.startsWith(`s:`)){let r=dp(t).get(n);if(r===void 0)throw new e.A(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return pn(t.properties.get(n.slice(2))??n);throw new e.A(`TLCGet(${n}) was undefined.`)},Ap=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.A(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.A(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${M(L(n))}`);return kp(t,n,r?.state)},jp=e=>e.length===0?[[]]:e.flatMap((t,n)=>jp([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Mp=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(Mp),e.kind===`Function`&&e.range.forEach(Mp))},Np=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:An(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},Pp=(t,n)=>[z(`Print`,2,e=>(t(ha([R(e,0,`Print`),R(e,1,`Print`)]).map(M).join(` `)),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(M(ha([R(e,0,`PrintT`)])[0])),!0)),z(`Assert`,2,t=>{if(R(t,0,`Assert`)!==!0)throw new e.A(`The first argument of Assert evaluated to FALSE; the second argument was:\n${M(L(R(t,1,`Assert`)))}`,e.rt.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Tr([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=It(t)?I(t):void 0,i=It(n)?I(n):void 0;if(!r)throw Io(`first`,`@@`,`function`,t);if(!i)throw Io(`second`,`@@`,`function`,n);let a=Wt(r),o=Wt(i).filter(e=>!a.some(t=>gr(e[0],t[0])));return Er([...a,...o])}),z(`ToString`,1,e=>pn(L(R(e,0,`ToString`),!0))),{...os(`TLCEval`,1,(e,t)=>{let n=Np(ss(e,0,`TLCEval`)());return t===void 0&&Mp(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=Lo(R(e,0,`Permutations`),`Permutations`).elements;return yr(jp(t).map(e=>Tr(t.map((t,n)=>[t,e[n]]))))}),Ho(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=pi(t);if(!n)throw Io(`first`,`SortSeq`,`natural number`,t);let r=Bo(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw Io(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),Ir(a)}),n.version===`1.7.4`?es({...Uo(`TLCGet`,1,(e,t)=>Ap(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):es(os(`TLCGet`,1,(e,t)=>Ap(n,ss(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Uo(`TLCSet`,2,e=>(vp(n,t,R(e,0,`TLCSet`),R(e,1,`TLCSet`)),!0)),Vo(`Any`,bn),z(`RandomElement`,1,e=>ep(R(e,0,`RandomElement`),n.getRandom()))],Fp=`----------------------------- MODULE Bags --------------------------------
404
+ `&&(i++,a=r)}throw m(`Unterminated string`)},ie=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},ae=t=>{if(l.length-1>=255)throw new e.x(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${p()}`);l.push(t),u.push(void 0),d.push(0),s=H.none},w=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=H.none},oe=()=>{let e=ne();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},se=()=>{let e=ne(),t=e===H.unquotedName?ie():C(e===H.singleQuotedName?`'`:`"`);return s=H.none,u[l.length-1]=t,t},ce=e=>e===H.true||e===H.false?e===H.true:e===H.null?null:e===H.number?(r+=c,{literal:t.slice(r-c,r)}):e===H.unquoted?ie():C(e===H.singleQuoted?`'`:`"`),le=()=>{let e=ne();if(e===H.beginArray){ae(rf.emptyArray);let e=[];for(;oe();)e.push(le());return w(),e}if(e===H.beginObject){ae(rf.emptyObject);let e=/* @__PURE__ */ new Map;for(;oe();)e.set(se(),le());return w(),e}let t=ce(e);return s=H.none,d[l.length-1]++,t};if(ne()===H.eof)return null;let ue=le();return o=!1,ue!==null&&ne(),ue},uf=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),df=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),ff=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),pf=e=>{if(!It(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Lr(n):void 0},mf=(t,n)=>{let r=`tlc2.value.impl.${Zo(t)}`,i=`tlc2.value.impl.${n}`;return new e.x(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},hf=t=>new e.x(`Cannot convert value: unsupported value type tlc2.value.impl.${Zo(t)}`),gf=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),_f=e=>`[${e.map(xf).join(`,`)}]`,vf=e=>`{${Gt(e).map(e=>`${gf(typeof e[0]==`string`?e[0]:L(e[0]))}:${xf(e[1])}`).join(`,`)}}`,yf=e=>{let t=I(e),n=pi(t);return n?_f(n):vf(t)},bf=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,xf=e=>typeof e==`string`?gf(e):typeof e==`object`?e.kind===`ModelValue`?gf(e.name):Zo(e)===`RecordValue`?vf(I(e)):Sf(e):String(e),Sf=e=>{let t=Zo(e);if(t===`TupleValue`)return _f(I(e).range);if(bf(t))return yf(e);if(zr(e))return _f(F(e).elements);throw hf(e)},Cf=e=>e.map(e=>`${xf(e)}\n`).join(``),wf=e=>{let t=Zo(e);if(t===`RecordValue`)return vf(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${xf(e)}`).join(`,`)}}`;if(bf(t))return yf(e);throw hf(e)},Tf=t=>{if(t===null)throw new e.x(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return pn(t);if(Array.isArray(t))return Ir(t.map(Tf));if(t instanceof Map)return Lr([...t].map(e=>[pn(e[0]),Tf(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||Go(n))throw new e.x(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},Ef=t=>{if(typeof t!=`string`)throw new e.x(`Cannot cast tlc2.value.impl.${Zo(t)} to tlc2.value.impl.StringValue`);return t},Df=(e,t)=>{let n=Li(e,t);if(typeof n!=`string`)throw mf(n,`StringValue`);return n},Of=t=>{if(!df.has(t.toLowerCase()))throw ff.has(t.toLowerCase())?new e.V(`IOUtils!Serialize does not support the charset ${t}`):new e.x(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},kf=(t,n,r,i)=>{let a=r.find(e=>!uf.has(e));if(a!==void 0)throw new e.x(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.x(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.x(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.V(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.x(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.x(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Af=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},jf=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.x(`${n} (No such file or directory)`);return r},Mf=e=>[es(Uo(`ToJson`,1,e=>pn(xf(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),es(Uo(`ToJsonArray`,1,e=>pn(Sf(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),es(Uo(`ToJsonObject`,1,e=>pn(wf(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),es(Uo(`JsonSerialize`,2,t=>{let n=Ef(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!pi(r)&&!pf(r))throw Io(`second`,`JsonSerialize`,`sequence or record`,r);return Af(e,n),e.writeFile?.(n,xf(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),es(Uo(`ndJsonSerialize`,2,t=>{let n=Ef(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=pi(r);if(!i)throw Io(`second`,`ndJsonSerialize`,`sequence`,r);return Af(e,n),e.writeFile?.(n,Cf(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),es(Uo(`JsonDeserialize`,1,t=>Tf(lf(jf(e,Ef(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),es(Uo(`ndJsonDeserialize`,1,t=>Ir(jf(e,Ef(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Tf(lf(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Nf=(e,t)=>[es(os(`Serialize`,3,(n,r)=>{let i=ss(n,2,`Serialize`)(),a=pf(i);if(!a)throw Io(`third`,`ndJsonSerialize`,`sequence`,i);if(Df(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=ss(n,0,`Serialize`)(),s=pi(o);if(!s)throw Io(`first`,`Serialize`,`sequence`,o);let c=ss(n,1,`Serialize`)();if(typeof c!=`string`)throw Io(`second`,`ndJsonSerialize`,`sequence`,c);let l=Li(a,`openOptions`);if(Zo(l)!==`TupleValue`)throw mf(l,`TupleValue`);let u=Df(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw mf(e,`StringValue`);return e});return Of(u),kf(e,c,d,Cf(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],Pf={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Ff=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=Dn(),s=e=>n.push(e&255),c=e=>{s(e>>8),s(e)},l=e=>{c(e>>16),c(e)},u=e=>e>32767?l(-e):c(e),d=e=>{s(Pf.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(Pf.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(Pf.boolean),s(+!!e);return}if(typeof e==`number`){s(Pf.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(Pf.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(Pf.interval),l(e.low),l(e.high);return}let t=r.get(e);if(t!==void 0){f(t);return}if(r.set(e,a++),N(e)){let t=F(e).elements;s(Pf.set),l(t.length),t.forEach(p);return}let n=I(e),m=Nn(e);m===`tuple`?(s(Pf.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(Pf.record),l(n.domain.length),n.domain.forEach((e,t)=>{let r=String(e),o=i.get(r);o===void 0?(i.set(r,a++),d(r)):f(o),p(n.range[t])})):(s(Pf.function),u(n.domain.length),s(1),n.domain.forEach((e,t)=>{p(e),p(n.range[t])}))};return p(e),(0,t.gzipSync)(Uint8Array.from(n))},If=e=>[es(Uo(`_TLCTraceSerialize`,2,t=>{let n=Ef(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Ff(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],Lf=25214903917n,Rf=(1n<<48n)-1n,zf=e=>{let t=(BigInt.asUintN(64,e)^Lf)&Rf,n=e=>(t=t*Lf+11n&Rf,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Lf)&Rf},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Bf=[],Vf=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Hf=()=>{for(let e=1277011;Bf.length<1341;e++)Vf(e)&&Bf.push(e);return Bf},Uf=e=>{let t=Hf(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Wf=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},Gf=e=>{for(let t=Math.max(e,9);;t++){let e=Wf(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},Kf=(e,t,n)=>{if(t<=0)return[];let r=Gf(t),i=BigInt(n.nextInt(t)),a=BigInt(Uf(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},qf=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Et),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Jf=(1n<<63n)-1n-24n,Yf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Jf*BigInt(n)+i)%t;return r<0n?r+t:r})},Xf=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,Zf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Pr(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>An(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>Lr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:Ir}}},Qf=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,$f=(e,t,n,r)=>{if(ai(t))return[];let i=r===`1.7.4`?qf:Kf;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Qf(t,r)?void 0:Zf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?Yf(e,t,n):i(e,Number(t),n)).map(e=>a.create(Xf(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},ep=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Lo(t.domain,`RandomElement`,t).elements];return An(e,e.map(()=>ep(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Lr(t.names.map((e,r)=>[e,ep(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Ir(t.factors.map(e=>ep(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.x(`Attempted to retrieve out-of-bounds element from the interval value ${j(L(t))}.`);return t.low+i}let r=Lo(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.x(`Index ${i} out of bounds for length ${r.length}`);return r[i]},tp=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Io(t,n,`nonnegative integer`,e);return e},np=(e,t,n,r)=>yr(Array.from({length:t},()=>yr(e.filter(()=>r.nextDouble()<n)))),rp=(e,t)=>{let n=`RandomSetOfSubsets`,r=tp(R(e,0,n),`first`,n),i=tp(R(e,1,n),`second`,n),a=R(e,2,n);if(!N(a)||!P(a))throw Io(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw Io(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Io(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return np(o,r,o.length===0?0:i/o.length,t.getRandom())},ip=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,ap=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,op=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(ip.test(t))return Number(t.replace(/[fFdD]$/,``));let n=ap.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},sp=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=tp(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw Io(`second`,n,`string literal representing a probability`,i);let a=op(i);if(a===void 0||a<0||a>1)throw Io(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!N(o)||gn(o)||!ui(o))throw Io(`third`,n,`finite set`,o);let s=ci(o);if(32-Math.clz32(r)>s&&r>1<<s)throw Io(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return np(F(o).elements,r,a,e.getRandom())}),cp=t=>[es(z(`RandomSubset`,2,n=>{let r=tp(R(n,0,`RandomSubset`),`first`,`RandomSubset`),i=R(n,1,`RandomSubset`);if(!zr(i)||!ui(i))throw Io(`second`,`RandomSubset`,`a finite set`,i);let a=Qf(i,t.version);if(a&&a.reduce((e,t)=>e*F(t).elements.length,1)>At())throw new e.x(jt());return yr($f(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,e=>rp(e,t)),z(`TestRandomSetOfSubsets`,3,e=>Ir(Array.from({length:5},()=>F(rp(e,t)).elements.length)))],lp=(e,t=0n)=>{let n=zf(t),r=zf(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Lr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ja,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},reseedRandom:()=>{i=void 0},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},up=e=>Tr([...e.possibleCounts].map(e=>[e[0],e[1]])),dp=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,up(e)]]),fp=e=>Lr([[`name`,e??`UnnamedAction`],[`location`,Lr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),pp=/* @__PURE__ */ new WeakSet,mp=e=>Mn(Er(e),`record`),hp=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(pn);let r=[[`action`,yr(e)],[`state`,yr(t)]],i=mp(n?r:[...r,[`console`,!1]]);return pp.add(i),i},gp=(e,t,n,r=!0)=>{let i=e.map((e,t)=>Ir([t+1,Lr(Object.entries(e))])),a=i.slice(1).map((e,n)=>Ir([i[n],t[n],e])),o=n?[Ir([i[i.length-1],n.action,i[n.start]])]:[];return hp([...a,...o],i,r)},_p=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return dp(e).get(t)},vp=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0||!t.pause)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),L(i));else throw new e.A(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${j(L(r))}`)},yp=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),bp=e=>e.every(e=>e!==void 0),xp=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!A(e);if(i&&t.variableIndex.has(r))return 1;let a=Be(e).map(e=>xp(e,t,n)),o=i?Vg(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(xp(o.body,t,n))),Math.max(0,...a)},Sp=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[os(`AssertError`,2,t=>{let r=Bo(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.x(`In computing AssertError, a non-string expression (${yp(r)}) was used as the err of an AssertError(err, exp).`);let i=ss(t,0,`AssertError`)();try{ss(t,1,`AssertError`)()}catch(t){if(t instanceof e.x)return lt(t.message,n.isTool)===i;throw t}return!1}),Uo(`TLCGetOrDefault`,2,e=>_p(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),Uo(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!bp(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.x(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?Ir(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Lr(i===void 0?t:[[`_action`,i],...t])})):Ir([Lr([])])}),Uo(`CounterExample`,0,()=>n.counterExample??hp([],[])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(typeof n!=`object`||!pp.has(n))throw new e.A(`The argument of ToTrace should be a CounterExample, but instead it is:\n${j(L(n))}`);let r=F(Li(n,`state`)).elements.map(e=>pi(e)??[]);return Ir(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,t=>{let n=R(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.A(`The argument of ModelValue should be a string, but instead it is:\n${j(L(n))}`);return En(n)}),os(`TLCDefer`,1,(e,t)=>{let r=Bo(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...os(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!bp(a)||i?.next&&n.isSeen(a)))return!0;let o=Bo(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.x(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Qo(s)}) was used as the condition of an IF.\n${o.expression?yp(o.expression):``}`);if(s||!i?.next||!bp(a)||!i.state||!bp(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=e=>t($e(n.isTool,Xe.moduleOverrideStdout,Ze.none,e));for(;;){u(`Extend behavior of length ${n.getLevel(c)} with a "${l?.name}" step [<Action ${l?.location.range&&e.Z(l.location.range)}>]? (Yes/no/explored/states/diff):`);let t=n.readLine?.();if(t===void 0)throw new e.y;if(/^[\0-\x20]*$/.test(t)||t.toLowerCase().startsWith(`y`))return!0;if(t[0]===`s`)u(`${ya(n.toRecord(c)).trimEnd()}\n~>\n${ya(n.toRecord(a)).trimEnd()}`);else if(t[0]===`d`)u(ya(n.toRecord(a),n.toRecord(c)));else if(t[0]===`e`){if(n.markExplored)return n.markExplored(a),!0;if(n.getSimulationValue===void 0)throw new e.V(`tla-ts can't mark a state explored while it searches depth first.`);u(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(t[0]===`n`)return!1}}),isActionLevel:!0},os(`TLCCache`,2,(e,t)=>{let i=Bo(e,0,`TLCCache`),o=ia(ss(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=xp(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Yi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ja([t])))}),os(`TLCEvalDefinition`,1,(t,n)=>{let r=ss(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.A(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${j(L(r))}`);let i=n?Vg(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new e.A(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${j(L(r))}`);if(i.kind===`Operator`&&i.params.length>0){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.A(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},Cp=(e,t)=>[Uo(`_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}),Uo(`_Counts`,0,()=>up(t)),Uo(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(up(t),!0)),!1)}),Uo(`_PrintCounts`,0,()=>(e(L(up(t),!0)),!0))],wp=e=>`${e.getUTCFullYear()}.${ut(e.getUTCMonth()+1)}.${ut(e.getUTCDate())}.${ut(e.getUTCHours())}${ut(e.getUTCMinutes())}${ut(e.getUTCSeconds())}`,Tp=e=>Tr([...e].map(e=>[e[0],Ir([e[1]])])),Ep=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Dp=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Op=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),kp=(t,n,r)=>{if(t.version===`1.7.4`?!Dp.has(n)||!t.isStarted&&Op.has(n):!t.isStarted&&Ep.has(n))throw new e.A(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return a;case`stats`:return mp([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return mp([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,Sa()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return mp([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,pn(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,pn(wp(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return fp(void 0);case`all`:return Tp(t.registers);case`all:named`:return Tp(dp(t))}if(n.startsWith(`s:`)){let r=dp(t).get(n);if(r===void 0)throw new e.A(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return pn(t.properties.get(n.slice(2))??n);throw new e.A(`TLCGet(${n}) was undefined.`)},Ap=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.A(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.A(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${j(L(n))}`);return kp(t,n,r?.state)},jp=e=>e.length===0?[[]]:e.flatMap((t,n)=>jp([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Mp=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(Mp),e.kind===`Function`&&e.range.forEach(Mp))},Np=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:An(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},Pp=(t,n)=>[z(`Print`,2,e=>(t(ha([R(e,0,`Print`),R(e,1,`Print`)]).map(j).join(` `)),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(j(ha([R(e,0,`PrintT`)])[0])),!0)),z(`Assert`,2,t=>{if(R(t,0,`Assert`)!==!0)throw new e.A(`The first argument of Assert evaluated to FALSE; the second argument was:\n${j(L(R(t,1,`Assert`)))}`,e.rt.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Tr([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=It(t)?I(t):void 0,i=It(n)?I(n):void 0;if(!r)throw Io(`first`,`@@`,`function`,t);if(!i)throw Io(`second`,`@@`,`function`,n);let a=Wt(r),o=Wt(i).filter(e=>!a.some(t=>gr(e[0],t[0])));return Er([...a,...o])}),z(`ToString`,1,e=>pn(L(R(e,0,`ToString`),!0))),{...os(`TLCEval`,1,(e,t)=>{let n=Np(ss(e,0,`TLCEval`)());return t===void 0&&Mp(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=Lo(R(e,0,`Permutations`),`Permutations`).elements;return yr(jp(t).map(e=>Tr(t.map((t,n)=>[t,e[n]]))))}),Ho(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=pi(t);if(!n)throw Io(`first`,`SortSeq`,`natural number`,t);let r=Bo(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw Io(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),Ir(a)}),n.version===`1.7.4`?es({...Uo(`TLCGet`,1,(e,t)=>Ap(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):es(os(`TLCGet`,1,(e,t)=>Ap(n,ss(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Uo(`TLCSet`,2,e=>(vp(n,t,R(e,0,`TLCSet`),R(e,1,`TLCSet`)),!0)),Vo(`Any`,bn),z(`RandomElement`,1,e=>ep(R(e,0,`RandomElement`),n.getRandom()))],Fp=`----------------------------- MODULE Bags --------------------------------
405
405
  (**************************************************************************)
406
406
  (* A bag, also called a multiset, is a set that can contain multiple *)
407
407
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -1778,16 +1778,16 @@ _TEPosition ==
1778
1778
  ELSE TLCGet("level") + 1
1779
1779
 
1780
1780
  =============================================================================
1781
- `]]),Rp=(e=`master`)=>e===`1.7.4`?Lp:Ip,zp=(e,t)=>e.every(e=>vi(e,t)),Bp=yr([!1,!0]);mr(Bp);const Vp=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return wr(Vp(e,t,r),Vp(e,r,n))},Hp=[`\\cup`,`\\cap`,`\\`],Up=e=>typeof e==`object`&&e.kind===`MixedSet`,Wp=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Gp=(e,t,n)=>{t.kind===`Interval`&&ci(t);let r=t.kind===`Interval`?t:pr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return Nt(r,e=>{vi(e,n)===i&&jt(a,e)}),Wp(t)?kn(a):br(a)}if(ai(t))return n;if(!Ft(n))return Ln({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return Nt(r,e=>jt(i,e)),Nt(n.kind===`Interval`?n:F(n).elements,e=>{vi(e,t)||jt(i,e)}),br(i)},Kp=(e,t)=>{let n=(t,n)=>zo([ss(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},qp=[Vo(`TRUE`,!0),Vo(`FALSE`,!1),Vo(`BOOLEAN`,Bp),Vo(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Wo(`=`,gr),Wo(`#`,(e,t)=>!gr(e,t)),z(`~`,1,e=>!zo(e,0,`~`)),z(`<=>`,2,e=>zo(e,0,`<=>`)===zo(e,1,`<=>`)),Kp(`/\\`,(e,t)=>e&&t()),Kp(`\\/`,(e,t)=>e||t()),Kp(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>vi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!vi(R(e,0,`\\notin`),R(e,1,`\\notin`))),Wo(`\\subseteq`,(t,n)=>{if(!Pt(t))throw new e.x(`\\subseteq expects a set but received ${L(t)}`);if(typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&P(t.base))return zp(F(t.base).elements,n.base);if(typeof t==`object`&&t.kind===`Interval`){if(typeof n==`object`&&n.kind===`Interval`&&n.low<=t.low&&n.high>=t.high)return!0;for(let e=t.low;e<=t.high;e++)if(!vi(e,n))return!1;return!0}return!$r(t,e=>!vi(e,n))}),...Hp.map(t=>z(t,2,n=>{let r=R(n,0,t),i=R(n,1,t),a=t!==`\\cup`&&typeof i==`object`&&i.kind===`Interval`&&typeof r==`object`&&r.kind!==`Interval`;if(Ft(r)&&Ft(i)&&!Up(r)&&!Up(i)&&!a&&!Mt(r)&&!Mt(i)){if(t===`\\cup`&&ai(r))return i;let n=t===`\\cup`?wr:t===`\\cap`?Cr:Sr;return gi((r,i)=>{let a=F(r),o=F(i),s=n(a,o);if(t===`\\cup`){let t=pr(a),n=Sr(o,a).elements,r=t===a.elements&&(n.length===0||Cn(t[t.length-1],n[0])<0);if(t.length+n.length>kt())throw new e.P(At());if(r&&!a.isNormalized)return s;let i=s===a?On(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=Wp(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>vi(e,s)))),s},(e,n)=>Gp(t,e,n),r,i)}return Ft(r)?Gp(t,r,i):t!==`\\`&&Ft(i)?Gp(t,i,r):Ln({kind:`SetOperation`,operator:t,left:r,right:i})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=Rt(t)?pr(t):[],r=n.filter(Rt);if(!Rt(t)||r.length!==n.length)return Ln({kind:`Union`,base:t});let i=r.flatMap(pr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{vi(t,e)||jt(e.elements,t)}),br(e.elements)};return Up(t)||r.some(Up)?a():r.length===0?xr:gi(e=>fi(Vp(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!It(n))throw new e.x(`DOMAIN expects a function but received ${L(n)}`);return zi(n)})],Jp=ns(`Integers`,`Neg`,`IntValue`,1),Yp=t=>{let n=ns(t,`DotDot`,`IntervalValue`,2);return[rs(t,`+`,`Plus`,(e,t)=>e+t),rs(t,`-`,`Minus`,(e,t)=>e-t),rs(t,`*`,`Times`,(e,t)=>e*t),rs(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.A(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.A(`0^0 is undefined.`);return t**n}),rs(t,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new e.A(`The second argument of \\div is 0.`);let r=Math.floor(t/n);if(Go(r))throw Ko(`${t} \\div ${n}`);return r}),rs(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.A(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),z(`..`,2,e=>{let t=R(e,0,`..`),r=ts(R(e,1,`..`),n);return{kind:`Interval`,low:ts(t,n),high:r}})]},Xp=Yp(`Naturals`),Zp=Yp(`Integers`),Qp=e=>{let t=Xp.indexOf(e);return t===-1?void 0:Zp[t]},$p=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[es(as(`<`,(e,t)=>e<t),t(`LT`)),es(as(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),es(as(`<=`,(e,t)=>e<=t),t(`LE`)),es(as(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},em=[Vo(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Xp,...$p(`Naturals`)],tm=[Vo(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Zp,...$p(`Integers`),z(`-.`,1,e=>{let t=ts(R(e,0,`-`),Jp);if(Go(-t))throw Ko(`-${t}`);return-t})],nm=(t,n,r)=>{let i=R(t,n,r),a=pi(i);if(!a)throw new e.A(`${r}\n${M(L(i))}`);return a},rm=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:nm(e,t,n)},im=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw Io(n,`SubSeq`,`natural number`,r);return r},am=(e,t,n)=>typeof e==`string`?pn(e.slice(t,n)):Ir(e.slice(t,n)),om=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,sm=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,cm=(e,t)=>{let n=Ls.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?es(e,t):e}):t},lm=t=>cm(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>rm(e,0,om(``,`Len`)).length),z(`\\o`,2,t=>{let n=rm(t,0,sm(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=nm(t,1,sm(`t \\o s`,`sequence`)),r=n.length===0?R(t,1,`\\o`):e.length===0?R(t,0,`\\o`):void 0;return r!==void 0&&Nn(r)===`tuple`?r:Ir([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.A(`${sm(`t \\o s`,`string`)}\n${M(L(r))}`);return pn(n+r)}),z(`Append`,2,e=>Ir([...nm(e,0,sm(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=nm(t,0,om(``,`Head`));if(n.length===0)throw new e.A(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,t=>{let n=rm(t,0,om(``,`Tail`));if(n.length===0)throw new e.A(`Attempted to apply Tail to the empty sequence.`);return am(n,1)}),z(`SubSeq`,3,t=>{let n=rm(t,0,om(`first `,`SubSeq`)),r=im(t,1,`second`),i=im(t,2,`third`);if(r>i)return am(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.A(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${M(L(R(t,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return am(n,r-1,i)}),Ho(`SelectSeq`,2,t=>{let n=Bo(t,1,`SelectSeq`);return Ir(nm(t,0,om(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.A(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),um=t=>cm(`FiniteSets`,[z(`IsFiniteSet`,1,e=>ui(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!Pt(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.A(`Attempted to compute cardinality of the value\n${M(L(r))}`);return ci(r,t)})]),dm=[es(z(`Warshall`,1,t=>{let n=R(t,0,`Warshall`);if(!Pt(n)||gn(n))throw new e.A(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${M(L(n))}`);ci(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=ia(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(t=>{let n=pi(t);if(n?.length!==2)throw new e.A(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${M(L(t))}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return br(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Ir([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],fm=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return dm;if(e===`AnySet`)return[Vo(`ANY`,bn)];if(e===`IOUtils`)return Nf(r,a);if(e===`_TLCTrace`)return If(r);if(!Rp(n.version).has(e))return;let o=hm(e,t,n,r,i);return e===`Randomization`&&o?[...o,sp(n)]:o},pm=/* @__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`]]]),mm=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),hm=(e,t,n,r,i)=>{switch(e){case`Naturals`:return em;case`Integers`:return tm;case`Sequences`:return lm(n.version);case`FiniteSets`:return um(n.version);case`TLC`:return cm(`TLC`,Pp(t,n));case`Randomization`:return cp(n);case`_Possible`:return Cp(t,n);case`Json`:return Mf(r);case`Bags`:return cm(`Bags`,nf(i));case`TLCExt`:return cm(`TLCExt`,Sp(t,n));default:return}},gm=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&kl.get(t)||[];r.expressions.push(...i,t);let a=hi.sets,o=a??[],s=o.length;hi.sets=o;try{return n()}catch(e){throw W_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,hi.sets=a}},_m=(e,t,n)=>e.coverage?ho(e.coverage,t,n):-1,vm=(e,t,n)=>e.coverage?_o(e.coverage,t,n):n(),ym=(e,t,n,r)=>vm(e,t,()=>W(n,r)),bm=(e,t,n,r)=>{let i=ym(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},xm=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Sm=e=>!e.includes(void 0),Cm=e=>e.variables.map(()=>void 0),wm=(e,t,n)=>{let r=[...e];return r[t]=n,r},Tm=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Em=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,Dm=e=>e.kind===`Identifier`?e.name:void 0,Om=(e,t,n)=>{if(t.kind===`Label`)return Om(e,t.body,n);let r=Dm(t);if(r===void 0)return;let i=Og(n,r);if(i?.kind===`Thunk`)return Om(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=v_(r,e);return o?.kind===`Closure`&&o.params.length===0?Om(e,o.body,o.scope):void 0},km=(e,t,n)=>{if(t.kind===`Prime`)return Om(e,t.expression,n);if(t.kind===`Label`)return km(e,t.body,n);let r=Dm(t);if(r===void 0)return;let i=Og(n,r);if(i?.kind===`Thunk`)return km(e,i.expression,i.scope);if(i)return;let a=v_(r,e);return a?.kind===`Closure`&&a.params.length===0?km(e,a.body,a.scope):void 0},Am=t=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean expression.`);return t},jm=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Mm=(e,t,n,r)=>{let i=Pm(e,t,n,r);return i&&e.coverage&&!e.isInit&&go(e.coverage,r),i},Nm=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(go(r,n),go(r,r.roots[n])),e.onState(t),!0},Pm=(e,t,n,r)=>t===void 0?Sm(n)?Nm(e,n,r):(e.onIncomplete?.(n),!1):Sm(n)&&jm(e)?Im(e,t,n,r):t.kind===`Predicate`?Lm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?$m(e,t.expression,t.rest,t.scope,n,t.node):Fm(e,t,n)&&Mm(e,t.rest,n,t.node),Fm=(e,t,n)=>{let r=e.environment,i=ym(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return ym(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Dg(t,r.runtime.version):t}})();try{return!gr(i,a)}catch(t){throw e.callStack&&W_(e.callStack,[i],t),t}},Im=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return $m(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?Fm(e,i,n):Am(ym(e,i.node,i.expression,xm(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Nm(e,n,r)},Lm=(e,t,n,r,i,a)=>Rm(e,t,n,r,i,_m(e,a,t)),Rm=(t,n,r,i,a,o)=>gm(t,n,()=>{switch(n.kind){case`Let`:{let e=xm(t,i,a),s=n.definitions,c=t.coverage?F_(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):F_(s,e);return Lm(t,n.body,r,c,a,o)}case`Label`:return Lm(t,n.body,r,i,a,o);default:if(qm.has(n.kind))throw new e.x(`The state relation is not a boolean expression.`);return gm(t,n,()=>Zm(t,n,r,i,a,o))}}),zm=(e,t,n,r,i)=>Am(t)&&Mm(e,n,r,i),Bm=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),Vm=(e,t,n,r,i,a)=>{let o=xm(e,r,i);if(t.kind===`Identifier`){let s=Og(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Lm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Lm(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:v_(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&Md(c,e.environment))?Lm(e,l.body,n,l.scope,i,a):zm(e,bm(e,a,t,o),n,i,a)}let s=y_(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=vm(e,a,()=>j_(s,t.args,o));return Lm(e,s.body,n,r,i,a)}let c=Bm.has(t.operator)?ym(e,a,t,o):bm(e,a,t,o);return zm(e,c,n,i,a)},Hm=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Mm(e,t,wm(n,r,i),a):gr(o,i)&&Mm(e,t,n,a)},Um=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Wm=(e,t,n)=>(e.coverage&&vo(e.coverage,t,n.length+1),n),Gm=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?Om(t.environment,s,i):km(t.environment,s,i),u=xm(t,i,a);if(l===void 0)return ym(t,o,n,u)===!0&&Mm(t,r,a,o);let d=ym(t,o,c,u),f=a[l];if(n.operator===`=`)return Hm(t,r,a,l,d,o);let p=n.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(typeof p==`object`&&p!==d&&t.callStack?.sources.set(p,c),f!==void 0)return ym(t,o,n,u)===!0&&Mm(t,r,a,o);if(!zr(p))throw new e.x(`The right side of \\IN is not enumerable.`);return Wm(t,p,ei(p)).reduce((e,n)=>Mm(t,r,wm(a,l,n),o)||e,!1)},Km=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),qm=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Jm={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Ym=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Jm[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},Xm=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=vm(e,r,()=>Jg(t.bounds,t=>{let r=W(t,n),i=Gg(r,t,a);return Array.isArray(i)&&Wm(e,r,i),i}));return Xg(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},Zm=(t,n,r,i,a,o)=>{let s=xm(t,i,a);switch(n.kind){case`Identifier`:return Vm(t,n,r,i,a,o);case`Apply`:return Km.has(n.operator)&&n.args.length===2?Gm(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?Am(ym(t,o,n.args[0],s))?Lm(t,n.args[1],r,i,a,o):Mm(t,r,a,o):Vm(t,n,r,i,a,o);case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Um(`Predicate`,t,i,o,e),r);return Lm(t,e[0],n,i,a,o)}let s=e[e.length-1];return Rm(t,Tm(n,e.length-1),Um(`Predicate`,s,i,o,r),i,a,Em(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>Lm(t,n,r,i,a,o)||e,!1);let s=Rm(t,Tm(n,e.length-1),r,i,a,Em(t,o)),c=Lm(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:return Xm(t,n,s,o).reduce((e,i)=>Lm(t,n.body,r,i,a,o)||e,!1);case`Forall`:{let e=Xm(t,n,s,o);if(e.length===0)return Mm(t,r,a,o);let i=e.slice(1).reduce((e,t)=>Um(`Predicate`,n.body,t,o,e),r);return Lm(t,n.body,i,e[0],a,o)}case`If`:return Lm(t,Am(ym(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>Am(ym(t,o,e.condition,s)))?.body??n.other;if(c===void 0)throw new e.x(`TLC encountered a CASE with no conditions true.`);return Lm(t,c,r,i,a,o)}case`FunctionApplication`:{let e=n_(ym(t,o,n.function,t.isInit?s:Mg(s)));if(e){let i=vm(t,o,()=>r_(e,n,s));return Lm(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return $m(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=Lm(t,n.action,r,i,a,o);return $m(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return Lm(t,n.action,Um(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Ym(n):void 0;if(c!==void 0)throw new e.x(c);return zm(t,ym(t,o,n,s),r,a,o)},Qm=(e,t,n)=>e.runtime.warn(Ye.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),$m=(e,t,n,r,i,a)=>gm(e,t,()=>{let o=_m(e,a,t),s=Om(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!gr(a,r)?(Qm(e.environment,s,t),!1):Hm(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Mm(e,n,i,o);let c=s.reduceRight((e,t)=>Um(`Unchanged`,t,r,o,e),n);return $m(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Og(r,t.name);if(a?.kind===`Thunk`)return $m(e,a.expression,n,a.scope,i,o);let s=a?void 0:v_(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return $m(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=xm(e,r,i),s=y_(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return $m(e,s.body,n,j_(s,t.args,a),i,o)}let c=e.environment,l=ym(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=ym(e,o,t,{environment:c,scope:r,state:i,next:void 0});return gr(l,u)&&Mm(e,n,i,o)}),eh=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),th=/* @__PURE__ */ Error(`The replay found a successor`),nh=(e,t,n,r)=>{let i=()=>{throw th},a=eh(r,`enabled`,n,i,i),o=a.callStack,s=o?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Um(`Changed`,e.subscript,t,-1,void 0);Lm(a,e.action,n,t,Cm(r),-1)}else Lm(a,e,void 0,t,Cm(r),-1);return!1}catch(e){if(e!==th)throw e;return o&&(o.expressions.length=s,o.isFrozen=!1),!0}},rh=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=eh(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>Um(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Lm(o,i.expression,s,i.scope,Cm(t),i.node??-1)},ih=(e,t,n,r)=>{e.some(e=>qm.has(e.expression.kind))||e.forEach(e=>{let i=[];ah(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},ah=(e,t,n,r,i,a)=>{let o=eh(r,`next`,n,i,a);Lm(o,e.expression,void 0,e.scope,Cm(r),t)},oh=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Om(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=Og(r,e.name)?void 0:v_(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,F_(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){km(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Og(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?y_(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:v_(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,j_(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},sh=/* @__PURE__ */ new WeakMap,ch=/* @__PURE__ */ new WeakMap,lh=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},uh=(e,t,n)=>{let r=e.slice();return r[t]=n,r},dh=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,fh=(t,n)=>{let r=new e.x(n);return t.isInit?r:e.ot(r,e.rt.error)},ph=(e,t,n,r)=>{let i=_g(n);return r&&qm.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${dh(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},mh=(e,t,n)=>{let r=Qo(t),i=U(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${dh(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1782
- `:``}${i}`},hh=(e,t,n)=>vh(e,t,W(t,n)),gh=new Set(qp.map(e=>e.name)),_h=e=>e.kind===`Apply`?gh.has(e.operator):e.kind!==`Identifier`&&!qm.has(e.kind),vh=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=ph(t,r,n,i);throw t.isInit&&i&&_h(n)?new e.B(a):fh(t,a)},yh=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=Z_(n,r.environment))(r),bh=e=>e===`=`||e===`\\in`||e===`\\subseteq`,xh=(e,t,n)=>{let r=n?sh:ch,i=r.get(e);if(i)return i;let a=tg(e,t,n),o=n?void 0:eg(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Sh=(e,t)=>{if(t.constants.has(e))return;let n=zg(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Ch=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Ch(e.expression,t,!1,r);if(e.kind!==`Identifier`||j(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Sh(e.name,t);if(a&&!r.has(a))return r.add(a),Ch(a.body,t,n,r)},wh=(e,t,n)=>Ch(e,t,!n),Th=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Th(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=F_(e.definitions,lh(r,t,n));return Th(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Og(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Th(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=Sh(e.name,r.environment);if(s)return Th(s.body,void 0,n,r,i)},Eh=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||j(e))||!t&&e.kind===`Prime`,Dh=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Dh(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Sh(e.name,t);if(i)return n.add(e.name),Dh(i.body,t,n)},Oh=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),kh=(e,t,n)=>Oh.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||bh(e.operator)&&(Eh(e.args[0],n)||wh(e.args[0],t,n)!==void 0)||j(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Ah=/* @__PURE__ */ new Set,jh=(e,t)=>{if(j(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Rl(e,(e,i)=>{let a=r?jh(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},Mh=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||j(e)?void 0:zg(r,t);return i&&!n.has(i)&&(n.add(i),Mh(i.body,t,n))?!0:ze(e).some(e=>Mh(e,t,n))},Nh=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=wh(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=Dh(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return kh(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:xh(e,t,n)}},Ph=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(zd(e,t)===void 0||Mh(e,t,/* @__PURE__ */ new Set))return!0;let n=jh(e,Ah);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},Fh=(e,t,n)=>{let r=e.map(e=>Nh(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=jm(t);for(let s=e;s<r.length;s++){if(s>0&&f&&rg(u)){d??=lh(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!gr(t,i[e.index])}):void 0;if(o){Qm(t.environment,o.index,o.expression);return}let s=n.expression,c=yh(a,e,s,d);if(!vh(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=lh(t,n,u);let r=yh(i,s,e.expression,d);if(!vh(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=lh(t,n,u);let r=yh(i,s,e.value,d),a=u[e.index];if(a===void 0)u=uh(u,e.index,r),d=void 0;else if(!gr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!gr(e,n[i.index])){Qm(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Ih=e=>{let t=Ym(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw fh(n,t);hh(n,e,lh(n,r,i))&&s(i,a)}},Lh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=lh(r,i,a);if(a[l]!==void 0){hh(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!zr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${dh(r)}, the right side of \\IN is not enumerable.`;throw fh(r,`${t}\n${U(e)}`)}let p=ei(f);if(r.generator){for(let e of $f(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(uh(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(uh(a,l,p[e]),o)}},Rh=/* @__PURE__ */ new WeakMap,zh=e=>{let t=Rh.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(zh),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Rh.set(e,n),n},Bh=(e,t)=>{let n=e.args[0],r=Ih(e),i=(e,r,i)=>Th(n,r,i,e,!t)??-1,a=Lh(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],lh(t,n,o));l(uh(o,u,d),s)}},Vh=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=lh(i,a,o),d=W(e.function,n?u:Mg(u)),f=n_(d);if(f!==void 0){xh(f.body,t,n)(i,r_(f,e,u),o,s,c,l);return}if(!It(d))throw fh(i,`In computing ${dh(i)}, a non-function (${Qo(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw fh(i,`In computing ${dh(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Hh=(e,t)=>{let n=zh(e);return Dh(e,t)?Fh([n],t,!1):e.kind===`Tuple`?xh(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Og(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){xh(zh(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=lh(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=y_(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){xh(zh(n.body),t,!1)(r,j_(n,e.args,u),a,o,s,c);return}}hh(r,n,u)&&c(a,o)}},Uh=(e,t,n)=>{let r=e.operator,i=Ih(e),a=j(e)?void 0:v_(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=nv(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=xh(a.body,t,n),o(e,i(lh(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=lh(a,o,s),f=y_(e,d);f?.kind===`Closure`?xh(f.body,t,n)(a,j_(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Wh=(e,t,n)=>{let r=Ih(e),i=j(e)?void 0:Sh(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Og(s,e.name);f?.kind===`Thunk`&&!f.isReleased?xh(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&p_(i,t)!==void 0?r(o,s,c,l,u,d):(a??=xh(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Gh=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||j(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!j(i))return;let a=Ch(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Kh=e=>e.kind===`And`?e.operands.flatMap(Kh):[e],qh=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&kh(e,t,!1),Jh=e=>{let t=[];return(n,r,i)=>{let a=lh(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!vh(n,i,yh(t,r,i,a)))return}}},Yh=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Kh(e),r=n.findIndex(e=>!qh(e,t)||Gh(e,t)),i=r===-1?void 0:Gh(n[r],t);return i?{...i,before:r===0?void 0:Jh(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Yh(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||j(e))return;let r=v_(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Yh(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!j(o))return;let s=i.before,c=s&&nv(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(lh(e,t,n)),n))}},Xh=(e,t,n)=>{let r=Og(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Zh=(e,t,n)=>{let r=e.map(e=>xh(e,t,n)),i=n?[]:e.map(e=>Yh(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Xh(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Qh=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=Uf(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},$h=(e,t)=>{let n=xh(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=lh(r,i,a),u=t.runtime.version,d=Jg(e.bounds,e=>W(e,l)).map((n,r)=>$f(Ug(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,Ag(i,l,e)))};f(d.length-1,i)}},eg=(e,t)=>{if(e.kind===`Exists`)return $h(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>xh(e,t,!1));return e.isBulleted?Qh(n):n.reduce((e,t)=>Qh([e,t]))},tg=(t,n,r)=>{let i=e=>xh(e,n,r);switch(t.kind){case`And`:return Fh(t.operands,n,r);case`Or`:return Zh(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=Ug(W(a.set,lh(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,kg(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Ph(t,n);if(o){let e=Fh(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=lh(r,i,a),d=Jg(t.bounds,e=>Ug(W(e,u),e,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=kg(n,o.names[t],e);if(t===d.length-1){let e=lh(r,i,a);if(!o.guards.every(t=>hh(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{Zg(t.bounds,lh(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&zd(t,n)!==void 0&&!Mh(t.body,n,/* @__PURE__ */ new Set)?jh(t,Ah):void 0;return(n,r,i,o,s,c)=>{let l=[];Zg(t.bounds,lh(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Og(r,e)?.kind===`Value`)){u.every(e=>hh(n,t.body,lh(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&rg(i)?u.slice(r).every(e=>hh(n,t.body,lh(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=W(t.condition,lh(r,i,a));if(typeof l!=`boolean`)throw fh(r,mh(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=lh(r,i,a),u=e.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw fh(r,`In computing ${dh(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Qo(t)}) was used as a guard condition of a CASE.\n${_g(e.source)}`)})?.body??n;if(!u)throw fh(r,`In computing ${dh(r)}, TLC encountered a CASE with no conditions true.\n${U(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=L_(t.definitions,n);return(n,i,a,o,s,c)=>e(n,F_(t.definitions,lh(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.x(`UNCHANGED appears in an initial predicate at ${mg(t)}`)}:Hh(t.expression,n);case`AngleAction`:{let e=i(t.action),r={kind:`Unchanged`,expression:t.subscript,location:t.subscript.location},a=(e,t,i)=>{try{return hh(e,r,lh(e,t,i))}catch(t){throw e.isEnabled?Dg(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return Zh([t.action,zh(t.subscript)],n,r);case`Label`:return i(t.body);case`Identifier`:return Wh(t,n,r);case`FunctionApplication`:return Vh(t,n,r);case`Apply`:{let e=t.args;if(bh(t.operator)){let i=wh(e[0],n,r);if(i!==void 0)return t.operator===`=`?Fh([t],n,r):Lh(t,()=>i);if(Eh(e[0],r))return Bh(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=W(e[0],lh(r,i,a));if(typeof l!=`boolean`){let e=Qo(l),n=U(t);throw fh(r,r.isInit?`In computing initial states of a predicate of form P => Q, P was ${e}\n.${n}`:r.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${e}.\n${n}`:`In computing next states of a predicate of the form P => Q, P was\n${e}.\n${n}`)}l?n(r,i,a,o,s,c):c(a,o)}}return Uh(t,n,r)}default:return Ih(t)}},ng=e=>e.variables.map(()=>void 0),rg=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},ig=(t,n)=>{let r=n.state;if(!r||!rg(r))throw new e.x(`ENABLED needs a complete state at ${mg(t)}`);let i=n.environment;if(i.callStack)return nh(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return xh(t,i,!1)(a,n.scope,ng(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},ag=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};xh(t,n,!0)(o,i,ng(n),void 0,!1,t=>{if(!o.isStopped){if(!rg(t)){if(a){o.isStopped=a([...t]);return}throw e.ot(new e.C([...t]),e.rt.error)}o.isStopped=r(t)}})},og=(e,t,n)=>{let r=[];return ag(e,t,e=>(r.push(e),!1),n),r},sg=(t,n,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return xh(t,r,!1)(c,a,ng(r),void 0,!1,(t,n)=>{if(!c.isStopped){if(!rg(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.w(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}c.successors++,c.isStopped=i({state:t,action:n})}}),c.successors},cg=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return xh(e,n,!1)(i,r,ng(n),void 0,!1,e=>{rg(e)||i.successors++}),i.successors>0},lg=(e,t,n,r)=>{let i=[];return sg(e,t,n,e=>(i.push(e),!1),r),i},ug=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),dg=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),fg=e=>dg.has(e.kind)||e.kind===`Apply`&&ug.has(e.operator),pg=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&Ft(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},mg=e=>`line ${e.location.line}, column ${e.location.column}`,U=t=>{let n=t.location.range;return n?e.Z(n):mg(t)},hg={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},gg=(t,n)=>new e.x(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${U(n)}`),_g=e=>e.kind===`Number`?e.text??String(e.value):U(e),vg=(t,n)=>new e.x(`A non-boolean expression (${Qo(n)}) was used as the condition of an IF.\n${U(t)}`),yg=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e.x(`A non-boolean expression (${Qo(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${_g(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.x(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${Qo(r)}.\n${U({...t,location:{...t.location,range:{...i,end:a}}})}`)},bg=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${M(L(e))}\n${U(t)}`,i=e=>`Attempted to apply function:\n${M(L(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!It(a))throw new e.x(`Attempted to select field "${n}" from a non-record value ${M(L(a))}\n${U(t)}`);let o=Nn(a);if(o===`tuple`)throw ki(n);return Li(a.kind===`LazyFunction`?I(a):a,n,o===`record`?r:i)}},xg=e=>e===`1.7.4`?(t,n)=>Ei(t,n,e):void 0,Sg=t=>n=>{if(!It(n))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${Qo(n)})\n${U(t)}`);return zi(n)},Cg=(t,n)=>(r,i)=>{if(!Pt(r)||gn(r))throw new e.x(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(t)}`);return n.evaluateBinary?n.evaluateBinary(r,i):n.evaluate([r,i])},wg=t=>e.ot(new e.x(`TLC can't handle real numbers.\n${t.text}`),e.rt.configParseError),Tg=t=>e.ot(new e.x(`TLC can't handle a number this big.\n${t.text??t.value}`),e.rt.error),Eg=(t,n)=>new e.z(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${U(n)}`,t),Dg=(t,n)=>t instanceof e.z&&n!==`1.7.4`?new e.x(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,Og=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},kg=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Ag=(t,n,r)=>{if(n.kind===`Name`)return kg(t,n.name,r);let i=pi(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.x(`Argument mismatch in operator application.${t?e.Z(t):``}`)}return n.names.reduce((e,t,n)=>kg(e,t,i[n]),t)},jg=(t,n)=>{if(It(t))return t;throw new e.x(`A non-function (${Qo(t)}) was applied as a function.\n${U(n)}`)},Mg=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Ng=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Pg=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Expected ${n} to be a boolean but found ${L(t)}`);return t},Fg=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form P => Q when ${r} was\n${Qo(t)}.\n${U(n)}`);return t},Ig=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to apply the operator ~ to a non-boolean\n(${Qo(t)})\n${U(n)}`);return!t},Lg=(t,n,r)=>{if(typeof t!=`boolean`||typeof n!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(r)}`);return t===n},Rg=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${_g(n)}`);return t},zg=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Bg=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},Vg=(t,n,r)=>{if(!Pt(t)||gn(t)){let i=L(t),a=r===`1.7.4`?void 0:Bg(t,i);throw new e.x(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${_g(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${_g(n)}\n${a}`)}},Hg=(e,t,n)=>(Vg(e,t,n),typeof e==`object`&&e.kind===`Interval`?Mr(e):Kr(e)??Qr(e)),Ug=(e,t,n)=>n===`1.7.4`?(Vg(e,t,n),Kr(e)??ei(e)):Hg(e,t,n),Wg=e=>{if(typeof e==`object`&&e.kind===`Interval`)return ci(e),e},Gg=(e,t,n)=>Wg(e)??Ug(e,t,n),Kg=(e,t,n)=>Wg(e)??Hg(e,t,n),qg=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Jg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),Yg=(e,t)=>Jg(e,e=>Gg(W(e,t),e,t.environment.runtime.version)),Xg=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):qg(t[n],t=>i(n-1,Ag(a,e[n].pattern,t)));return i(e.length-1,n)},Zg=(e,t,n)=>Xg(e,Yg(e,t),t.scope,n),Qg=(e,t)=>{let n=Jg(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},$g=(e,t,n)=>{if(e.length===1)return Ag(t,e[0].pattern,n);let r=pi(n)??[];return e.reduce((e,t,n)=>Ag(e,t.pattern,r[n]),t)},e_=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,t_=e=>Object.assign(e.value,{lambda:e}),n_=e=>e_(e)?e.lambda:void 0,r_=(t,n,r)=>{let i=t.value,a=n.args.map(e=>W(e,r)),o=a.length===1?a[0]:Ir(a),s=(e,t,r)=>`In applying the function\n${M(L(i))},\nthe ${e} is:\n${M(L(t))}${r}.\n${U(n.function)}`,c=t.bounds;if(c.length===1){if(!vi(o,i.domain))throw new e.x(s(`first argument`,o,`which is not in its domain`));return $g(c,t.scope,o)}let l=pi(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0)throw new e.x(`Attempted to apply a function to an argument not in its domain.\n${U(n.function)}`);let d=()=>new e.x(`In applying the function\n${M(L(i))},\nthe argument list is:\n${M(L(o))}\nwhich does not match its formal parameter.\n`);if(c.forEach((t,n)=>{if(n>=l.length)throw d();let r=l[n],i=`argument number ${n+1}`;if(!vi(r,u[n]))throw new e.x(s(i,r,`${t.pattern.kind===`Name`?``:`
1783
- `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&pi(r)?.length!==t.pattern.names.length)throw new e.x(s(i,r,`which does not match its formal parameter`))}),l.length>c.length)throw d();return $g(c,t.scope,o)},i_=(e,t)=>{if(t.location.range)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:_g(t)}},a_=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},o_=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},s_=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),c_=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),l_=(e,t)=>{let n=Qg(e.bounds,t),r=o_(n,(n,r)=>W(e.body,Ng(t,$g(e.bounds,kg(void 0,e.name,r),n))),a_(i_(e.bounds,e.body),e.bounds,n),s_(e.bounds));t_({value:r,bounds:e.bounds,body:e.body,scope:kg(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=l_(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?Pn(i):i},u_=(t,n)=>{if(typeof n!=`object`||Nn(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Ft(n.domain))return n;try{let e=I(n);return An(e.domain,e.range)}catch(t){if(t instanceof e.x)return n;throw t}},d_=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e.x(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>l_(t,e):Z_(c_(t),n):Z_(t.body,n),f_=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=d_(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Ng(e,void 0)):e=>a[i]??r(Ng(e,void 0));return t.definitionEvaluators.set(e,o),o},p_=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},m_=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!Nd(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>u_(t,d_(t,n)(a)));mr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.x)&&!e.nt(t))throw t}}),h_=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&Vn(t[n],e))}catch(t){if(t instanceof e.x)return!1;throw t}},g_=(e,t)=>{let n=e.cache;if(n!==void 0&&h_(t.state,e.state)&&h_(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?_o(r,i,()=>W(e.expression,Ng(t,e.scope))):W(e.expression,Ng(t,e.scope));return(!e.isStreamed||ni(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},__=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),v_=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return v_(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?__(r):t.builtins.get(e)},y_=(e,t)=>j(e)?b_(e.operator,t):v_(e.operator,t.environment)??b_(e.operator,t),b_=(e,t)=>{let n=Og(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return v_(e,t.environment)},x_=e=>e.kind===`Closure`?e.params.length:e.arity,S_=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:b_(r,n);if(!i)throw new e.x(`Expected an operator argument at ${mg(t)}`);return i},C_=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>kg(e,n.name,t[r]),e.scope);return W(e.body,Ng(n,r))},w_=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:x_(e),call:n=>C_(e,n,t)},T_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=b_(e.name,t);return n!==void 0&&x_(n)>0},E_=(e,t)=>e.map(e=>T_(e,t)?w_(S_(e,t),t):W(e,t)),D_=(t,n)=>new e.x(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),O_=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),k_=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return k_(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},A_=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Bt(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=O_(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=j(e)?void 0:k_(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=Og(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:O_(e,t)}}return t=>O_(e,t)},j_=(e,t,n,r)=>{if(t.length!==e.params.length)throw D_(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:S_(t[a],n)}:(r?.[a]??A_(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},M_=(e,t,n,r)=>e.kind===`Closure`?W(e.body,Ng(n,j_(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(ev(t,n),n):e.evaluate(E_(t,n),n),N_=/* @__PURE__ */ new WeakMap,P_=e=>{let t=N_.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return N_.set(e,n),n},F_=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:P_(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},I_=(t,n,r)=>{let i=Og(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return g_(i,r);if(i?.kind===`Operator`){if(x_(i.operator)===0)return C_(i.operator,[],r);throw new e.x(`Operator ${t} is used without arguments`)}let a=k_(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw Eg(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return f_(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.x(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${U(n)}`)},L_=(e,t)=>({impure:new Set(e.filter(e=>Id(e,t))),streamed:new Set(e.filter(e=>Id(e,t,`streamed`)))}),R_=e=>[...e.facts.ids.keys()].some(t=>Id(t,e)),z_=e=>[...e.facts.ids.keys()].some(t=>Id(t,e,`repeated`)),B_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,V_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),H_=e=>t=>{let n=e(t);return Vn(n,e(V_(t)))},U_=(t,n,r,i)=>a=>{i.expressions.push(t);let o=hi.sets,s=hi.callStack,c=o??[],l=c.length;hi.sets=c,hi.callStack=i;try{let e=n(a),o=B_(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&fg(t)&&i.sources.set(o,t),o}catch(n){n instanceof e.P&&!i.isFrozen&&(i.expressions.length=0,i.isFrozen=!0);let r=n instanceof Error?i.failures.get(n):void 0;n instanceof Error&&i.failures.set(n,t);let a=pg(t,i.values),o=a&&!ze(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!It(o)?void 0:o;throw W_(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,hi.sets=o,hi.callStack=s}},W_=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e.x){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},G_=(t,n,r)=>{if(!(r instanceof e.x))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},K_=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),q_=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw yg(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},J_=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},Y_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=ho(n,i,e);go(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},X_=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=wv(e,t),i=t.callStack,a=i&&kl.get(e),o=i?U_(e,r,t,i):r,s=i&&a?J_(e,a,o,i):o,c=t.coverage,l=c?Y_(e,s,c):s;return t.evaluators.set(e,l),l},Z_=(e,t)=>{if(t.callStack||t.coverage)return X_(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Os(e,t)??X_(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>Z_(e,t.environment)(t),Q_=(e,t)=>{let n=e.name,r=j(e)?void 0:k_(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Eg(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=f_(e,t))(r)}return t=>I_(n,e,t)},$_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||j(e))return!0;let n=v_(e.name,t);return n===void 0||x_(n)===0},ev=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),tv=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(ev(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&$_(t[0],n)){let e=X_(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&$_(t[0],n)&&$_(t[1],n);if(i&&a){let e=X_(t[0],n),r=X_(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(E_(t,n),n)},nv=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw D_(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:A_(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:S_(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},rv=(e,t,n)=>{let r=nv(e,t,n),i;return t=>(i??=Z_(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},iv=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=X_(r[0],n),i=X_(r[1],n);return n=>!Fg(e(n),t,`P`)||Fg(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=X_(r[0],n);return n=>Ig(e(n),t)}if(t.operator===`<=>`){let e=X_(r[0],n),i=X_(r[1],n);return n=>Lg(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw gg(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=j(t)?void 0:v_(t.operator,n);if(i?.kind===`Closure`)return rv(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=X_(r[0],n),i=Sg(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Ol.has(t)&&!Bd(r[0],n),a=n.tlcEvalValues;return n=>{if(!e||n.scope!==void 0)return i.evaluate(ev(r,n),n);let o=a.get(t);if(o!==void 0)return o;let s=i.evaluate(ev(r,n),void 0);return a.set(t,s),s}}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=X_(r[0],n),a=X_(r[1],n),o=Cg(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return tv(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.x(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a=r.map(e=>A_(e,n));return i=>{let o=b_(t.operator,i);if(o)return M_(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e.x(`${t.operator} is a function; apply it with brackets`):new e.x(`Unknown operator ${t.operator} at ${mg(t)}`)}},av=(e,t)=>{let n=e.kind===`Forall`,r=X_(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=X_(i.set,t);return s=>qg(Gg(o(s),i.set,t.runtime.version),t=>Rg(r(Ng(s,kg(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=Jg(a,e=>Gg(X_(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?Rg(r(Ng(o,a)),e)!==n:qg(s[t],e=>c(t-1,kg(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>Zg(a,t,i=>Rg(r(Ng(t,i)),e)!==n)?!n:n},ov=(e,t)=>{if(e.kind===`Tuple`)return Ir(e.names.map(e=>{let n=Og(t,e);return n?.kind===`Value`&&n.value}));let n=Og(t,e.name);return n?.kind===`Value`?n.value:void 0},sv=/* @__PURE__ */ new WeakSet,cv=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&sv.add(e)},lv=/* @__PURE__ */ new WeakMap,uv=e=>{if(lv.has(e))return lv.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=Be(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),ze(e).every(n)},r=n(e)?[...t]:void 0;return lv.set(e,r),r},dv=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Og(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),fv=e=>sv.has(e),pv=(t,n)=>{let r=fv(t),i=X_(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=e=>i(Ng(t,kg(t.scope,n,e)));if(Mt(e))return ci(e),Nt(e,r),f(e,t);let a=Pr(e),s=An(a,a.map(r));return Ft(e)?s:(s.lambdaDomain=e,Pn(s))}let n=[],r=Jg(a,(n,r)=>Kg(a.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return Xg(a,r,t.scope,e=>{let r=a.length===1?ov(o.pattern,e)??!1:Ir(a.map(t=>ov(t.pattern,e)??!1));return n.push([r,i(Ng(t,e))]),!1}),Tr(n)},l=i_(a,t.body),u=s_(a),d=uv(t.body),f=(e,n)=>{let r=dv(n.scope,d),o=Ng(n,r),s=t_({value:o_(e,e=>i(Ng(o,$g(a,r,e))),a_(l,a,e),u),bounds:a,body:t.body,scope:r});return a.length===1?Pn(s):s},p=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!P(n))return f(n,i);if(!(a.length===1?Ft(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(Ft))){if(p)return f(n,i);try{return c(n,i)}catch(t){if(!(t instanceof e.x))throw t;return f(n,i)}}if(!p)return c(n,i);try{return c(n,i)}catch(e){throw G_(p,t,e),e}},createLazy:f}},mv=(e,t)=>{let n=pv(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=X_(r[0].set,t);return t=>n(e(t),t)}return e=>n(Qg(r,e),e)},hv=(e,t)=>{let n=sv.has(e);n&&cv(e.function);let r=X_(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>X_(e,t))}),value:X_(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Ir(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Ng(i,kg(i.scope,`@`,e))):Bi(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(Ye.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},gv=(t,n)=>{let r=X_(t.predicate,n),i=t.bound.pattern,a=_g(t.predicate),o=t.predicate.location.range&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:a},s=n.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=_o(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(n,r,s,u)=>({kind:`FilteredSet`,base:n,test:(t,n)=>{if(i.kind===`Tuple`&&pi(t)?.length!==i.names.length)throw new e.x(`Attempted to check if the value:\n${M(L(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=c(u,n,()=>s(Ng(r,Ag(r.scope,i,t))));if(typeof o!=`boolean`)throw new e.x(`${n?`The evaluation of predicate`:`Evaluating predicate`} ${a} yielded non-Boolean value.`);return o},source:o,rebind:e=>l(n,{...r,environment:e},X_(t.predicate,e),-1)});return(e,t,n=-1)=>l(e,t,r,n)},_v=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Qo(t)}.\n${_g(n.predicate)}`);return t},vv=(t,n,r,i)=>{if(!Pt(t)||gn(t))throw new e.x(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(n)}`);return hr(t),Kg(t,r,i)},yv=t=>new e.x(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(t)}`),bv=(t,n)=>{if(t.kind===`SetFilter`){let e=X_(t.predicate,n),r=X_(t.bound.set,n),i=gv(t,n),a=t.bound.pattern,o=n.coverage;return n=>{let s=r(n);if(!Ft(s))return i(s,n,o?.current);let c=[],l=r=>{let i=e(Ng(n,Ag(n.scope,a,r)));_v(i,t)&&jt(c,r)},u=s.kind===`Interval`?s:F(s).elements;return Nt(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),kn(c)}}if(t.kind===`SetMap`){let e=X_(t.expression,n);return n=>{let r=[];return Zg(t.bounds,n,t=>(jt(r,e(Ng(n,t))),!1)),br(r)}}let r=t.set;if(!r)return()=>{throw new e.x(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(t)}`)};let i=X_(t.body,n),a=X_(r,n);return n=>{let o=vv(a(n),t,r,n.environment.runtime.version),s,c=t.pattern;if(qg(o,r=>{if(c.kind===`Tuple`&&pi(r)?.length!==c.names.length)throw new e.x(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(t)}`);let a=Ag(n.scope,c,r);return Rg(i(Ng(n,a)),t)?(s=ov(c,a),!0):!1}),s===void 0)throw yv(t);return s}},xv=e=>[...e].sort((e,t)=>Cn(e.name,t.name)),Sv=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Cv=(e,t)=>{let n=xv(e),r=e.map(e=>X_(e.value,t));if(Sv(n))return t=>Lr(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>Kt(i,t,r.map(t=>t(e)),a)}return e=>Rr(i,r.map(t=>t(e)))},wv=(t,n)=>{let r=e=>X_(e,n);switch(t.kind){case`Number`:{let e=t.value;return Bt(e)?()=>e:()=>{throw Tg(t)}}case`Decimal`:return()=>{throw wg(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Q_(t,n);case`Apply`:return iv(t,n);case`Bracket`:return()=>{throw new e.x(`A bracket without a function or subscript is not an expression at ${mg(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.x(`An operator cannot be used as a value at ${mg(t)}`)};case`And`:{let e=t.operands.map(r);return q_(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw yg(t,r,i);if(!i)return!1}return!0})}case`Or`:{let e=t.operands.map(r);return q_(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw yg(t,r,i);if(i)return!0}return!1})}case`Prime`:{let e=r(t.expression);return t=>e(V_(t))}case`Unchanged`:return H_(r(t.expression));case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw vg(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e.x(`A non-boolean expression (${Qo(n)}) was used as a condition of a CASE. ${_g(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.x(`Attempted to evaluate a CASE with no conditions true.\n${U(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(Ng(n,F_(t.definitions,n)))}case`Forall`:case`Exists`:return av(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?gg(t.quantifier===`Forall`?`\\AA`:`\\EE`,t):new e.x(`TLC attempted to evaluate an unbounded ${n}.\nMake sure that the expression is of form ${n} x \\in S: P(x).\n${U(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return bv(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>br(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>Ir(e.map(e=>e(t)))}case`FunctionConstruction`:return mv(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return Cv(t.fields,n);case`RecordSet`:{let e=xv(t.fields),n=e.map(e=>e.name),i=e.map(e=>t.fields.indexOf(e)),a=t.fields.map(e=>r(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:n,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:n,sets:i.map(e=>t[e])}}}case`Except`:return hv(t,n);case`ExceptAt`:return n=>{let r=Og(n.scope,`@`);if(r?.kind!==`Value`)throw new e.x(`@ appears outside an EXCEPT at ${mg(t)}`);return r.value};case`FunctionApplication`:{cv(t.function);let e=r(t.function),i=n=>jg(e(Mg(n)),t),a=t.args.map(r),o=xg(n.runtime.version);if(a.length===1){let e=a[0];return t=>Li(i(t),e(t),o)}return e=>Li(i(e),Ir(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=bg(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let n=r(t.action),i=H_(r(t.subscript)),a=t.kind===`BoxAction`,o=a?`[A]_e`:`<A>_e`;return r=>{let s=n(r);if(typeof s!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form ${o}, but A was not a boolean.\n${U(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>ig(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.x(`The subexpression reference at ${mg(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw gg(hg[t.kind],t)}}},Tv=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Ev=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zi(e[t]),16777619),r=Math.imul(r^ra(e[t]),1540483477);t[0]=Tv(n)||1,t[1]=Tv(r)},Dv=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(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}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},Ov=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),kv=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Hi(t,Zi(e[n]));return t&1073741823},Av=(e,t)=>{for(let n=0;n<t.length;n++)if(!Un(e[n],t[n]))return!1;return!0},jv=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,Mv=(e,t,n)=>{let r=e.slots.length-1;for(let i=jv(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&Av(e.states[r-1],n))return r-1}},Nv=(e,t,n)=>{let r=e.slots.length-1,i=jv(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},Pv=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&Nv(e,t[n],t[n+1])}Nv(e,t,n+1)},Fv=(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}},Iv=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Lv=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Fv(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Rv=e=>Atomics.load(e.used,0)*2>=e.slots.length,zv=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Fv(t,n);return{slots:t,used:e.used}},Bv={kind:`Boolean`,value:!0},Vv={kind:`Boolean`,value:!1},Hv=e=>e?Bv:Vv,Uv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Wv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Gv=(e,t)=>({kind:e,body:t}),Kv=(e,t,n)=>({kind:e,operands:[t,n]}),qv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?qv(e,t.operands).operands:[t])}),Jv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Jv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Jv(t)),0)}},Yv=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 Yv(e.body);case`And`:case`Or`:return e.operands.some(Yv)}},Xv=/* @__PURE__ */ new WeakMap;let Zv=0;const Qv=e=>{let t=Xv.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`#${Zv++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Qv).join(`,`)})`;default:return`${e.kind}(${Qv(e.body)})`}})();return Xv.set(e,n),n},$v=(e,t)=>e===t||Qv(e)===Qv(t),ey=(e,t)=>{let n=Qv(t);return e.some(e=>e===t||Qv(e)===n)},ty=e=>e===`And`?`Or`:`And`,ny=(e,t)=>{switch(e.kind){case`Boolean`:return t?Hv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Gv(`Not`,e):e;case`Not`:return ny(e.body,!t);case`And`:case`Or`:return qv(t?ty(e.kind):e.kind,e.operands.map(e=>ny(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Gv(n,ny(e.body,t))}}},ry=e=>{switch(e.kind){case`Boolean`:return Hv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return qv(ty(e.kind),e.operands.map(ry));case`Always`:return Gv(`Eventually`,ry(e.body));case`Eventually`:return Gv(`Always`,ry(e.body));default:return Gv(`Not`,e)}},iy=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=iy(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Hv(t)}return n.length===0?Hv(!t):n.length===1?n[0]:qv(e.kind,n)}case`Not`:{let t=iy(e.body);return t.kind===`Boolean`?Hv(!t.value):Gv(`Not`,t)}case`Always`:case`Eventually`:{let t=iy(e.body);return Gv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},ay=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,oy=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=oy(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r*=t.operands.length,r>2147483647))throw new e.x(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r===1)return{kind:`And`,operands:n};let i=Array.from({length:r},()=>[]),a=1,o=r;for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}o/=e.operands.length;let t=0;for(let n=0;n<a;n++)for(let n of e.operands)for(let e=0;e<o;e++)i[t++].push(n);a*=e.operands.length}return{kind:`Or`,operands:i.map(e=>qv(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=oy(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=ay(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:qv(`Or`,e);n.push(Gv(`Always`,Gv(`Eventually`,t)))}return qv(`Or`,n)}case`Not`:return Uv(t.body)?t:oy(ry(t.body));default:return t}},sy=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?sy(e.operands[0]):qv(e.kind,e.operands.map(sy));case`Not`:return e.body.kind===`Not`?sy(e.body.body):Gv(`Not`,sy(e.body));case`Always`:case`Eventually`:case`Next`:return Gv(e.kind,sy(e.body));default:return e}},cy=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return cy(e.operands[0]);let t=Math.floor(e.operands.length/2);return Kv(e.kind,cy(qv(e.kind,e.operands.slice(0,t))),cy(qv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Gv(e.kind,cy(e.body));default:return e}},ly=(e,t)=>{e.kind===`Eventually`&&!ey(t,e)&&t.push(e),`body`in e&&ly(e.body,t),`operands`in e&&e.operands.forEach(e=>ly(e,t))},uy=e=>{let t=e.filter(Wv),n=e.flatMap(e=>e.kind===`Not`&&Wv(e.body)?[e.body]:[]);return!t.some(e=>ey(n,e))},dy=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,Gv(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.x(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},fy=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Gv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},py=(e,t,n)=>e.flatMap(e=>{let r=fy(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),my=e=>[...new Set(e.map(Qv))].sort().join(`|`),hy=(e,t)=>{let n=new Set(t.map(my));return[...e.filter(e=>!n.has(my(e))),...t]},gy=e=>{let t=dy(e),n=py(t,`Always`,`And`),r=py(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=fy(t,`Eventually`,`Or`);if(n&&!(ey(e,n.first)||ey(e,n.second)))return hy(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(ey(e,t.first)||ey(e,t.second))&&!ey(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!uy(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=fy(t[e],`Always`,`And`);n&&(ey(t,n.first)||t.push(n.first),ey(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)ey(t,e.first)&&ey(t,e.second)&&!ey(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!uy(t)?[]:i(t)};return a(e)},_y=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Jv(e)<=1)}),vy=e=>{let t=gy([e]).map(_y),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=my(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 gy(n)){let n=my(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(_y(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},yy=(e,t)=>!ey(e,t)||ey(e,t.body),by=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&Jv(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=ay(t);if(r){let e=Jv(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(Yv(t))throw new e.x(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},xy=(e,t)=>{let n=e.findIndex(e=>$v(e,t));return n===-1?(e.push(t),e.length-1):n},Sy=e=>{let t=oy(iy(ny(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=sy(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])by(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:qv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:$v(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&cy(e.formula),n=[];t&&ly(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>xy(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>xy(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>xy(i,e))}));return{tableau:t&&vy(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Cy=()=>e.ot(new e.x(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.rt.livenessEvaluationFailure),wy=/* @__PURE__ */ new Set([`~>`,`-+->`]),Ty=/* @__PURE__ */ new WeakSet,Ey=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),Dy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Oy=(t,n)=>new e.x(`TLC cannot handle the temporal formula ${U(t)}${n===void 0?``:`:\n${n}`}`),ky=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=ky(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Og(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=zg(e,n);if(t)return Ld(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:j(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Ll(e,(e,o)=>(a=Math.max(a,ky(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};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:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(wy.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=j(e)?void 0:v_(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,j_(o,e.args,Dy(n,t)))}default:return l(e)}},Ay=(t,n)=>{try{return Yg(t,n)}catch(t){if(!(t instanceof e.x))throw t;if(!at(t))return;throw e.ot(new e.x(`${e.G}${t.message}`),e.rt.error)}},jy=(t,n,r,i,a={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let o=(e,t,n=a.name,o=a.expanding,s)=>jy(e,t,r,i,{name:n,path:s?.kind===`Operator`&&s.params.length===0?[...a.path,s.name]:a.path,expanding:o,isSubstituted:a.isSubstituted||s!==void 0&&r.substitutedDefinitions.has(s)});if(t.kind===`And`)return t.operands.flatMap(e=>o(e,n,U(e)));if(t.kind===`Label`)return o(t.body,n);if(t.kind===`Let`)return o(t.body,My(t,n,r));if(t.kind===`Identifier`){let i=j(t)?Og(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return o(i.expression,i.scope,Ty.has(i)?t.name:a.name);let s=r.constants.has(t.name)?void 0:zg(t.name,r);if(!i&&s?.kind===`Operator`&&s.params.length===0&&(Ld(s,r)>0||p_(s,r)===void 0)){if(a.expanding.has(s))throw e.X();return o(s.body,void 0,!a.isSubstituted&&r.instanceNames.get(t.name)||s.name,/* @__PURE__ */ new Set([...a.expanding,s]),s)}}let s=Dy(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||ky(t,n,r)===3)){let e=y_(t,s),n=j(t)?void 0:zg(t.operator,r),i=e?.kind===`Closure`&&e.params.every(e=>r.instanceParams.has(e));if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&(!a.isSubstituted||i))return o(e.body,j_(e,t.args,s),a.isSubstituted&&n?n.name:t.operator,a.expanding,n)}let c=i&&t.kind===`Forall`&&t.bounds.every(e=>ky(e.set,n,r)===0),l=c?Ay(t.bounds,s):void 0;if(c&&l){let e=[];if(Xg(t.bounds,l,n,n=>(e.push(...o(t.body,n,U(t.body))),!1)),e.length===0)throw Cy();return e}return[{expression:t,scope:n,name:a.name,path:a.path}]},My=(e,t,n)=>{let r=F_(e.definitions,Dy(n,t),L_(e.definitions,n));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Ty.add(e.binding);return r},Ny=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?ky(t,n,r):a;if(o===0){let i=W(t,Dy(r,n));if(typeof i!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${_g(t)}`);return Hv(i)}return o===1?{kind:`State`,expression:t,scope:n}:t.kind===`AngleAction`?{kind:`Action`,expression:t.action,subscript:t.subscript,scope:n}:{kind:`Action`,expression:t,subscript:void 0,scope:n}},o=0,s=(t,n,i,s)=>{if(o>=100)throw e.X();o++;let c=p(t,n);o--;let l=Jv(c),u=l===0&&ky(i,s,r)>2;return l>2||u?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=Dy(r,t),o=j(e)||zg(n,r)===void 0?Og(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&Ty.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:j(e)?b_(n,a):v_(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?Ey.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,qv(f,n))}if(c?.kind!==`Closure`)throw Oy(e);let m=!j(e)&&zg(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,j_(c,u,a),e,t)),m)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.F||r&&!i;throw!(n instanceof e.x)||a?n:Oy(t)}},u=(t,n)=>{let i=ky(t,n,r),o=[],s=t.kind===`Forall`;try{Zg(t.bounds,Dy(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.x)||r instanceof e.F)throw r;if(i<=2)return a(t,n,i);throw Oy(t,s&&!at(r)?r.message:void 0)}return o.length===0?Hv(s):d(t,n,qv(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=Jv(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,qv(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,qv(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let n=ky(e,t,r);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,My(e,t,r));case`Apply`:{let n=e.args;if(e.operator===`~`&&!j(e))return d(e,t,Gv(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,Kv(`Or`,Gv(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&ky(e.condition,t,r)===0){let n=W(e.condition,Dy(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,Kv(`Or`,Kv(`And`,n,p(e.consequent,t)),Kv(`And`,Gv(`Not`,n),p(e.alternative,t))))}}if(n<=2)return a(e,t,n);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?Gv(`Always`,Kv(`Or`,Gv(`Not`,p(e.args[0],t)),Gv(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return Gv(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=Gv(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?Gv(`Always`,Gv(`Eventually`,Kv(`Or`,i,a))):Kv(`Or`,Gv(`Eventually`,Gv(`Always`,i)),Gv(`Always`,Gv(`Eventually`,a)))}default:throw Oy(e)}};return p(t,n)},Py=t=>({holdsState:(n,r)=>{let i={environment:t,scope:n.scope,state:r,next:void 0},a=n.kind===`State`?W(n.expression,i):ig(n.step,i);if(typeof a!=`boolean`)throw new e.x(`A state predicate was evaluated to a non-boolean value.`);return a},holdsAction:(n,r,i)=>{let a=n.scope,o=n.subscript;if(o&&gr(W(o,{environment:t,scope:a,state:r,next:void 0}),W(o,{environment:t,scope:a,state:i,next:void 0})))return!1;let s=W(n.expression,{environment:t,scope:a,state:r,next:i});if(typeof s!=`boolean`)throw new e.x(`Encountered an action predicate that's not a boolean.`);return s}}),Fy=(t,n,r,i,a)=>{let o=e=>Fy(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r=i.holdsState(t,n);return a.set(t,r),r}case`Action`:return t.enabled&&a.get(t.enabled)===!1?!1:r!==void 0&&i.holdsAction(t,n,r);case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return Fy(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.x(`TLC cannot evaluate a temporal formula in a single step`)}},Iy=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Iy(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return Fy(e,t[r],t[a(r)],Py(i),/* @__PURE__ */ new Map)}},Ly=`UnnamedAction`,Ry={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},zy=e=>{let t=e.range??Ry;return Lr([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},By=(e,t)=>{let n=[[`name`,e.name],[`location`,zy(e.location)]];return e.parameters.length>0&&n.push([`context`,Lr(e.parameters)],[`parameters`,Ir(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Lr(n)},Vy=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),Hy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Uy=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Wy=e=>e.kind===`Apply`?e.args:[],Gy=(e,t,n)=>{let r=Uy(e);if(r===void 0)return;if(j(e)){let e=Og(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=v_(r,n);return i?.kind===`Closure`?i:void 0},Ky=(t,n)=>{try{return W(t,Hy(n,void 0)),!0}catch(t){if(t instanceof e.b)return!1;throw t}},qy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&Nd(e,t)&&Ky(e.body,t),Jy=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&qy(e,t),Yy=(e,t)=>{let n=zg(e.name,t);return n?.body===e.body&&Jy(n,t)},Xy=(e,t)=>{if(e.kind!==`Identifier`||!j(e))return;let n=Og(t,e.name);return n?.kind===`Thunk`?n:void 0},Zy=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:My(e,t,n)};let r=Xy(e,t);return r&&{expression:r.expression,scope:r.scope}},Qy=(e,t,n,r)=>t.kind===`Apply`?j_(e,t.args,Hy(r,n)):e.scope,$y=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Og(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),eb=(t,n)=>{try{return t()}catch(t){if(t instanceof e.b)return n();throw t}},tb=(e,t,n,r,i)=>{let a=Wy(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>ky(e,n,i)!==0)?o():eb(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,Hy(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},nb=(t,n,r,i,a)=>{let o=()=>({name:r?.name??Ly,location:t.location,parameters:$y(r,n),expression:t,scope:n});if(qm.has(t.kind))throw e.ot(new e.x(`${e.K}The next state relation is not a boolean expression.\n${_g(t)}`),e.rt.error);switch(t.kind){case`Let`:return nb(t.body,My(t,n,i),r,i,a);case`Label`:return nb(t.body,n,r,i,a);case`Or`:return t.operands.flatMap(e=>nb(e,n,r,i,a));case`Exists`:return eb(()=>{let e=[];return Zg(t.bounds,Hy(i,n),n=>(e.push(...nb(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=j(t)?void 0:a.get(Uy(t)??``),c=Gy(t,n,i);if(s)return tb(s,t,n,c,i);if(!c)return[o()];let l=Wy(t),u=j(t)?c.name:i.instanceNames.get(Uy(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return Yy(c,i)||l.some(e=>ky(e,n,i)!==0)?d():eb(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:W(t,Hy(i,n))},parent:e}),c.scope);return nb(c.body,e,{...c,name:u},i,a)},d)},rb=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>rb(e,t,n,r,i,o),s=(e,t,n)=>Vy(e,Al(t,a),n),c=Zy(e,t,n);if(c){o(c.expression,c.scope);return}let l=Gy(e,t,n);if(l&&Yy(l,n))return;let u=l?[...a,...kl.get(l.body)??[]]:a;if(l&&l.params.length===0){if(ky(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,j_(l,e.args,Hy(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(Ly,e,t));return}let d=ky(e,t,n);d<=1?r.inits.push(s(Ly,e,t)):d===3&&r.temporals.push(s(Ly,e,t))},ib=(e,t,n,r,i)=>{let a=(t,n)=>ib(e,t,n,r,i),o=Zy(t,n,r);if(o){a(o.expression,o.scope);return}let s=Gy(t,n,r);if(s&&Yy(s,r))return;if(s&&s.params.length===Wy(t).length){a(s.body,Qy(s,t,n,r));return}if(t.kind===`Forall`&&eb(()=>(Zg(t.bounds,Hy(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Vy(e,a)):ky(a,n,r)<2?i.invariants.push(Vy(e,a)):i.impliedTemporals.push(Vy(e,t));return}let c=ky(t,n,r);c<=1?i.impliedInits.push(Vy(e,t)):c===3&&i.impliedTemporals.push(Vy(e,t))},ab=(e,t)=>{let n=zg(e,t);return n?.kind===`Operator`&&!Jy(n,t)?n:void 0},ob=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:ab(e.specification,t);a&&(rb(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Ly,location:e.frames[0].location,parameters:[],expression:Al(e.expression,e.frames),scope:e.scope}]:nb(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:v_(e.init,t);o?.kind===`Closure`&&r.inits.push(Vy(e.init??``,o.body));let s=e.next===void 0?void 0:v_(e.next,t);return s?.kind===`Closure`&&r.actions.push(...nb(s.body,s.scope,s,t,n)),r},sb=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=Zy(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&j(e)?Og(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!j(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Gy(e,t,n);if(!s||s.params.length!==Wy(e).length)return!0;let c=zg(s.name,n);return c?.body===s.body&&qy(c,n)?!0:i(s.body,Qy(s,e,t,n))};return i(e,t)?r:void 0},cb=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,lb=(t,n,r=!1)=>`${t.name===Ly?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:cb(t)} ${e.Z(t.location.range??Ry)}`,ub=e=>`${e.name}${cb(e)}`,db=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=ab(e,n);t&&i.invariants.push(Vy(e,t.body))}),t.properties.forEach(e=>{let t=ab(e,n);t&&ib(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>yr(e.map(e=>{let n=a&&t&&No(a,t,e.expression);return By(e,n&&Lr(n))})),s=e=>yr(e.flatMap(e=>{let t=ab(e,n);return t?[Lr([[`name`,t.name],[`location`,zy(t.location)]])]:[]}));return Lr([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,yr(n.variables.map((e,t)=>Lr([[`name`,e],[`location`,zy(r[t])],...a?[[`coverage`,Lr([[`distinct`,xo(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},fb=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return fb(e.body);case`And`:case`Or`:return e.operands.some(fb);default:return!1}},pb=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,mb=e=>e.promises.some(e=>fb(e.body))||e.models.some(e=>!pb(e)),hb=(e,t)=>e.every((e,n)=>Un(e,t[n])),gb=e=>e.filter((t,n)=>n===0||e[n-1]!==t),_b=e=>({data:e(1024),length:0,create:e}),vb=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},yb=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},bb=e=>new Int32Array(e).fill(-1),xb=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Sb=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Cb=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,wb=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),Tb=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Eb=2**53-1,Db=(e,t,n)=>{let r=t.map(e=>Ny(e.expression,e.scope,n)),i=e.map(e=>Gv(`Not`,Ny(e.expression,e.scope,n))),a=i.length===1?i[0]:qv(`Or`,i);return{formula:r.length===0?a:qv(`And`,[...r,a]),negations:i}},Ob=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},kb=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>kb(e,t));return;default:kb(e.body,t)}},Ab=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>kb(e,t));return[...t]},jb=e=>Ab(e).flatMap(e=>Ob(e).map(e=>e.expression)),Mb=(e,t,n,r)=>{if(e.length===0)return;let i=Db(e,t,n),a=/* @__PURE__ */ new Set;kb(i.formula,a);let o=[...a].flatMap(Ob),s=o.every(e=>e.scope===void 0)?!Fd(o.map(e=>e.expression),n,`repeated`):!z_(n),c={environment:n,atoms:Py(n)},l=Sy(i.formula),u=Nb(l,{atoms:{holdsState:(e,t)=>c.atoms.holdsState(e,t),holdsAction:(e,t,n)=>c.atoms.holdsAction(e,t,n)},isShared:s,isSame:hb,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},r,n.runtime.version!==`1.7.4`),d=(e,t)=>{if(e===void 0)return t();c.atoms=Py(e);try{return t()}finally{c.atoms=Py(n)}};return{branches:u.branches,solutions:l,addInitialState:(e,t,n)=>d(n,()=>u.addInitialState(e,t)),addState:(e,t,n,r)=>d(r,()=>u.addState(e,t,n,r!==void 0)),storeState:u.storeState,getStateCounts:u.getStateCounts,findViolation:u.findViolation,getViolatedProperties:(t,r)=>[...new Set(e.filter((e,a)=>!Iy(i.negations[a].body,t,r,0,n)).map(e=>e.name))]}},Nb=(t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=1,s=n.isShared,c=n.atoms,l=n.evaluateFrom,u=/* @__PURE__ */ new Map,d=[],f=e=>{let t=u.get(e)??u.size;return u.set(e,t),d[t]=e,t},p=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[f(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[f(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(p);return t.every(e=>e!==void 0)?t.flat():void 0},m=e=>new Int8Array(e*u.size).fill(-1),h=e=>new Int8Array(e*a.size).fill(-1),g=(e,t,n,r,i)=>s?e(t,n,r,i):e(t,m(1),0,i),_=t=>{switch(t.kind){case`Boolean`:{let e=t.value;return()=>e}case`State`:case`Enabled`:{let e=f(t);return(n,r,i)=>(r[i+e]===-1&&(r[i+e]=+!!c.holdsState(t,n)),r[i+e]===1)}case`Action`:{let e=t.enabled&&f(t.enabled);return(n,r,i,a)=>(e===void 0||r[i+e]!==0)&&a!==void 0&&c.holdsAction(t,n,a)}case`Not`:{let e=_(t.body);return(t,n,r,i)=>!e(t,n,r,i)}case`And`:{let e=t.operands.map(_);return(t,n,r,i)=>e.every(e=>e(t,n,r,i))}case`Or`:{let e=t.operands.map(_);return(t,n,r,i)=>e.some(e=>e(t,n,r,i))}case`Next`:{let e=_(t.body);return(t,n,r,i)=>e(i??t,m(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new e.x(`TLC cannot evaluate a temporal formula in a single step`)}}},v=t.map(e=>({solution:e,checks:{states:e.stateChecks.map(_),actions:e.actionChecks.map(_),nodes:e.tableau?.nodes.map(e=>{let t=s?p({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(_)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=Qv(e),n=a.get(t)??a.size;return a.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:_b(e=>new Int32Array(e)),edgeActions:_b(e=>new Uint8Array(e)),stateResults:_b(e=>new Uint8Array(e)),initial:[],firstNodes:_b(bb),lastNodes:_b(bb),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),y=(e,t,n,r,i)=>l(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!g(e,n,r,i)}),a}),b=(e,t,n,r,i,a,o,c,u,d)=>l(t,()=>{let t=e.checks.actions;for(let l=0;l<t.length;l++){if(!s){u[d+l]=+!!g(t[l],n,r,i,a);continue}let f=c+e.actionIds[l];o[f]===-1&&(o[f]=+!!t[l](n,r,i,a)),u[d+l]=o[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>g(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!c.holdsState(d[t>>1],n)),r[o]!==(t&1))return!1}return!0},te=(e,t,n,r,i,a)=>l(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!i)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},S=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=yb(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n,r)=>{let i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),yb(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],yb(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?vb(e.firstNodes,t,[r]):e.nextSiblings[a]=r,vb(e.lastNodes,t,[r]),r},re=(e,t)=>t<0?e.checks.nodes.some((n,r)=>S(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,C=(e,t,n)=>(re(e,t)||e.stateCount++,ne(e,t,n,wb(e,t,n))),ie=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;vb(e.edgeTargets,o,n),i.forEach((t,n)=>vb(e.edgeActions,(o+n)*s,r,t*s,s)),vb(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},ae={slots:/* @__PURE__ */ new Int32Array},w=(e,t,i)=>{let a=[...i,{index:e,state:t}],s=16*o;ae.slots=ae.slots.length===s?ae.slots.fill(0):new Int32Array(s);let c=e=>{let t=ae.slots,i=a[e];for(let o=(r.getFingerprint(i)&2147483647)%t.length;;o=(o+1)%t.length){let r=t[o];if(r===0)return t[o]=e+1,!0;let s=a[r-1];if(s.index===i.index&&n.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<a.length;e++){if(l>=ae.slots.length>>1){let e=ae.slots;ae.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}ae.slots.length>s&&o++;let u=[];for(let e of ae.slots)e!==0&&u.push(a[e-1]);return u},oe=(e,t,n,i,o,s,c)=>{let l=y(e,i,n,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],p=[],g=new Uint8Array(d);u.successors.length>0&&b(e,i,n,s,c,n,h(1),0,g,0);for(let r of u.successors){if(!te(e,r,i,n,s,c))continue;if(x(t,r)&&e.errorNode===void 0&&e.solution.models.some(pb)){e.errorNode=o;return}let a=S(e,i,r);if(a!==void 0&&p.includes(a))continue;let l=a??C(e,i,r);p.push(l),f.push(0),a===void 0&&oe(e,t,n,i,l,s,c)}let _=[g],v=1;if(r.forEachActionSuccessors(i,n,r=>{let o=h(r.length),l=new Uint8Array(r.length*d);_.push(l);for(let h=0;h<r.length;h++){let g=r[h],_=m(1);b(e,i,n,s,c,g.state,o,h*a.size,l,h*d);let y=e.isDone[g.index]===!0;for(let n of u.successors){if(!te(e,n,i,g.state,_,0))continue;let r=S(e,g.index,n);if(r!==void 0&&p.includes(r))continue;let a=r??C(e,g.index,n);p.push(a),f.push(v+h),r===void 0&&y&&oe(e,t,g.state,g.index,a,_,0)}}v+=r.length}),p.length>0){let t=new Uint8Array(v*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;ie(e,o,p,t,f,l)}},se=(e,t,n,r,i,a,o)=>{let s=u.size,c=new Uint8Array(t.nodes.length*n.length);l(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(c[i*n.length+t]=1)}),re(e,o)||e.stateCount++,e.isDone[o]=!0;for(let l of Tb(e,o)){let o=[],u=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[l]].successors){if(c[f*n.length+a]===0)continue;let l=S(e,i.index,f);if(l!==void 0&&o.includes(l))continue;let p=l??C(e,i.index,f);o.push(p),u.push(a),l===void 0&&d&&oe(e,t,i.state,i.index,p,r,a*s)}}),ie(e,l,o,i,u,a)}return e.errorNode===void 0?void 0:ue(e,e.errorNode)},ce=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)wb(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{xb(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),xb(e,i)||e.stateCount++,ie(e,i,a,n,o,r)},le=(t,n)=>{if(t.initial.includes(n))return[n];let r=/* @__PURE__ */ new Map,i=[];for(let e of t.initial)xb(t,e)&&(i.push(e),r.set(e,-1));for(let e=0;e<i.length;e++){let a=i[e];for(let e of Sb(t,a))if(!(e===a&&t.solution.tableau)){if(e===n){let e=[n];for(let t=a;t!==-1;t=r.get(t)??-1)e.push(t);return e}xb(t,e)&&!r.has(e)&&(r.set(e,a),i.push(e))}}throw new e.x(`Couldn't re-create liveness trace (path) starting at: ${n}`)},ue=(e,t)=>gb(le(e,t).reverse().map(t=>e.nodeStates[t])),de=(t,n)=>{let r=t.solution,i=r.actionChecks.length,a=(e,n,r)=>t.edgeActions.data[(t.edgeStarts[e]+n)*i+r]===1,o=(e,t)=>n.eventuallyAlways.every(n=>a(e,t,n)),s=new Float64Array(t.nodeStates.length).fill(-1),c=t.initial.filter(e=>xb(t,e)),l=[],u=e=>{let n=Sb(t,e).indexOf(e);return n!==-1&&o(e,n)},d=(e,n)=>r.tableau!==void 0&&yy(r.tableau.nodes[t.nodeTableaux[e]].particle,n),f=e=>{let i=l.pop()??e;if(i===e&&!u(i)){s[i]=Eb;return}let c=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let n=i;;n=l.pop()??e){c.add(n);let r=f.get(t.nodeStates[n]);if(r?r.push(n):f.set(t.nodeStates[n],[n]),s[n]=Eb,n===e)break}let m=n.infinitelyOftenStates.every(e=>[...c].some(n=>Cb(t,n,e))),h=n.infinitelyOftenActions.every(e=>[...c].some(n=>Sb(t,n).some((t,r)=>c.has(t)&&o(n,r)&&a(n,r,e)))),g=r.promises.every(e=>[...c].some(t=>d(t,e)));if(m&&h&&g)return p(e,c,f)},p=(i,s,c)=>{let l=ue(t,i),u=[],f=/* @__PURE__ */ new Set([i]),p=n.infinitelyOftenStates.map(()=>!1),h=n.infinitelyOftenActions.map(()=>!1),g=r.promises.map(()=>!1),_=p.length+h.length+g.length,v=i,y=e=>{u.push(v),v=e};for(;_>0;){let i=_;for(;n.infinitelyOftenStates.forEach((e,n)=>{!p[n]&&Cb(t,v,e)&&(p[n]=!0,_--)}),r.promises.forEach((e,t)=>{!g[t]&&d(v,e)&&(g[t]=!0,_--)}),!(_<=0);){let r=-1,l=-1,d=_;if(Sb(t,v).some((e,i)=>{if(c.has(t.nodeStates[e])){if(!s.has(e)||!o(v,i))return!1;r=e,n.infinitelyOftenActions.forEach((e,t)=>{!h[t]&&a(v,i,e)&&(h[t]=!0,_--)})}return _<d?(y(e),f.clear(),!0):(s.has(e)&&!f.has(e)&&(l=e),!1)}))break;if(_<i){y(r),f.clear();break}for(;l===-1;){let n=u.pop();if(n===void 0)throw new e.x(`TLC failed to build the counterexample of a liveness property`);v=n,l=Sb(t,n).find(e=>s.has(e)&&!f.has(e))??-1}y(l),f.add(l)}}let b=m(i,v,c);for(let e=u.length-1;e>=0;e--){let n=t.nodeStates[u[e]];b[b.length-1]!==n&&b.push(n)}let ee=l[l.length-1];return b[b.length-1]===ee&&b.pop(),{prefix:l.slice(0,-1),cycle:[ee,...b.reverse()],isCycleConstrained:mb(r)}},m=(n,r,i)=>{if(r===n)return[];let a=t.nodeStates[r],s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set([a]),l=[];for(let r=a,u=-1,d=0;;d++){for(let e of i.get(r)??[])for(let[d,f]of Sb(t,e).entries()){if(f===e||!o(e,d))continue;if(f===n){let e=[];for(let t=r,n=u;t!==a;)e.push(t),t=n,n=s.get(t)??-1;return e.push(a),e}let p=t.nodeStates[f];i.has(p)&&!c.has(p)&&(c.add(p),l.push([p,r]))}s.set(r,u);let f=l[d];if(f===void 0)throw new e.x(`TLC failed to build the counterexample of a liveness property`);r=f[0],u=f[1]}};for(let e=0;e<c.length;e++){let n=[c[e],-1,0],r=0;for(;n.length>=3;){let e=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===e){let e=f(a);if(e)return e}n.push(Math.min(n.pop()??e,e));continue}if(s[a]!==-1){n.push(Math.min(e,s[a]));continue}s[a]=r,n.push(e,a,-42),l.push(a);let u=r++;Sb(t,a).forEach((e,r)=>{xb(t,e)&&(o(a,r)?s[e]===-1?n.push(e,-1):u=Math.min(u,s[e]):s[e]===-1&&c.push(e))}),n.push(u)}}};return{branches:v.length,addInitialState:(e,t)=>{let n=m(1);for(let r of v){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)te(r,a,void 0,t,n,0)&&r.initial.push(S(r,e,a)??C(r,e,a))}},addState:(t,n,r,i)=>{let o=w(t,n,r),s=m(o.length),c=o.findIndex(e=>e.index===t)*u.size,l=h(o.length);for(let r of v){let u=r.checks.actions.length,d=new Uint8Array(o.length*u);o.forEach((e,i)=>b(r,t,n,s,c,e.state,l,i*a.size,d,i*u));let f=y(r,t,n,s,c),p=r.solution.tableau;if(i&&(p?Tb(r,t).some(e=>r.edgeCounts[e]>0):o.every(e=>xb(r,e.index))))throw new e.x(`The behavior graph holds every edge of the state already.`);if(!p){ce(r,o,d,f,t);continue}let m=se(r,p,o,s,d,f,t);if(m)return m}},storeState:(e,t)=>{for(let n of v){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=S(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,ne(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>v.map(e=>e.stateCount),findViolation:()=>{for(let e of v)for(let t of e.solution.models){let n=de(e,t);if(n)return n}}}},Pb=t=>{switch(t.kind){case`Number`:if(!Bt(t.value))throw e.ot(new e.A(`TLC can't handle a number this big.\n${t.value}`),e.rt.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return En(t.name);case`Set`:return F({kind:`MixedSet`,elements:t.elements.map(Pb)})}},Fb=t=>{try{return Pb(t)}catch(t){throw!(t instanceof e.x)||t instanceof e.A||t instanceof e.S?t:e.ot(new e.x(`${e.K}${t.message}`),e.rt.error)}},Ib=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e.x(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Vn(e,r)})});if(n)return n[1];throw new e.x(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Lb=t=>new e.v(`In the configuration file, the identifier ${t} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),Rb=(t,n)=>{let r=e=>n.root.visible.get(e)?.key??e,i=n.root.constants.map(e=>e.name),a=n.root.variables,o=e=>{let t=n.moduleSymbols.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},s=e=>{if(e.module===void 0)return[e.name,r(e.name)];let t=o(e);return t?[t.key]:[]},c=e=>e.module===n.root.module.name?[]:s(e),l=e=>{let t=n.definitions.get(e);return t?.kind===`Operator`?t.params.length:n.root.constants.find(t=>t.name===e)?.arity??n.builtins.get(e)?.arity??0},u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,f=(e,t)=>{n.builtins.set(e,t),n.definitions.delete(e),u.delete(e),d.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Fb(e.value);mr(t),c(e).forEach(e=>{let n=l(e);n===0?u.set(e,t):f(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let p=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=p.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.v(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(Pb),Pb(t.value)]),p.set(n,r)}),p.forEach(e=>c(e).forEach(t=>f(t,Ib(e.name,l(t),e.rows))));let m=new Map(t.substitutions.flatMap(e=>s(e).map(t=>[t,r(e.target)])));[...m.keys()].forEach(e=>u.delete(e));let h=(t,o,s)=>{let c=r(o),l=n.definitions.get(c);if(!(l!==void 0||n.builtins.has(c)||u.has(c)||i.includes(o)||a.includes(o)))throw new e.v(`The configuration file substitutes for ${t} with the undefined identifier ${o}.`);if(l?.kind===`Operator`&&l.params.length!==s)throw new e.v(`The configuration file substitutes for ${t} with ${o} of different number of arguments.`)};t.substitutions.filter(e=>e.module===void 0).forEach(r=>{let a=r.name,o=r.target;if(!i.includes(a)&&!n.root.visible.has(a))throw new e.v(`In the configuration file, the identifier ${a} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===o))throw Lb(o);h(a,o,n.root.constants.find(e=>e.name===a)?.arity??n.root.visible.get(a)?.arity)});let g=t.substitutions.filter(e=>e.module!==void 0);[...n.moduleSymbols.keys()].forEach(t=>{let n=g.filter(e=>e.module===t);n.forEach(e=>{let t=o(e);if(t){if(n.some(t=>t.name===e.target))throw Lb(e.target);h(e.name,e.target,t.arity)}});let r=n.find(e=>!o(e));if(r)throw new e.v(`In the configuration file, the identifier ${r.name} does not appear in the specification.`)});let _=g.find(e=>!n.moduleSymbols.has(e.module??``));if(_)throw new e.v(`In the configuration file, the module name ${_.module} is not a module in the specification.`);let v=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(c)),y=(e,t)=>{if(v.has(e))return{key:e,prefix:t};let r=n.copySources.get(e);return r&&y(r.source,t+r.prefix)};n.copySources.forEach((e,t)=>{let r=y(e.source,e.prefix),i=n.definitions.get(t);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=ru(t,r.key,a,a.slice(r.prefix),i.location);n.definitions.set(t,o),n.root.visible.forEach((e,r)=>{e.key===t&&r!==t&&n.definitions.set(r,o)})}),n.operatorConstants.forEach((e,t)=>u.set(t,e));let b=i.filter(e=>!u.has(e)&&!m.has(e)&&!d.has(e));if(b.length>0){let t=n.order.getDeclarationOrder(`constant`).find(e=>b.includes(e))??b[0];throw new e.v(`The constant parameter ${t} is not assigned a value by the configuration file.`)}return{constants:u,substitutions:m}},zb=`tlc2/value/impl/`,Bb={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Vb={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},Hb=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},Ub=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Wb=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Gb=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Ub.get(e[3])}${`[]`.repeat(e[1].length)}`),Kb=(e,t)=>e[e[t].first].text,qb=(e,t)=>Kb(e,t).replaceAll(`/`,`.`),Jb=t=>{let n=Hb(t);if(n.readUint32()!==3405691582)throw new e.I(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===Bb.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Bb.integer?i.value=n.readInt32():t===Bb.float?n.readUint32():t===Bb.long||t===Bb.double?(n.readBytes(8),e++):t===Bb.class||t===Bb.string||t===Bb.methodType||t===Bb.module||t===Bb.package?i.first=n.readUint16():t===Bb.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=qb(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=Gb(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:Hb(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>qb(r,d.readUint16())):[],p=Wb.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=Gb(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${h}`})}return{pool:r,methods:s}},Yb=(e,t)=>{let n=e[t],r=e[n.second];return{className:Kb(e,n.first),name:e[r.first].text}},Xb=(t,n,r,i)=>{let a=()=>new e.V(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===Bb.integer)return t.value;if(t.tag===Bb.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=Vb.iconstM1&&t<=Vb.iconst5)s.push(t-Vb.iconst0),e+=1;else if(t===Vb.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===Vb.sipush)s.push(r()<<16>>16),e+=3;else if(t===Vb.ldc)s.push(l(o[e+1])),e+=2;else if(t===Vb.ldcW)s.push(l(r())),e+=3;else if(t===Vb.dup){let t=c();s.push(t,t),e+=1}else if(t===Vb.getstatic){let t=Yb(n,r());if(t.className!==`${zb}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===Vb.invokestatic){let t=Yb(n,r()),o=c();if(t.className!==`${zb}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===Vb.new)s.push({className:Kb(n,r()),value:void 0}),e+=3;else if(t===Vb.invokespecial){let t=Yb(n,r()),o=c(),s=c();if(!(t.className===`${zb}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===Vb.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},Zb=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Jb(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Xb(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Qb=w(`EOF`),$b=w(`IDENTIFIER`),ex=w(`DEFBREAK`),tx=(e,t)=>Array.from({length:w(t)-w(e)+1},(t,n)=>w(e)+n),nx=new Set(tx(`op_57`,`op_119`)),rx=new Set(tx(`op_1`,`op_119`)),ix=new Set(tx(`op_57`,`op_70`)),ax=/* @__PURE__ */ new Set([...tx(`ACTION`,`EXCEPT`),w(`EXTENDS`),...tx(`IF`,`SF`),w(`STATE`),...tx(`THEN`,`WITH`),w(`US`),...tx(`op_112`,`op_116`)]),ox=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),sx=new Map([...ox(`postfix`,160,160,!0,`[`),...ox(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...ox(`prefix`,120,120,!1,`-.`),...ox(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...ox(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...ox(`prefix`,40,40,!0,`\\lnot`),...ox(`nfix`,100,130,!0,`\\times`),...ox(`infix`,140,140,!1,`^`,`^^`),...ox(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...ox(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...ox(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...ox(`infix`,100,110,!0,`|`,`||`,`%%`),...ox(`infix`,100,110,!1,`%`),...ox(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...ox(`infix`,90,140,!1,`\\wr`),...ox(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...ox(`infix`,90,130,!1,`!!`),...ox(`infix`,90,90,!1,`...`,`..`),...ox(`infix`,80,80,!0,`\\intersect`,`\\union`),...ox(`infix`,80,80,!1,`\\`),...ox(`infix`,70,70,!1,`<:`,`:>`),...ox(`infix`,60,60,!0,`@@`),...ox(`infix`,50,140,!0,`\\cdot`),...ox(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...ox(`infix`,30,30,!0,`\\land`,`\\lor`),...ox(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...ox(`infix`,10,10,!1,`=>`)]),cx=new Map([...sx,...As.flatMap(e=>e.slice(1).map(t=>[t,sx.get(e[0])]))]),lx=cx.get(`[`),ux={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},dx=e=>({type:`tokens`,kinds:new Set(e)}),fx=e=>typeof e==`string`?e.startsWith(`<`)?dx([w(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(fx)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),px=e=>(...t)=>({type:e,body:G(...t)}),q=px(`zeroOrMore`),mx=px(`oneOrMore`),J=px(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),hx=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),gx=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=hx(e,n);return n},_x=(...e)=>{let t=e.map(w);return e=>t.includes(gx(e,1).kind)},vx=(e,t=gx(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},yx=e=>{let t=gx(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},bx=e=>_x(`CASESEP`)(e)&&vx(e),xx=e=>{let t=gx(e,1);ax.has(t.kind)&&(t.kind=$b)},Sx=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Cx=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),wx=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Tx=e=>e.operatorStacks[e.operatorStacks.length-1],Ex=(e,t)=>e.low>t.high,Dx=(e,t)=>e.high<t.low,Ox=e=>e.fix===`prefix`?e:cx.get(`${e.name}.`),kx=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===lx?Cx(`FcnAppl`,[n,...r.node.heirs]):Cx(`PostfixExpr`,[n,r.node]),operator:void 0})},Ax=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Cx(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Cx(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},jx=e=>{let t=Tx(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return kx(t,n),jx(e);if(i.operator!==void 0){let t=Ox(r.operator);return t!==void 0&&Ex(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Sx(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Sx(e,a.node.first,a.node.last)} and expression at location ${Sx(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Dx(a.operator,r.operator)?void 0:Ex(a.operator,r.operator)?(Ax(t,a.operator),jx(e)):`Precedence conflict between ops ${a.operator.name} in block ${Sx(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Ox(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Dx(s,r.operator))return;if(!Ex(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Sx(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Ax(t,s),jx(e);let c=Sx(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===ux?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Mx=e=>Y(t=>{let n=Tx(t),r=wx(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:jx(t)}),Nx=Mx(()=>!1),Px=Mx(()=>!0),Fx=Y(e=>{e.lastOperator=cx.get(e.token.image)}),Ix=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Lx=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Ix(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Rx=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!vx(e,n.first.beginColumn))return n;let t=Rx(e,n);if(t!==void 0)return t}},zx=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(w),n=(e,...t)=>t.some(t=>e.kind===w(t)),r=e=>e!==void 0&&nx.has(e.kind),i=e.token,a=hx(e,i);i.next=void 0;let o=hx(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===$b&&(e=e.next)}else if(e.kind===$b){let t=e.next;!r(t)||ix.has(t.kind)||rx.has(t.kind)&&t.next?.kind!==$b||(e=t.next?.kind===w(`SUBSTITUTE`)?i:rx.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==ex&&(e.next={kind:ex,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=hx(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Bx=e=>{let t=gx(e,1);if(t.kind===w(`LAB`)){let n=1;for(;n!==0;)if(t=hx(e,t),t.kind===w(`LAB`)&&n++,t.kind===w(`RAB`)&&n--,t.kind===Qb)return!1;return hx(e,t).kind===w(`IN`)}if(t.kind!==$b)return!1;for(t=hx(e,t);t.kind===w(`COMMA`);){if(t=hx(e,t),t.kind!==$b)return!1;t=hx(e,t)}return t.kind===w(`IN`)},Vx=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Hx=e=>e.proofLevels.at(-1)??-1,Ux=e=>{let t=gx(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:_x(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Hx(e)>=0&&Vx(t)>Hx(e):_x(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Wx=(e,t)=>{let n=Vx(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Gx=e=>Y(t=>Wx(t,t.token)?void 0:`${Sx(t,t.token)}: ${e}`),Kx=dx([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(w)),qx=dx([...Kx.kinds,w(`op_76`)]),Jx=dx(rx),Yx=dx(ix),Xx=dx([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(w)),Zx=()=>q(Z({expansion:[K(Kx,`<op_77>`)],semantic:vx}),K(`PrefixOp`,`InfixOp`),Px),Qx=()=>K(G(Z({expansion:[`OpenStart`],semantic:vx}),`OpenExpression`,Nx),G(Z({semantic:vx}),`ExtendableExpr`)),$x=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),eS=()=>K(G(Z({semantic:e=>_x(`ASSUME`,`BOXASSUME`)(e)||gx(e,2).kind===w(`COLONCOLON`)&&[w(`ASSUME`),w(`BOXASSUME`)].includes(gx(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),tS=()=>[`JuncItem`,q(Z({semantic:yx}),`JuncItem`)],nS=e=>Y(t=>{t.expecting=e,xx(t)}),rS=e=>Y(t=>{t.isTerminalProof=e}),iS=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{zx(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),aS={CompilationUnit:Q(void 0,[Y(zx),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),nS(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,nS(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,nS(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(zx)),G(Z({semantic:e=>_x(`USE`)(e)&&gx(e,2).kind!==w(`ONLY`)||_x(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(iS(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),iS(`Expression`,Z({expansion:[`<IDENTIFIER>`,Yx]}),`PostfixLHS`,`Expression`),iS(`Expression`,Z({expansion:[`<IDENTIFIER>`,Jx]}),`InfixLHS`,`Expression`),iS(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),iS(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[qx,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Jx,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Yx]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,nS(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[Kx,Fx]),NonExpPrefixOp:Q(void 0,[qx,Fx]),InfixOp:Q(`Infix Op`,[Jx,Fx]),PostfixOp:Q(void 0,[Yx,Fx]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{zx(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),eS(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),eS(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=wx(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Sx(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(zx),K(G(Z({amount:3}),Z({semantic:_x(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Ux}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>_x(`BY`)(e)||gx(e,2).kind===w(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>gx(e,2).kind!==w(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,rS(!0),J(`<ONLY>`)),G(`<USE>`,rS(!1),J(`<ONLY>`)),G(`<HIDE>`,rS(!1))),X("an expression, `MODULE' or `DEF'"),J($x(),q(`<COMMA>`,X(`MODULE or expression`),$x(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),$x(),q(`<COMMA>`,X(`MODULE or expression`),$x(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Xx,Gx(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Ux}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Xx,Gx(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:_x(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:_x(`INSTANCE`)}),`Instantiation`),G(Z({semantic:_x(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Ux}),Y(e=>{let t=wx(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Sx(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),mx(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:_x(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(qx,Jx,Yx),dx([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(w))],semantic:vx}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Sx(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:vx}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Bx}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),mx(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=wx(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),mx(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Bx}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>gx(e,2).kind===w(`MAPTO`)&&ax.has(gx(e,1).kind)}),Y(e=>{gx(e,1).kind=$b}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=Cx(`FcnAppl`,t.heirs),e.lastOperator=lx})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,mx(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(xx),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===w(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>bx(e)&&gx(e,2).kind!==w(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:bx}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[mx(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=gx(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...tS()),G(Z({expansion:[`<AND>`]}),...tS())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Rx(t,e.heirs[1]);return n&&`Item at ${Sx(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Sx(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),Zx(),Qx()],(e,t)=>{let n=Tx(t);n.push({node:e.heirs[0],operator:ux});let r=jx(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Nx,q(K(G(Z({expansion:[`PostfixOp`],semantic:vx}),`PostfixOp`,Px),G(Z({expansion:[`<DOT>`],semantic:vx}),`<DOT>`,Y(xx),Z({semantic:vx}),`Identifier`,Y(e=>{let t=Tx(e);t[t.length-1].operator!==void 0&&kx(t,t.length),t[t.length-1]={node:Cx(`RecordComponent`,[t[t.length-1].node,wx(e,2),wx(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:vx}),X(`function argument`),`SBracketCases`,Mx(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:vx}),`InfixOp`,Px,Zx(),Qx()),G(Z({expansion:[`<COLONCOLON>`],semantic:vx}),`<COLONCOLON>`,Y(e=>{let t=Tx(e);if(!Lx(t[t.length-1].node))return`\`::' at ${Sx(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Tx(e),n=wx(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Dx(r,e.lastOperator)){let t=wx(e,3);return`Removing label at ${Sx(e,t.first,t.last)} would change expression parsing.`}t.push({node:Cx(`Label`,[wx(e,3),wx(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:vx}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:vx}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Hx(e)<0&&e.proofLevels.length<=1?`${Sx(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Sx(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Ix(e.heirs)===void 0?e.heirs.length===1?Cx(`GeneralId`,e.heirs):void 0:Cx(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>gx(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>gx(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Sx(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},oS=/* @__PURE__ */ new Map,sS=e=>{let t=oS.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=sS(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,sS(aS[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return oS.set(e,n),n},cS=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},lS=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=hx(e,e.scanPosition)),e.scanPosition=hx(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},uS=(e,t)=>{if(t.type===`tokens`)return lS(e,t.kinds);if(t.type===`call`)return uS(e,aS[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||cS(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=uS(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||cS(e,t.semantic)?uS(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=uS(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=uS(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},dS=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=uS(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},fS=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||sS(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!sS(a).hasSemanticStart?sS(a).first.has(gx(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):dS(e,i,a)&&(o===void 0||o(e))}),pS=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,uS(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=hx(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Qb){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=hx(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ce(e.token.image)}" `},mS=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??pS(e)}\n\nResidual stack trace follows:\n${r}`,!1},hS=(e,t)=>{let n=hx(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,mS(e))},gS=(e,t)=>{let n=aS[t];n.message!==void 0&&(e.messages.push({name:n.message,token:gx(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!_S(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return mS(e,i);let a=r.node??(r.heirs.length===0?void 0:Cx(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},_S=(e,t)=>{if(t.type===`tokens`)return hS(e,t.kinds);if(t.type===`call`)return gS(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||mS(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||mS(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||_S(e,t));if(t.type===`choice`){let n=fS(e,t.alternatives);return n===-1?mS(e):_S(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!_S(e,t.body))return!1;if(t.type===`optional`)return fS(e,[t.body])===-1||_S(e,t.body);for(;fS(e,[t.body])===0;)if(!_S(e,t.body))return!1;return!0},vS=e=>{let t=xe(e),n={kind:Qb,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=_S(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
1784
- `)},yS={low:15,high:15},bS={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),xS=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),SS=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,CS=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),wS={low:17,high:17},TS=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),ES=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),DS=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),OS=/* @__PURE__ */ new Set([...DS,`'`]),kS=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),AS=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),jS=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),MS=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),NS=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...OS]),PS=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),FS=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),IS=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),LS=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),RS=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),zS=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),BS=/* @__PURE__ */ new Set([``,`*`,`-`]),VS={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},HS=(e,t)=>e.line-t.line||e.column-t.column,US=(e,t)=>({start:HS(e.start,t.start)<=0?e.start:t.start,stop:HS(e.stop,t.stop)>=0?e.stop:t.stop}),WS=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),GS={printed:``,set:``},KS={printed:`
1785
- `,set:``},qS={printed:`
1781
+ `]]),Rp=(e=`master`)=>e===`1.7.4`?Lp:Ip,zp=(e,t)=>e.every(e=>vi(e,t)),Bp=yr([!1,!0]);mr(Bp);const Vp=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return wr(Vp(e,t,r),Vp(e,r,n))},Hp=[`\\cup`,`\\cap`,`\\`],Up=e=>typeof e==`object`&&e.kind===`MixedSet`,Wp=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Gp=(e,t,n)=>{t.kind===`Interval`&&ci(t);let r=t.kind===`Interval`?t:pr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return Pt(r,e=>{vi(e,n)===i&&Mt(a,e)}),Wp(t)?kn(a):br(a)}if(ai(t))return n;if(!Ft(n))return Ln({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return Pt(r,e=>Mt(i,e)),Pt(n.kind===`Interval`?n:F(n).elements,e=>{vi(e,t)||Mt(i,e)}),br(i)},Kp=(e,t)=>{let n=t.elements,r=0,i=n.length;for(;r<i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;a<e.low?r=t+1:i=t}for(let t=e.low;t<=e.high;t++,r++){if(r===n.length)return!1;let e=n[r];if(e!==t)return typeof e!=`number`&&void 0}return!0},qp=(e,t)=>{if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;let n=typeof t==`object`&&t.kind===`Set`?Kp(e,t):void 0;if(n!==void 0)return n;for(let n=e.low;n<=e.high;n++)if(!vi(n,t))return!1;return!0},Jp=(e,t)=>{let n=(t,n)=>zo([ss(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Yp=[Vo(`TRUE`,!0),Vo(`FALSE`,!1),Vo(`BOOLEAN`,Bp),Vo(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Wo(`=`,gr),Wo(`#`,(e,t)=>!gr(e,t)),z(`~`,1,e=>!zo(e,0,`~`)),z(`<=>`,2,e=>zo(e,0,`<=>`)===zo(e,1,`<=>`)),Jp(`/\\`,(e,t)=>e&&t()),Jp(`\\/`,(e,t)=>e||t()),Jp(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>vi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!vi(R(e,0,`\\notin`),R(e,1,`\\notin`))),Wo(`\\subseteq`,(t,n)=>{if(typeof t==`object`&&t.kind===`Interval`)return qp(t,n);if(!N(t))throw new e.x(`\\subseteq expects a set but received ${L(t)}`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&P(t.base)?zp(F(t.base).elements,n.base):!$r(t,e=>!vi(e,n))}),...Hp.map(t=>z(t,2,n=>{let r=R(n,0,t),i=R(n,1,t),a=t!==`\\cup`&&typeof i==`object`&&i.kind===`Interval`&&typeof r==`object`&&r.kind!==`Interval`;if(Ft(r)&&Ft(i)&&!Up(r)&&!Up(i)&&!a&&!Nt(r)&&!Nt(i)){if(t===`\\cup`&&ai(r))return i;let n=t===`\\cup`?wr:t===`\\cap`?Cr:Sr;return gi((r,i)=>{let a=F(r),o=F(i),s=n(a,o);if(t===`\\cup`){let t=pr(a),n=Sr(o,a).elements,r=t===a.elements&&(n.length===0||Cn(t[t.length-1],n[0])<0);if(t.length+n.length>At())throw new e.P(jt());if(r&&!a.isNormalized)return s;let i=s===a?On(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=Wp(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>vi(e,s)))),s},(e,n)=>Gp(t,e,n),r,i)}return Ft(r)?Gp(t,r,i):t!==`\\`&&Ft(i)?Gp(t,i,r):Ln({kind:`SetOperation`,operator:t,left:r,right:i})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=Rt(t)?pr(t):[],r=n.filter(Rt);if(!Rt(t)||r.length!==n.length)return Ln({kind:`Union`,base:t});let i=r.flatMap(pr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{vi(t,e)||Mt(e.elements,t)}),br(e.elements)};return Up(t)||r.some(Up)?a():r.length===0?xr:gi(e=>fi(Vp(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!It(n))throw new e.x(`DOMAIN expects a function but received ${L(n)}`);return zi(n)})],Xp=ns(`Integers`,`Neg`,`IntValue`,1),Zp=t=>{let n=ns(t,`DotDot`,`IntervalValue`,2);return[rs(t,`+`,`Plus`,(e,t)=>e+t),rs(t,`-`,`Minus`,(e,t)=>e-t),rs(t,`*`,`Times`,(e,t)=>e*t),rs(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.A(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.A(`0^0 is undefined.`);return t**n}),rs(t,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new e.A(`The second argument of \\div is 0.`);let r=Math.floor(t/n);if(Go(r))throw Ko(`${t} \\div ${n}`);return r}),rs(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.A(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),Wo(`..`,(e,t)=>{let r=ts(t,n);return{kind:`Interval`,low:ts(e,n),high:r}})]},Qp=Zp(`Naturals`),$p=Zp(`Integers`),em=e=>{let t=Qp.indexOf(e);return t===-1?void 0:$p[t]},tm=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[es(as(`<`,(e,t)=>e<t),t(`LT`)),es(as(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),es(as(`<=`,(e,t)=>e<=t),t(`LE`)),es(as(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},nm=[Vo(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Qp,...tm(`Naturals`)],rm=[Vo(`Int`,{kind:`InfiniteSet`,name:`Int`}),...$p,...tm(`Integers`),z(`-.`,1,e=>{let t=ts(R(e,0,`-`),Xp);if(Go(-t))throw Ko(`-${t}`);return-t})],im=(t,n,r)=>{let i=R(t,n,r),a=pi(i);if(!a)throw new e.A(`${r}\n${j(L(i))}`);return a},am=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:im(e,t,n)},om=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw Io(n,`SubSeq`,`natural number`,r);return r},sm=(e,t,n)=>typeof e==`string`?pn(e.slice(t,n)):Ir(e.slice(t,n)),cm=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,lm=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,um=(e,t)=>{let n=Ls.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?es(e,t):e}):t},dm=t=>um(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>am(e,0,cm(``,`Len`)).length),z(`\\o`,2,t=>{let n=am(t,0,lm(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=im(t,1,lm(`t \\o s`,`sequence`)),r=n.length===0?R(t,1,`\\o`):e.length===0?R(t,0,`\\o`):void 0;return r!==void 0&&Nn(r)===`tuple`?r:Ir([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.A(`${lm(`t \\o s`,`string`)}\n${j(L(r))}`);return pn(n+r)}),z(`Append`,2,e=>Ir([...im(e,0,lm(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=im(t,0,cm(``,`Head`));if(n.length===0)throw new e.A(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,t=>{let n=am(t,0,cm(``,`Tail`));if(n.length===0)throw new e.A(`Attempted to apply Tail to the empty sequence.`);return sm(n,1)}),z(`SubSeq`,3,t=>{let n=am(t,0,cm(`first `,`SubSeq`)),r=om(t,1,`second`),i=om(t,2,`third`);if(r>i)return sm(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.A(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${j(L(R(t,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return sm(n,r-1,i)}),Ho(`SelectSeq`,2,t=>{let n=Bo(t,1,`SelectSeq`);return Ir(im(t,0,cm(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.A(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),fm=t=>um(`FiniteSets`,[z(`IsFiniteSet`,1,e=>ui(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!N(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.A(`Attempted to compute cardinality of the value\n${j(L(r))}`);return ci(r,t)})]),pm=[es(z(`Warshall`,1,t=>{let n=R(t,0,`Warshall`);if(!N(n)||gn(n))throw new e.A(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${j(L(n))}`);ci(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=ia(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(t=>{let n=pi(t);if(n?.length!==2)throw new e.A(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${j(L(t))}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return br(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Ir([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],mm=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return pm;if(e===`AnySet`)return[Vo(`ANY`,bn)];if(e===`IOUtils`)return Nf(r,a);if(e===`_TLCTrace`)return If(r);if(!Rp(n.version).has(e))return;let o=_m(e,t,n,r,i);return e===`Randomization`&&o?[...o,sp(n)]:o},hm=/* @__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`]]]),gm=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),_m=(e,t,n,r,i)=>{switch(e){case`Naturals`:return nm;case`Integers`:return rm;case`Sequences`:return dm(n.version);case`FiniteSets`:return fm(n.version);case`TLC`:return um(`TLC`,Pp(t,n));case`Randomization`:return cp(n);case`_Possible`:return Cp(t,n);case`Json`:return Mf(r);case`Bags`:return um(`Bags`,nf(i));case`TLCExt`:return um(`TLCExt`,Sp(t,n));default:return}},vm=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&kl.get(t)||[];r.expressions.push(...i,t);let a=hi.sets,o=a??[],s=o.length;hi.sets=o;try{return n()}catch(e){throw K_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,hi.sets=a}},ym=(e,t,n)=>e.coverage?ho(e.coverage,t,n):-1,bm=(e,t,n)=>e.coverage?_o(e.coverage,t,n):n(),xm=(e,t,n,r)=>bm(e,t,()=>W(n,r)),Sm=(e,t,n,r)=>{let i=xm(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Cm=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},wm=e=>!e.includes(void 0),Tm=e=>e.variables.map(()=>void 0),Em=(e,t,n)=>{let r=[...e];return r[t]=n,r},Dm=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Om=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,km=e=>e.kind===`Identifier`?e.name:void 0,Am=(e,t,n)=>{if(t.kind===`Label`)return Am(e,t.body,n);let r=km(t);if(r===void 0)return;let i=Ag(n,r);if(i?.kind===`Thunk`)return Am(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=b_(r,e);return o?.kind===`Closure`&&o.params.length===0?Am(e,o.body,o.scope):void 0},jm=(e,t,n)=>{if(t.kind===`Prime`)return Am(e,t.expression,n);if(t.kind===`Label`)return jm(e,t.body,n);let r=km(t);if(r===void 0)return;let i=Ag(n,r);if(i?.kind===`Thunk`)return jm(e,i.expression,i.scope);if(i)return;let a=b_(r,e);return a?.kind===`Closure`&&a.params.length===0?jm(e,a.body,a.scope):void 0},Mm=t=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean expression.`);return t},Nm=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Pm=(e,t,n,r)=>{let i=Im(e,t,n,r);return i&&e.coverage&&!e.isInit&&go(e.coverage,r),i},Fm=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(go(r,n),go(r,r.roots[n])),e.onState(t),!0},Im=(e,t,n,r)=>t===void 0?wm(n)?Fm(e,n,r):e.onIncomplete?.(n)??!1:wm(n)&&Nm(e)?Rm(e,t,n,r):t.kind===`Predicate`?zm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?th(e,t.expression,t.rest,t.scope,n,t.node):Lm(e,t,n)&&Pm(e,t.rest,n,t.node),Lm=(e,t,n)=>{let r=e.environment,i=xm(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return xm(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?kg(t,r.runtime.version):t}})();try{return!gr(i,a)}catch(t){throw e.callStack&&K_(e.callStack,[i],t),t}},Rm=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return th(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?Lm(e,i,n):Mm(xm(e,i.node,i.expression,Cm(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Fm(e,n,r)},zm=(e,t,n,r,i,a)=>Bm(e,t,n,r,i,ym(e,a,t)),Bm=(t,n,r,i,a,o)=>vm(t,n,()=>{switch(n.kind){case`Let`:{let e=Cm(t,i,a),s=n.definitions,c=t.coverage?L_(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):L_(s,e);return zm(t,n.body,r,c,a,o)}case`Label`:return zm(t,n.body,r,i,a,o);default:if(Ym.has(n.kind))throw new e.x(`The state relation is not a boolean expression.`);return vm(t,n,()=>$m(t,n,r,i,a,o))}}),Vm=(e,t,n,r,i)=>Mm(t)&&Pm(e,n,r,i),Hm=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),Um=(e,t,n,r,i,a)=>{let o=Cm(e,r,i);if(t.kind===`Identifier`){let s=Ag(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return zm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return zm(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:b_(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&Md(c,e.environment))?zm(e,l.body,n,l.scope,i,a):Vm(e,Sm(e,a,t,o),n,i,a)}let s=x_(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=bm(e,a,()=>N_(s,t.args,o));return zm(e,s.body,n,r,i,a)}let c=Hm.has(t.operator)?xm(e,a,t,o):Sm(e,a,t,o);return Vm(e,c,n,i,a)},Wm=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Pm(e,t,Em(n,r,i),a):gr(o,i)&&Pm(e,t,n,a)},Gm=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Km=(e,t,n)=>(e.coverage&&vo(e.coverage,t,n.length+1),n),qm=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?Am(t.environment,s,i):jm(t.environment,s,i),u=Cm(t,i,a);if(l===void 0)return xm(t,o,n,u)===!0&&Pm(t,r,a,o);let d=xm(t,o,c,u),f=a[l];if(n.operator===`=`)return Wm(t,r,a,l,d,o);let p=n.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(typeof p==`object`&&p!==d&&t.callStack?.sources.set(p,c),f!==void 0)return xm(t,o,n,u)===!0&&Pm(t,r,a,o);if(!zr(p))throw new e.x(`The right side of \\IN is not enumerable.`);return Km(t,p,ei(p)).reduce((e,n)=>Pm(t,r,Em(a,l,n),o)||e,!1)},Jm=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Ym=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Xm={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Zm=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Xm[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},Qm=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=bm(e,r,()=>Xg(t.bounds,t=>{let r=W(t,n),i=qg(r,t,a);return Array.isArray(i)&&Km(e,r,i),i}));return Qg(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},$m=(t,n,r,i,a,o)=>{let s=Cm(t,i,a);switch(n.kind){case`Identifier`:return Um(t,n,r,i,a,o);case`Apply`:return Jm.has(n.operator)&&n.args.length===2?qm(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?Mm(xm(t,o,n.args[0],s))?zm(t,n.args[1],r,i,a,o):Pm(t,r,a,o):Um(t,n,r,i,a,o);case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Gm(`Predicate`,t,i,o,e),r);return zm(t,e[0],n,i,a,o)}let s=e[e.length-1];return Bm(t,Dm(n,e.length-1),Gm(`Predicate`,s,i,o,r),i,a,Om(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>zm(t,n,r,i,a,o)||e,!1);let s=Bm(t,Dm(n,e.length-1),r,i,a,Om(t,o)),c=zm(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:return Qm(t,n,s,o).reduce((e,i)=>zm(t,n.body,r,i,a,o)||e,!1);case`Forall`:{let e=Qm(t,n,s,o);if(e.length===0)return Pm(t,r,a,o);let i=e.slice(1).reduce((e,t)=>Gm(`Predicate`,n.body,t,o,e),r);return zm(t,n.body,i,e[0],a,o)}case`If`:return zm(t,Mm(xm(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>Mm(xm(t,o,e.condition,s)))?.body??n.other;if(c===void 0)throw new e.x(`TLC encountered a CASE with no conditions true.`);return zm(t,c,r,i,a,o)}case`FunctionApplication`:{let e=i_(xm(t,o,n.function,t.isInit?s:Pg(s)));if(e){let i=bm(t,o,()=>a_(e,n,s));return zm(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return th(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=zm(t,n.action,r,i,a,o);return th(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return zm(t,n.action,Gm(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Zm(n):void 0;if(c!==void 0)throw new e.x(c);return Vm(t,xm(t,o,n,s),r,a,o)},eh=(e,t,n)=>e.runtime.warn(Xe.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),th=(e,t,n,r,i,a)=>vm(e,t,()=>{let o=ym(e,a,t),s=Am(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;e.isEnabled&&e.coverage&&go(e.coverage,o);let a=i[s];return a!==void 0&&!gr(a,r)?(eh(e.environment,s,t),!1):Wm(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Pm(e,n,i,o);let c=s.reduceRight((e,t)=>Gm(`Unchanged`,t,r,o,e),n);return th(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Ag(r,t.name);if(a?.kind===`Thunk`)return th(e,a.expression,n,a.scope,i,o);let s=a?void 0:b_(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return th(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Cm(e,r,i),s=x_(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return th(e,s.body,n,N_(s,t.args,a),i,o)}let c=e.environment,l=xm(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=xm(e,o,t,{environment:c,scope:r,state:i,next:void 0});return gr(l,u)&&Pm(e,n,i,o)}),nh=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:t===`enabled`&&e.coverage?.current===-1?void 0:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),rh=/* @__PURE__ */ Error(`The replay found a successor`),ih=(e,t,n,r)=>{let i=()=>{throw rh},a=r.coverage?.current??-1,o=nh(r,`enabled`,n,i,i),s=o.callStack,c=s?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Gm(`Changed`,e.subscript,t,a,void 0);zm(o,e.action,n,t,Tm(r),a)}else zm(o,e,void 0,t,Tm(r),a);return!1}catch(e){if(e!==rh)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},ah=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=nh(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>Gm(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);zm(o,i.expression,s,i.scope,Tm(t),i.node??-1)},oh=(e,t,n,r)=>{if(e.some(e=>Ym.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;sh(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},sh=(e,t,n,r,i,a)=>{let o=nh(r,`next`,n,i,a);zm(o,e.expression,void 0,e.scope,Tm(r),t)},ch=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Am(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=Ag(r,e.name)?void 0:b_(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,L_(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){jm(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Ag(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?x_(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:b_(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,N_(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},lh=/* @__PURE__ */ new WeakMap,uh=/* @__PURE__ */ new WeakMap,dh=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},fh=(e,t,n)=>{let r=e.slice();return r[t]=n,r},ph=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,mh=(t,n)=>{let r=new e.x(n);return t.isInit?r:e.ot(r,e.rt.error)},hh=(e,t,n,r)=>{let i=yg(n);return r&&Ym.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${ph(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},gh=(e,t,n)=>{let r=Qo(t),i=U(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${ph(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1782
+ `:``}${i}`},_h=(e,t,n)=>bh(e,t,W(t,n)),vh=new Set(Yp.map(e=>e.name)),yh=e=>e.kind===`Apply`?vh.has(e.operator):e.kind!==`Identifier`&&!Ym.has(e.kind),bh=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=hh(t,r,n,i);throw t.isInit&&i&&yh(n)?new e.B(a):mh(t,a)},xh=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=$_(n,r.environment))(r),Sh=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ch=(e,t,n)=>{let r=n?lh:uh,i=r.get(e);if(i)return i;let a=rg(e,t,n),o=n?void 0:ng(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},wh=(e,t)=>{if(t.constants.has(e))return;let n=Vg(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Th=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Th(e.expression,t,!1,r);if(e.kind!==`Identifier`||A(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=wh(e.name,t);if(a&&!r.has(a))return r.add(a),Th(a.body,t,n,r)},Eh=(e,t,n)=>Th(e,t,!n),Dh=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Dh(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=L_(e.definitions,dh(r,t,n));return Dh(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Ag(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Dh(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=wh(e.name,r.environment);if(s)return Dh(s.body,void 0,n,r,i)},Oh=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||A(e))||!t&&e.kind===`Prime`,kh=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>kh(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=wh(e.name,t);if(i)return n.add(e.name),kh(i.body,t,n)},Ah=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),jh=(e,t,n)=>Ah.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Sh(e.operator)&&(Oh(e.args[0],n)||Eh(e.args[0],t,n)!==void 0)||A(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Mh=/* @__PURE__ */ new Set,Nh=(e,t)=>{if(A(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Rl(e,(e,i)=>{let a=r?Nh(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},Ph=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||A(e)?void 0:Vg(r,t);return i&&!n.has(i)&&(n.add(i),Ph(i.body,t,n))?!0:Be(e).some(e=>Ph(e,t,n))},Fh=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Eh(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=kh(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return jh(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Ch(e,t,n)}},Ih=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(zd(e,t)===void 0||Ph(e,t,/* @__PURE__ */ new Set))return!0;let n=Nh(e,Mh);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},Lh=(e,t,n)=>{let r=e.map(e=>Fh(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Nm(t);for(let s=e;s<r.length;s++){if(s>0&&f&&ag(u)){d??=dh(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!gr(t,i[e.index])}):void 0;if(o){eh(t.environment,o.index,o.expression);return}let s=n.expression,c=xh(a,e,s,d);if(!bh(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=dh(t,n,u);let r=xh(i,s,e.expression,d);if(!bh(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=dh(t,n,u);let r=xh(i,s,e.value,d),a=u[e.index];if(a===void 0)u=fh(u,e.index,r),d=void 0;else if(!gr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!gr(e,n[i.index])){eh(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Rh=e=>{let t=Zm(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw mh(n,t);_h(n,e,dh(n,r,i))&&s(i,a)}},zh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=dh(r,i,a);if(a[l]!==void 0){_h(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!zr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${ph(r)}, the right side of \\IN is not enumerable.`;throw mh(r,`${t}\n${U(e)}`)}let p=ei(f);if(r.generator){for(let e of $f(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(fh(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(fh(a,l,p[e]),o)}},Bh=/* @__PURE__ */ new WeakMap,Vh=e=>{let t=Bh.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Vh),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Bh.set(e,n),n},Hh=(e,t)=>{let n=e.args[0],r=Rh(e),i=(e,r,i)=>Dh(n,r,i,e,!t)??-1,a=zh(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],dh(t,n,o));l(fh(o,u,d),s)}},Uh=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=dh(i,a,o),d=W(e.function,n?u:Pg(u)),f=i_(d);if(f!==void 0){Ch(f.body,t,n)(i,a_(f,e,u),o,s,c,l);return}if(!It(d))throw mh(i,`In computing ${ph(i)}, a non-function (${Qo(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw mh(i,`In computing ${ph(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Wh=(e,t)=>{let n=Vh(e);return kh(e,t)?Lh([n],t,!1):e.kind===`Tuple`?Ch(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Ag(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Ch(Vh(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=dh(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=x_(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Ch(Vh(n.body),t,!1)(r,N_(n,e.args,u),a,o,s,c);return}}_h(r,n,u)&&c(a,o)}},Gh=(e,t,n)=>{let r=e.operator,i=Rh(e),a=A(e)?void 0:b_(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=iv(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Ch(a.body,t,n),o(e,i(dh(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=dh(a,o,s),f=x_(e,d);f?.kind===`Closure`?Ch(f.body,t,n)(a,N_(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Kh=(e,t,n)=>{let r=Rh(e),i=A(e)?void 0:wh(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Ag(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Ch(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&h_(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Ch(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},qh=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||A(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!A(i))return;let a=Th(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Jh=e=>e.kind===`And`?e.operands.flatMap(Jh):[e],Yh=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&jh(e,t,!1),Xh=e=>{let t=[];return(n,r,i)=>{let a=dh(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!bh(n,i,xh(t,r,i,a)))return}}},Zh=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Jh(e),r=n.findIndex(e=>!Yh(e,t)||qh(e,t)),i=r===-1?void 0:qh(n[r],t);return i?{...i,before:r===0?void 0:Xh(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Zh(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||A(e))return;let r=b_(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Zh(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!A(o))return;let s=i.before,c=s&&iv(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(dh(e,t,n)),n))}},Qh=(e,t,n)=>{let r=Ag(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},$h=(e,t,n)=>{let r=e.map(e=>Ch(e,t,n)),i=n?[]:e.map(e=>Zh(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Qh(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},eg=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=Uf(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},tg=(e,t)=>{let n=Ch(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=dh(r,i,a),u=t.runtime.version,d=Xg(e.bounds,e=>W(e,l)).map((n,r)=>$f(Gg(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,Mg(i,l,e)))};f(d.length-1,i)}},ng=(e,t)=>{if(e.kind===`Exists`)return tg(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Ch(e,t,!1));return e.isBulleted?eg(n):n.reduce((e,t)=>eg([e,t]))},rg=(t,n,r)=>{let i=e=>Ch(e,n,r);switch(t.kind){case`And`:return Lh(t.operands,n,r);case`Or`:return $h(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=Gg(W(a.set,dh(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,jg(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Ih(t,n);if(o){let e=Lh(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=dh(r,i,a),d=Xg(t.bounds,e=>Gg(W(e,u),e,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=jg(n,o.names[t],e);if(t===d.length-1){let e=dh(r,i,a);if(!o.guards.every(t=>_h(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{$g(t.bounds,dh(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&zd(t,n)!==void 0&&!Ph(t.body,n,/* @__PURE__ */ new Set)?Nh(t,Mh):void 0;return(n,r,i,o,s,c)=>{let l=[];$g(t.bounds,dh(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Ag(r,e)?.kind===`Value`)){u.every(e=>_h(n,t.body,dh(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&ag(i)?u.slice(r).every(e=>_h(n,t.body,dh(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=W(t.condition,dh(r,i,a));if(typeof l!=`boolean`)throw mh(r,gh(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=dh(r,i,a),u=e.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw mh(r,`In computing ${ph(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Qo(t)}) was used as a guard condition of a CASE.\n${yg(e.source)}`)})?.body??n;if(!u)throw mh(r,`In computing ${ph(r)}, TLC encountered a CASE with no conditions true.\n${U(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=z_(t.definitions,n);return(n,i,a,o,s,c)=>e(n,L_(t.definitions,dh(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.x(`UNCHANGED appears in an initial predicate at ${gg(t)}`)}:Wh(t.expression,n);case`AngleAction`:{let e=i(t.action),r={kind:`Unchanged`,expression:t.subscript,location:t.subscript.location},a=(e,t,i)=>{try{return _h(e,r,dh(e,t,i))}catch(t){throw e.isEnabled?kg(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return $h([t.action,Vh(t.subscript)],n,r);case`Label`:return i(t.body);case`Identifier`:return Kh(t,n,r);case`FunctionApplication`:return Uh(t,n,r);case`Apply`:{let e=t.args;if(Sh(t.operator)){let i=Eh(e[0],n,r);if(i!==void 0)return t.operator===`=`?Lh([t],n,r):zh(t,()=>i);if(Oh(e[0],r))return Hh(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=W(e[0],dh(r,i,a));if(typeof l!=`boolean`){let e=Qo(l),n=U(t);throw mh(r,r.isInit?`In computing initial states of a predicate of form P => Q, P was ${e}\n.${n}`:r.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${e}.\n${n}`:`In computing next states of a predicate of the form P => Q, P was\n${e}.\n${n}`)}l?n(r,i,a,o,s,c):c(a,o)}}return Gh(t,n,r)}default:return Rh(t)}},ig=e=>e.variables.map(()=>void 0),ag=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},og=(t,n)=>{let r=n.state;if(!r||!ag(r))throw new e.x(`ENABLED needs a complete state at ${gg(t)}`);let i=n.environment;if(i.callStack||i.coverage&&i.coverage.current!==-1)return ih(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return Ch(t,i,!1)(a,n.scope,ig(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},sg=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Ch(t,n,!0)(o,i,ig(n),void 0,!1,t=>{if(!o.isStopped){if(!ag(t)){if(a){o.isStopped=a([...t]);return}throw e.ot(new e.C([...t]),e.rt.error)}o.isStopped=r(t)}})},cg=(e,t,n)=>{let r=[];return sg(e,t,e=>(r.push(e),!1),n),r},lg=(t,n,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return Ch(t,r,!1)(c,a,ig(r),void 0,!1,(t,n)=>{if(!c.isStopped){if(!ag(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.w(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}c.successors++,c.isStopped=i({state:t,action:n})}}),c.successors},ug=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Ch(e,n,!1)(i,r,ig(n),void 0,!1,e=>{ag(e)||i.successors++}),i.successors>0},dg=(e,t,n,r)=>{let i=[];return lg(e,t,n,e=>(i.push(e),!1),r),i},fg=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),pg=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),mg=e=>pg.has(e.kind)||e.kind===`Apply`&&fg.has(e.operator),hg=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&Ft(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},gg=e=>`line ${e.location.line}, column ${e.location.column}`,U=t=>{let n=t.location.range;return n?e.Z(n):gg(t)},_g={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},vg=(t,n)=>new e.x(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${U(n)}`),yg=e=>e.kind===`Number`?e.text??String(e.value):U(e),bg=(t,n)=>new e.x(`A non-boolean expression (${Qo(n)}) was used as the condition of an IF.\n${U(t)}`),xg=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e.x(`A non-boolean expression (${Qo(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${yg(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.x(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${Qo(r)}.\n${U({...t,location:{...t.location,range:{...i,end:a}}})}`)},Sg=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${j(L(e))}\n${U(t)}`,i=e=>`Attempted to apply function:\n${j(L(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!It(a))throw new e.x(`Attempted to select field "${n}" from a non-record value ${j(L(a))}\n${U(t)}`);let o=Nn(a);if(o===`tuple`)throw ki(n);return Li(a.kind===`LazyFunction`?I(a):a,n,o===`record`?r:i)}},Cg=e=>e===`1.7.4`?(t,n)=>Ei(t,n,e):void 0,wg=t=>n=>{if(!It(n))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${Qo(n)})\n${U(t)}`);return zi(n)},Tg=(t,n)=>(r,i)=>{if(!N(r)||gn(r))throw new e.x(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(t)}`);return n(r,i)},Eg=t=>e.ot(new e.x(`TLC can't handle real numbers.\n${t.text}`),e.rt.configParseError),Dg=t=>e.ot(new e.x(`TLC can't handle a number this big.\n${t.text??t.value}`),e.rt.error),Og=(t,n)=>new e.z(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${U(n)}`,t),kg=(t,n)=>t instanceof e.z&&n!==`1.7.4`?new e.x(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,Ag=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},jg=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Mg=(t,n,r)=>{if(n.kind===`Name`)return jg(t,n.name,r);let i=pi(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.x(`Argument mismatch in operator application.${t?e.Z(t):``}`)}return n.names.reduce((e,t,n)=>jg(e,t,i[n]),t)},Ng=(t,n)=>{if(It(t))return t;throw new e.x(`A non-function (${Qo(t)}) was applied as a function.\n${U(n)}`)},Pg=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Fg=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Ig=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Expected ${n} to be a boolean but found ${L(t)}`);return t},Lg=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form P => Q when ${r} was\n${Qo(t)}.\n${U(n)}`);return t},Rg=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to apply the operator ~ to a non-boolean\n(${Qo(t)})\n${U(n)}`);return!t},zg=(t,n,r)=>{if(typeof t!=`boolean`||typeof n!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(r)}`);return t===n},Bg=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${yg(n)}`);return t},Vg=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Hg=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},Ug=(t,n,r)=>{if(!N(t)||gn(t)){let i=L(t),a=r===`1.7.4`?void 0:Hg(t,i);throw new e.x(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${yg(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${yg(n)}\n${a}`)}},Wg=(e,t,n)=>(Ug(e,t,n),typeof e==`object`&&e.kind===`Interval`?Mr(e):Kr(e)??Qr(e)),Gg=(e,t,n)=>n===`1.7.4`?(Ug(e,t,n),Kr(e)??ei(e)):Wg(e,t,n),Kg=e=>{if(typeof e==`object`&&e.kind===`Interval`)return ci(e),e},qg=(e,t,n)=>Kg(e)??Gg(e,t,n),Jg=(e,t,n)=>Kg(e)??Wg(e,t,n),Yg=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Xg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),Zg=(e,t)=>Xg(e,e=>qg(W(e,t),e,t.environment.runtime.version)),Qg=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Yg(t[n],t=>i(n-1,Mg(a,e[n].pattern,t)));return i(e.length-1,n)},$g=(e,t,n)=>Qg(e,Zg(e,t),t.scope,n),e_=(e,t)=>{let n=Xg(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},t_=(e,t,n)=>{if(e.length===1)return Mg(t,e[0].pattern,n);let r=pi(n)??[];return e.reduce((e,t,n)=>Mg(e,t.pattern,r[n]),t)},n_=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,r_=e=>Object.assign(e.value,{lambda:e}),i_=e=>n_(e)?e.lambda:void 0,a_=(t,n,r)=>{let i=t.value,a=n.args.map(e=>W(e,r)),o=a.length===1?a[0]:Ir(a),s=(e,t,r)=>`In applying the function\n${j(L(i))},\nthe ${e} is:\n${j(L(t))}${r}.\n${U(n.function)}`,c=t.bounds;if(c.length===1){if(!vi(o,i.domain))throw new e.x(s(`first argument`,o,`which is not in its domain`));return t_(c,t.scope,o)}let l=pi(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0)throw new e.x(`Attempted to apply a function to an argument not in its domain.\n${U(n.function)}`);let d=()=>new e.x(`In applying the function\n${j(L(i))},\nthe argument list is:\n${j(L(o))}\nwhich does not match its formal parameter.\n`);if(c.forEach((t,n)=>{if(n>=l.length)throw d();let r=l[n],i=`argument number ${n+1}`;if(!vi(r,u[n]))throw new e.x(s(i,r,`${t.pattern.kind===`Name`?``:`
1783
+ `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&pi(r)?.length!==t.pattern.names.length)throw new e.x(s(i,r,`which does not match its formal parameter`))}),l.length>c.length)throw d();return t_(c,t.scope,o)},o_=(e,t)=>{if(t.location.range)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:yg(t)}},s_=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},c_=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},l_=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),u_=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),d_=(e,t)=>{let n=e_(e.bounds,t),r=c_(n,(n,r)=>W(e.body,Fg(t,t_(e.bounds,jg(void 0,e.name,r),n))),s_(o_(e.bounds,e.body),e.bounds,n),l_(e.bounds));r_({value:r,bounds:e.bounds,body:e.body,scope:jg(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=d_(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?Pn(i):i},f_=(t,n)=>{if(typeof n!=`object`||Nn(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Ft(n.domain))return n;try{let e=I(n);return An(e.domain,e.range)}catch(t){if(t instanceof e.x)return n;throw t}},p_=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e.x(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>d_(t,e):$_(u_(t),n):$_(t.body,n),m_=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=p_(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Fg(e,void 0)):e=>a[i]??r(Fg(e,void 0));return t.definitionEvaluators.set(e,o),o},h_=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},g_=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(n.constants.has(r)||n.substitutions.has(r)||!Nd(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>f_(t,p_(t,n)(a)));mr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.x)&&!e.nt(t))throw t}}),__=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&Vn(t[n],e))}catch(t){if(t instanceof e.x)return!1;throw t}},v_=(e,t)=>{let n=e.cache;if(n!==void 0&&__(t.state,e.state)&&__(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?_o(r,i,()=>W(e.expression,Fg(t,e.scope))):W(e.expression,Fg(t,e.scope));return(!e.isStreamed||ni(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},y_=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),b_=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return b_(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?y_(r):t.builtins.get(e)},x_=(e,t)=>A(e)?S_(e.operator,t):b_(e.operator,t.environment)??S_(e.operator,t),S_=(e,t)=>{let n=Ag(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return b_(e,t.environment)},C_=e=>e.kind===`Closure`?e.params.length:e.arity,w_=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:S_(r,n);if(!i)throw new e.x(`Expected an operator argument at ${gg(t)}`);return i},T_=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>jg(e,n.name,t[r]),e.scope);return W(e.body,Fg(n,r))},E_=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:C_(e),call:n=>T_(e,n,t)},D_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=S_(e.name,t);return n!==void 0&&C_(n)>0},O_=(e,t)=>e.map(e=>D_(e,t)?E_(w_(e,t),t):W(e,t)),k_=(t,n)=>new e.x(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),A_=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),j_=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return j_(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},M_=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Bt(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=A_(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=A(e)?void 0:j_(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=Ag(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:A_(e,t)}}return t=>A_(e,t)},N_=(e,t,n,r)=>{if(t.length!==e.params.length)throw k_(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:w_(t[a],n)}:(r?.[a]??M_(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},P_=(e,t,n,r)=>e.kind===`Closure`?W(e.body,Fg(n,N_(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(nv(t,n),n):e.evaluate(O_(t,n),n),F_=/* @__PURE__ */ new WeakMap,I_=e=>{let t=F_.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return F_.set(e,n),n},L_=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:I_(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},R_=(t,n,r)=>{let i=Ag(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return v_(i,r);if(i?.kind===`Operator`){if(C_(i.operator)===0)return T_(i.operator,[],r);throw new e.x(`Operator ${t} is used without arguments`)}let a=j_(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw Og(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return m_(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.x(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${U(n)}`)},z_=(e,t)=>({impure:new Set(e.filter(e=>Id(e,t))),streamed:new Set(e.filter(e=>Id(e,t,`streamed`)))}),B_=e=>[...e.facts.ids.keys()].some(t=>Id(t,e)),V_=e=>[...e.facts.ids.keys()].some(t=>Id(t,e,`repeated`)),H_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,U_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),W_=e=>t=>{let n=e(t);return Vn(n,e(U_(t)))},G_=(t,n,r,i)=>a=>{i.expressions.push(t);let o=hi.sets,s=hi.callStack,c=o??[],l=c.length;hi.sets=c,hi.callStack=i;try{let e=n(a),o=H_(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&mg(t)&&i.sources.set(o,t),o}catch(n){n instanceof e.P&&!i.isFrozen&&(i.expressions.length=0,i.isFrozen=!0);let r=n instanceof Error?i.failures.get(n):void 0;n instanceof Error&&i.failures.set(n,t);let a=hg(t,i.values),o=a&&!Be(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!It(o)?void 0:o;throw K_(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,hi.sets=o,hi.callStack=s}},K_=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e.x){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},q_=(t,n,r)=>{if(!(r instanceof e.x))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},J_=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Y_=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw xg(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},X_=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},Z_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=ho(n,i,e);go(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},Q_=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Ov(e,t),i=t.callStack,a=i&&kl.get(e),o=i?G_(e,r,t,i):r,s=i&&a?X_(e,a,o,i):o,c=t.coverage,l=c?Z_(e,s,c):s;return t.evaluators.set(e,l),l},$_=(e,t)=>{if(t.callStack||t.coverage)return Q_(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Os(e,t)??Q_(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>$_(e,t.environment)(t),ev=(e,t)=>{let n=e.name,r=A(e)?void 0:j_(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Og(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=m_(e,t))(r)}return t=>R_(n,e,t)},tv=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||A(e))return!0;let n=b_(e.name,t);return n===void 0||C_(n)===0},nv=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),rv=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(nv(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&tv(t[0],n)){let e=Q_(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&tv(t[0],n)&&tv(t[1],n);if(i&&a){let e=Q_(t[0],n),r=Q_(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(O_(t,n),n)},iv=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw k_(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:M_(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:w_(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},av=(e,t,n)=>{let r=iv(e,t,n),i;return t=>(i??=$_(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},ov=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=Q_(r[0],n),i=Q_(r[1],n);return n=>!Lg(e(n),t,`P`)||Lg(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=Q_(r[0],n);return n=>Rg(e(n),t)}if(t.operator===`<=>`){let e=Q_(r[0],n),i=Q_(r[1],n);return n=>zg(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw vg(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=A(t)?void 0:b_(t.operator,n);if(i?.kind===`Closure`)return av(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=Q_(r[0],n),i=wg(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Ol.has(t)&&!Bd(r[0],n),a=n.tlcEvalValues;return n=>{if(!e||n.scope!==void 0)return i.evaluate(nv(r,n),n);let o=a.get(t);if(o!==void 0)return o;let s=i.evaluate(nv(r,n),void 0);return a.set(t,s),s}}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2){let e=Q_(r[0],n),a=Q_(r[1],n),o=Tg(t,i.evaluateBinary);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return rv(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.x(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a=r.map(e=>M_(e,n));return i=>{let o=S_(t.operator,i);if(o)return P_(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e.x(`${t.operator} is a function; apply it with brackets`):new e.x(`Unknown operator ${t.operator} at ${gg(t)}`)}},sv=(e,t)=>{let n=e.kind===`Forall`,r=Q_(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=Q_(i.set,t);return s=>Yg(qg(o(s),i.set,t.runtime.version),t=>Bg(r(Fg(s,jg(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=Xg(a,e=>qg(Q_(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?Bg(r(Fg(o,a)),e)!==n:Yg(s[t],e=>c(t-1,jg(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>$g(a,t,i=>Bg(r(Fg(t,i)),e)!==n)?!n:n},cv=(e,t)=>{if(e.kind===`Tuple`)return Ir(e.names.map(e=>{let n=Ag(t,e);return n?.kind===`Value`&&n.value}));let n=Ag(t,e.name);return n?.kind===`Value`?n.value:void 0},lv=/* @__PURE__ */ new WeakSet,uv=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&lv.add(e)},dv=/* @__PURE__ */ new WeakMap,fv=e=>{if(dv.has(e))return dv.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=Ve(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),Be(e).every(n)},r=n(e)?[...t]:void 0;return dv.set(e,r),r},pv=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Ag(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),mv=e=>lv.has(e),hv=(t,n)=>{let r=mv(t),i=Q_(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=e=>i(Fg(t,jg(t.scope,n,e)));if(Nt(e))return ci(e),Pt(e,r),f(e,t);let a=Pr(e),s=An(a,a.map(r));return Ft(e)?s:(s.lambdaDomain=e,Pn(s))}let n=[],r=Xg(a,(n,r)=>Jg(a.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return Qg(a,r,t.scope,e=>{let r=a.length===1?cv(o.pattern,e)??!1:Ir(a.map(t=>cv(t.pattern,e)??!1));return n.push([r,i(Fg(t,e))]),!1}),Tr(n)},l=o_(a,t.body),u=l_(a),d=fv(t.body),f=(e,n)=>{let r=pv(n.scope,d),o=Fg(n,r),s=r_({value:c_(e,e=>i(Fg(o,t_(a,r,e))),s_(l,a,e),u),bounds:a,body:t.body,scope:r});return a.length===1?Pn(s):s},p=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!P(n))return f(n,i);if(!(a.length===1?Ft(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(Ft))){if(p)return f(n,i);try{return c(n,i)}catch(t){if(!(t instanceof e.x))throw t;return f(n,i)}}if(!p)return c(n,i);try{return c(n,i)}catch(e){throw q_(p,t,e),e}},createLazy:f}},gv=(e,t)=>{let n=hv(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=Q_(r[0].set,t);return t=>n(e(t),t)}return e=>n(e_(r,e),e)},_v=(e,t)=>{let n=lv.has(e);n&&uv(e.function);let r=Q_(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>Q_(e,t))}),value:Q_(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Ir(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Fg(i,jg(i.scope,`@`,e))):Bi(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(Xe.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},vv=(t,n)=>{let r=Q_(t.predicate,n),i=t.bound.pattern,a=yg(t.predicate),o=t.predicate.location.range&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:a},s=n.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=_o(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(n,r,s,u)=>({kind:`FilteredSet`,base:n,test:(t,n)=>{if(i.kind===`Tuple`&&pi(t)?.length!==i.names.length)throw new e.x(`Attempted to check if the value:\n${j(L(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=c(u,n,()=>s(Fg(r,Mg(r.scope,i,t))));if(typeof o!=`boolean`)throw new e.x(`${n?`The evaluation of predicate`:`Evaluating predicate`} ${a} yielded non-Boolean value.`);return o},source:o,rebind:e=>l(n,{...r,environment:e},Q_(t.predicate,e),-1)});return(e,t,n=-1)=>l(e,t,r,n)},yv=e=>A(e)||e.kind===`OperatorReference`||Be(e).some(yv),bv=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!yv(e.predicate)&&!Fd([e.predicate],t,`varying`),xv=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Qo(t)}.\n${yg(n.predicate)}`);return t},Sv=(t,n,r,i)=>{if(!N(t)||gn(t))throw new e.x(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(n)}`);return hr(t),Jg(t,r,i)},Cv=t=>new e.x(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(t)}`),wv=(t,n)=>{if(t.kind===`SetFilter`){let e=Q_(t.predicate,n),r=Q_(t.bound.set,n),i=vv(t,n),a=t.bound.pattern,o=n.coverage,s=bv(t,n);return n=>{let c=r(n);if(!Ft(c))return i(c,n,o?.current);let l=[],u=c.kind===`Interval`?c:F(c).elements,d=Array.isArray(u)?u.length:u.high-u.low+1;for(let r=0;r<d;r++){let i=Array.isArray(u)?u[r]:u.low+r,o=e(Fg(n,Mg(n.scope,a,i)));if(xv(o,t))Mt(l,i);else if(s)break}return o&&o.current!==-1&&(o.secondary[o.current]+=d+l.length),kn(l)}}if(t.kind===`SetMap`){let e=Q_(t.expression,n);return n=>{let r=[];return $g(t.bounds,n,t=>(Mt(r,e(Fg(n,t))),!1)),br(r)}}let r=t.set;if(!r)return()=>{throw new e.x(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(t)}`)};let i=Q_(t.body,n),a=Q_(r,n);return n=>{let o=Sv(a(n),t,r,n.environment.runtime.version),s,c=t.pattern;if(Yg(o,r=>{if(c.kind===`Tuple`&&pi(r)?.length!==c.names.length)throw new e.x(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(t)}`);let a=Mg(n.scope,c,r);return Bg(i(Fg(n,a)),t)?(s=cv(c,a),!0):!1}),s===void 0)throw Cv(t);return s}},Tv=e=>[...e].sort((e,t)=>Cn(e.name,t.name)),Ev=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Dv=(e,t)=>{let n=Tv(e),r=e.map(e=>Q_(e.value,t));if(Ev(n))return t=>Lr(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>Kt(i,t,r.map(t=>t(e)),a)}return e=>Rr(i,r.map(t=>t(e)))},Ov=(t,n)=>{let r=e=>Q_(e,n);switch(t.kind){case`Number`:{let e=t.value;return Bt(e)?()=>e:()=>{throw Dg(t)}}case`Decimal`:return()=>{throw Eg(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return ev(t,n);case`Apply`:return ov(t,n);case`Bracket`:return()=>{throw new e.x(`A bracket without a function or subscript is not an expression at ${gg(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.x(`An operator cannot be used as a value at ${gg(t)}`)};case`And`:{let e=t.operands.map(r);return Y_(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw xg(t,r,i);if(!i)return!1}return!0})}case`Or`:{let e=t.operands.map(r);return Y_(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw xg(t,r,i);if(i)return!0}return!1})}case`Prime`:{let e=r(t.expression);return t=>e(U_(t))}case`Unchanged`:return W_(r(t.expression));case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw bg(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e.x(`A non-boolean expression (${Qo(n)}) was used as a condition of a CASE. ${yg(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.x(`Attempted to evaluate a CASE with no conditions true.\n${U(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(Fg(n,L_(t.definitions,n)))}case`Forall`:case`Exists`:return sv(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?vg(t.quantifier===`Forall`?`\\AA`:`\\EE`,t):new e.x(`TLC attempted to evaluate an unbounded ${n}.\nMake sure that the expression is of form ${n} x \\in S: P(x).\n${U(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return wv(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>br(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>Ir(e.map(e=>e(t)))}case`FunctionConstruction`:return gv(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return Dv(t.fields,n);case`RecordSet`:{let e=Tv(t.fields),n=e.map(e=>e.name),i=e.map(e=>t.fields.indexOf(e)),a=t.fields.map(e=>r(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:n,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:n,sets:i.map(e=>t[e])}}}case`Except`:return _v(t,n);case`ExceptAt`:return n=>{let r=Ag(n.scope,`@`);if(r?.kind!==`Value`)throw new e.x(`@ appears outside an EXCEPT at ${gg(t)}`);return r.value};case`FunctionApplication`:{uv(t.function);let e=r(t.function),i=n=>Ng(e(Pg(n)),t),a=t.args.map(r),o=Cg(n.runtime.version);if(a.length===1){let e=a[0];return t=>Li(i(t),e(t),o)}return e=>Li(i(e),Ir(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Sg(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let n=r(t.action),i=W_(r(t.subscript)),a=t.kind===`BoxAction`,o=a?`[A]_e`:`<A>_e`;return r=>{let s=n(r);if(typeof s!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form ${o}, but A was not a boolean.\n${U(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>og(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.x(`The subexpression reference at ${gg(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw vg(_g[t.kind],t)}}},kv=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Av=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zi(e[t]),16777619),r=Math.imul(r^ra(e[t]),1540483477);t[0]=kv(n)||1,t[1]=kv(r)},jv=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(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}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},Mv=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),Nv=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Hi(t,Zi(e[n]));return t&1073741823},Pv=(e,t)=>{for(let n=0;n<t.length;n++)if(!Un(e[n],t[n]))return!1;return!0},Fv=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,Iv=(e,t,n)=>{let r=e.slots.length-1;for(let i=Fv(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&Pv(e.states[r-1],n))return r-1}},Lv=(e,t,n)=>{let r=e.slots.length-1,i=Fv(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},Rv=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&Lv(e,t[n],t[n+1])}Lv(e,t,n+1)},zv=(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}},Bv=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Vv=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return zv(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Hv=e=>Atomics.load(e.used,0)*2>=e.slots.length,Uv=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&zv(t,n);return{slots:t,used:e.used}},Wv={kind:`Boolean`,value:!0},Gv={kind:`Boolean`,value:!1},Kv=e=>e?Wv:Gv,qv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Jv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Yv=(e,t)=>({kind:e,body:t}),Xv=(e,t,n)=>({kind:e,operands:[t,n]}),Zv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Zv(e,t.operands).operands:[t])}),Qv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Qv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Qv(t)),0)}},$v=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 $v(e.body);case`And`:case`Or`:return e.operands.some($v)}},ey=/* @__PURE__ */ new WeakMap;let ty=0;const ny=e=>{let t=ey.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`#${ty++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(ny).join(`,`)})`;default:return`${e.kind}(${ny(e.body)})`}})();return ey.set(e,n),n},ry=(e,t)=>e===t||ny(e)===ny(t),iy=(e,t)=>{let n=ny(t);return e.some(e=>e===t||ny(e)===n)},ay=e=>e===`And`?`Or`:`And`,oy=(e,t)=>{switch(e.kind){case`Boolean`:return t?Kv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Yv(`Not`,e):e;case`Not`:return oy(e.body,!t);case`And`:case`Or`:return Zv(t?ay(e.kind):e.kind,e.operands.map(e=>oy(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Yv(n,oy(e.body,t))}}},sy=e=>{switch(e.kind){case`Boolean`:return Kv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Zv(ay(e.kind),e.operands.map(sy));case`Always`:return Yv(`Eventually`,sy(e.body));case`Eventually`:return Yv(`Always`,sy(e.body));default:return Yv(`Not`,e)}},cy=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=cy(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Kv(t)}return n.length===0?Kv(!t):n.length===1?n[0]:Zv(e.kind,n)}case`Not`:{let t=cy(e.body);return t.kind===`Boolean`?Kv(!t.value):Yv(`Not`,t)}case`Always`:case`Eventually`:{let t=cy(e.body);return Yv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},ly=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,uy=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=uy(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r*=t.operands.length,r>2147483647))throw new e.x(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r===1)return{kind:`And`,operands:n};let i=Array.from({length:r},()=>[]),a=1,o=r;for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}o/=e.operands.length;let t=0;for(let n=0;n<a;n++)for(let n of e.operands)for(let e=0;e<o;e++)i[t++].push(n);a*=e.operands.length}return{kind:`Or`,operands:i.map(e=>Zv(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=uy(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=ly(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:Zv(`Or`,e);n.push(Yv(`Always`,Yv(`Eventually`,t)))}return Zv(`Or`,n)}case`Not`:return qv(t.body)?t:uy(sy(t.body));default:return t}},dy=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?dy(e.operands[0]):Zv(e.kind,e.operands.map(dy));case`Not`:return e.body.kind===`Not`?dy(e.body.body):Yv(`Not`,dy(e.body));case`Always`:case`Eventually`:case`Next`:return Yv(e.kind,dy(e.body));default:return e}},fy=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return fy(e.operands[0]);let t=Math.floor(e.operands.length/2);return Xv(e.kind,fy(Zv(e.kind,e.operands.slice(0,t))),fy(Zv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Yv(e.kind,fy(e.body));default:return e}},py=(e,t)=>{e.kind===`Eventually`&&!iy(t,e)&&t.push(e),`body`in e&&py(e.body,t),`operands`in e&&e.operands.forEach(e=>py(e,t))},my=e=>{let t=e.filter(Jv),n=e.flatMap(e=>e.kind===`Not`&&Jv(e.body)?[e.body]:[]);return!t.some(e=>iy(n,e))},hy=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,Yv(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.x(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},gy=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Yv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},_y=(e,t,n)=>e.flatMap(e=>{let r=gy(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),vy=e=>[...new Set(e.map(ny))].sort().join(`|`),yy=(e,t)=>{let n=new Set(t.map(vy));return[...e.filter(e=>!n.has(vy(e))),...t]},by=e=>{let t=hy(e),n=_y(t,`Always`,`And`),r=_y(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=gy(t,`Eventually`,`Or`);if(n&&!(iy(e,n.first)||iy(e,n.second)))return yy(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(iy(e,t.first)||iy(e,t.second))&&!iy(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!my(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=gy(t[e],`Always`,`And`);n&&(iy(t,n.first)||t.push(n.first),iy(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)iy(t,e.first)&&iy(t,e.second)&&!iy(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!my(t)?[]:i(t)};return a(e)},xy=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Qv(e)<=1)}),Sy=e=>{let t=by([e]).map(xy),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=vy(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 by(n)){let n=vy(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(xy(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Cy=(e,t)=>!iy(e,t)||iy(e,t.body),wy=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&Qv(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=ly(t);if(r){let e=Qv(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if($v(t))throw new e.x(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},Ty=(e,t)=>{let n=e.findIndex(e=>ry(e,t));return n===-1?(e.push(t),e.length-1):n},Ey=e=>{let t=uy(cy(oy(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=dy(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])wy(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Zv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:ry(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&fy(e.formula),n=[];t&&py(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Ty(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Ty(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Ty(i,e))}));return{tableau:t&&Sy(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Dy=()=>e.ot(new e.x(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.rt.livenessEvaluationFailure),Oy=/* @__PURE__ */ new Set([`~>`,`-+->`]),ky=/* @__PURE__ */ new WeakSet,Ay=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),jy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),My=(t,n)=>new e.x(`TLC cannot handle the temporal formula ${U(t)}${n===void 0?``:`:\n${n}`}`),Ny=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=Ny(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Ag(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Vg(e,n);if(t)return Ld(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:A(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Ll(e,(e,o)=>(a=Math.max(a,Ny(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};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:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(Oy.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=A(e)?void 0:b_(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,N_(o,e.args,jy(n,t)))}default:return l(e)}},Py=(t,n)=>{try{return Zg(t,n)}catch(t){if(!(t instanceof e.x))throw t;if(!ot(t))return;throw e.ot(new e.x(`${e.G}${t.message}`),e.rt.error)}},Fy=(t,n,r,i,a={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let o=(e,t,n=a.name,o=a.expanding,s)=>Fy(e,t,r,i,{name:n,path:s?.kind===`Operator`&&s.params.length===0?[...a.path,s.name]:a.path,expanding:o,isSubstituted:a.isSubstituted||s!==void 0&&r.substitutedDefinitions.has(s)});if(t.kind===`And`)return t.operands.flatMap(e=>o(e,n,U(e)));if(t.kind===`Label`)return o(t.body,n);if(t.kind===`Let`)return o(t.body,Iy(t,n,r));if(t.kind===`Identifier`){let i=A(t)?Ag(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return o(i.expression,i.scope,ky.has(i)?t.name:a.name);let s=r.constants.has(t.name)?void 0:Vg(t.name,r);if(!i&&s?.kind===`Operator`&&s.params.length===0&&(Ld(s,r)>0||h_(s,r)===void 0)){if(a.expanding.has(s))throw e.X();return o(s.body,void 0,!a.isSubstituted&&r.instanceNames.get(t.name)||s.name,/* @__PURE__ */ new Set([...a.expanding,s]),s)}}let s=jy(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||Ny(t,n,r)===3)){let e=x_(t,s),n=A(t)?void 0:Vg(t.operator,r),i=e?.kind===`Closure`&&e.params.every(e=>r.instanceParams.has(e));if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&(!a.isSubstituted||i))return o(e.body,N_(e,t.args,s),a.isSubstituted&&n?n.name:t.operator,a.expanding,n)}let c=i&&t.kind===`Forall`&&t.bounds.every(e=>Ny(e.set,n,r)===0),l=c?Py(t.bounds,s):void 0;if(c&&l){let e=[];if(Qg(t.bounds,l,n,n=>(e.push(...o(t.body,n,U(t.body))),!1)),e.length===0)throw Dy();return e}return[{expression:t,scope:n,name:a.name,path:a.path}]},Iy=(e,t,n)=>{let r=L_(e.definitions,jy(n,t),z_(e.definitions,n));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&ky.add(e.binding);return r},Ly=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?Ny(t,n,r):a;if(o===0){let i=W(t,jy(r,n));if(typeof i!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${yg(t)}`);return Kv(i)}return o===1?{kind:`State`,expression:t,scope:n}:t.kind===`AngleAction`?{kind:`Action`,expression:t.action,subscript:t.subscript,scope:n}:{kind:`Action`,expression:t,subscript:void 0,scope:n}},o=0,s=(t,n,i,s)=>{if(o>=100)throw e.X();o++;let c=p(t,n);o--;let l=Qv(c),u=l===0&&Ny(i,s,r)>2;return l>2||u?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=jy(r,t),o=A(e)||Vg(n,r)===void 0?Ag(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&ky.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:A(e)?S_(n,a):b_(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?Ay.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,Zv(f,n))}if(c?.kind!==`Closure`)throw My(e);let m=!A(e)&&Vg(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,N_(c,u,a),e,t)),m)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.F||r&&!i;throw!(n instanceof e.x)||a?n:My(t)}},u=(t,n)=>{let i=Ny(t,n,r),o=[],s=t.kind===`Forall`;try{$g(t.bounds,jy(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.x)||r instanceof e.F)throw r;if(i<=2)return a(t,n,i);throw My(t,s&&!ot(r)?r.message:void 0)}return o.length===0?Kv(s):d(t,n,Zv(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=Qv(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,Zv(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,Zv(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let n=Ny(e,t,r);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Iy(e,t,r));case`Apply`:{let n=e.args;if(e.operator===`~`&&!A(e))return d(e,t,Yv(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,Xv(`Or`,Yv(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Ny(e.condition,t,r)===0){let n=W(e.condition,jy(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,Xv(`Or`,Xv(`And`,n,p(e.consequent,t)),Xv(`And`,Yv(`Not`,n),p(e.alternative,t))))}}if(n<=2)return a(e,t,n);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?Yv(`Always`,Xv(`Or`,Yv(`Not`,p(e.args[0],t)),Yv(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return Yv(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=Yv(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?Yv(`Always`,Yv(`Eventually`,Xv(`Or`,i,a))):Xv(`Or`,Yv(`Eventually`,Yv(`Always`,i)),Yv(`Always`,Yv(`Eventually`,a)))}default:throw My(e)}};return p(t,n)},Ry=t=>({holdsState:(n,r)=>{let i={environment:t,scope:n.scope,state:r,next:void 0},a=n.kind===`State`?W(n.expression,i):og(n.step,i);if(typeof a!=`boolean`)throw new e.x(`A state predicate was evaluated to a non-boolean value.`);return a},holdsAction:(n,r,i)=>{let a=n.scope,o=n.subscript;if(o&&gr(W(o,{environment:t,scope:a,state:r,next:void 0}),W(o,{environment:t,scope:a,state:i,next:void 0})))return!1;let s=W(n.expression,{environment:t,scope:a,state:r,next:i});if(typeof s!=`boolean`)throw new e.x(`Encountered an action predicate that's not a boolean.`);return s}}),zy=(t,n,r,i,a)=>{let o=e=>zy(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r=i.holdsState(t,n);return a.set(t,r),r}case`Action`:return t.enabled&&a.get(t.enabled)===!1?!1:r!==void 0&&i.holdsAction(t,n,r);case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return zy(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.x(`TLC cannot evaluate a temporal formula in a single step`)}},By=(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)=>By(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 zy(e,t[r],t[a(r)],Ry(i),/* @__PURE__ */ new Map)}},Vy=`UnnamedAction`,Hy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Uy=e=>{let t=e.range??Hy;return Lr([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Wy=(e,t)=>{let n=[[`name`,e.name],[`location`,Uy(e.location)]];return e.parameters.length>0&&n.push([`context`,Lr(e.parameters)],[`parameters`,Ir(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Lr(n)},Gy=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),Ky=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),qy=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Jy=e=>e.kind===`Apply`?e.args:[],Yy=(e,t,n)=>{let r=qy(e);if(r===void 0)return;if(A(e)){let e=Ag(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=b_(r,n);return i?.kind===`Closure`?i:void 0},Xy=(t,n)=>{try{return W(t,Ky(n,void 0)),!0}catch(t){if(t instanceof e.b)return!1;throw t}},Zy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&Nd(e,t)&&Xy(e.body,t),Qy=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Zy(e,t),$y=(e,t)=>{let n=Vg(e.name,t);return n?.body===e.body&&Qy(n,t)},eb=(e,t)=>{if(e.kind!==`Identifier`||!A(e))return;let n=Ag(t,e.name);return n?.kind===`Thunk`?n:void 0},tb=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:Iy(e,t,n)};let r=eb(e,t);return r&&{expression:r.expression,scope:r.scope}},nb=(e,t,n,r)=>t.kind===`Apply`?N_(e,t.args,Ky(r,n)):e.scope,rb=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ag(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),ib=(t,n)=>{try{return t()}catch(t){if(t instanceof e.b)return n();throw t}},ab=(e,t,n,r,i)=>{let a=Jy(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>Ny(e,n,i)!==0)?o():ib(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,Ky(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},ob=(t,n,r,i,a)=>{let o=()=>({name:r?.name??Vy,location:t.location,parameters:rb(r,n),expression:t,scope:n});if(Ym.has(t.kind))throw e.ot(new e.x(`${e.K}The next state relation is not a boolean expression.\n${yg(t)}`),e.rt.error);switch(t.kind){case`Let`:return ob(t.body,Iy(t,n,i),r,i,a);case`Label`:return ob(t.body,n,r,i,a);case`Or`:return t.operands.flatMap(e=>ob(e,n,r,i,a));case`Exists`:return ib(()=>{let e=[];return $g(t.bounds,Ky(i,n),n=>(e.push(...ob(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=A(t)?void 0:a.get(qy(t)??``),c=Yy(t,n,i);if(s)return ab(s,t,n,c,i);if(!c)return[o()];let l=Jy(t),u=A(t)?c.name:i.instanceNames.get(qy(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return $y(c,i)||l.some(e=>Ny(e,n,i)!==0)?d():ib(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:W(t,Ky(i,n))},parent:e}),c.scope);return ob(c.body,e,{...c,name:u},i,a)},d)},sb=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>sb(e,t,n,r,i,o),s=(e,t,n)=>Gy(e,Al(t,a),n),c=tb(e,t,n);if(c){o(c.expression,c.scope);return}let l=Yy(e,t,n);if(l&&$y(l,n))return;let u=l?[...a,...kl.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Ny(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,N_(l,e.args,Ky(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(Vy,e,t));return}let d=Ny(e,t,n);d<=1?r.inits.push(s(Vy,e,t)):d===3&&r.temporals.push(s(Vy,e,t))},cb=(e,t,n,r,i)=>{let a=(t,n)=>cb(e,t,n,r,i),o=tb(t,n,r);if(o){a(o.expression,o.scope);return}let s=Yy(t,n,r);if(s&&$y(s,r))return;if(s&&s.params.length===Jy(t).length){a(s.body,nb(s,t,n,r));return}if(t.kind===`Forall`&&ib(()=>($g(t.bounds,Ky(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Gy(e,a)):Ny(a,n,r)<2?i.invariants.push(Gy(e,a)):i.impliedTemporals.push(Gy(e,t));return}let c=Ny(t,n,r);c<=1?i.impliedInits.push(Gy(e,t)):c===3&&i.impliedTemporals.push(Gy(e,t))},lb=(e,t)=>{let n=Vg(e,t);return n?.kind===`Operator`&&!Qy(n,t)?n:void 0},ub=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:lb(e.specification,t);a&&(sb(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Vy,location:e.frames[0].location,parameters:[],expression:Al(e.expression,e.frames),scope:e.scope}]:ob(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:b_(e.init,t);o?.kind===`Closure`&&r.inits.push(Gy(e.init??``,o.body));let s=e.next===void 0?void 0:b_(e.next,t);return s?.kind===`Closure`&&r.actions.push(...ob(s.body,s.scope,s,t,n)),r},db=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=tb(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&A(e)?Ag(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!A(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Yy(e,t,n);if(!s||s.params.length!==Jy(e).length)return!0;let c=Vg(s.name,n);return c?.body===s.body&&Zy(c,n)?!0:i(s.body,nb(s,e,t,n))};return i(e,t)?r:void 0},fb=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,pb=(t,n,r=!1)=>`${t.name===Vy?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:fb(t)} ${e.Z(t.location.range??Hy)}`,mb=e=>`${e.name}${fb(e)}`,hb=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=lb(e,n);t&&i.invariants.push(Gy(e,t.body))}),t.properties.forEach(e=>{let t=lb(e,n);t&&cb(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>yr(e.map(e=>{let n=a&&t&&No(a,t,e.expression);return Wy(e,n&&Lr(n))})),s=e=>yr(e.flatMap(e=>{let t=lb(e,n);return t?[Lr([[`name`,t.name],[`location`,Uy(t.location)]])]:[]}));return Lr([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,yr(n.variables.map((e,t)=>Lr([[`name`,e],[`location`,Uy(r[t])],...a?[[`coverage`,Lr([[`distinct`,xo(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},gb=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return gb(e.body);case`And`:case`Or`:return e.operands.some(gb);default:return!1}},_b=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,vb=e=>e.promises.some(e=>gb(e.body))||e.models.some(e=>!_b(e)),yb=(e,t)=>e.every((e,n)=>Un(e,t[n])),bb=e=>e.filter((t,n)=>n===0||e[n-1]!==t),xb=e=>({data:e(1024),length:0,create:e}),Sb=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},Cb=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},wb=e=>new Int32Array(e).fill(-1),Tb=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Eb=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Db=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Ob=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),kb=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Ab=2**53-1,jb=(e,t,n)=>{let r=t.map(e=>Ly(e.expression,e.scope,n)),i=e.map(e=>Yv(`Not`,Ly(e.expression,e.scope,n))),a=i.length===1?i[0]:Zv(`Or`,i);return{formula:r.length===0?a:Zv(`And`,[...r,a]),negations:i}},Mb=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},Nb=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>Nb(e,t));return;default:Nb(e.body,t)}},Pb=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>Nb(e,t));return[...t]},Fb=e=>Pb(e).flatMap(e=>Mb(e).map(e=>e.expression)),Ib=(e,t,n)=>{if(e.length===0)return;let r=jb(e,t,n),i=/* @__PURE__ */ new Set;Nb(r.formula,i);let a=[...i].flatMap(Mb),o=a.every(e=>e.scope===void 0)?!Fd(a.map(e=>e.expression),n,`repeated`):!V_(n);return{solutions:Ey(r.formula),createChecker:(t,i)=>{let a={environment:n,atoms:Ry(n)},s=Rb(i,{atoms:{holdsState:(e,t)=>a.atoms.holdsState(e,t),holdsAction:(e,t,n)=>a.atoms.holdsAction(e,t,n)},isShared:o,isSame:yb,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},t,n.runtime.version!==`1.7.4`),c=(e,t)=>{if(e===void 0)return t();a.atoms=Ry(e);try{return t()}finally{a.atoms=Ry(n)}};return{branches:s.branches,solutions:i,addInitialState:(e,t,n)=>c(n,()=>s.addInitialState(e,t)),addState:(e,t,n,r)=>c(r,()=>s.addState(e,t,n,r!==void 0)),storeState:s.storeState,getStateCounts:s.getStateCounts,findViolation:s.findViolation,getViolatedProperties:(t,i)=>[...new Set(e.filter((e,a)=>!By(r.negations[a].body,t,i,0,n)).map(e=>e.name))]}}}},Lb=(e,t,n,r)=>{let i=Ib(e,t,n);return i?.createChecker(r,i.solutions)},Rb=(t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=1,s=n.isShared,c=n.atoms,l=n.evaluateFrom,u=/* @__PURE__ */ new Map,d=[],f=e=>{let t=u.get(e)??u.size;return u.set(e,t),d[t]=e,t},p=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[f(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[f(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(p);return t.every(e=>e!==void 0)?t.flat():void 0},m=e=>new Int8Array(e*u.size).fill(-1),h=e=>new Int8Array(e*a.size).fill(-1),g=(e,t,n,r,i)=>s?e(t,n,r,i):e(t,m(1),0,i),_=t=>{switch(t.kind){case`Boolean`:{let e=t.value;return()=>e}case`State`:case`Enabled`:{let e=f(t);return(n,r,i)=>(r[i+e]===-1&&(r[i+e]=+!!c.holdsState(t,n)),r[i+e]===1)}case`Action`:{let e=t.enabled&&f(t.enabled);return(n,r,i,a)=>(e===void 0||r[i+e]!==0)&&a!==void 0&&c.holdsAction(t,n,a)}case`Not`:{let e=_(t.body);return(t,n,r,i)=>!e(t,n,r,i)}case`And`:{let e=t.operands.map(_);return(t,n,r,i)=>e.every(e=>e(t,n,r,i))}case`Or`:{let e=t.operands.map(_);return(t,n,r,i)=>e.some(e=>e(t,n,r,i))}case`Next`:{let e=_(t.body);return(t,n,r,i)=>e(i??t,m(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new e.x(`TLC cannot evaluate a temporal formula in a single step`)}}},v=t.map(e=>({solution:e,checks:{states:e.stateChecks.map(_),actions:e.actionChecks.map(_),nodes:e.tableau?.nodes.map(e=>{let t=s?p({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(_)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=ny(e),n=a.get(t)??a.size;return a.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:xb(e=>new Int32Array(e)),edgeActions:xb(e=>new Uint8Array(e)),stateResults:xb(e=>new Uint8Array(e)),initial:[],firstNodes:xb(wb),lastNodes:xb(wb),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),y=(e,t,n,r,i)=>l(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!g(e,n,r,i)}),a}),b=(e,t,n,r,i,a,o,c,u,d)=>l(t,()=>{let t=e.checks.actions;for(let l=0;l<t.length;l++){if(!s){u[d+l]=+!!g(t[l],n,r,i,a);continue}let f=c+e.actionIds[l];o[f]===-1&&(o[f]=+!!t[l](n,r,i,a)),u[d+l]=o[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>g(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!c.holdsState(d[t>>1],n)),r[o]!==(t&1))return!1}return!0},te=(e,t,n,r,i,a)=>l(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!i)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},S=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Cb(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n,r)=>{let i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Cb(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],Cb(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Sb(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Sb(e.lastNodes,t,[r]),r},re=(e,t)=>t<0?e.checks.nodes.some((n,r)=>S(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,C=(e,t,n)=>(re(e,t)||e.stateCount++,ne(e,t,n,Ob(e,t,n))),ie=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Sb(e.edgeTargets,o,n),i.forEach((t,n)=>Sb(e.edgeActions,(o+n)*s,r,t*s,s)),Sb(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},ae={slots:/* @__PURE__ */ new Int32Array},w=(e,t,i)=>{let a=[...i,{index:e,state:t}],s=16*o;ae.slots=ae.slots.length===s?ae.slots.fill(0):new Int32Array(s);let c=e=>{let t=ae.slots,i=a[e];for(let o=(r.getFingerprint(i)&2147483647)%t.length;;o=(o+1)%t.length){let r=t[o];if(r===0)return t[o]=e+1,!0;let s=a[r-1];if(s.index===i.index&&n.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<a.length;e++){if(l>=ae.slots.length>>1){let e=ae.slots;ae.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}ae.slots.length>s&&o++;let u=[];for(let e of ae.slots)e!==0&&u.push(a[e-1]);return u},oe=(e,t,n,i,o,s,c)=>{let l=y(e,i,n,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],p=[],g=new Uint8Array(d);u.successors.length>0&&b(e,i,n,s,c,n,h(1),0,g,0);for(let r of u.successors){if(!te(e,r,i,n,s,c))continue;if(x(t,r)&&e.errorNode===void 0&&e.solution.models.some(_b)){e.errorNode=o;return}let a=S(e,i,r);if(a!==void 0&&p.includes(a))continue;let l=a??C(e,i,r);p.push(l),f.push(0),a===void 0&&oe(e,t,n,i,l,s,c)}let _=[g],v=1;if(r.forEachActionSuccessors(i,n,r=>{let o=h(r.length),l=new Uint8Array(r.length*d);_.push(l);for(let h=0;h<r.length;h++){let g=r[h],_=m(1);b(e,i,n,s,c,g.state,o,h*a.size,l,h*d);let y=e.isDone[g.index]===!0;for(let n of u.successors){if(!te(e,n,i,g.state,_,0))continue;let r=S(e,g.index,n);if(r!==void 0&&p.includes(r))continue;let a=r??C(e,g.index,n);p.push(a),f.push(v+h),r===void 0&&y&&oe(e,t,g.state,g.index,a,_,0)}}v+=r.length}),p.length>0){let t=new Uint8Array(v*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;ie(e,o,p,t,f,l)}},se=(e,t,n,r,i,a,o)=>{let s=u.size,c=new Uint8Array(t.nodes.length*n.length);l(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(c[i*n.length+t]=1)}),re(e,o)||e.stateCount++,e.isDone[o]=!0;for(let l of kb(e,o)){let o=[],u=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[l]].successors){if(c[f*n.length+a]===0)continue;let l=S(e,i.index,f);if(l!==void 0&&o.includes(l))continue;let p=l??C(e,i.index,f);o.push(p),u.push(a),l===void 0&&d&&oe(e,t,i.state,i.index,p,r,a*s)}}),ie(e,l,o,i,u,a)}return e.errorNode===void 0?void 0:ue(e,e.errorNode)},ce=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Ob(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Tb(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),Tb(e,i)||e.stateCount++,ie(e,i,a,n,o,r)},le=(t,n)=>{if(t.initial.includes(n))return[n];let r=/* @__PURE__ */ new Map,i=[];for(let e of t.initial)Tb(t,e)&&(i.push(e),r.set(e,-1));for(let e=0;e<i.length;e++){let a=i[e];for(let e of Eb(t,a))if(!(e===a&&t.solution.tableau)){if(e===n){let e=[n];for(let t=a;t!==-1;t=r.get(t)??-1)e.push(t);return e}Tb(t,e)&&!r.has(e)&&(r.set(e,a),i.push(e))}}throw new e.x(`Couldn't re-create liveness trace (path) starting at: ${n}`)},ue=(e,t)=>bb(le(e,t).reverse().map(t=>e.nodeStates[t])),de=(t,n)=>{let r=t.solution,i=r.actionChecks.length,a=(e,n,r)=>t.edgeActions.data[(t.edgeStarts[e]+n)*i+r]===1,o=(e,t)=>n.eventuallyAlways.every(n=>a(e,t,n)),s=new Float64Array(t.nodeStates.length).fill(-1),c=t.initial.filter(e=>Tb(t,e)),l=[],u=e=>{let n=Eb(t,e).indexOf(e);return n!==-1&&o(e,n)},d=(e,n)=>r.tableau!==void 0&&Cy(r.tableau.nodes[t.nodeTableaux[e]].particle,n),f=e=>{let i=l.pop()??e;if(i===e&&!u(i)){s[i]=Ab;return}let c=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let n=i;;n=l.pop()??e){c.add(n);let r=f.get(t.nodeStates[n]);if(r?r.push(n):f.set(t.nodeStates[n],[n]),s[n]=Ab,n===e)break}let m=n.infinitelyOftenStates.every(e=>[...c].some(n=>Db(t,n,e))),h=n.infinitelyOftenActions.every(e=>[...c].some(n=>Eb(t,n).some((t,r)=>c.has(t)&&o(n,r)&&a(n,r,e)))),g=r.promises.every(e=>[...c].some(t=>d(t,e)));if(m&&h&&g)return p(e,c,f)},p=(i,s,c)=>{let l=ue(t,i),u=[],f=/* @__PURE__ */ new Set([i]),p=n.infinitelyOftenStates.map(()=>!1),h=n.infinitelyOftenActions.map(()=>!1),g=r.promises.map(()=>!1),_=p.length+h.length+g.length,v=i,y=e=>{u.push(v),v=e};for(;_>0;){let i=_;for(;n.infinitelyOftenStates.forEach((e,n)=>{!p[n]&&Db(t,v,e)&&(p[n]=!0,_--)}),r.promises.forEach((e,t)=>{!g[t]&&d(v,e)&&(g[t]=!0,_--)}),!(_<=0);){let r=-1,l=-1,d=_;if(Eb(t,v).some((e,i)=>{if(c.has(t.nodeStates[e])){if(!s.has(e)||!o(v,i))return!1;r=e,n.infinitelyOftenActions.forEach((e,t)=>{!h[t]&&a(v,i,e)&&(h[t]=!0,_--)})}return _<d?(y(e),f.clear(),!0):(s.has(e)&&!f.has(e)&&(l=e),!1)}))break;if(_<i){y(r),f.clear();break}for(;l===-1;){let n=u.pop();if(n===void 0)throw new e.x(`TLC failed to build the counterexample of a liveness property`);v=n,l=Eb(t,n).find(e=>s.has(e)&&!f.has(e))??-1}y(l),f.add(l)}}let b=m(i,v,c);for(let e=u.length-1;e>=0;e--){let n=t.nodeStates[u[e]];b[b.length-1]!==n&&b.push(n)}let ee=l[l.length-1];return b[b.length-1]===ee&&b.pop(),{prefix:l.slice(0,-1),cycle:[ee,...b.reverse()],isCycleConstrained:vb(r)}},m=(n,r,i)=>{if(r===n)return[];let a=t.nodeStates[r],s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set([a]),l=[];for(let r=a,u=-1,d=0;;d++){for(let e of i.get(r)??[])for(let[d,f]of Eb(t,e).entries()){if(f===e||!o(e,d))continue;if(f===n){let e=[];for(let t=r,n=u;t!==a;)e.push(t),t=n,n=s.get(t)??-1;return e.push(a),e}let p=t.nodeStates[f];i.has(p)&&!c.has(p)&&(c.add(p),l.push([p,r]))}s.set(r,u);let f=l[d];if(f===void 0)throw new e.x(`TLC failed to build the counterexample of a liveness property`);r=f[0],u=f[1]}};for(let e=0;e<c.length;e++){let n=[c[e],-1,0],r=0;for(;n.length>=3;){let e=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===e){let e=f(a);if(e)return e}n.push(Math.min(n.pop()??e,e));continue}if(s[a]!==-1){n.push(Math.min(e,s[a]));continue}s[a]=r,n.push(e,a,-42),l.push(a);let u=r++;Eb(t,a).forEach((e,r)=>{Tb(t,e)&&(o(a,r)?s[e]===-1?n.push(e,-1):u=Math.min(u,s[e]):s[e]===-1&&c.push(e))}),n.push(u)}}};return{branches:v.length,addInitialState:(e,t)=>{let n=m(1);for(let r of v){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)te(r,a,void 0,t,n,0)&&r.initial.push(S(r,e,a)??C(r,e,a))}},addState:(t,n,r,i)=>{let o=w(t,n,r),s=m(o.length),c=o.findIndex(e=>e.index===t)*u.size,l=h(o.length);for(let r of v){let u=r.checks.actions.length,d=new Uint8Array(o.length*u);o.forEach((e,i)=>b(r,t,n,s,c,e.state,l,i*a.size,d,i*u));let f=y(r,t,n,s,c),p=r.solution.tableau;if(i&&(p?kb(r,t).some(e=>r.edgeCounts[e]>0):o.every(e=>Tb(r,e.index))))throw new e.x(`The behavior graph holds every edge of the state already.`);if(!p){ce(r,o,d,f,t);continue}let m=se(r,p,o,s,d,f,t);if(m)return m}},storeState:(e,t)=>{for(let n of v){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=S(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,ne(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>v.map(e=>e.stateCount),findViolation:()=>{for(let e of v)for(let t of e.solution.models){let n=de(e,t);if(n)return n}}}},zb=t=>{switch(t.kind){case`Number`:if(!Bt(t.value))throw e.ot(new e.A(`TLC can't handle a number this big.\n${t.value}`),e.rt.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return En(t.name);case`Set`:return F({kind:`MixedSet`,elements:t.elements.map(zb)})}},Bb=t=>{try{return zb(t)}catch(t){throw!(t instanceof e.x)||t instanceof e.A||t instanceof e.S?t:e.ot(new e.x(`${e.K}${t.message}`),e.rt.error)}},Vb=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e.x(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Vn(e,r)})});if(n)return n[1];throw new e.x(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Hb=t=>new e.v(`In the configuration file, the identifier ${t} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),Ub=(t,n)=>{let r=e=>n.root.visible.get(e)?.key??e,i=n.root.constants.map(e=>e.name),a=n.root.variables,o=e=>{let t=n.moduleSymbols.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},s=e=>{if(e.module===void 0)return[e.name,r(e.name)];let t=o(e);return t?[t.key]:[]},c=e=>e.module===n.root.module.name?[]:s(e),l=e=>{let t=n.definitions.get(e);return t?.kind===`Operator`?t.params.length:n.root.constants.find(t=>t.name===e)?.arity??n.builtins.get(e)?.arity??0},u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,f=(e,t)=>{n.builtins.set(e,t),n.definitions.delete(e),u.delete(e),d.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Bb(e.value);mr(t),c(e).forEach(e=>{let n=l(e);n===0?u.set(e,t):f(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let p=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=p.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.v(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(zb),zb(t.value)]),p.set(n,r)}),p.forEach(e=>c(e).forEach(t=>f(t,Vb(e.name,l(t),e.rows))));let m=new Map(t.substitutions.flatMap(e=>s(e).map(t=>[t,r(e.target)])));[...m.keys()].forEach(e=>u.delete(e));let h=(t,o,s)=>{let c=r(o),l=n.definitions.get(c);if(!(l!==void 0||n.builtins.has(c)||u.has(c)||i.includes(o)||a.includes(o)))throw new e.v(`The configuration file substitutes for ${t} with the undefined identifier ${o}.`);if(l?.kind===`Operator`&&l.params.length!==s)throw new e.v(`The configuration file substitutes for ${t} with ${o} of different number of arguments.`)};t.substitutions.filter(e=>e.module===void 0).forEach(r=>{let a=r.name,o=r.target;if(!i.includes(a)&&!n.root.visible.has(a))throw new e.v(`In the configuration file, the identifier ${a} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===o))throw Hb(o);h(a,o,n.root.constants.find(e=>e.name===a)?.arity??n.root.visible.get(a)?.arity)});let g=t.substitutions.filter(e=>e.module!==void 0);[...n.moduleSymbols.keys()].forEach(t=>{let n=g.filter(e=>e.module===t);n.forEach(e=>{let t=o(e);if(t){if(n.some(t=>t.name===e.target))throw Hb(e.target);h(e.name,e.target,t.arity)}});let r=n.find(e=>!o(e));if(r)throw new e.v(`In the configuration file, the identifier ${r.name} does not appear in the specification.`)});let _=g.find(e=>!n.moduleSymbols.has(e.module??``));if(_)throw new e.v(`In the configuration file, the module name ${_.module} is not a module in the specification.`);let v=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(c)),y=(e,t)=>{if(v.has(e))return{key:e,prefix:t};let r=n.copySources.get(e);return r&&y(r.source,t+r.prefix)};n.copySources.forEach((e,t)=>{let r=y(e.source,e.prefix),i=n.definitions.get(t);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=ru(t,r.key,a,a.slice(r.prefix),i.location);n.definitions.set(t,o),n.root.visible.forEach((e,r)=>{e.key===t&&r!==t&&n.definitions.set(r,o)})}),n.operatorConstants.forEach((e,t)=>u.set(t,e));let b=i.filter(e=>!u.has(e)&&!m.has(e)&&!d.has(e));if(b.length>0){let t=n.order.getDeclarationOrder(`constant`).find(e=>b.includes(e))??b[0];throw new e.v(`The constant parameter ${t} is not assigned a value by the configuration file.`)}return{constants:u,substitutions:m}},Wb=`tlc2/value/impl/`,Gb={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Kb={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},qb=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},Jb=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Yb=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Xb=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Jb.get(e[3])}${`[]`.repeat(e[1].length)}`),Zb=(e,t)=>e[e[t].first].text,Qb=(e,t)=>Zb(e,t).replaceAll(`/`,`.`),$b=t=>{let n=qb(t);if(n.readUint32()!==3405691582)throw new e.I(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===Gb.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Gb.integer?i.value=n.readInt32():t===Gb.float?n.readUint32():t===Gb.long||t===Gb.double?(n.readBytes(8),e++):t===Gb.class||t===Gb.string||t===Gb.methodType||t===Gb.module||t===Gb.package?i.first=n.readUint16():t===Gb.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Qb(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=Xb(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:qb(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Qb(r,d.readUint16())):[],p=Yb.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=Xb(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${h}`})}return{pool:r,methods:s}},ex=(e,t)=>{let n=e[t],r=e[n.second];return{className:Zb(e,n.first),name:e[r.first].text}},tx=(t,n,r,i)=>{let a=()=>new e.V(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===Gb.integer)return t.value;if(t.tag===Gb.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=Kb.iconstM1&&t<=Kb.iconst5)s.push(t-Kb.iconst0),e+=1;else if(t===Kb.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===Kb.sipush)s.push(r()<<16>>16),e+=3;else if(t===Kb.ldc)s.push(l(o[e+1])),e+=2;else if(t===Kb.ldcW)s.push(l(r())),e+=3;else if(t===Kb.dup){let t=c();s.push(t,t),e+=1}else if(t===Kb.getstatic){let t=ex(n,r());if(t.className!==`${Wb}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===Kb.invokestatic){let t=ex(n,r()),o=c();if(t.className!==`${Wb}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===Kb.new)s.push({className:Zb(n,r()),value:void 0}),e+=3;else if(t===Kb.invokespecial){let t=ex(n,r()),o=c(),s=c();if(!(t.className===`${Wb}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===Kb.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},nx=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=$b(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:tx(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},rx=w(`EOF`),ix=w(`IDENTIFIER`),ax=w(`DEFBREAK`),ox=(e,t)=>Array.from({length:w(t)-w(e)+1},(t,n)=>w(e)+n),sx=new Set(ox(`op_57`,`op_119`)),cx=new Set(ox(`op_1`,`op_119`)),lx=new Set(ox(`op_57`,`op_70`)),ux=/* @__PURE__ */ new Set([...ox(`ACTION`,`EXCEPT`),w(`EXTENDS`),...ox(`IF`,`SF`),w(`STATE`),...ox(`THEN`,`WITH`),w(`US`),...ox(`op_112`,`op_116`)]),dx=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),fx=new Map([...dx(`postfix`,160,160,!0,`[`),...dx(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...dx(`prefix`,120,120,!1,`-.`),...dx(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...dx(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...dx(`prefix`,40,40,!0,`\\lnot`),...dx(`nfix`,100,130,!0,`\\times`),...dx(`infix`,140,140,!1,`^`,`^^`),...dx(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...dx(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...dx(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...dx(`infix`,100,110,!0,`|`,`||`,`%%`),...dx(`infix`,100,110,!1,`%`),...dx(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...dx(`infix`,90,140,!1,`\\wr`),...dx(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...dx(`infix`,90,130,!1,`!!`),...dx(`infix`,90,90,!1,`...`,`..`),...dx(`infix`,80,80,!0,`\\intersect`,`\\union`),...dx(`infix`,80,80,!1,`\\`),...dx(`infix`,70,70,!1,`<:`,`:>`),...dx(`infix`,60,60,!0,`@@`),...dx(`infix`,50,140,!0,`\\cdot`),...dx(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...dx(`infix`,30,30,!0,`\\land`,`\\lor`),...dx(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...dx(`infix`,10,10,!1,`=>`)]),px=new Map([...fx,...As.flatMap(e=>e.slice(1).map(t=>[t,fx.get(e[0])]))]),mx=px.get(`[`),hx={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},gx=e=>({type:`tokens`,kinds:new Set(e)}),_x=e=>typeof e==`string`?e.startsWith(`<`)?gx([w(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(_x)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),vx=e=>(...t)=>({type:e,body:G(...t)}),q=vx(`zeroOrMore`),yx=vx(`oneOrMore`),J=vx(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),bx=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),xx=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=bx(e,n);return n},Sx=(...e)=>{let t=e.map(w);return e=>t.includes(xx(e,1).kind)},Cx=(e,t=xx(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},wx=e=>{let t=xx(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Tx=e=>Sx(`CASESEP`)(e)&&Cx(e),Ex=e=>{let t=xx(e,1);ux.has(t.kind)&&(t.kind=ix)},Dx=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Ox=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),kx=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Ax=e=>e.operatorStacks[e.operatorStacks.length-1],jx=(e,t)=>e.low>t.high,Mx=(e,t)=>e.high<t.low,Nx=e=>e.fix===`prefix`?e:px.get(`${e.name}.`),Px=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===mx?Ox(`FcnAppl`,[n,...r.node.heirs]):Ox(`PostfixExpr`,[n,r.node]),operator:void 0})},Fx=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Ox(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Ox(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Ix=e=>{let t=Ax(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return Px(t,n),Ix(e);if(i.operator!==void 0){let t=Nx(r.operator);return t!==void 0&&jx(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Dx(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Dx(e,a.node.first,a.node.last)} and expression at location ${Dx(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Mx(a.operator,r.operator)?void 0:jx(a.operator,r.operator)?(Fx(t,a.operator),Ix(e)):`Precedence conflict between ops ${a.operator.name} in block ${Dx(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Nx(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Mx(s,r.operator))return;if(!jx(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Dx(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Fx(t,s),Ix(e);let c=Dx(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===hx?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Lx=e=>Y(t=>{let n=Ax(t),r=kx(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Ix(t)}),Rx=Lx(()=>!1),zx=Lx(()=>!0),Bx=Y(e=>{e.lastOperator=px.get(e.token.image)}),Vx=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Hx=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Vx(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Ux=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Cx(e,n.first.beginColumn))return n;let t=Ux(e,n);if(t!==void 0)return t}},Wx=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(w),n=(e,...t)=>t.some(t=>e.kind===w(t)),r=e=>e!==void 0&&sx.has(e.kind),i=e.token,a=bx(e,i);i.next=void 0;let o=bx(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===ix&&(e=e.next)}else if(e.kind===ix){let t=e.next;!r(t)||lx.has(t.kind)||cx.has(t.kind)&&t.next?.kind!==ix||(e=t.next?.kind===w(`SUBSTITUTE`)?i:cx.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==ax&&(e.next={kind:ax,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=bx(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Gx=e=>{let t=xx(e,1);if(t.kind===w(`LAB`)){let n=1;for(;n!==0;)if(t=bx(e,t),t.kind===w(`LAB`)&&n++,t.kind===w(`RAB`)&&n--,t.kind===rx)return!1;return bx(e,t).kind===w(`IN`)}if(t.kind!==ix)return!1;for(t=bx(e,t);t.kind===w(`COMMA`);){if(t=bx(e,t),t.kind!==ix)return!1;t=bx(e,t)}return t.kind===w(`IN`)},Kx=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),qx=e=>e.proofLevels.at(-1)??-1,Jx=e=>{let t=xx(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Sx(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||qx(e)>=0&&Kx(t)>qx(e):Sx(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Yx=(e,t)=>{let n=Kx(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Xx=e=>Y(t=>Yx(t,t.token)?void 0:`${Dx(t,t.token)}: ${e}`),Zx=gx([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(w)),Qx=gx([...Zx.kinds,w(`op_76`)]),$x=gx(cx),eS=gx(lx),tS=gx([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(w)),nS=()=>q(Z({expansion:[K(Zx,`<op_77>`)],semantic:Cx}),K(`PrefixOp`,`InfixOp`),zx),rS=()=>K(G(Z({expansion:[`OpenStart`],semantic:Cx}),`OpenExpression`,Rx),G(Z({semantic:Cx}),`ExtendableExpr`)),iS=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),aS=()=>K(G(Z({semantic:e=>Sx(`ASSUME`,`BOXASSUME`)(e)||xx(e,2).kind===w(`COLONCOLON`)&&[w(`ASSUME`),w(`BOXASSUME`)].includes(xx(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),oS=()=>[`JuncItem`,q(Z({semantic:wx}),`JuncItem`)],sS=e=>Y(t=>{t.expecting=e,Ex(t)}),cS=e=>Y(t=>{t.isTerminalProof=e}),lS=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Wx(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),uS={CompilationUnit:Q(void 0,[Y(Wx),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),sS(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,sS(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,sS(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(Wx)),G(Z({semantic:e=>Sx(`USE`)(e)&&xx(e,2).kind!==w(`ONLY`)||Sx(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(lS(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),lS(`Expression`,Z({expansion:[`<IDENTIFIER>`,eS]}),`PostfixLHS`,`Expression`),lS(`Expression`,Z({expansion:[`<IDENTIFIER>`,$x]}),`InfixLHS`,`Expression`),lS(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),lS(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[Qx,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,$x,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,eS]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,sS(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[Zx,Bx]),NonExpPrefixOp:Q(void 0,[Qx,Bx]),InfixOp:Q(`Infix Op`,[$x,Bx]),PostfixOp:Q(void 0,[eS,Bx]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Wx(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),aS(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),aS(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=kx(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Dx(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(Wx),K(G(Z({amount:3}),Z({semantic:Sx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Jx}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>Sx(`BY`)(e)||xx(e,2).kind===w(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>xx(e,2).kind!==w(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,cS(!0),J(`<ONLY>`)),G(`<USE>`,cS(!1),J(`<ONLY>`)),G(`<HIDE>`,cS(!1))),X("an expression, `MODULE' or `DEF'"),J(iS(),q(`<COMMA>`,X(`MODULE or expression`),iS(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),iS(),q(`<COMMA>`,X(`MODULE or expression`),iS(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),tS,Xx(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Jx}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),tS,Xx(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:Sx(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:Sx(`INSTANCE`)}),`Instantiation`),G(Z({semantic:Sx(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Jx}),Y(e=>{let t=kx(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Dx(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),yx(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:Sx(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(Qx,$x,eS),gx([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(w))],semantic:Cx}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Dx(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Cx}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Gx}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),yx(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=kx(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),yx(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Gx}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>xx(e,2).kind===w(`MAPTO`)&&ux.has(xx(e,1).kind)}),Y(e=>{xx(e,1).kind=ix}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=Ox(`FcnAppl`,t.heirs),e.lastOperator=mx})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,yx(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Ex),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===w(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>Tx(e)&&xx(e,2).kind!==w(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Tx}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[yx(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=xx(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...oS()),G(Z({expansion:[`<AND>`]}),...oS())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Ux(t,e.heirs[1]);return n&&`Item at ${Dx(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Dx(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),nS(),rS()],(e,t)=>{let n=Ax(t);n.push({node:e.heirs[0],operator:hx});let r=Ix(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Rx,q(K(G(Z({expansion:[`PostfixOp`],semantic:Cx}),`PostfixOp`,zx),G(Z({expansion:[`<DOT>`],semantic:Cx}),`<DOT>`,Y(Ex),Z({semantic:Cx}),`Identifier`,Y(e=>{let t=Ax(e);t[t.length-1].operator!==void 0&&Px(t,t.length),t[t.length-1]={node:Ox(`RecordComponent`,[t[t.length-1].node,kx(e,2),kx(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Cx}),X(`function argument`),`SBracketCases`,Lx(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Cx}),`InfixOp`,zx,nS(),rS()),G(Z({expansion:[`<COLONCOLON>`],semantic:Cx}),`<COLONCOLON>`,Y(e=>{let t=Ax(e);if(!Hx(t[t.length-1].node))return`\`::' at ${Dx(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Ax(e),n=kx(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Mx(r,e.lastOperator)){let t=kx(e,3);return`Removing label at ${Dx(e,t.first,t.last)} would change expression parsing.`}t.push({node:Ox(`Label`,[kx(e,3),kx(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Cx}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Cx}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>qx(e)<0&&e.proofLevels.length<=1?`${Dx(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Dx(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Vx(e.heirs)===void 0?e.heirs.length===1?Ox(`GeneralId`,e.heirs):void 0:Ox(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>xx(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>xx(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Dx(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},dS=/* @__PURE__ */ new Map,fS=e=>{let t=dS.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=fS(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,fS(uS[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return dS.set(e,n),n},pS=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},mS=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=bx(e,e.scanPosition)),e.scanPosition=bx(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},hS=(e,t)=>{if(t.type===`tokens`)return mS(e,t.kinds);if(t.type===`call`)return hS(e,uS[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||pS(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=hS(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||pS(e,t.semantic)?hS(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=hS(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=hS(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},gS=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=hS(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},_S=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||fS(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!fS(a).hasSemanticStart?fS(a).first.has(xx(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):gS(e,i,a)&&(o===void 0||o(e))}),vS=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,hS(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=bx(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===rx){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=bx(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${we(e.token.image)}" `},yS=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??vS(e)}\n\nResidual stack trace follows:\n${r}`,!1},bS=(e,t)=>{let n=bx(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,yS(e))},xS=(e,t)=>{let n=uS[t];n.message!==void 0&&(e.messages.push({name:n.message,token:xx(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!SS(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return yS(e,i);let a=r.node??(r.heirs.length===0?void 0:Ox(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},SS=(e,t)=>{if(t.type===`tokens`)return bS(e,t.kinds);if(t.type===`call`)return xS(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||yS(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||yS(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||SS(e,t));if(t.type===`choice`){let n=_S(e,t.alternatives);return n===-1?yS(e):SS(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!SS(e,t.body))return!1;if(t.type===`optional`)return _S(e,[t.body])===-1||SS(e,t.body);for(;_S(e,[t.body])===0;)if(!SS(e,t.body))return!1;return!0},CS=e=>{let t=Se(e),n={kind:rx,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=SS(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
1784
+ `)},wS={low:15,high:15},TS={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),ES=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),DS=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,OS=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),kS={low:17,high:17},AS=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),jS=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),MS=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),NS=/* @__PURE__ */ new Set([...MS,`'`]),PS=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),FS=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),IS=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),LS=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),RS=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...NS]),zS=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),BS=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),VS=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),HS=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),US=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),WS=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),GS=/* @__PURE__ */ new Set([``,`*`,`-`]),KS={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},qS=(e,t)=>e.line-t.line||e.column-t.column,JS=(e,t)=>({start:qS(e.start,t.start)<=0?e.start:t.start,stop:qS(e.stop,t.stop)>=0?e.stop:t.stop}),YS=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),XS={printed:``,set:``},ZS={printed:`
1785
+ `,set:``},QS={printed:`
1786
1786
  `,set:`
1787
- `},JS=(t,n,r,i=`Proof.Parser`)=>new e.I(t,void 0,{reason:`${t}${r.set}`,line:n.start.line,column:n.start.column,isEnd:!1,proof:{stop:n.stop,exception:i,printed:`${t}${r.printed}`}}),YS=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),XS=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),ZS=/* @__PURE__ */ new Set([`NEW`,...XS.keys()]),QS=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),$S=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),eC=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),tC=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?xS.has(e.operator):DS.has(e.operator)),nC=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,rC=e=>xS.has(e)||DS.has(e)||e===`-.`,iC=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},aC=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
1788
- `)}\n`},oC=(t,n,r=re(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(ee),o=0,s=[],l,u,d=[],f=[],p,m=0,h=[],g=/* @__PURE__ */ new WeakMap,_=e=>d[d.length-1].has(e),v=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),y=[],b=[],te=[],x=(e,t=o-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];y[e]??=v(a[e]),b[t]??={line:r.line,column:r.endColumn};let i={module:f[0].name,start:y[e],end:b[t]};return e===t&&(te[e]=i),i},S=(e,t)=>(e.location.range=x(t),e),ne=(e=0)=>a[Math.min(o+e,a.length-1)],C=(e=0)=>{let t=ne(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ie=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ae=e=>i&&(e.kind===`Keyword`||eC.has(e.text)),w=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:zS.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ae(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,se=(t,n=ne(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column,s=new e.I(`${t} at line ${n.line}, column ${n.column}`,void 0,ce(t,n,o,r));return p!==void 0&&g.set(s,p),s},ce=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[h[0]-1],s=r?`Unexpected ${oe(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?w(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},le=(e,t=ne())=>se(e,t,t),ue=t=>{let n={cursor:o,frame:p,restorePoints:h.length,offsideColumns:s.length,recursiveScopes:d.length},r=++m;p=r;try{let e=t();return p=n.frame,e}catch(t){if(!(t instanceof e.I)||g.get(t)!==r)throw t;o=n.cursor,p=n.frame,h.length=n.restorePoints,s.length=n.offsideColumns,d.length=n.recursiveScopes;return}},de=e=>{let t=p;p=void 0;let n=e();return p=t,n},fe=e=>{h.push(o);let t=e();return h.pop(),t},pe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ae(e),T=(e,t=0)=>{let n=C(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},E=()=>{let e=C();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o++,e},D=e=>T(e)?(o++,!0):!1,O=e=>{if(!T(e))throw le(`Expected ${JSON.stringify(e)} but found ${ie(C())}`);return E()},k=()=>{let e=C();if(e.kind!==`Identifier`)throw le(`Expected an identifier but found ${ie(e)}`);if(ae(e))throw le(`Unexpected keyword ${e.text}`);return o++,e.text},me=()=>{let e=o;return{name:k(),range:x(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=C();return e.kind!==`String`&&(AS.has(e.text)||xS.has(e.text)||OS.has(e.text))?(o++,e.text):k()},_e=!1,ve=()=>C().kind===`Identifier`||!pe(C())?k():(_e=!0,E().text),ye=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},A=(e,t=`,`)=>{let n=[e()];for(;D(t);)n.push(e());return n},be=(e=0)=>{if(T(`<<`,e)){let t=e+1;for(;C(t).kind===`Identifier`||T(`,`,t);)t++;return T(`>>`,t)&&T(`\\in`,t+1)}let t=e;for(;C(t).kind===`Identifier`;){if(T(`\\in`,t+1))return!0;if(!T(`,`,t+1))return!1;t+=2}return!1},xe=()=>{if(T(`::`))return!0;if(!T(`(`))return!1;let e=1;for(;C(e).kind===`Identifier`&&T(`,`,e+1);)e+=2;return C(e).kind===`Identifier`&&T(`)`,e+1)&&T(`::`,e+2)},Se=()=>{if(!D(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(T(`>>`)?[]:A(me));return O(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>{let e=()=>{let e=A(Se);O(`\\in`);let t=de(N);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;T(`,`)&&(!i||be(1));)E(),t.push(e());return t.flat()},we=()=>{let e=C();if(i&&eC.has(e.text)){let t=o;E();let n={kind:`Identifier`,name:e.text,location:v(e)};return{subscript:S(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||T(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(x(o,o)),n.push(k()),e&&T(`(`)?ke():[]),s=[a(!i)];for(;T(`!`)&&C(1).kind===`Identifier`;)E(),s.push(a(!0));let c=s.slice(0,-1),l=v(e);l.range={...x(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(T(`<<`)||T(`(`)||T(`{`)||T(`[`)||t){let e=o,t=Be();return{subscript:t.location.range?t:S(t,e),lastArgs:[]}}throw le(`Expected a subscript but found ${ie(e)}`)},Te=e=>{let t=C(1),n=C(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&T(`==`,OS.has(n.text)?3:4))},Ee=e=>{let t=C(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||T(`,`,1)||T(`)`,1)||t.kind===`Keyword`&&FS.has(t.text)||Te(e)},De=()=>{let e=C(),t=e.kind===`Operator`&&(xS.has(e.text)||kS.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(kS.has(e.text)||NS.has(e.text)&&e.text!==`'`&&!DS.has(e.text)||MS.has(e.text)&&C(-1).text===`(`&&C(-1).line===e.line&&C(-1).endColumn+1===e.column&&C(1).text===`)`&&C(1).line===e.line&&C(1).column===e.endColumn+1)&&Ee(e))throw se(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw se(`\\X may not be used as an infix operator`,e);if(t)return o++,S({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:v(e)},o-1);if(e.kind!==`String`&&NS.has(e.text)&&Ee(e)){o++;let t=v(e);if(DS.has(e.text))return S({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return S({kind:`Lambda`,params:[n.name],body:iC(e.text,n,t),operator:e.text,location:v(e)},o-1)}if(T(`LAMBDA`)){let t=o;E();let n=he(A(me));O(`:`);let r=N();return S({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:v(e)},t)}if(!i)return N();let n=ue(N);if(n)return n;throw le(`Unexpected ${ie(C())}`)},Oe,ke=()=>ye(()=>{let e=o;O(`(`);let t=A(De);return O(`)`),Oe=x(e),t}),Ae=()=>{let e=E();s.push(e.column);let t=[N()],n=()=>{for(;nC(ne())&&ne().text===e.text&&ne().column===e.column;)o++,t.push(N())};return i?de(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:v(e)}},je=e=>ye(()=>{let t=v(e),n=C().kind===`Identifier`,r=T(`|->`,1)&&(n||pe(C()));if(r||n&&T(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=v(C()),i=e();return n.range=x(t),O(r?`|->`:`:`),{name:i,value:N(),location:n}},a=[i(()=>n?k():E().text),...D(`,`)?A(()=>i(k)):[]];return O(`]`),{kind:e,fields:a,location:t}}if(be()){let e=o,n=Ce();if(!i||T(`|->`)){O(`|->`);let e=N();return O(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=N();if(D(`->`)){let e=N();return O(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(D(`EXCEPT`)){let e=A(()=>{O(`!`);let e=[];for(;T(`.`)||T(`[`);)if(D(`.`)){if(!pe(C()))throw le(`Expected a field name but found ${ie(C())}`);if(!i&&T(`@`))throw le(`@ used in !.@`);e.push({kind:`Field`,name:E().text})}else O(`[`),e.push({kind:`Index`,args:A(()=>N())}),O(`]`);return O(`=`),{path:e,value:N()}});return O(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!T(`]_`)){let e=[a];for(;D(`,`);)e.push(N());return O(`]`),{kind:`Bracket`,args:e,location:t}}return O(`]_`),{kind:`BoxAction`,action:a,subscript:we().subscript,location:t}}),Me=()=>{let e=o,t=S(Ve(),e),n=v(E());return S({kind:`Apply`,operator:`\\in`,args:[t,de(N)],location:n},e)},Ne=e=>ye(()=>{let t=v(e);if(D(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(C(1).text===`\\in`||T(`<<`))){let e=o,n=Se();O(`\\in`);let r=de(N);if(D(`:`)){let e=de(N);return O(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=C().kind===`Identifier`&&T(`\\in`,1)?Me():N();if(D(`:`)){let e=Ce();return O(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;D(`,`);)r.push(N());return O(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=v(e),n=ye(()=>T(`>>`)||T(`>>_`)?[]:A(()=>N()));if(D(`>>_`)){if(n.length!==1)throw se(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:de(we).subscript,location:t}}return O(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=v(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return O(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=he(A(me));return O(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:N(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{let n=o;if(D(`OTHER`))return O(`->`),{kind:`Case`,arms:t,other:N(),otherRange:x(n),location:v(e)};let r=N();O(`->`),t.push({condition:r,body:N()})}while(D(`[]`));return{kind:`Case`,arms:t,other:void 0,location:v(e)}},Le=()=>{let e=C(1);return T(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||PS.has(e.text)||e.kind===`Operator`&&(xS.has(e.text)||OS.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&AS.has(e.text))},Re=()=>{let e=E();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:T(`(`)?ke():[]}},ze=(e,t,n,r,i)=>{let a=[{kind:`Name`,name:e,args:t}],s=[x(r,r)],c=[n];for(;Le();){E();let e=o;Oe=void 0;let t=Re();s.push(t.kind===`Bound`?x(e):x(e,e)),a.push(t),c.push(Oe)}let l=a.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=a.flatMap(e=>`args`in e?e.args:[]),f=a.map(e=>`args`in e?e.args.length:0);return l.length<a.length?{kind:`Subexpression`,selectors:a,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??x(r),selectorRanges:s,argumentRanges:c,location:i}},Be=e=>{let t=o,r=E(),a=v(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=A(k);return O(`:`),{kind:`Lambda`,params:e,body:N(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:c(r.text),text:r.text,location:a};if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&xt(r);if(!i&&s&&vt()<0&&_t.length<=1)throw se(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw se(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?St(r)??r.text:r.text;if(xe()){let o=he(D(`(`)?A(me):[]);o.names.length>0&&O(`)`),O(`::`);let s=x(t),c=N();if(!i&&e!==void 0&&l!==void 0&&tC(c)&&e.high>=l.low)throw se(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:s,body:c,location:a}}let o=T(`(`);if(n===`@`&&!o&&!Le())return{kind:`ExceptAt`,location:a};let c=o?ke():[];return Le()?ze(n,c,o?Oe:void 0,t,a):o?{kind:`Apply`,operator:n,args:c,argumentsRange:Oe,location:a}:{kind:`Identifier`,name:n,location:a}}let u=r.kind===`Operator`&&(rC(r.text)||r.text===`'`&&!i);if(u&&T(`(`)){let e=ke();return!i&&Le()?ze(r.text,e,Oe,t,a):n===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:r.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,argumentsRange:Oe,location:a}}if(u&&!i)return Le()?ze(r.text,[],void 0,t,a):{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=ye(()=>N());return O(`)`),e}case`[`:return je(r);case`{`:return Ne(r);case`<<`:return Pe(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(r);case`IF`:{let e=N();O(`THEN`);let t=N();return O(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:a}}case`CASE`:return Ie(r);case`LET`:{let e=[],t=[],n=[];for(d.push(/* @__PURE__ */ new Set);!D(`IN`);){if(i&&T(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`);if(D(`RECURSIVE`)){n.push(...mt());continue}let r=st(!i&&D(`LOCAL`));r.kind===`Instance`?t.push(r):e.push(r)}return d.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:N(),location:a}}case`CHOOSE`:{let e=Se(),t=D(`\\in`)?N():void 0;return O(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=we(),t=!T(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ye(()=>{O(`(`);let e=N();return O(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw le(`Unexpected ${ie(r)}`,r)},j=(e,t,n)=>{l=u={low:t,high:n};let r=N(n+1),i=C(),a=OS.has(i.text)?yS.high:xS.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw se(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Ve=()=>{let e=u;u=void 0;let t=C(),n=v(t);if(t.kind===`Operator`&&nC(t))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return E(),{kind:`Apply`,operator:`~`,args:[j(t,4,4)],location:n};case`-`:return E(),{kind:`Apply`,operator:`-.`,args:[j(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return E(),iC(t.text,j(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return E(),{kind:`Apply`,operator:t.text,args:[j(t,10,13)],location:n}}return Be(e)},He=(e,t,n,r,i)=>{let a=v(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},Ue=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:v(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:v(e)},We=()=>{E();let e=ye(()=>A(()=>N()));return ye(()=>O(`]`)),e},Ge=e=>{let t=o,n=Ve(),r=n.location.range?n:S(n,t),i;for(;;){let n=C();if(n.kind!==`Operator`)break;let a=v(n);if(OS.has(n.text)&&e<=15){E(),l=yS,r=S(Ue(n,r),t);continue}if(n.text===`[`){let e=We();l=bS,r=S({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&pe(C(1))){E();let e=E().text;r=S({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=xS.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw se(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(E(),o.low>12&&T(`-`))throw se(`Precedence conflict between ${n.text} and -`,C());l=u=o;let s=N(o.high+1),c=i?.text===n.text;r=S(He(n,r,s,c,x(t).end),t),i={...o,text:n.text}}return r},Ke=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&xt(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&TS.has(e.text),qe=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:S(e,t)}),Je=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),M=e=>e.kind===`Operator`&&OS.has(e.text)&&T(`(`,1)?ue(()=>ye(()=>{E(),E();let t=N(),n=o-1;return O(`)`),{end:n,expression:Ue(e,t)}})):void 0,Ye=()=>{let e=0;for(let t=o+1;t<a.length;t++){let n=a[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(a[t-1].text!==`!`&&(QS.has(n.text)&&e++,$S.has(n.text)&&--e===0))return!1}}return!1},Xe=e=>T(`(`,1)&&Ye()?ue(()=>ye(()=>{E(),E();let t=N();O(`,`);let n=N();return O(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:v(e)}})):void 0,Ze=e=>{let t=o,n=C(),r=v(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?xS.get(n.text):void 0;if(!e){if(T(`[`)){let e=We();return Je(t,`Postfix`,wS,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(T(`.`)&&pe(C(1))){E();let e=E().text;return Je(t,`Postfix`,wS,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(Xe(n)){o=t;return}return E(),{...Je(t,`Infix`,a,e=>He(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,x(e[0].start,e[1].end).end)),isLeft:SS(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!OS.has(n.text))return;if(M(n)){o=t;return}return E(),Je(t,`Postfix`,yS,e=>Ue(n,e[0].expression))}if(n.kind===`Operator`&&nC(n))return qe(Ae(),t);let s=a?Xe(n):void 0;if(s)return qe(s,t);let c=M(n);if(c)return c.expression.location.range=x(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?CS.get(n.text):void 0;if(l)return E(),Je(t,`Prefix`,l,e=>iC(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Ke(n))return;let u=n.kind===`Operator`&&ES.has(n.text);return qe(u?Be():de(Be),t)},Qe=e=>e!==void 0&&`fixity`in e,$e=e=>e!==void 0&&!(`fixity`in e),et=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=x(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},tt=e=>{let t=e.pop(),n=e.pop();if(!$e(t)||!Qe(n))throw se(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(et(n,$e(r)?[r,t]:[t]))},nt=e=>{let t=e[e.length-2];return Qe(t)?t:void 0},rt=(e,t)=>t!==void 0&&e.high<t.low,it=()=>fe(()=>{let e=ue(()=>Ze(!0));if(e===void 0){let e=ne();throw e.kind===`End`?le(`Unexpected end of expression`,e):se(`required expressions(s) missing before '${oe(e)}'`,e)}return de(()=>{let t=[e];for(;;){let e=ue(()=>Ze(Qe(t[t.length-1])));if(e===void 0)break;if($e(e)||e.fixity===`Prefix`){t.push(e);continue}for(;rt(e,nt(t));)tt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&$e(n)){t.splice(-1,1,et(e,[n]));continue}let r=nt(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!rt(r,e)&&tt(t),t.push(e)}for(;t.length>1;)tt(t);let n=t[0];if(!$e(n))throw se(`incomplete expression`);return n.expression})}),N=(e=0)=>i?it():Ge(e),at=()=>{if(!D(`(`))return[];let e=pt();return O(`)`),e},ot=()=>{let e=v(C()),t=N(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},st=e=>{let t=o;return S(lt(e),t)},ct=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),lt=e=>{let t=C(),n=o,r=v(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:x(n,o-2),...ot(),isLocal:e,isRecursive:_(t),location:r});if(t.kind===`Identifier`&&C(1).kind===`Operator`&&xS.has(C(1).text)&&C(2).kind===`Identifier`&&T(`==`,3)){let e=me(),t=E().text,n=me();return O(`==`),i(t,[ct(e),ct(n)])}let a=t.kind!==`String`&&AS.has(t.text),s=t.kind===`Identifier`&&OS.has(C(1).text)&&T(`==`,2);if(a||s){let e=a?t.text:C(1).text;a&&E();let n=me();return s&&E(),O(`==`),i(e,[ct(n)])}let c=k();if(D(`[`)){let t=ye(()=>Ce());return O(`]`),O(`==`),{kind:`Function`,name:c,bounds:t,body:N(),isLocal:e,isRecursive:_(c),location:r}}let l=o,u=at();return O(`==`),T(`INSTANCE`)?{...ut(c,u,e,r),definitionRange:x(l)}:i(c,u)},ut=(e,t,n,r)=>{let i=o;return O(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:D(`WITH`)?A(()=>{let e=o,t=ge(),n=x(e);return O(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:x(i)}},dt=()=>{let e=o;return S(ft(),e)},ft=()=>{let e=v(C());if(T(`_`)&&C(1).kind===`Operator`&&(xS.has(C(1).text)||OS.has(C(1).text)))return E(),{name:E().text,arity:D(`_`)?2:1,location:e};if(C().kind!==`String`&&(AS.has(C().text)||i&&C().kind===`Operator`)&&T(`_`,1)){let t=E().text;return E(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=k();if(!D(`(`))return{name:t,arity:0,location:e};let n=A(()=>O(`_`));return O(`)`),{name:t,arity:n.length,location:e}},pt=()=>A(dt),mt=()=>{let e=pt();return e.forEach(e=>d[d.length-1].add(e.name)),e},ht=e=>{let t=0,n=e;do{let e=C(n);if(e.kind===`End`)return n;e.kind===`Operator`&&QS.has(e.text)&&t++,e.kind===`Operator`&&$S.has(e.text)&&t--,n++}while(t>0);return n},gt=()=>{let e=C(),t=C(1);return e.kind===`Identifier`?T(`(`,1)||T(`[`,1)?T(`==`,ht(1)):t.kind===`Operator`&&OS.has(t.text)?T(`==`,2):t.kind===`Operator`&&xS.has(t.text)?C(2).kind===`Identifier`&&T(`==`,3):T(`==`,1):e.kind!==`String`&&AS.has(e.text)&&t.kind===`Identifier`&&T(`==`,2)},_t=[],vt=()=>_t[_t.length-1]??-1,yt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),bt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},xt=e=>!e.text.endsWith(`.`)&&!BS.has(bt(e)),St=e=>{let t=bt(e);if(BS.has(t))return;let n=yt(e);if(n>=0)return`<${n}>${t}`;let r=vt(),i=_t[_t.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Ct=e=>{if(e.kind===`Keyword`)return LS.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return _t.length===0;if(e.text[1]===`+`||_t.length===0)return!0;let t=vt();return t>=0&&yt(e)>t},wt=e=>{let t=yt(e),n=_t.length-1,r=_t[n-1]??-1,i=_t[n]<0;return i&&(_t[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:_t[n]===t},Tt=()=>{let e=C();return e.kind===`Step`?xt(e):e.kind===`Keyword`?YS.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!gt()},Et=()=>{let e=o,t=C();return t.kind===`Operator`&&!jS.has(t.text)&&rC(t.text)?(o++,S({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:v(t)},e)):D(`MODULE`)?S({kind:`ModuleFact`,name:k(),location:v(t)},e):N()},Dt=()=>{let e=o,t=C(),n=A(()=>{let e=C();if((e.kind!==`Identifier`||ae(e))&&e.kind!==`Operator`)throw le(`Expected a definition name but found ${ie(e)}`,e);return o++,e.text},`!`),r=v(t);return S(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Ot=()=>A(i?Dt:Et),kt=()=>{let e=ue(N);if(!e)return[];let t=[e];return fe(()=>{for(;T(`,`);){let e=ue(()=>(E(),N()));if(!e)return;t.push(e)}}),t},At=()=>{let e=i?kt():Tt()?A(Et):[],t=D(`DEF`)||D(`DEFS`);if(i&&e.length===0&&!t)throw le(`Expected a fact`);return{facts:e,defs:t?Ot():[]}},jt=()=>{let e=o,t=E(),n=t.text===`USE`&&D(`ONLY`),r=x(e);return S({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...At(),keyword:r,location:v(t)},e)},Mt=()=>{let e=o,t=v(C()),n=D(`NEW`),r=i?o:e,a=i?v(C()):t,s=C().kind===`Keyword`?XS.get(C().text):void 0;if(!n&&s===void 0)throw le(`Expected a declaration but found ${ie(C())}`);if(s!==void 0&&E(),s===`Variable`){let e=me();return S({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=dt(),l=(s??`Constant`)===`Constant`&&T(`\\in`);if(l&&c.arity>0)throw se(`declared symbol with arguments before \\in`);return l&&E(),S({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?N():void 0,nameRange:c.location.range,location:a},r)},Nt=()=>{if(C().kind===`Identifier`&&T(`::`,1)&&T(`ASSUME`,2)&&(E(),E()),T(`ASSUME`))return Ft();if(C().kind===`Keyword`&&ZS.has(C().text))return i?de(Mt):Mt();if(!i)return N();let e=ue(N);if(e===void 0)throw le(`Expected a hypothesis`);return e},Pt=()=>{let e=[Nt()];return fe(()=>{for(;;){let t=ue(()=>(O(`,`),Nt()));if(t===void 0)break;e.push(t)}}),e},Ft=()=>{let e=o,t=v(O(`ASSUME`)),n=()=>{let n=i?Pt():A(Nt);return O(`PROVE`),S({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)};return i?de(n):n()},It=e=>{let t=0;for(;C(t).kind===`Identifier`&&T(`,`,t+1);)t+=2;return C(t).kind===`Identifier`&&T(e,t+1)},Lt=()=>{let e=C();if(T(`USE`)||T(`HIDE`))return jt();if(!i&&T(`INSTANCE`)){let t=o;return S(ut(void 0,[],!1,v(e)),t)}if(T(`DEFINE`)||gt()){let t=o;D(`DEFINE`);let n=[st(!1)];for(;gt();)n.push(st(!1));let r={kind:`Define`,definitions:n,location:v(e)};return S(r,t)}if(D(`HAVE`))return{kind:`Have`,expression:N()};if(D(`TAKE`)){let e=be(),t=he(e?[]:A(me)),n=e?Ce():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(D(`WITNESS`))return{kind:`Witness`,expressions:A(()=>N())};if(D(`PICK`)){let e=It(`:`),t=he(e?A(me):[]),n=e?[]:Ce();return O(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:N()}}return D(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:D(`SUFFICES`),statement:T(`ASSUME`)?Ft():N()}},Rt=e=>{let t=C();if(t.kind!==`Step`)throw le(`Expected a step number but found ${ie(t)}`,t);if(!wt(t))throw se(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&yt(t)<0&&St(t)!==void 0)throw se(`<*> and <+> cannot be used for a named step`,t);return o++,{name:St(t),token:t.text,location:v(t)}},zt=()=>{let e=o,t=Rt(T(`QED`,1)),n=o,r=D(`QED`)?{kind:`Qed`}:Lt(),i=x(e),a=x(n),s=Ct(C());if(s&&!RS.has(r.kind))throw se(`Proof of a step that does not take a proof`);let c=s?Ht():void 0;return S({...t,body:r,head:i,statement:a,proof:c},e)},Bt=e=>{if(D(`BY`)){let t=x(o-1);return{kind:`By`,isOnly:D(`ONLY`),...At(),keyword:t,location:e}}let t=C();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;E();let n=x(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=v(C());D(`PROOF`);let t=Bt(e);if(t)return t;let n=[zt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(zt());return{kind:`Steps`,level:vt(),steps:n,location:e}},Ht=()=>{let e=o;_t.push(-1);let t=Vt();return _t.pop(),S(t,e)},Ut=()=>C().kind===`Step`||C().kind===`Keyword`&&LS.has(C().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return WS(e);let n=t.defs[t.defs.length-1]?.location.range;return US(WS({...e,end:e.start}),WS(n??t.keyword))},Gt=()=>{let e=o,t=v(C()),n=D(`PROOF`),r=Bt(t);if(r){let t=S(r,e);return{kind:`Leaf`,proof:t,span:WS(t.keyword),first:e,end:o-1}}let i=C();if(i.kind!==`Step`)throw le(`Expected a step number but found ${ie(i)}`);let a=o;E();let s=o,c=D(`QED`)?{kind:`Qed`}:Lt(),l=x(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:x(s),span:Wt(l,c),first:e,start:a,end:o-1}},Kt=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=qt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...v(a[i.first]),range:x(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},qt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw JS(`Unexpected end of (sub)proof at level ${n} before QED step`,r,qS);if(a.kind===`Leaf`)throw JS(`Expecting a proof step but found a${VS[a.proof.kind]} leaf proof`,a.span,qS);if(!i&&a.isProof)throw JS(`PROOF keyword found in step that does not begin subproof`,a.span,KS);let o=a.token.text[1];if(o===`+`&&!i)throw JS(`<+> used but no subproof expected`,a.span,KS);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:yt(a.token);if(s<n||!i&&s>n)return;let c=RS.has(a.body.kind)?Kt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:St(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...v(a.token),range:x(a.start,l)}},d=US(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=qt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:US(d,f.span)}},Jt=()=>{if(!Ut())return;let e=[];for(;Ut();)e.push(Gt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Kt(e,0,0,t.span),r=e[n.next];if(r)throw JS(`extra step(s) after finished proof`,r.span,GS,`Proof.Parser.toplevel`);return n.proof},Yt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Xt=()=>{if(C().kind!==`Identifier`||!T(`==`,1))return;let e=k();return E(),e},Zt=()=>{if(!i)return N();let e=ne(),t=ue(N);if(t)return t;throw le(`Expected "====" but found ${ie(e)}`,e)},Qt=e=>{let t=o,n=E(),r=Xt(),a=T(`ASSUME`)?Ft():Zt(),s=i?Jt():Ct(C())?Ht():void 0,c=S({name:r,statement:a,proof:s,location:v(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&a.kind!==`AssumeProve`&&Yt(e,r,a,c.location)},$t=()=>{let e=o,t=E(),n=Xt();return S({name:n,expression:N(),isAxiom:t.text===`AXIOM`,location:v(t)},e)},en=()=>{let e=v(O(`----`));O(`MODULE`);let t=ve();O(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),d.push(/* @__PURE__ */ new Set),D(`EXTENDS`)&&A(()=>{let e=o;n.extends.push(ve()),n.extendsRanges.push(x(e))});;){let t=o,r=C();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),d.pop(),n;if(r.kind===`Separator`){if(T(`MODULE`,1)){let e=en();n.modules.push(e),n.units.push({kind:`Module`,module:e}),O(`====`);continue}E()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=v(E()),r=pt();n.constants.push(...r),e.range=x(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=v(E()),r=A(()=>{let e=o,t=v(C());return S({name:k(),arity:0,location:t},e)});n.variables.push(...r),e.range=x(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=$t();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Yt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(T(`USE`)&&T(`ONLY`,1))throw le(`Expected a module unit but found ${ie(r)}`);let e=jt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=v(E()),r=mt();e.range=x(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:tn(n,S(ut(void 0,[],!1,v(r)),t));continue;case`LOCAL`:if(E(),T(`INSTANCE`)){tn(n,S(ut(void 0,[],!0,v(r)),t));continue}tn(n,S(lt(!0),t));continue}r.kind===`Keyword`&&IS.has(r.text)?Qt(n):tn(n,st(!1))}}},tn=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},nn=en(),rn=_e?vS(t):void 0;if(rn!==void 0)throw new e.I(rn);return nn},sC=e=>oC(e,`tlc`),cC=(e,t)=>oC(e,`tlc`,t),lC=e=>oC(e,`tlapm`),uC=e=>oC(e,`sany`),dC=/* @__PURE__ */ new WeakMap,fC=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&dC.set(n,e.arity)}),pC=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},mC=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),hC=(t,n)=>new e.I(`${t} at line ${n.line}, column ${n.column}`),gC=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return gC(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ze(e)){let e=gC(r,t,n);if(e)return e}},_C=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),vC=(e,t)=>{let n=e.location,r=_C(t,e.lets,n);if(e.params.length===0&&r!==t)return r;if(e.params.length===0){let e={...t};return Ks.set(e,Ks.get(t)??t),e}if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw hC(`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 hC(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:zs,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:zs,args:e.args,location:n,resolution:Rs},location:n}},yC=(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:Rs})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Rs}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Rs};return vC({...t,params:[...t.params,...r]},a)},bC=(t,n,r,i,a)=>{let o=i.location,s={params:[],args:[],lets:[],location:o},c=0,l,u=!1,d=[],f=[],p,m=(t,n)=>{!p&&t&&(p={location:e.Z(t),message:n})},h=(t,n,r=!1)=>{let a=i.selectorRanges?.[c];t&&a&&d.push({node:t,error:{location:e.Z(a),message:n},isEmpty:r})},g=(t,n)=>{if(!t)throw hC(n,o);Vs.set(i,{applications:f,nulls:d,error:{location:e.Z(t),message:n}}),u=!0},_=e=>{let r=[],i=[];for(;c<t.length;){let a=t[c];if(a.kind!==`Name`&&!e)return;if(a.kind!==`Name`)throw hC(`Expected an operator name`,o);r.push(a.name),i.push(...a.args);let s=r.join(`!`),l=e?e.find(e=>Pl(e)===s):n(s);if(l)return{definition:l,name:s,args:i,earlier:i.length-a.args.length};c++}throw hC(`Unknown operator ${r.join(`!`)}`,o)},v=e=>{let n=_(e);if(!n){u=!0;return}let r=n.definition,d=dC.get(r)??nc(r),p=c===t.length-1;if(n.args.length!==d){let e=i.argumentRanges?.[c]??o.range,t=`The operator ${Ms(n.name)} requires ${d-n.earlier} arguments.`;if(!a||n.args.length!==0)return g(e,t);m(e,t)}if(n.args.forEach((e,t)=>Ws.set(e,{operator:n.name,index:t,range:i.selectorRanges?.[c]})),p)return{definition:r,args:n.args};let h=r.location.range,v=dC.has(r)&&h?.module===o.range?.module&&ec(o,r.location);if(f.push({operator:n.name,range:i.selectorRanges?.[c],args:n.args,params:v?Array(d).fill(0):rc(r)}),r.isRecursive&&h&&h.module===o.range?.module&&ec(o,h.end))return g(i.selectorRanges?.[c],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(r.kind!==`Operator`)throw hC(`Cannot select a subexpression of ${r.name}`,o);s.params.push(...r.params),s.args.push(...n.args),l=r.body,c++},y=()=>{for(;c<t.length&&!u;){let e=t[c];if(e.kind!==`Name`)return;let n=i.selectorRanges?.[c],r=l&&gC(l,e.name,[]);if(!r)return g(n,`Cannot find label \`${e.name}'.`);let o=r.label.params;if(e.args.length!==o.length){let t=`Label \`${e.name}' used with wrong number of arguments.`;if(!a)return g(n,t);m(n,t)}s.lets.push(...r.lets),s.params.push(...o.map(e=>({name:e,arity:0}))),s.args.push(...e.args),f.push(mC(e.name,n,e.args)),l=r.label.body,c++}},b=e=>{if(!l)throw hC(`Subexpression selection failed`,o);if(e.kind===`Colon`)return;let a=i.selectorRanges?.[c],u=l.location.range;if((l.kind===`Subexpression`||l.kind===`Identifier`&&l.name.includes(`!`)||l.kind===`Apply`&&l.operator.includes(`!`))&&(u?.module!==o.range?.module||ec(l.location,o))){let t=Vs.has(l)?l:CC(l,n,r),i=`Choosing operand \`${pC(e)}' of subexpression with no operands.`;if(Vs.has(t)){g(a,i);return}Bs.has(t)&&t.kind!==`Lambda`&&(h(t,i,!0),l=t.kind===`Let`&&t.body.kind===`Apply`&&t.body.operator===`$subexpression`?t.body:{kind:`Tuple`,elements:[t],location:t.location})}if(l.kind===`Label`){l=l.body,b(e);return}let d=`Nonexistent operand specified by \`${pC(e)}'.`;if(l.kind===`Let`){if(e.kind!==`Operand`||Oc(e.operand,1)!==0){g(a,`A LET/IN expression has only one operand.`);return}s.lets.push(l.definitions),l=l.body;return}let p=Mc(l);if(p&&(e.kind===`Bound`||e.kind===`At`)){if(e.kind===`Bound`&&e.args.length!==p.names.length){g(a,`Selector with ${e.args.length} argument(s) used for quantifier with ${p.names.length} bound identifier(s).`);return}s.params.push(...p.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&(s.args.push(...e.args),f.push(mC(``,a,e.args))),l=p.body;return}if(l.kind===`Case`){let n=[...l.arms,...l.other?[{condition:void 0,body:l.other}]:[]];if(c===t.length-1){g(a,`Subexpression of CASE must have form !i!j.`);return}let r=e.kind===`Operand`?n[Oc(e.operand,n.length)]:void 0;if(!r){g(a,d);return}c++;let o=t[c],s=o.kind===`Operand`?Oc(o.operand,2):-1,u=i.selectorRanges?.[c];if(s===-1){g(u,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=s===0?r.condition:r.body;if(!f){g(u,`Selecting OTHER in a CASE statement.`);return}l=f;return}if(l.kind===`Except`&&e.kind===`Operand`&&Oc(e.operand,l.updates.length+1)>0){g(a,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let m=p?p.sets:Nc(l);if(!m&&l.kind!==`Identifier`){g(a,`Selecting subexpression of expression that has none.`);return}if(e.kind!==`Operand`){g(a,d);return}let _=m?.[Oc(e.operand,m.length)];_?l=_:g(a,d)},ee=v(void 0);if(u)return i;if(ee)return yC(ee.definition,{...s,args:ee.args});for(y();c<t.length&&!u;){let e=t[c];if(e.kind===`Name`){for(;l?.kind===`Label`;)l=l.body;if(l?.kind!==`Let`)return g(i.selectorRanges?.[c-1],`A name selector here must be from a LET clause.`),i;s.lets.push(l.definitions);let e=v(l.definitions);if(u)return i;if(e)return yC(e.definition,{...s,args:[...s.args,...e.args]});y()}else e.kind!==`Colon`&&(h(l,`Subexpression selection failed, probably due to an error in the selected expression.`),h(l,`Choosing operand \`${pC(e)}' of subexpression with no operands.`,!0)),b(e),h(l,`An unexpected null node specified by '${pC(t[c])}'.\nThis is probably due to a previous error.`),c++}if(u)return i;if(!l)throw hC(`Subexpression selection failed`,o);let te=s.params.length,x=s.args.length;if(te!==x){let e=`Expected ${te} arguments but found ${x}.`;if(!a||x>0)return g(o.range,e),i;m(o.range,e)}let S=vC(s,l);return Gs.set(S,d),p&&Hs.set(S,p),S},xC=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return kc(e,t,n)},SC=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ze(e).some(SC),CC=(e,t,n,r=!1)=>{if(!SC(e))return e;if(e.kind===`Let`){e.recursive&&fC(e.recursive,e.definitions);let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=t=>!e.definitions.some(e=>e.name===t)&&n(t),a=Ll(e,e=>CC(e,r,i));return a.kind===`Let`&&a.instances?{...a,instances:a.instances.map(e=>wC(e,r,i))}:a}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>CC(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Ll(e,e=>CC(e,t,n)),o=ze(e),s=ze(a).every((e,t)=>e===o[t])?e:a,c=s.kind===`Subexpression`?s.selectors:s.kind===`Identifier`?xC(s.name,[],void 0,t):s.kind===`Apply`?xC(s.operator,s.args,s.argumentCounts,t):void 0,l=c?.[0];if(!c)return s;let u=c.findIndex(e=>e.kind!==`Name`),d=c.slice(0,u===-1?c.length:u),f=d.some((e,n)=>n>0&&t(d.slice(0,n+1).map(pC).join(`!`)));if(l?.kind===`Name`&&n(l.name)&&!f||l?.kind===`Name`&&c[1].kind!==`Name`&&!t(l.name))return s;let p=bC(c,t,n,s,r);return p!==s&&Bs.add(p),p},wC=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:CC(e.expression,t,n,!0)}))}),TC=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},EC=(e,t)=>wC(e,TC(t.definitions),()=>!1),DC=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]);fC(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return ec(e.location,t)||e.isRecursive&&n!==void 0&&ec(n,t)},s=(e,t)=>n=>{let r=e(n);return r&&(!i.has(r)||o(r,t))?r:void 0},c=TC([...t,...e.definitions]),l=e=>n.has(e),u=TC([...t,...e.definitions,...r]),d=(e,t)=>CC(e,s(u,t),e=>l(e)&&r.every(t=>t.name!==e)),f=e=>{let t=t=>l(t)||!e(t),n=n=>CC(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return Us.set(t,e),t},i=e=>e.map(e=>({...e,set:n(e.set)})),a=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:a(e)),conclusion:n(e.conclusion)}:n(e),o=o=>{switch(o.kind){case`Use`:case`Hide`:return{...o,facts:r(o.facts)};case`Instance`:return wC(o,e,t);case`Define`:return{...o,definitions:o.definitions.map(r=>r.kind===`Instance`?wC(r,e,t):Il(r,n))};case`Have`:case`Case`:return{...o,expression:n(o.expression)};case`Witness`:return{...o,expressions:o.expressions.map(n)};case`Take`:return{...o,bounds:i(o.bounds)};case`Pick`:return{...o,bounds:i(o.bounds),body:n(o.body)};case`Assert`:return{...o,statement:a(o.statement)};default:return o}},s=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:o,resolveProof:s};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(e.body.kind===`Define`){let t=e.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=f(e=>t.find(t=>t.name===e)??r(e))}return t})}};return{lookup:e,resolveFacts:r,resolveStatement:a,resolveStep:o,resolveProof:s}},p={...e,theorems:e.theorems.map(e=>{let t=f(s(c,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&f(s(c,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>({...e,facts:f(s(c,e.location)).resolveFacts(e.facts)}))};return e.definitions.some(e=>SC(e.body))||e.assumptions.some(e=>SC(e.expression))?{...p,definitions:e.definitions.map(e=>Il(e,t=>d(t,e.location))),assumptions:e.assumptions.map(e=>({...e,expression:d(e.expression,e.location)}))}:p},OC=(e,t)=>e.maxLevels[t]??3,kC=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=md({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Su(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Su(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Cu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=yu(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)&&Su(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(hd(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.Z(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;if(r)for(let t=0;t<e.arity;t++){let i=l.argConstraints.get(_u(e.name,t));i!==void 0&&OC(r,t)<i&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${t+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let t=yu(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=OC(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.J([...i.values()])}},AC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],jC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),MC=new Map(As.flatMap(e=>e.map(t=>[t,e[0]]))),NC=e=>MC.get(e)??e,PC=()=>{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}}},FC=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Ve(e)&2147483647,kind:t,isLocal:n}),IC=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:NC(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:NC(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}},LC=(e,t)=>{let n=[];for(let r=t;;){let t=IC(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},RC=e=>({line:e.line,column:e.column}),zC=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=LC(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},BC=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,VC={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},HC=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&BC(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&BC(e[n+1],e[n+2])?n+=BC(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=>VC[e])}"`:r.text)}return t},UC=e=>e[2]?.text,WC=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},GC=(e,t)=>e.find(e=>e.name===t)??e.map(e=>GC(e.modules,t)).find(Boolean),KC=e=>{let t=e===void 0?[]:re(e),n;return{tokens:t,ranges:WC(t),getModule:()=>n??=e===void 0?sC(``):cC(e,t)}},qC=(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=KC(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??Is.get(i)??Ip.get(i)??aC(e,i),c=a(s),l=c.tokens,u=c.ranges.get(UC(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>GC(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},JC=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=LC(t,e+1);i.push({location:RC(t[e]),apply:e=>r.forEach(t=>e.put(FC(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:RC(n),apply:t=>t.put(FC(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&LC(t,u+1).every(e=>s.has(e))&&o(u,`definition`),jC.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(RC(n)),i.push({location:RC(n),apply:e=>e.put(FC(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(FC(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=NC(e.name);i.push({location:e.location,apply:n=>n.put(FC(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(FC(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(FC(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>ec(e.location,t.location)?-1:+!!ec(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=PC();n.set(i??``,o),ks.toReversed().forEach(e=>o.put(FC(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},YC=(t,n,r)=>{let i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};n.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Ns.forEach(a);let s=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=zC(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;HC(s(void 0)).forEach((e,t)=>{t===3&&Fs.forEach(a),a(e)});let b=u(void 0);for(;;){let n=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!n)break;let[r,i]=n;if(f.add(`${r.key}>${i}`),y.set(r.unit,[...y.get(r.unit)??[],i]),!v.has(i)){if(v.add(i),t(i).tokens.length===0){let n=r.unit??UC(t(void 0).tokens);throw e.q(i,n)}HC(s(i)).forEach(a)}}AC.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),r.forEach(e=>{let t=s(e);HC(t).forEach(a),t.forEach(e=>{e.kind===`String`&&a(e.text)})}),Ps.forEach(a),[...i]},XC=(e,t)=>{let n=qC(e,t),r=n.getParsed,i,a=()=>i??=JC(r);return{getStringOrder:(e,t)=>YC(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},ZC=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),QC=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],$C=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.I))throw r;let i=vS(t);throw i===void 0?r:e.J([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},ew=t=>new e.I(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),tw=(t,n)=>t.location.range&&n.location.range&&{location:e.Z(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.Z(n.location.range)}.`},nw=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,rw=e=>e===`Theorem`?`ThmOrAssumpDefNode`:nw(e),iw=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:tu(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),aw=(e,t)=>{let n=Be(e);return n!==void 0&&t.has(n)||ze(e).some(e=>aw(e,t))},ow=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Xl(e),n.get(e)??n.size)),n},sw=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),cw=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw wg(e);if(e.kind===`Number`&&!Bt(e.value))throw Tg(e);cw(e.kind===`Let`?[...ze(e),...sw(e.instances??[])]:ze(e))}),lw=(t,n)=>{let r=n.order??XC(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(qp.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=lp(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`,f.readLine=n.readLine;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,ee=e=>`${e}#${b++}`,te=[],x=[],S=kC(e=>{let t=m.get(e)??ce(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)}}),ne=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,C=/* @__PURE__ */ new Map,ie=e=>{let t=d.get(e);if(t)return t;let r=hm(e,n.print,f,n.files,u);if(!r)return;pm.get(e)?.forEach(ie);let i=/* @__PURE__ */ new Map;return mm.get(e)?.forEach(e=>ie(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:mu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:gu(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},ae=e=>{let t=pm.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=ie(e);return r&&y(e,t),r&&t.includes(`Integers`)&&ie(`Integers`),r},w=e=>(cw([...e.definitions.flatMap(Re),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...sw(e.instances)]),e.modules.forEach(w),e);w(i);let oe=(t,i)=>{let a=n.loadModule?.(t)??Rp(f.version).get(t)??aC(n.source,t);if(a===void 0)throw e.q(t,i);let o=$C(a,t,r);if(o.name!==t)throw e.J([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return w(o)},se=t=>{let n=v.indexOf(t.name);if(n!==-1){let r=[...v.slice(n),t.name].map(e=>`${e}.tla`);throw new e.I(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];v.push(t.name),_.push(r);let s=O(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:x,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.J(a,!1,void 0,x);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&tw(c,l.module);if(u)throw e.J([u],!1,void 0,x);if(c)throw ew(c);return o.forEach(e=>e()),{linked:s,closure:r}},ce=(t,r)=>{let i=p.get(t);if(i)return y(t,g.get(t)??[]),i;let o=se(oe(t,r)),s=/* @__PURE__ */ new Map;return fm(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.x(`No definition of ${t} to fall back to`);return W(i.body,{environment:r.environment,scope:j_(__(i),a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&ZC.has(t))return;let r=a.get(n.key);r&&s.set(e.name,r),u.set(n.key,e),a.delete(n.key)}),p.set(t,o.linked),g.set(t,o.closure),y(t,o.closure),o.linked},le=(e,t,n,r,i)=>{let u=i?void 0:ae(e.module);if(u)return ue(e,u);let d=i??ce(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=QC(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Tl(EC(e,t),f,t,n);te.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>l.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=lu({params:g,substitutions:new Map([...h].map(e=>[e[0],jl(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ee(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&re.set(u,`${e.name}!${re.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ee,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return de(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ne.set(r,{name:n,location:e.location}),e.name!==void 0&&C.set(r,n),r})},ue=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),de=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(e=>!i.has(e[0])).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:o.get(t[1].key)===!0?e.location.range:t[1].range}];let n=`${e.name}!${t[0]}`;return[n,{key:r(t[1].key,n),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind}]}))},fe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),pe=(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=fe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:nu(r,n),location:n}}},T=(e,t,n,r)=>{let i=e.location,s=r?void 0:ae(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=fe(t[1].arity,t[1].params);return ru(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,i)});let c=r??ce(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=QC(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};te.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=>aw(f(e),p),h=d.map(t=>{let n=pe(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=[],_=lu({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:nu(e.params,i),location:i,resolution:Rs}:tu(`${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}:iw(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])).map(t=>{let n=_.getKey(t[1].key),r=fe(t[1].arity,t[1].params),a=[...e.params,...r];return ru(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,a,n===t[1].key?r:a,i)});return[...h,...g,...y]},E=e=>[...e].flatMap(e=>{let t=a.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),D=/* @__PURE__ */ new Map,O=(t,r)=>{let s=Zb(t,n.loadClass?.(t.name),t===i);D.set(t.name,s.overrides);let c=s.module,l=te.length,u=new Map([...qp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:bl,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=_.get(n);if(!r){u.set(n,t),_.set(n,t);return}if(!r.range||!t.range||e.Z(r.range)===e.Z(t.range))return;let i=e.Z(t.range),a=e.Z(r.range);rw(r.kind)===rw(t.kind)?f.warnings.push({location:i,message:`Warning: the ${nw(r.kind)} of '${n}' conflicts with \nits ${nw(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${nw(t.kind)} of '${n}' conflicts with \nits ${nw(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,b=[],ee=[...c.constants],ne=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),re=ne.map(e=>e.name),ie=ne.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:ae(e);if(n){g(n);return}let i=t??ce(e,c.name);ee.push(...i.constants.filter(e=>ee.every(t=>t.name!==e.name)&&!re.includes(e.name))),i.variables.forEach((e,t)=>{re.includes(e)||ee.some(t=>t.name===e)||(re.push(e),ie.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>v.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),b.push(i)});let w=new Map(u),oe=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],se=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});oe.forEach(e=>_.set(e.name,se(e)));let fe=e=>({key:k(e),arity:nc(e),params:rc(e),kind:xl(c,e)?`Theorem`:`Definition`,range:e.location.range}),pe=ee.length===0&&re.length===0,k=e=>c===i?e.name:`${e.name}@${r.id}`,me=/* @__PURE__ */ new Map,he=()=>new Map([...r.modules,...y]),ge=e=>{let t=c.modules.find(t=>t.name===e.module);return t?ec(t.location,e.location)?y.get(t.name):void 0:he().get(e.module)},_e=e=>({imported:u,getInstance:e=>{let t=ge(e),n=t?void 0:ae(e.module);if(n)return{declarations:[],symbols:ue(e,n),instancer:c.name};let r=t??ce(e.module,c.name),i=QC(r);return{declarations:i,symbols:de(e,r.exported,i,e=>e),instancer:c.name}},bound:w,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:k,instanced:me,facts:v,reports:p,warnings:r.warnings}),ve=e=>[...oe.filter(t=>ec(t.location,e)).map(e=>[e.name,se(e)]),...c.definitions.filter(t=>ec(t.location,e)).map(e=>[e.name,fe(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(u)),ye=e=>{let t=he(),n=t.get(e.name),i=n&&tw(e,n.module);if(n&&!i)throw ew(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=O(e,{id:`${r.id}/${e.name}`,symbols:ve(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=le(e,c,_e(c),pe,he().get(e.module));me.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>ec(e.location,t.location)?-1:1).forEach(e=>e.link());let A=DC(pu(c,(e,t)=>T(e,t,c.name,ge(e))),E(u));r.errors.push(...Dl(A,_e(A))),A.definitions.forEach(e=>{let t=k(e);a.set(t,e),o.set(t,!pe);let n=fe(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ec(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let be={module:A,constants:ee,variables:re,variableLocations:ie,visible:u,exported:_,modules:y,extended:b,facts:/* @__PURE__ */ new Set([...v,...[...A.theorems,...A.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,be);let xe=te.splice(l).map(e=>({location:e.location,check:()=>S(e)}));return r.levelChecks.push(()=>gd(A,{constants:new Set(ee.map(e=>e.name)),variables:new Set(re),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>C.get(u.get(e)?.key??e)},xe,x)),h.push(be),be},k=se(i).linked,me=n.traceFile,he=me===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:me}}],ge=[...n.moduleOperators??[],...he].map(e=>{let t=ce(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(k),1)),x.length>0&&!n.isSanyReported&&n.print(e.Q(x));let _e=n.runtimeInvariants??[];_e.forEach(e=>{if(e.module===void 0)return;p.set(i.name,k);let t=ce(e.module,i.name);h.splice(h.indexOf(t),1);let n=a.get(t.visible.get(e.name)?.key??e.name);n&&a.set(e.name,n)}),k.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),ge.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let ve=[],ye=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ye(e,t)),ve.push(...e.module.assumptions))};ye(k,/* @__PURE__ */ new Set);let A=k.constants.map(e=>e.name),be=k.variables,xe=Rb(t,{root:k,moduleSymbols:new Map([...d,...[...p].map(e=>[e[0],e[1].visible]),[i.name,k.visible]]),definitions:a,builtins:u,copySources:s,operatorConstants:new Map(ge.flatMap(e=>ce(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),Se=xe.constants,Ce=xe.substitutions;me!==void 0&&u.forEach((e,t)=>{let n=Qp(e);n&&u.set(t,n)});let we=ow(be,h.flatMap(e=>e.module.variables.map(e=>e.name))),Te=kd({definitions:a,substitutions:Ce,constants:Se,variableIndex:we,builtins:u,variables:be}),Ee={runtime:f,definitions:a,builtins:u,constants:Se,substitutions:Ce,instanceNames:re,variables:be,variableIndex:we,facts:Te,startupValues:Array.from({length:Te.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},De=md({constants:new Set(Se.keys()),variables:/* @__PURE__ */ new Set([...be,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>zg(e,Ee)}),Oe=t=>{try{W(t,{environment:Ee,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.x)return t;throw t}};Ce.forEach((t,n)=>{let r=a.get(t),i=A.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&De.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Oe(r.body):void 0;if(i){let r=at(i)?``:` - specifically: ${i.message}`;throw new e.v(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let ke=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),Ae=r.createDefinitionOrder();return{environment:Ee,assumptions:ve,variableLocations:k.variableLocations,instanceActions:ne,startupDefinitions:h.filter(e=>!ke.has(e.module.name)||QC(e).length===0).flatMap(e=>Ae(e===k?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>D.get(e.module.name)??[]),moduleOperators:ge,runtimeInvariants:_e,rootName:i.name}},uw=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),dw=(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},fw=t=>e.ot(new e.x(`${e.K}${t}`),e.rt.error),pw=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Lt(e)||!Lt(i))throw fw(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},mw=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${hw(t)}`:n},hw=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(hw).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${mw(e.pattern,e.set)}:${hw(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(hw).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${hw(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>mw(e.pattern,e.set)).join(`,`)}|->${hw(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(hw);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},gw=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,_w=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.v(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw fw(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>W(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!Pt(o)||!P(o))throw fw(`The symmetry operator must specify a set of functions.`);let s=F(o).elements;if(!s.every(It))throw fw(`The symmetry values must be function records.`);let c=i.body,l=c.kind===`Apply`?c.args:c.kind===`SetEnumeration`?c.elements:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=hw(gw(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Ye.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;s.map(pw).forEach(e=>{e.size>0&&f.set(uw(e),e)});let p=[...f.values()],m=0;for(;m<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m,t).forEach(e=>{let t=dw(n,e),r=uw(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!gw(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>Lt(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},vw=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=bw(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(bw(e[r],t));return a}},yw=(e,t)=>{let n=[],r=[];for(let i of e){let e=bw(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Cn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Cn(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},bw=(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=yw(e.elements,t);return n?On(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=vw(n.domain,t),i=vw(n.range,t)??n.range;if(r){let e=Tr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?An(n.domain,e.range):e}return i===n.range?n:An(n.domain,i)}if(n===`Interval`||!Pt(e)||!P(e))return e;let r=F(e),i=vw(r.elements,t);return i?yr(i):r},xw=(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]=bw(e[o],i),a===0&&(a=Cn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Sw={line:0,column:0},Cw=e=>({kind:`Identifier`,name:e,location:Sw}),ww=e=>({name:e,expression:Cw(e),scope:void 0}),Tw=/* @__PURE__ */ new Set([`name`,`property`]),Ew=(t,n,r)=>{let i=zg(n,r);if(!i)throw new e.v(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.v(Tw.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},Dw=e=>e.body.kind===`Number`||e.body.kind===`String`,Ow=(e,t,n)=>n.constants.has(e)?n.constants.get(e):Dw(t)?void 0:p_(t,n),kw=(t,n,r)=>{if(r.constants.has(n))throw new e.v(`The ${t} ${n} cannot be a constant.`);let i=Ew(t,n,r);if(Ow(n,i,r)!==void 0)throw new e.v(`The ${t} ${n} cannot be a constant.`);return i},Aw=(t,n,r)=>{let i=r.constants.has(n)?void 0:Ew(t,n,r),a=i?Ow(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.v(`The ${t} of ${n} is equal to ${L(a)}`);return a===void 0?i:void 0},jw=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Mw=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),m_(e.startupDefinitions,r),t.invariants.forEach(e=>{Aw(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Nw=(t,n)=>{let r=md({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=Aw(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1787
+ `},$S=(t,n,r,i=`Proof.Parser`)=>new e.I(t,void 0,{reason:`${t}${r.set}`,line:n.start.line,column:n.start.column,isEnd:!1,proof:{stop:n.stop,exception:i,printed:`${t}${r.printed}`}}),eC=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),tC=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),nC=/* @__PURE__ */ new Set([`NEW`,...tC.keys()]),rC=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),iC=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),aC=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),oC=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?ES.has(e.operator):MS.has(e.operator)),sC=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,cC=e=>ES.has(e)||MS.has(e)||e===`-.`,lC=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},uC=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
1788
+ `)}\n`},dC=(t,n,r=re(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(ee),o=0,s=[],l,u,d=[],f=[],p,m=0,h=[],g=/* @__PURE__ */ new WeakMap,_=e=>d[d.length-1].has(e),v=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),y=[],b=[],te=[],x=(e,t=o-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];y[e]??=v(a[e]),b[t]??={line:r.line,column:r.endColumn};let i={module:f[0].name,start:y[e],end:b[t]};return e===t&&(te[e]=i),i},S=(e,t)=>(e.location.range=x(t),e),ne=(e=0)=>a[Math.min(o+e,a.length-1)],C=(e=0)=>{let t=ne(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ie=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ae=e=>i&&(e.kind===`Keyword`||aC.has(e.text)),w=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:WS.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ae(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,se=(t,n=ne(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column,s=new e.I(`${t} at line ${n.line}, column ${n.column}`,void 0,ce(t,n,o,r));return p!==void 0&&g.set(s,p),s},ce=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[h[0]-1],s=r?`Unexpected ${oe(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?w(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},le=(e,t=ne())=>se(e,t,t),ue=t=>{let n={cursor:o,frame:p,restorePoints:h.length,offsideColumns:s.length,recursiveScopes:d.length},r=++m;p=r;try{let e=t();return p=n.frame,e}catch(t){if(!(t instanceof e.I)||g.get(t)!==r)throw t;o=n.cursor,p=n.frame,h.length=n.restorePoints,s.length=n.offsideColumns,d.length=n.recursiveScopes;return}},de=e=>{let t=p;p=void 0;let n=e();return p=t,n},fe=e=>{h.push(o);let t=e();return h.pop(),t},pe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ae(e),T=(e,t=0)=>{let n=C(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},E=()=>{let e=C();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o++,e},D=e=>T(e)?(o++,!0):!1,O=e=>{if(!T(e))throw le(`Expected ${JSON.stringify(e)} but found ${ie(C())}`);return E()},me=()=>{let e=C();if(e.kind!==`Identifier`)throw le(`Expected an identifier but found ${ie(e)}`);if(ae(e))throw le(`Unexpected keyword ${e.text}`);return o++,e.text},he=()=>{let e=o;return{name:me(),range:x(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=C();return e.kind!==`String`&&(FS.has(e.text)||ES.has(e.text)||NS.has(e.text))?(o++,e.text):me()},ve=!1,ye=()=>C().kind===`Identifier`||!pe(C())?me():(ve=!0,E().text),be=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},k=(e,t=`,`)=>{let n=[e()];for(;D(t);)n.push(e());return n},xe=(e=0)=>{if(T(`<<`,e)){let t=e+1;for(;C(t).kind===`Identifier`||T(`,`,t);)t++;return T(`>>`,t)&&T(`\\in`,t+1)}let t=e;for(;C(t).kind===`Identifier`;){if(T(`\\in`,t+1))return!0;if(!T(`,`,t+1))return!1;t+=2}return!1},Se=()=>{if(T(`::`))return!0;if(!T(`(`))return!1;let e=1;for(;C(e).kind===`Identifier`&&T(`,`,e+1);)e+=2;return C(e).kind===`Identifier`&&T(`)`,e+1)&&T(`::`,e+2)},Ce=()=>{if(!D(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(T(`>>`)?[]:k(he));return O(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},we=()=>{let e=()=>{let e=k(Ce);O(`\\in`);let t=de(M);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;T(`,`)&&(!i||xe(1));)E(),t.push(e());return t.flat()},Te=()=>{let e=C();if(i&&aC.has(e.text)){let t=o;E();let n={kind:`Identifier`,name:e.text,location:v(e)};return{subscript:S(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||T(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(x(o,o)),n.push(me()),e&&T(`(`)?Ae():[]),s=[a(!i)];for(;T(`!`)&&C(1).kind===`Identifier`;)E(),s.push(a(!0));let c=s.slice(0,-1),l=v(e);l.range={...x(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(T(`<<`)||T(`(`)||T(`{`)||T(`[`)||t){let e=o,t=Ve();return{subscript:t.location.range?t:S(t,e),lastArgs:[]}}throw le(`Expected a subscript but found ${ie(e)}`)},Ee=e=>{let t=C(1),n=C(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&T(`==`,NS.has(n.text)?3:4))},De=e=>{let t=C(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||T(`,`,1)||T(`)`,1)||t.kind===`Keyword`&&BS.has(t.text)||Ee(e)},Oe=()=>{let e=C(),t=e.kind===`Operator`&&(ES.has(e.text)||PS.has(e.text))&&De(e);if(i&&e.kind!==`String`&&(PS.has(e.text)||RS.has(e.text)&&e.text!==`'`&&!MS.has(e.text)||LS.has(e.text)&&C(-1).text===`(`&&C(-1).line===e.line&&C(-1).endColumn+1===e.column&&C(1).text===`)`&&C(1).line===e.line&&C(1).column===e.endColumn+1)&&De(e))throw se(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw se(`\\X may not be used as an infix operator`,e);if(t)return o++,S({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:v(e)},o-1);if(e.kind!==`String`&&RS.has(e.text)&&De(e)){o++;let t=v(e);if(MS.has(e.text))return S({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return S({kind:`Lambda`,params:[n.name],body:lC(e.text,n,t),operator:e.text,location:v(e)},o-1)}if(T(`LAMBDA`)){let t=o;E();let n=ge(k(he));O(`:`);let r=M();return S({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:v(e)},t)}if(!i)return M();let n=ue(M);if(n)return n;throw le(`Unexpected ${ie(C())}`)},ke,Ae=()=>be(()=>{let e=o;O(`(`);let t=k(Oe);return O(`)`),ke=x(e),t}),je=()=>{let e=E();s.push(e.column);let t=[M()],n=()=>{for(;sC(ne())&&ne().text===e.text&&ne().column===e.column;)o++,t.push(M())};return i?de(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:v(e)}},Me=e=>be(()=>{let t=v(e),n=C().kind===`Identifier`,r=T(`|->`,1)&&(n||pe(C()));if(r||n&&T(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=v(C()),i=e();return n.range=x(t),O(r?`|->`:`:`),{name:i,value:M(),location:n}},a=[i(()=>n?me():E().text),...D(`,`)?k(()=>i(me)):[]];return O(`]`),{kind:e,fields:a,location:t}}if(xe()){let e=o,n=we();if(!i||T(`|->`)){O(`|->`);let e=M();return O(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=M();if(D(`->`)){let e=M();return O(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(D(`EXCEPT`)){let e=k(()=>{O(`!`);let e=[];for(;T(`.`)||T(`[`);)if(D(`.`)){if(!pe(C()))throw le(`Expected a field name but found ${ie(C())}`);if(!i&&T(`@`))throw le(`@ used in !.@`);e.push({kind:`Field`,name:E().text})}else O(`[`),e.push({kind:`Index`,args:k(()=>M())}),O(`]`);return O(`=`),{path:e,value:M()}});return O(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!T(`]_`)){let e=[a];for(;D(`,`);)e.push(M());return O(`]`),{kind:`Bracket`,args:e,location:t}}return O(`]_`),{kind:`BoxAction`,action:a,subscript:Te().subscript,location:t}}),Ne=()=>{let e=o,t=S(He(),e),n=v(E());return S({kind:`Apply`,operator:`\\in`,args:[t,de(M)],location:n},e)},Pe=e=>be(()=>{let t=v(e);if(D(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(xe()&&(C(1).text===`\\in`||T(`<<`))){let e=o,n=Ce();O(`\\in`);let r=de(M);if(D(`:`)){let e=de(M);return O(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=C().kind===`Identifier`&&T(`\\in`,1)?Ne():M();if(D(`:`)){let e=we();return O(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;D(`,`);)r.push(M());return O(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Fe=e=>{let t=v(e),n=be(()=>T(`>>`)||T(`>>_`)?[]:k(()=>M()));if(D(`>>_`)){if(n.length!==1)throw se(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:de(Te).subscript,location:t}}return O(`>>`),{kind:`Tuple`,elements:n,location:t}},Ie=e=>{let t=v(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&xe()){let e=we();return O(`:`),{kind:n,bounds:e,body:M(),location:t}}let i=ge(k(he));return O(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:M(),isTemporal:r,location:t}},Le=e=>{let t=[];do{let n=o;if(D(`OTHER`))return O(`->`),{kind:`Case`,arms:t,other:M(),otherRange:x(n),location:v(e)};let r=M();O(`->`),t.push({condition:r,body:M()})}while(D(`[]`));return{kind:`Case`,arms:t,other:void 0,location:v(e)}},Re=()=>{let e=C(1);return T(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||zS.has(e.text)||e.kind===`Operator`&&(ES.has(e.text)||NS.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&FS.has(e.text))},ze=()=>{let e=E();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:Ae()}}return{kind:`Name`,name:e.text,args:T(`(`)?Ae():[]}},Be=(e,t,n,r,i)=>{let a=[{kind:`Name`,name:e,args:t}],s=[x(r,r)],c=[n];for(;Re();){E();let e=o;ke=void 0;let t=ze();s.push(t.kind===`Bound`?x(e):x(e,e)),a.push(t),c.push(ke)}let l=a.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=a.flatMap(e=>`args`in e?e.args:[]),f=a.map(e=>`args`in e?e.args.length:0);return l.length<a.length?{kind:`Subexpression`,selectors:a,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??x(r),selectorRanges:s,argumentRanges:c,location:i}},Ve=e=>{let t=o,r=E(),a=v(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=k(me);return O(`:`),{kind:`Lambda`,params:e,body:M(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:c(r.text),text:r.text,location:a};if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&St(r);if(!i&&s&&yt()<0&&vt.length<=1)throw se(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw se(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?Ct(r)??r.text:r.text;if(Se()){let o=ge(D(`(`)?k(he):[]);o.names.length>0&&O(`)`),O(`::`);let s=x(t),c=M();if(!i&&e!==void 0&&l!==void 0&&oC(c)&&e.high>=l.low)throw se(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:s,body:c,location:a}}let o=T(`(`);if(n===`@`&&!o&&!Re())return{kind:`ExceptAt`,location:a};let c=o?Ae():[];return Re()?Be(n,c,o?ke:void 0,t,a):o?{kind:`Apply`,operator:n,args:c,argumentsRange:ke,location:a}:{kind:`Identifier`,name:n,location:a}}let u=r.kind===`Operator`&&(cC(r.text)||r.text===`'`&&!i);if(u&&T(`(`)){let e=Ae();return!i&&Re()?Be(r.text,e,ke,t,a):n===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:r.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,argumentsRange:ke,location:a}}if(u&&!i)return Re()?Be(r.text,[],void 0,t,a):{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=be(()=>M());return O(`)`),e}case`[`:return Me(r);case`{`:return Pe(r);case`<<`:return Fe(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ie(r);case`IF`:{let e=M();O(`THEN`);let t=M();return O(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:M(),location:a}}case`CASE`:return Le(r);case`LET`:{let e=[],t=[],n=[];for(d.push(/* @__PURE__ */ new Set);!D(`IN`);){if(i&&T(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`);if(D(`RECURSIVE`)){n.push(...ht());continue}let r=ct(!i&&D(`LOCAL`));r.kind===`Instance`?t.push(r):e.push(r)}return d.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:M(),location:a}}case`CHOOSE`:{let e=Ce(),t=D(`\\in`)?M():void 0;return O(`:`),{kind:`Choose`,pattern:e,set:t,body:M(),location:a}}case`WF_`:case`SF_`:{let e=Te(),t=!T(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:be(()=>{O(`(`);let e=M();return O(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw le(`Unexpected ${ie(r)}`,r)},A=(e,t,n)=>{l=u={low:t,high:n};let r=M(n+1),i=C(),a=NS.has(i.text)?wS.high:ES.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw se(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},He=()=>{let e=u;u=void 0;let t=C(),n=v(t);if(t.kind===`Operator`&&sC(t))return je();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return E(),{kind:`Apply`,operator:`~`,args:[A(t,4,4)],location:n};case`-`:return E(),{kind:`Apply`,operator:`-.`,args:[A(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return E(),lC(t.text,A(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return E(),{kind:`Apply`,operator:t.text,args:[A(t,10,13)],location:n}}return Ve(e)},Ue=(e,t,n,r,i)=>{let a=v(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},We=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:v(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:v(e)},Ge=()=>{E();let e=be(()=>k(()=>M()));return be(()=>O(`]`)),e},Ke=e=>{let t=o,n=He(),r=n.location.range?n:S(n,t),i;for(;;){let n=C();if(n.kind!==`Operator`)break;let a=v(n);if(NS.has(n.text)&&e<=15){E(),l=wS,r=S(We(n,r),t);continue}if(n.text===`[`){let e=Ge();l=TS,r=S({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&pe(C(1))){E();let e=E().text;r=S({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=ES.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw se(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(E(),o.low>12&&T(`-`))throw se(`Precedence conflict between ${n.text} and -`,C());l=u=o;let s=M(o.high+1),c=i?.text===n.text;r=S(Ue(n,r,s,c,x(t).end),t),i={...o,text:n.text}}return r},qe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&St(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&AS.has(e.text),Je=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:S(e,t)}),Ye=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),j=e=>e.kind===`Operator`&&NS.has(e.text)&&T(`(`,1)?ue(()=>be(()=>{E(),E();let t=M(),n=o-1;return O(`)`),{end:n,expression:We(e,t)}})):void 0,Xe=()=>{let e=0;for(let t=o+1;t<a.length;t++){let n=a[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(a[t-1].text!==`!`&&(rC.has(n.text)&&e++,iC.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>T(`(`,1)&&Xe()?ue(()=>be(()=>{E(),E();let t=M();O(`,`);let n=M();return O(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:v(e)}})):void 0,Qe=e=>{let t=o,n=C(),r=v(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?ES.get(n.text):void 0;if(!e){if(T(`[`)){let e=Ge();return Ye(t,`Postfix`,kS,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(T(`.`)&&pe(C(1))){E();let e=E().text;return Ye(t,`Postfix`,kS,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(Ze(n)){o=t;return}return E(),{...Ye(t,`Infix`,a,e=>Ue(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,x(e[0].start,e[1].end).end)),isLeft:DS(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!NS.has(n.text))return;if(j(n)){o=t;return}return E(),Ye(t,`Postfix`,wS,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&sC(n))return Je(je(),t);let s=a?Ze(n):void 0;if(s)return Je(s,t);let c=j(n);if(c)return c.expression.location.range=x(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?OS.get(n.text):void 0;if(l)return E(),Ye(t,`Prefix`,l,e=>lC(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!qe(n))return;let u=n.kind===`Operator`&&jS.has(n.text);return Je(u?Ve():de(Ve),t)},$e=e=>e!==void 0&&`fixity`in e,et=e=>e!==void 0&&!(`fixity`in e),tt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=x(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},nt=e=>{let t=e.pop(),n=e.pop();if(!et(t)||!$e(n))throw se(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(tt(n,et(r)?[r,t]:[t]))},rt=e=>{let t=e[e.length-2];return $e(t)?t:void 0},it=(e,t)=>t!==void 0&&e.high<t.low,at=()=>fe(()=>{let e=ue(()=>Qe(!0));if(e===void 0){let e=ne();throw e.kind===`End`?le(`Unexpected end of expression`,e):se(`required expressions(s) missing before '${oe(e)}'`,e)}return de(()=>{let t=[e];for(;;){let e=ue(()=>Qe($e(t[t.length-1])));if(e===void 0)break;if(et(e)||e.fixity===`Prefix`){t.push(e);continue}for(;it(e,rt(t));)nt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&et(n)){t.splice(-1,1,tt(e,[n]));continue}let r=rt(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!it(r,e)&&nt(t),t.push(e)}for(;t.length>1;)nt(t);let n=t[0];if(!et(n))throw se(`incomplete expression`);return n.expression})}),M=(e=0)=>i?at():Ke(e),ot=()=>{if(!D(`(`))return[];let e=mt();return O(`)`),e},st=()=>{let e=v(C()),t=M(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},ct=e=>{let t=o;return S(ut(e),t)},lt=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),ut=e=>{let t=C(),n=o,r=v(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:x(n,o-2),...st(),isLocal:e,isRecursive:_(t),location:r});if(t.kind===`Identifier`&&C(1).kind===`Operator`&&ES.has(C(1).text)&&C(2).kind===`Identifier`&&T(`==`,3)){let e=he(),t=E().text,n=he();return O(`==`),i(t,[lt(e),lt(n)])}let a=t.kind!==`String`&&FS.has(t.text),s=t.kind===`Identifier`&&NS.has(C(1).text)&&T(`==`,2);if(a||s){let e=a?t.text:C(1).text;a&&E();let n=he();return s&&E(),O(`==`),i(e,[lt(n)])}let c=me();if(D(`[`)){let t=be(()=>we());return O(`]`),O(`==`),{kind:`Function`,name:c,bounds:t,body:M(),isLocal:e,isRecursive:_(c),location:r}}let l=o,u=ot();return O(`==`),T(`INSTANCE`)?{...dt(c,u,e,r),definitionRange:x(l)}:i(c,u)},dt=(e,t,n,r)=>{let i=o;return O(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:D(`WITH`)?k(()=>{let e=o,t=_e(),n=x(e);return O(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:x(i)}},ft=()=>{let e=o;return S(pt(),e)},pt=()=>{let e=v(C());if(T(`_`)&&C(1).kind===`Operator`&&(ES.has(C(1).text)||NS.has(C(1).text)))return E(),{name:E().text,arity:D(`_`)?2:1,location:e};if(C().kind!==`String`&&(FS.has(C().text)||i&&C().kind===`Operator`)&&T(`_`,1)){let t=E().text;return E(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!D(`(`))return{name:t,arity:0,location:e};let n=k(()=>O(`_`));return O(`)`),{name:t,arity:n.length,location:e}},mt=()=>k(ft),ht=()=>{let e=mt();return e.forEach(e=>d[d.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=C(n);if(e.kind===`End`)return n;e.kind===`Operator`&&rC.has(e.text)&&t++,e.kind===`Operator`&&iC.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=C(),t=C(1);return e.kind===`Identifier`?T(`(`,1)||T(`[`,1)?T(`==`,gt(1)):t.kind===`Operator`&&NS.has(t.text)?T(`==`,2):t.kind===`Operator`&&ES.has(t.text)?C(2).kind===`Identifier`&&T(`==`,3):T(`==`,1):e.kind!==`String`&&FS.has(e.text)&&t.kind===`Identifier`&&T(`==`,2)},vt=[],yt=()=>vt[vt.length-1]??-1,bt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),xt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},St=e=>!e.text.endsWith(`.`)&&!GS.has(xt(e)),Ct=e=>{let t=xt(e);if(GS.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},wt=e=>{if(e.kind===`Keyword`)return HS.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},Tt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Et=()=>{let e=C();return e.kind===`Step`?St(e):e.kind===`Keyword`?eC.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},Dt=()=>{let e=o,t=C();return t.kind===`Operator`&&!IS.has(t.text)&&cC(t.text)?(o++,S({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:v(t)},e)):D(`MODULE`)?S({kind:`ModuleFact`,name:me(),location:v(t)},e):M()},Ot=()=>{let e=o,t=C(),n=k(()=>{let e=C();if((e.kind!==`Identifier`||ae(e))&&e.kind!==`Operator`)throw le(`Expected a definition name but found ${ie(e)}`,e);return o++,e.text},`!`),r=v(t);return S(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},kt=()=>k(i?Ot:Dt),At=()=>{let e=ue(M);if(!e)return[];let t=[e];return fe(()=>{for(;T(`,`);){let e=ue(()=>(E(),M()));if(!e)return;t.push(e)}}),t},jt=()=>{let e=i?At():Et()?k(Dt):[],t=D(`DEF`)||D(`DEFS`);if(i&&e.length===0&&!t)throw le(`Expected a fact`);return{facts:e,defs:t?kt():[]}},Mt=()=>{let e=o,t=E(),n=t.text===`USE`&&D(`ONLY`),r=x(e);return S({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...jt(),keyword:r,location:v(t)},e)},Nt=()=>{let e=o,t=v(C()),n=D(`NEW`),r=i?o:e,a=i?v(C()):t,s=C().kind===`Keyword`?tC.get(C().text):void 0;if(!n&&s===void 0)throw le(`Expected a declaration but found ${ie(C())}`);if(s!==void 0&&E(),s===`Variable`){let e=he();return S({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=ft(),l=(s??`Constant`)===`Constant`&&T(`\\in`);if(l&&c.arity>0)throw se(`declared symbol with arguments before \\in`);return l&&E(),S({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?M():void 0,nameRange:c.location.range,location:a},r)},Pt=()=>{if(C().kind===`Identifier`&&T(`::`,1)&&T(`ASSUME`,2)&&(E(),E()),T(`ASSUME`))return Ft();if(C().kind===`Keyword`&&nC.has(C().text))return i?de(Nt):Nt();if(!i)return M();let e=ue(M);if(e===void 0)throw le(`Expected a hypothesis`);return e},N=()=>{let e=[Pt()];return fe(()=>{for(;;){let t=ue(()=>(O(`,`),Pt()));if(t===void 0)break;e.push(t)}}),e},Ft=()=>{let e=o,t=v(O(`ASSUME`)),n=()=>{let n=i?N():k(Pt);return O(`PROVE`),S({kind:`AssumeProve`,assumptions:n,conclusion:M(),location:t},e)};return i?de(n):n()},It=e=>{let t=0;for(;C(t).kind===`Identifier`&&T(`,`,t+1);)t+=2;return C(t).kind===`Identifier`&&T(e,t+1)},Lt=()=>{let e=C();if(T(`USE`)||T(`HIDE`))return Mt();if(!i&&T(`INSTANCE`)){let t=o;return S(dt(void 0,[],!1,v(e)),t)}if(T(`DEFINE`)||_t()){let t=o;D(`DEFINE`);let n=[ct(!1)];for(;_t();)n.push(ct(!1));let r={kind:`Define`,definitions:n,location:v(e)};return S(r,t)}if(D(`HAVE`))return{kind:`Have`,expression:M()};if(D(`TAKE`)){let e=xe(),t=ge(e?[]:k(he)),n=e?we():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(D(`WITNESS`))return{kind:`Witness`,expressions:k(()=>M())};if(D(`PICK`)){let e=It(`:`),t=ge(e?k(he):[]),n=e?[]:we();return O(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:M()}}return D(`CASE`)?{kind:`Case`,expression:M()}:{kind:`Assert`,isSuffices:D(`SUFFICES`),statement:T(`ASSUME`)?Ft():M()}},Rt=e=>{let t=C();if(t.kind!==`Step`)throw le(`Expected a step number but found ${ie(t)}`,t);if(!Tt(t))throw se(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&bt(t)<0&&Ct(t)!==void 0)throw se(`<*> and <+> cannot be used for a named step`,t);return o++,{name:Ct(t),token:t.text,location:v(t)}},zt=()=>{let e=o,t=Rt(T(`QED`,1)),n=o,r=D(`QED`)?{kind:`Qed`}:Lt(),i=x(e),a=x(n),s=wt(C());if(s&&!US.has(r.kind))throw se(`Proof of a step that does not take a proof`);let c=s?Ht():void 0;return S({...t,body:r,head:i,statement:a,proof:c},e)},Bt=e=>{if(D(`BY`)){let t=x(o-1);return{kind:`By`,isOnly:D(`ONLY`),...jt(),keyword:t,location:e}}let t=C();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;E();let n=x(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=v(C());D(`PROOF`);let t=Bt(e);if(t)return t;let n=[zt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(zt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Ht=()=>{let e=o;vt.push(-1);let t=Vt();return vt.pop(),S(t,e)},Ut=()=>C().kind===`Step`||C().kind===`Keyword`&&HS.has(C().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return YS(e);let n=t.defs[t.defs.length-1]?.location.range;return JS(YS({...e,end:e.start}),YS(n??t.keyword))},Gt=()=>{let e=o,t=v(C()),n=D(`PROOF`),r=Bt(t);if(r){let t=S(r,e);return{kind:`Leaf`,proof:t,span:YS(t.keyword),first:e,end:o-1}}let i=C();if(i.kind!==`Step`)throw le(`Expected a step number but found ${ie(i)}`);let a=o;E();let s=o,c=D(`QED`)?{kind:`Qed`}:Lt(),l=x(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:x(s),span:Wt(l,c),first:e,start:a,end:o-1}},Kt=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=qt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...v(a[i.first]),range:x(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},qt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw $S(`Unexpected end of (sub)proof at level ${n} before QED step`,r,QS);if(a.kind===`Leaf`)throw $S(`Expecting a proof step but found a${KS[a.proof.kind]} leaf proof`,a.span,QS);if(!i&&a.isProof)throw $S(`PROOF keyword found in step that does not begin subproof`,a.span,ZS);let o=a.token.text[1];if(o===`+`&&!i)throw $S(`<+> used but no subproof expected`,a.span,ZS);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=US.has(a.body.kind)?Kt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Ct(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...v(a.token),range:x(a.start,l)}},d=JS(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=qt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:JS(d,f.span)}},Jt=()=>{if(!Ut())return;let e=[];for(;Ut();)e.push(Gt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Kt(e,0,0,t.span),r=e[n.next];if(r)throw $S(`extra step(s) after finished proof`,r.span,XS,`Proof.Parser.toplevel`);return n.proof},Yt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Xt=()=>{if(C().kind!==`Identifier`||!T(`==`,1))return;let e=me();return E(),e},Zt=()=>{if(!i)return M();let e=ne(),t=ue(M);if(t)return t;throw le(`Expected "====" but found ${ie(e)}`,e)},Qt=e=>{let t=o,n=E(),r=Xt(),a=T(`ASSUME`)?Ft():Zt(),s=i?Jt():wt(C())?Ht():void 0,c=S({name:r,statement:a,proof:s,location:v(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&a.kind!==`AssumeProve`&&Yt(e,r,a,c.location)},$t=()=>{let e=o,t=E(),n=Xt();return S({name:n,expression:M(),isAxiom:t.text===`AXIOM`,location:v(t)},e)},en=()=>{let e=v(O(`----`));O(`MODULE`);let t=ye();O(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),d.push(/* @__PURE__ */ new Set),D(`EXTENDS`)&&k(()=>{let e=o;n.extends.push(ye()),n.extendsRanges.push(x(e))});;){let t=o,r=C();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),d.pop(),n;if(r.kind===`Separator`){if(T(`MODULE`,1)){let e=en();n.modules.push(e),n.units.push({kind:`Module`,module:e}),O(`====`);continue}E()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=v(E()),r=mt();n.constants.push(...r),e.range=x(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=v(E()),r=k(()=>{let e=o,t=v(C());return S({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=x(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=$t();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Yt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(T(`USE`)&&T(`ONLY`,1))throw le(`Expected a module unit but found ${ie(r)}`);let e=Mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=v(E()),r=ht();e.range=x(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:tn(n,S(dt(void 0,[],!1,v(r)),t));continue;case`LOCAL`:if(E(),T(`INSTANCE`)){tn(n,S(dt(void 0,[],!0,v(r)),t));continue}tn(n,S(ut(!0),t));continue}r.kind===`Keyword`&&VS.has(r.text)?Qt(n):tn(n,ct(!1))}}},tn=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},nn=en(),rn=ve?CS(t):void 0;if(rn!==void 0)throw new e.I(rn);return nn},fC=e=>dC(e,`tlc`),pC=(e,t)=>dC(e,`tlc`,t),mC=e=>dC(e,`tlapm`),hC=e=>dC(e,`sany`),gC=/* @__PURE__ */ new WeakMap,_C=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&gC.set(n,e.arity)}),vC=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},yC=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),bC=(t,n)=>new e.I(`${t} at line ${n.line}, column ${n.column}`),xC=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return xC(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Be(e)){let e=xC(r,t,n);if(e)return e}},SC=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),CC=(e,t)=>{let n=e.location,r=SC(t,e.lets,n);if(e.params.length===0&&r!==t)return r;if(e.params.length===0){let e={...t};return Ks.set(e,Ks.get(t)??t),e}if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw bC(`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 bC(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:zs,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:zs,args:e.args,location:n,resolution:Rs},location:n}},wC=(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:Rs})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Rs}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Rs};return CC({...t,params:[...t.params,...r]},a)},TC=(t,n,r,i,a)=>{let o=i.location,s={params:[],args:[],lets:[],location:o},c=0,l,u=!1,d=[],f=[],p,m=(t,n)=>{!p&&t&&(p={location:e.Z(t),message:n})},h=(t,n,r=!1)=>{let a=i.selectorRanges?.[c];t&&a&&d.push({node:t,error:{location:e.Z(a),message:n},isEmpty:r})},g=(t,n)=>{if(!t)throw bC(n,o);Vs.set(i,{applications:f,nulls:d,error:{location:e.Z(t),message:n}}),u=!0},_=e=>{let r=[],i=[];for(;c<t.length;){let a=t[c];if(a.kind!==`Name`&&!e)return;if(a.kind!==`Name`)throw bC(`Expected an operator name`,o);r.push(a.name),i.push(...a.args);let s=r.join(`!`),l=e?e.find(e=>Pl(e)===s):n(s);if(l)return{definition:l,name:s,args:i,earlier:i.length-a.args.length};c++}throw bC(`Unknown operator ${r.join(`!`)}`,o)},v=e=>{let n=_(e);if(!n){u=!0;return}let r=n.definition,d=gC.get(r)??nc(r),p=c===t.length-1;if(n.args.length!==d){let e=i.argumentRanges?.[c]??o.range,t=`The operator ${Ms(n.name)} requires ${d-n.earlier} arguments.`;if(!a||n.args.length!==0)return g(e,t);m(e,t)}if(n.args.forEach((e,t)=>Ws.set(e,{operator:n.name,index:t,range:i.selectorRanges?.[c]})),p)return{definition:r,args:n.args};let h=r.location.range,v=gC.has(r)&&h?.module===o.range?.module&&ec(o,r.location);if(f.push({operator:n.name,range:i.selectorRanges?.[c],args:n.args,params:v?Array(d).fill(0):rc(r)}),r.isRecursive&&h&&h.module===o.range?.module&&ec(o,h.end))return g(i.selectorRanges?.[c],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(r.kind!==`Operator`)throw bC(`Cannot select a subexpression of ${r.name}`,o);s.params.push(...r.params),s.args.push(...n.args),l=r.body,c++},y=()=>{for(;c<t.length&&!u;){let e=t[c];if(e.kind!==`Name`)return;let n=i.selectorRanges?.[c],r=l&&xC(l,e.name,[]);if(!r)return g(n,`Cannot find label \`${e.name}'.`);let o=r.label.params;if(e.args.length!==o.length){let t=`Label \`${e.name}' used with wrong number of arguments.`;if(!a)return g(n,t);m(n,t)}s.lets.push(...r.lets),s.params.push(...o.map(e=>({name:e,arity:0}))),s.args.push(...e.args),f.push(yC(e.name,n,e.args)),l=r.label.body,c++}},b=e=>{if(!l)throw bC(`Subexpression selection failed`,o);if(e.kind===`Colon`)return;let a=i.selectorRanges?.[c],u=l.location.range;if((l.kind===`Subexpression`||l.kind===`Identifier`&&l.name.includes(`!`)||l.kind===`Apply`&&l.operator.includes(`!`))&&(u?.module!==o.range?.module||ec(l.location,o))){let t=Vs.has(l)?l:OC(l,n,r),i=`Choosing operand \`${vC(e)}' of subexpression with no operands.`;if(Vs.has(t)){g(a,i);return}Bs.has(t)&&t.kind!==`Lambda`&&(h(t,i,!0),l=t.kind===`Let`&&t.body.kind===`Apply`&&t.body.operator===`$subexpression`?t.body:{kind:`Tuple`,elements:[t],location:t.location})}if(l.kind===`Label`){l=l.body,b(e);return}let d=`Nonexistent operand specified by \`${vC(e)}'.`;if(l.kind===`Let`){if(e.kind!==`Operand`||Oc(e.operand,1)!==0){g(a,`A LET/IN expression has only one operand.`);return}s.lets.push(l.definitions),l=l.body;return}let p=Mc(l);if(p&&(e.kind===`Bound`||e.kind===`At`)){if(e.kind===`Bound`&&e.args.length!==p.names.length){g(a,`Selector with ${e.args.length} argument(s) used for quantifier with ${p.names.length} bound identifier(s).`);return}s.params.push(...p.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&(s.args.push(...e.args),f.push(yC(``,a,e.args))),l=p.body;return}if(l.kind===`Case`){let n=[...l.arms,...l.other?[{condition:void 0,body:l.other}]:[]];if(c===t.length-1){g(a,`Subexpression of CASE must have form !i!j.`);return}let r=e.kind===`Operand`?n[Oc(e.operand,n.length)]:void 0;if(!r){g(a,d);return}c++;let o=t[c],s=o.kind===`Operand`?Oc(o.operand,2):-1,u=i.selectorRanges?.[c];if(s===-1){g(u,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=s===0?r.condition:r.body;if(!f){g(u,`Selecting OTHER in a CASE statement.`);return}l=f;return}if(l.kind===`Except`&&e.kind===`Operand`&&Oc(e.operand,l.updates.length+1)>0){g(a,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let m=p?p.sets:Nc(l);if(!m&&l.kind!==`Identifier`){g(a,`Selecting subexpression of expression that has none.`);return}if(e.kind!==`Operand`){g(a,d);return}let _=m?.[Oc(e.operand,m.length)];_?l=_:g(a,d)},ee=v(void 0);if(u)return i;if(ee)return wC(ee.definition,{...s,args:ee.args});for(y();c<t.length&&!u;){let e=t[c];if(e.kind===`Name`){for(;l?.kind===`Label`;)l=l.body;if(l?.kind!==`Let`)return g(i.selectorRanges?.[c-1],`A name selector here must be from a LET clause.`),i;s.lets.push(l.definitions);let e=v(l.definitions);if(u)return i;if(e)return wC(e.definition,{...s,args:[...s.args,...e.args]});y()}else e.kind!==`Colon`&&(h(l,`Subexpression selection failed, probably due to an error in the selected expression.`),h(l,`Choosing operand \`${vC(e)}' of subexpression with no operands.`,!0)),b(e),h(l,`An unexpected null node specified by '${vC(t[c])}'.\nThis is probably due to a previous error.`),c++}if(u)return i;if(!l)throw bC(`Subexpression selection failed`,o);let te=s.params.length,x=s.args.length;if(te!==x){let e=`Expected ${te} arguments but found ${x}.`;if(!a||x>0)return g(o.range,e),i;m(o.range,e)}let S=CC(s,l);return Gs.set(S,d),p&&Hs.set(S,p),S},EC=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return kc(e,t,n)},DC=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Be(e).some(DC),OC=(e,t,n,r=!1)=>{if(!DC(e))return e;if(e.kind===`Let`){e.recursive&&_C(e.recursive,e.definitions);let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=t=>!e.definitions.some(e=>e.name===t)&&n(t),a=Ll(e,e=>OC(e,r,i));return a.kind===`Let`&&a.instances?{...a,instances:a.instances.map(e=>kC(e,r,i))}:a}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>OC(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Ll(e,e=>OC(e,t,n)),o=Be(e),s=Be(a).every((e,t)=>e===o[t])?e:a,c=s.kind===`Subexpression`?s.selectors:s.kind===`Identifier`?EC(s.name,[],void 0,t):s.kind===`Apply`?EC(s.operator,s.args,s.argumentCounts,t):void 0,l=c?.[0];if(!c)return s;let u=c.findIndex(e=>e.kind!==`Name`),d=c.slice(0,u===-1?c.length:u),f=d.some((e,n)=>n>0&&t(d.slice(0,n+1).map(vC).join(`!`)));if(l?.kind===`Name`&&n(l.name)&&!f||l?.kind===`Name`&&c[1].kind!==`Name`&&!t(l.name))return s;let p=TC(c,t,n,s,r);return p!==s&&Bs.add(p),p},kC=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:OC(e.expression,t,n,!0)}))}),AC=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},jC=(e,t)=>kC(e,AC(t.definitions),()=>!1),MC=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]);_C(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return ec(e.location,t)||e.isRecursive&&n!==void 0&&ec(n,t)},s=(e,t)=>n=>{let r=e(n);return r&&(!i.has(r)||o(r,t))?r:void 0},c=AC([...t,...e.definitions]),l=e=>n.has(e),u=AC([...t,...e.definitions,...r]),d=(e,t)=>OC(e,s(u,t),e=>l(e)&&r.every(t=>t.name!==e)),f=e=>{let t=t=>l(t)||!e(t),n=n=>OC(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return Us.set(t,e),t},i=e=>e.map(e=>({...e,set:n(e.set)})),a=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:a(e)),conclusion:n(e.conclusion)}:n(e),o=o=>{switch(o.kind){case`Use`:case`Hide`:return{...o,facts:r(o.facts)};case`Instance`:return kC(o,e,t);case`Define`:return{...o,definitions:o.definitions.map(r=>r.kind===`Instance`?kC(r,e,t):Il(r,n))};case`Have`:case`Case`:return{...o,expression:n(o.expression)};case`Witness`:return{...o,expressions:o.expressions.map(n)};case`Take`:return{...o,bounds:i(o.bounds)};case`Pick`:return{...o,bounds:i(o.bounds),body:n(o.body)};case`Assert`:return{...o,statement:a(o.statement)};default:return o}},s=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:o,resolveProof:s};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(e.body.kind===`Define`){let t=e.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=f(e=>t.find(t=>t.name===e)??r(e))}return t})}};return{lookup:e,resolveFacts:r,resolveStatement:a,resolveStep:o,resolveProof:s}},p={...e,theorems:e.theorems.map(e=>{let t=f(s(c,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&f(s(c,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>({...e,facts:f(s(c,e.location)).resolveFacts(e.facts)}))};return e.definitions.some(e=>DC(e.body))||e.assumptions.some(e=>DC(e.expression))?{...p,definitions:e.definitions.map(e=>Il(e,t=>d(t,e.location))),assumptions:e.assumptions.map(e=>({...e,expression:d(e.expression,e.location)}))}:p},NC=(e,t)=>e.maxLevels[t]??3,PC=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=md({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Su(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Su(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Cu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=yu(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)&&Su(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(hd(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.Z(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;if(r)for(let t=0;t<e.arity;t++){let i=l.argConstraints.get(_u(e.name,t));i!==void 0&&NC(r,t)<i&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${t+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let t=yu(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=NC(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.J([...i.values()])}},FC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],IC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),LC=new Map(As.flatMap(e=>e.map(t=>[t,e[0]]))),RC=e=>LC.get(e)??e,zC=()=>{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}}},BC=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:He(e)&2147483647,kind:t,isLocal:n}),VC=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:RC(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:RC(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},HC=(e,t)=>{let n=[];for(let r=t;;){let t=VC(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},UC=e=>({line:e.line,column:e.column}),WC=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=HC(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},GC=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,KC={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},qC=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&GC(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&GC(e[n+1],e[n+2])?n+=GC(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=>KC[e])}"`:r.text)}return t},JC=e=>e[2]?.text,YC=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},XC=(e,t)=>e.find(e=>e.name===t)??e.map(e=>XC(e.modules,t)).find(Boolean),ZC=e=>{let t=e===void 0?[]:re(e),n;return{tokens:t,ranges:YC(t),getModule:()=>n??=e===void 0?fC(``):pC(e,t)}},QC=(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=ZC(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??Is.get(i)??Ip.get(i)??uC(e,i),c=a(s),l=c.tokens,u=c.ranges.get(JC(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>XC(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},$C=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=HC(t,e+1);i.push({location:UC(t[e]),apply:e=>r.forEach(t=>e.put(BC(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:UC(n),apply:t=>t.put(BC(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&HC(t,u+1).every(e=>s.has(e))&&o(u,`definition`),IC.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(UC(n)),i.push({location:UC(n),apply:e=>e.put(BC(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(BC(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=RC(e.name);i.push({location:e.location,apply:n=>n.put(BC(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(BC(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(BC(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>ec(e.location,t.location)?-1:+!!ec(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=zC();n.set(i??``,o),ks.toReversed().forEach(e=>o.put(BC(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)}}},ew=(t,n,r)=>{let i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};n.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Ns.forEach(a);let s=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=WC(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;qC(s(void 0)).forEach((e,t)=>{t===3&&Fs.forEach(a),a(e)});let b=u(void 0);for(;;){let n=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!n)break;let[r,i]=n;if(f.add(`${r.key}>${i}`),y.set(r.unit,[...y.get(r.unit)??[],i]),!v.has(i)){if(v.add(i),t(i).tokens.length===0){let n=r.unit??JC(t(void 0).tokens);throw e.q(i,n)}qC(s(i)).forEach(a)}}FC.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),r.forEach(e=>{let t=s(e);qC(t).forEach(a),t.forEach(e=>{e.kind===`String`&&a(e.text)})}),Ps.forEach(a),[...i]},tw=(e,t)=>{let n=QC(e,t),r=n.getParsed,i,a=()=>i??=$C(r);return{getStringOrder:(e,t)=>ew(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},nw=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),rw=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],iw=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.I))throw r;let i=CS(t);throw i===void 0?r:e.J([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},aw=t=>new e.I(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),ow=(t,n)=>t.location.range&&n.location.range&&{location:e.Z(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.Z(n.location.range)}.`},sw=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,cw=e=>e===`Theorem`?`ThmOrAssumpDefNode`:sw(e),lw=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:tu(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),uw=(e,t)=>{let n=Ve(e);return n!==void 0&&t.has(n)||Be(e).some(e=>uw(e,t))},dw=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Xl(e),n.get(e)??n.size)),n},fw=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),pw=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Eg(e);if(e.kind===`Number`&&!Bt(e.value))throw Dg(e);pw(e.kind===`Let`?[...Be(e),...fw(e.instances??[])]:Be(e))}),mw=(t,n)=>{let r=n.order??tw(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(Yp.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=lp(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`,f.readLine=n.readLine;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,ee=e=>`${e}#${b++}`,te=[],x=[],S=PC(e=>{let t=m.get(e)??ce(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)}}),ne=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,C=/* @__PURE__ */ new Map,ie=e=>{let t=d.get(e);if(t)return t;let r=_m(e,n.print,f,n.files,u);if(!r)return;hm.get(e)?.forEach(ie);let i=/* @__PURE__ */ new Map;return gm.get(e)?.forEach(e=>ie(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:mu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:gu(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},ae=e=>{let t=hm.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=ie(e);return r&&y(e,t),r&&t.includes(`Integers`)&&ie(`Integers`),r},w=e=>(pw([...e.definitions.flatMap(ze),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...fw(e.instances)]),e.modules.forEach(w),e);w(i);let oe=(t,i)=>{let a=n.loadModule?.(t)??Rp(f.version).get(t)??uC(n.source,t);if(a===void 0)throw e.q(t,i);let o=iw(a,t,r);if(o.name!==t)throw e.J([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return w(o)},se=t=>{let n=v.indexOf(t.name);if(n!==-1){let r=[...v.slice(n),t.name].map(e=>`${e}.tla`);throw new e.I(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];v.push(t.name),_.push(r);let s=O(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:x,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.J(a,!1,void 0,x);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&ow(c,l.module);if(u)throw e.J([u],!1,void 0,x);if(c)throw aw(c);return o.forEach(e=>e()),{linked:s,closure:r}},ce=(t,r)=>{let i=p.get(t);if(i)return y(t,g.get(t)??[]),i;let o=se(oe(t,r)),s=/* @__PURE__ */ new Map;return mm(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.x(`No definition of ${t} to fall back to`);return W(i.body,{environment:r.environment,scope:N_(y_(i),a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&nw.has(t))return;let r=a.get(n.key);r&&s.set(e.name,r),u.set(n.key,e),a.delete(n.key)}),p.set(t,o.linked),g.set(t,o.closure),y(t,o.closure),o.linked},le=(e,t,n,r,i)=>{let u=i?void 0:ae(e.module);if(u)return ue(e,u);let d=i??ce(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=rw(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Tl(jC(e,t),f,t,n);te.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>l.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=lu({params:g,substitutions:new Map([...h].map(e=>[e[0],jl(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ee(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&re.set(u,`${e.name}!${re.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ee,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return de(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ne.set(r,{name:n,location:e.location}),e.name!==void 0&&C.set(r,n),r})},ue=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),de=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(e=>!i.has(e[0])).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:o.get(t[1].key)===!0?e.location.range:t[1].range}];let n=`${e.name}!${t[0]}`;return[n,{key:r(t[1].key,n),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind}]}))},fe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),pe=(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=fe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:nu(r,n),location:n}}},T=(e,t,n,r)=>{let i=e.location,s=r?void 0:ae(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=fe(t[1].arity,t[1].params);return ru(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,i)});let c=r??ce(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=rw(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};te.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=>uw(f(e),p),h=d.map(t=>{let n=pe(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=[],_=lu({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:nu(e.params,i),location:i,resolution:Rs}:tu(`${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}:lw(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])).map(t=>{let n=_.getKey(t[1].key),r=fe(t[1].arity,t[1].params),a=[...e.params,...r];return ru(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,a,n===t[1].key?r:a,i)});return[...h,...g,...y]},E=e=>[...e].flatMap(e=>{let t=a.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),D=/* @__PURE__ */ new Map,O=(t,r)=>{let s=nx(t,n.loadClass?.(t.name),t===i);D.set(t.name,s.overrides);let c=s.module,l=te.length,u=new Map([...Yp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:bl,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=_.get(n);if(!r){u.set(n,t),_.set(n,t);return}if(!r.range||!t.range||e.Z(r.range)===e.Z(t.range))return;let i=e.Z(t.range),a=e.Z(r.range);cw(r.kind)===cw(t.kind)?f.warnings.push({location:i,message:`Warning: the ${sw(r.kind)} of '${n}' conflicts with \nits ${sw(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${sw(t.kind)} of '${n}' conflicts with \nits ${sw(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,b=[],ee=[...c.constants],ne=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),re=ne.map(e=>e.name),ie=ne.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:ae(e);if(n){g(n);return}let i=t??ce(e,c.name);ee.push(...i.constants.filter(e=>ee.every(t=>t.name!==e.name)&&!re.includes(e.name))),i.variables.forEach((e,t)=>{re.includes(e)||ee.some(t=>t.name===e)||(re.push(e),ie.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>v.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),b.push(i)});let w=new Map(u),oe=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],se=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});oe.forEach(e=>_.set(e.name,se(e)));let fe=e=>({key:me(e),arity:nc(e),params:rc(e),kind:xl(c,e)?`Theorem`:`Definition`,range:e.location.range}),pe=ee.length===0&&re.length===0,me=e=>c===i?e.name:`${e.name}@${r.id}`,he=/* @__PURE__ */ new Map,ge=()=>new Map([...r.modules,...y]),_e=e=>{let t=c.modules.find(t=>t.name===e.module);return t?ec(t.location,e.location)?y.get(t.name):void 0:ge().get(e.module)},ve=e=>({imported:u,getInstance:e=>{let t=_e(e),n=t?void 0:ae(e.module);if(n)return{declarations:[],symbols:ue(e,n),instancer:c.name};let r=t??ce(e.module,c.name),i=rw(r);return{declarations:i,symbols:de(e,r.exported,i,e=>e),instancer:c.name}},bound:w,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:me,instanced:he,facts:v,reports:p,warnings:r.warnings}),ye=e=>[...oe.filter(t=>ec(t.location,e)).map(e=>[e.name,se(e)]),...c.definitions.filter(t=>ec(t.location,e)).map(e=>[e.name,fe(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(u)),be=e=>{let t=ge(),n=t.get(e.name),i=n&&ow(e,n.module);if(n&&!i)throw aw(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=O(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||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=le(e,c,ve(c),pe,ge().get(e.module));he.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>be(e)}))].sort((e,t)=>ec(e.location,t.location)?-1:1).forEach(e=>e.link());let k=MC(pu(c,(e,t)=>T(e,t,c.name,_e(e))),E(u));r.errors.push(...Dl(k,ve(k))),k.definitions.forEach(e=>{let t=me(e);a.set(t,e),o.set(t,!pe);let n=fe(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ec(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let xe={module:k,constants:ee,variables:re,variableLocations:ie,visible:u,exported:_,modules:y,extended:b,facts:/* @__PURE__ */ new Set([...v,...[...k.theorems,...k.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,xe);let Se=te.splice(l).map(e=>({location:e.location,check:()=>S(e)}));return r.levelChecks.push(()=>gd(k,{constants:new Set(ee.map(e=>e.name)),variables:new Set(re),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>C.get(u.get(e)?.key??e)},Se,x)),h.push(xe),xe},me=se(i).linked,he=n.traceFile,ge=he===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:he}}],_e=[...n.moduleOperators??[],...ge].map(e=>{let t=ce(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(me),1)),x.length>0&&!n.isSanyReported&&n.print(e.Q(x));let ve=n.runtimeInvariants??[];ve.forEach(e=>{if(e.module===void 0)return;p.set(i.name,me);let t=ce(e.module,i.name);h.splice(h.indexOf(t),1);let n=a.get(t.visible.get(e.name)?.key??e.name);n&&a.set(e.name,n)}),me.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),_e.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let ye=[],be=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>be(e,t)),ye.push(...e.module.assumptions))};be(me,/* @__PURE__ */ new Set);let k=me.constants.map(e=>e.name),xe=me.variables,Se=Ub(t,{root:me,moduleSymbols:new Map([...d,...[...p].map(e=>[e[0],e[1].visible]),[i.name,me.visible]]),definitions:a,builtins:u,copySources:s,operatorConstants:new Map(_e.flatMap(e=>ce(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),Ce=Se.constants,we=Se.substitutions;he!==void 0&&u.forEach((e,t)=>{let n=em(e);n&&u.set(t,n)});let Te=dw(xe,h.flatMap(e=>e.module.variables.map(e=>e.name))),Ee=kd({definitions:a,substitutions:we,constants:Ce,variableIndex:Te,builtins:u,variables:xe}),De={runtime:f,definitions:a,builtins:u,constants:Ce,substitutions:we,instanceNames:re,variables:xe,variableIndex:Te,facts:Ee,startupValues:Array.from({length:Ee.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Oe=md({constants:new Set(Ce.keys()),variables:/* @__PURE__ */ new Set([...xe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Vg(e,De)}),ke=t=>{try{W(t,{environment:De,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.x)return t;throw t}};we.forEach((t,n)=>{let r=a.get(t),i=k.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Oe.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?ke(r.body):void 0;if(i){let r=ot(i)?``:` - specifically: ${i.message}`;throw new e.v(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let Ae=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),je=r.createDefinitionOrder();return{environment:De,assumptions:ye,variableLocations:me.variableLocations,instanceActions:ne,startupDefinitions:h.filter(e=>!Ae.has(e.module.name)||rw(e).length===0).flatMap(e=>je(e===me?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>D.get(e.module.name)??[]),moduleOperators:_e,runtimeInvariants:ve,rootName:i.name}},hw=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),gw=(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},_w=t=>e.ot(new e.x(`${e.K}${t}`),e.rt.error),vw=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Lt(e)||!Lt(i))throw _w(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},yw=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${bw(t)}`:n},bw=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(bw).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${yw(e.pattern,e.set)}:${bw(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(bw).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${bw(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>yw(e.pattern,e.set)).join(`,`)}|->${bw(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(bw);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},xw=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Sw=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.v(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw _w(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>W(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!N(o)||!P(o))throw _w(`The symmetry operator must specify a set of functions.`);let s=F(o).elements;if(!s.every(It))throw _w(`The symmetry values must be function records.`);let c=i.body,l=c.kind===`Apply`?c.args:c.kind===`SetEnumeration`?c.elements:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=bw(xw(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Xe.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;s.map(vw).forEach(e=>{e.size>0&&f.set(hw(e),e)});let p=[...f.values()],m=0;for(;m<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m,t).forEach(e=>{let t=gw(n,e),r=hw(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!xw(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>Lt(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},Cw=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Tw(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(Tw(e[r],t));return a}},ww=(e,t)=>{let n=[],r=[];for(let i of e){let e=Tw(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Cn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Cn(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},Tw=(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=ww(e.elements,t);return n?On(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=Cw(n.domain,t),i=Cw(n.range,t)??n.range;if(r){let e=Tr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?An(n.domain,e.range):e}return i===n.range?n:An(n.domain,i)}if(n===`Interval`||!N(e)||!P(e))return e;let r=F(e),i=Cw(r.elements,t);return i?yr(i):r},Ew=(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]=Tw(e[o],i),a===0&&(a=Cn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Dw={line:0,column:0},Ow=e=>({kind:`Identifier`,name:e,location:Dw}),kw=e=>({name:e,expression:Ow(e),scope:void 0}),Aw=/* @__PURE__ */ new Set([`name`,`property`]),jw=(t,n,r)=>{let i=Vg(n,r);if(!i)throw new e.v(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.v(Aw.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},Mw=e=>e.body.kind===`Number`||e.body.kind===`String`,Nw=(e,t,n)=>n.constants.has(e)?n.constants.get(e):Mw(t)?void 0:h_(t,n),Pw=(t,n,r)=>{if(r.constants.has(n))throw new e.v(`The ${t} ${n} cannot be a constant.`);let i=jw(t,n,r);if(Nw(n,i,r)!==void 0)throw new e.v(`The ${t} ${n} cannot be a constant.`);return i},Fw=(t,n,r)=>{let i=r.constants.has(n)?void 0:jw(t,n,r),a=i?Nw(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.v(`The ${t} of ${n} is equal to ${L(a)}`);return a===void 0?i:void 0},Iw=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Lw=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),g_(e.startupDefinitions,r),t.invariants.forEach(e=>{Fw(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Rw=(t,n)=>{let r=md({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=Fw(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1789
1789
  Note that a bug can cause TLC to incorrectly report this error.
1790
1790
  If you believe your TLA+ or PlusCal specification to be correct,
1791
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.ot(new e.v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.rt.safetyEvaluationFailure)}return[ww(t)]})},Pw=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Pw(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=zg(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&p_(n,t)===void 0)return Pw(n.body,t)}return[e]},Fw=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||ky(i,t.scope,n)>0)return!1;let a=W(i,$w(n,void 0,void 0,t.scope));if(a===!1)throw new e.v(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.v(`The operator ${i.name}, which equals ${L(a)},\ncannot be used as a ${r}`);return!0},Iw=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return kw(t,e,n),Cw(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(t.init!==void 0||t.next!==void 0)throw new e.v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let o=[],s=[],c=[],l=n.constants.has(t.specification)?n.constants.get(t.specification):Ow(t.specification,Ew(`name`,t.specification,n),n);if(l!==void 0)throw new e.v(`The value of ${t.specification} is equal to ${L(l)}`);let u=Ew(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;jy(u.body,void 0,n,!1).forEach(t=>{let l=t.expression,u=t.path.some(e=>{let t=zg(e,n);return t?.kind===`Operator`&&ky(t.body,void 0,n)===1});if(!u&&Fw(t,n,`spec`))return;let p=l.kind===`Identifier`&&!j(l)?n.variableIndex.get(l.name):void 0;if(!u&&l.kind===`Identifier`&&p!==void 0){let t=r[p].range;throw new e.v(`The operator ${l.name}, which equals ${t?e.Z(t):l.name},\ncannot be used as a spec`)}if(l.kind===`UnboundedQuantifier`&&l.isTemporal)throw e.ot(new e.v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.rt.error);if(l.kind===`Always`&&l.expression.kind===`BoxAction`){let r=sb(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:Ye.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1792
- all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:Ye.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),s.length>0)throw new e.v(`The specification contains more than one conjunct of the form [][Next]_v,
1793
- but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&ky(l.expression,t.scope,n)<2)throw e.ot(new e.x(`TLC cannot handle the temporal formula ${U(l.expression)}`),e.rt.error);let m=ky(l,t.scope,n);if(m===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(m===2)throw new e.v(`TLC cannot handle this conjunct of the spec:\n${U(l)}`);o.push(t)}});let p=[...o,...s],m=e=>`$specification${e}`,h=p.reduce((e,t,n)=>t.scope===void 0?e:{name:m(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:m(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:o.length===0?void 0:{kind:`And`,operands:o.map(g),location:Sw},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},Lw=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=Aw(`property`,t,n);if(!a)return;ky(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;jy(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(Fw(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&ky(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!j(e)?zg(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=ky(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=U(a),n=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,r=a.kind===`BoxAction`?`To check that action ${o} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${t} (compare page 90 of ${n}).`:a.kind===`AngleAction`?`To check that infinitely many ${o} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${t} (compare page 91 of ${n}).`:`To check that action ${o} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${t}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${n}).`;throw new e.v(`The formula ${o} at ${t} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${r}`)}i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},Rw=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},zw=(e,t,n)=>t.flatMap(t=>Aw(e,t,n)?[ww(t)]:[]),Bw=(e,t)=>{let n=zg(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Vw=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.v(`_POSSIBLE lists ${r} more than once`);kw(`possible`,r,n);let a=ww(r);if(ky(a.expression,void 0,n)===3)throw new e.v(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return a}),Hw=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||j(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Uw=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=zg(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Ww=(e,t)=>e.flatMap(e=>{let n=Uw(e.expression,t);return(e.scope===void 0&&zd(n,t)===void 0?[n]:Pw(e.expression,t)).map(r=>{let i=e.scope===void 0?zd(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:Hw(r,i,t),predicate:n}})}),Gw=(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},Kw=/[\u0100-\uffff]/,qw=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Jw=e=>e.kind===`String`?Kw.test(e.value):e.kind===`Set`&&e.elements.some(Jw),Yw=e=>e.kind===`String`&&Kw.test(e.value)||e.kind===`Apply`&&qw.has(e.operator)||ze(e).some(Yw),Xw=(e,t)=>e.constants.some(e=>Jw(e.value)||(e.args??[]).some(Jw))||[...t.definitions.values()].some(e=>Yw(e.body)||e.kind===`Function`&&e.bounds.some(e=>Yw(e.set))),Zw=e=>{if(!It(e))return;let t=Wt(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},Qw=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},$w=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),eT=(e,t,n)=>Pg(W(e,t),n),tT=(t,n,r=rT)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.x(r(t,n.environment));return i},nT=(t,n,r)=>{let i=n.kind===`Identifier`?zg(n.name,r):void 0,a=i?.kind===`Operator`?i.body:n,o=i?.kind===`Operator`?i.bodyRange:void 0;return`TLC expected a ${t} value, but did not find one. ${o&&a.kind!==`Number`?e.Z(o):_g(a)}`},rT=(e,t)=>nT(`boolean`,e,t),iT=(e,t)=>tT(e.expression,t,(n,r)=>(e.predicate!==e.expression&&tT(e.predicate,t),rT(n,r))),aT=()=>{},oT=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=eT(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),sT=(t,n)=>{try{return t($w(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.x)return{message:t.message};throw t}},cT=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=sT(e=>Rg(W(n.expression,e),n.expression),t);if(e)return{name:_g(n.expression),trace:[],message:e.message}}},lT=(e,t,n,r=!1)=>{let i=XC(t.source,t.loadModule);return nn(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),cn(t),Ia(t.fingerprintPolynomial??0),r&&rn(),{order:i,specification:lw(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},uT=e=>{let t=typeof e.config==`string`?Le(e.config,e.version):e.config,n=lT(t,e,e.onPrint??console.log),r=n.specification;Mw(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=ob(t,i,r.instanceActions);return i.runtime.getSpecification=()=>db(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:pT(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants),getDescription:o}},dT=(t,n,r)=>{let i=cT(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(Ye.assumptionFalse,t,t),e.rt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(Ye.assumptionEvaluationError,a,st(Ye.assumptionEvaluationError,a,!0)),e.rt.assumptionViolation},fT=t=>e.ot(new e.x(`${e.K}Could not find operator: ${t.operator} in module: ${t.module}`),e.rt.error),pT=(t,n,r,i,a,o=[],s=[])=>{let c=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw fT(e);return{name:e.operator,key:e.key}}),l=Nw(t.invariants,n),u=Iw(t,n,r,i,a),d=Lw(t,n,a),f=t.properties[0],p=f&&zg(f,n)?.location.range,m=t.specification,h=m&&zg(m,n)?.location.range;u.isPropertyFairness&&p&&h&&a?.({kind:`warning`,code:Ye.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${e.Z(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${e.Z(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let g=Ww([...l,...d.invariants],n),_=g.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(_||d.initialPredicates.length>0||n.variables.length>0))throw new e.v(n.runtime.version===`1.7.4`?et:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&_)throw new e.v(`The configuration file did not specify the next state predicate.`);let v=Ww(s.map(e=>{let t=zg(e.name,n);return{name:e.name,expression:t?.kind===`Operator`?t.body:Cw(e.name),scope:void 0}}),n),y=[...g,...v],b=[...new Map(y.map(e=>[e.predicate,e])).values()],ee=zw(`constraint`,[...t.constraints,...c(`constraint`).map(e=>e.name)],n),te=Ww(ee,n),x=zw(`action constraint`,t.actionConstraints,n),S=n.coverage,ne=(e,t,r=!0)=>t.flatMap(t=>{if(!S)return[];let i=r?Uw(t.expression,n):t.expression,a=io(r?t.name:void 0,i,n),o=no(S,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),re=[...ne(`invariant`,l),...ne(`invariant`,d.invariants,!1)],C=new Map([...l,...d.invariants].map((e,t)=>[Uw(e.expression,n),re[t]])),ie=ne(`constraint`,x),ae=ne(`constraint`,ee),w=ne(`implied`,d.initialPredicates,!1),oe=ne(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),se=(e,t,r,i)=>{try{return _o(e,t.node,()=>W(t.expression,$w(n,r,i,t.scope)))}catch{return}},ce=(e,t,n)=>{if(S){for(let r of e){let e=se(S,r,t,n);if(typeof e!=`boolean`)return;if(!e)return S.primary[r.node]++,!1;S.secondary[r.node]++}return!0}};t.rlReward!==void 0&&Ew(`rlreward`,t.rlReward,n),t.periodic!==void 0&&Ew(`periodic`,t.periodic,n);let le=Vw(t.possible,n);if(n.variables.length===0)return;let ue=t.symmetry===void 0?void 0:_w(t.symmetry,n,t.substitutions),de=t.view===void 0?void 0:kw(`view function`,t.view,n),fe=t.view??c(`view`)[0]?.name,pe=fe===void 0?void 0:ww(fe),T=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Sw};return{...e,unchanged:t}}),E=e=>ky(e.expression,void 0,n)>=2,D=le.filter(e=>!E(e)),O=le.filter(E),k=n.runtime,me,he=()=>{if(me)return me;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return me=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),me},ge=(e,t)=>W(e,$w(n,t,void 0)),_e=e=>(pe!==void 0&&e.forEach(mr),ue===void 0?e:xw(e,ue,he())),ve=e=>{let t=_e(e);return Ja(pe===void 0?he().map(e=>t[e]):[ge(pe.expression,t)])},ye=e=>d.initialPredicates.find((t,r)=>{let i=S&&se(S,w[r],e,void 0);return typeof i==`boolean`?!i:!tT(t.expression,$w(n,e,void 0,t.scope))}),A=/* @__PURE__ */ new WeakSet,be=(t,r,i)=>{let a=i&&!A.has(i)?i:void 0;if(Gw(t,r,a))return!1;try{let e=$w(n,r,void 0,t.scope),i=t.membership;return a&&i?!Ti(r[i.variable],a[i.variable],W(i.set,e)):!iT(t,e)}catch(n){throw i?pt(e.ot(n,e.rt.safetyEvaluationFailure),Ye.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},xe=(e,t,n)=>{let r=C.get(e.predicate),i=S&&r?se(S,r,t,void 0):void 0;return typeof i==`boolean`?!i:y.some(r=>r.predicate===e.predicate&&be(r,t,n))},Se=Xw(t,n);k.getFingerprint=ve;let Ce=()=>{let t=le.find(e=>!k.possibleCounts.get(e.name));if(!t)return;let r=Bw(t.name,n),i=r?` at ${e.Z(r)}`:``;return{name:t.name,code:Ye.possibleUnwitnessed,message:`The _POSSIBLE predicate ${t.name}${i} 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:M(L(up(k),!0))}},we=de?.body.kind===`Tuple`?de.body.elements:[],Te=we.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),Ee=de?.body.kind===`Tuple`&&Te.length===we.length&&new Set(Te).size===Te.length,De=(e,t)=>Ee?he().filter(e=>Te.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${M(L(t[e]))}\n`).join(``):M(L(ge(e,t))),Oe=(t,r,i)=>tT(t.expression,$w(n,r,i),t=>`${e.K}${rT(t,n)}`),ke=e=>{let t=Object.fromEntries(he().map(t=>[n.variables[t],e[t]]));return pe===void 0?t:un(t,()=>De(pe.expression,e))};return k.toRecord=ke,{properties:d,spec:u,toRecord:ke,evaluateAlias:(t,r,i,a)=>{let o=()=>ke(r.map(e=>e??En(`null`)));try{kw(`alias`,t,n);let e=W(Cw(t),$w(n,r,i)),a=Zw(e);return a===void 0?o():fn(a,t)}catch(t){if(!(t instanceof e.v||t instanceof e.x))throw t;return{...o(),_ALIASEvalError:ct(t.message,a)}}},isSymmetric:ue!==void 0,isConstrained:te.length>0||x.length>0,getTypedChecks:e=>{if(S!==void 0||le.length>0||t.periodic!==void 0||[...y,...te].some(e=>e.scope!==void 0)||x.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(e===void 0||pe!==void 0)||u.init===void 0||u.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(te.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...n.facts.ids.keys()],s=Rw(u.scope),c=e=>p_(e,n)===void 0&&Id(e,n,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&Md(e,n)&&c(e))||Fd([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...pe?[pe.expression]:[],...s,...jb(e??[])],n,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>ye(e)===void 0,actionProperties:d.actionProperties,symmetry:ue,view:pe?.expression,variableOrder:he(),liveness:e}},getTlcOrder:he,getStoredFingerprints:(e,t)=>pe!==void 0||Se?BigInt64Array.from(e,ve):Xa(t,he()),getFingerprintState:e=>{if(Se)return[String(ve(e))];let t=_e(e);return pe===void 0?t:[ge(pe.expression,t)]},findViolatedInvariant:(e,t)=>{let n=S===void 0?y.find(n=>be(n,e,t)):b.find(n=>xe(n,e,t));return n&&A.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of b)xe(n,e,void 0)&&(A.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r)=>tT(n,$w(t,e,void 0,r));te.every(e=>i(e.predicate,e.scope))&&n();for(let e of b)i(e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find(e=>!i(e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>tT(e.predicate,$w(n,t,void 0,e.scope)))&&x.every(r=>tT(r.expression,$w(n,e,t,r.scope))))||r())||b.every(e=>tT(e.predicate,$w(n,t,void 0,e.scope))))&&T.every(r=>tT(r.box,$w(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>ce(ae,e)??te.every(r=>Gw(r,e,t)||iT(r,$w(n,e,void 0))),findFailedInitialPredicate:ye,findViolatedActionProperty:(e,t)=>T.find((r,i)=>{let a=S&&se(S,oe[i],e,t);if(typeof a==`boolean`)return!a;try{return!tT(r.action,$w(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!eT(r.unchanged,$w(n,e,t,r.scope),`a subscript`)}catch(e){throw pt(mT(e),Ye.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ce(ie,e,t)??x.every(n=>Oe(n,e,t)),getExcludingConstraints:(t,r)=>[...te.filter(e=>!iT(e,$w(n,r,void 0))),...x.filter(e=>!Oe(e,t,r))].map(t=>{let r=Bw(t.name,n);return r?e.Z(r):t.name}),trackStatePossible:D.length===0?aT:e=>oT(D,k,$w(n,e,void 0)),trackActionPossible:O.length===0?aT:(e,t)=>oT(O,k,$w(n,e,t)),findUnwitnessedPossible:Ce,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=Cw(t.rlReward),s=W(o,$w(n,r,i));if(typeof s!=`number`)throw new e.x(nT(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=c(`postcondition`),a=t.postconditions.map(e=>{let t=zg(e,n);return t?t.kind===`Operator`&&t.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!Dw(t)&&p_(t,n)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(a!==void 0){if(r)return;throw e.ot(new e.x(a),e.rt.configParseError)}let o=(t,r)=>{let i=sT(e=>tT(Cw(r),e),n);if(!i)return;let a=zg(r,n)?.body,o=Bw(r,n),s=o?` at ${a?.kind===`Number`?_g(a):e.Z(o)}`:``;return i.message===void 0?{name:t,code:Ye.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:Ye.postconditionFailed,message:`Evaluating postcondition ${t}${s} failed.\n${i.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let s=Ce();if(s)return s;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},mT=t=>t instanceof e.A?e.ot(t,t.exitCode):t,hT=(e,t)=>e*((t-e)/2**64),gT=e=>e.includes(`.`)?e:`${e}.0`,_T=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return gT(String(e));let[n,r]=e.toExponential().split(`e`);return`${gT(n)}E${r.replace(`+`,``)}`},vT=e=>e!==void 0&&e>=`0`&&e<=`9`,yT=e=>{if(e===0)return`0.0`;let t=_T(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;vT(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;vT(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;vT(t[n])&&r<2;)i+=t[n++],r++;for(vT(t[n])&&Number(t[n])>=5&&(i=bT(i));vT(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},bT=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${bT(r)}.`:n===`9`?`${bT(r)}0`:`${r}${Number(n)+1}`},xT=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},ST=(e,t,n)=>{if(hT(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},CT=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},wT=[void 0,`lambda`,`tuple`,`record`],TT=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=Ri(e.domain);return t?(a(7),a(wT.indexOf(Nn(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(wT.indexOf(Nn(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},ET=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return En(t.strings[n[r++]]);if(e===5)return On(i(n[r++]));let a=wT[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Pr({kind:`Interval`,low:e,high:e+t-1});return Mn(An(o,i(t)),a)}let o=n[r++],s=i(o);return Mn(An(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return sg}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return Un}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ob}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Ja}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Lv}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Rr}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return lC}}),Object.defineProperty(exports,"Cn",{enumerable:!0,get:function(){return _e}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return $a}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Ab}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Wa}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Mb}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return Ha}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return Iv}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Tr}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return K_}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return Yi}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Rv}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return Ir}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return Ov}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return En}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return k_}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return Xi}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return Mv}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Lr}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return By}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Cn}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Cy}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return gi}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return lb}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Dv}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Kn}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return ag}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return P}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return kv}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return yr}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return uC}}),Object.defineProperty(exports,"Sn",{enumerable:!0,get:function(){return Te}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return bo}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Nb}}),Object.defineProperty(exports,"Tn",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Mo}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Pv}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return ya}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Av}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return On}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Ev}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return p_}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return ei}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return zg}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return Ot}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return R_}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return an}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Mw}}),Object.defineProperty(exports,"_n",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Fd}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return ST}}),Object.defineProperty(exports,"an",{enumerable:!0,get:function(){return Xe}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return rh}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return aC}}),Object.defineProperty(exports,"bn",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return no}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return lT}}),Object.defineProperty(exports,"cn",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Lp}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return cT}}),Object.defineProperty(exports,"dn",{enumerable:!0,get:function(){return N}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return fp}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return og}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return $w}}),Object.defineProperty(exports,"fn",{enumerable:!0,get:function(){return Ct}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return gp}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return jw}}),Object.defineProperty(exports,"gn",{enumerable:!0,get:function(){return bt}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return Md}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return dT}}),Object.defineProperty(exports,"hn",{enumerable:!0,get:function(){return mt}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Uf}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return xT}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return Ye}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return oh}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return db}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return Tt}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return ub}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return za}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return fT}}),Object.defineProperty(exports,"ln",{enumerable:!0,get:function(){return dt}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Ip}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return uT}}),Object.defineProperty(exports,"mn",{enumerable:!0,get:function(){return at}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return zf}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return TT}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Mh}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return hT}}),Object.defineProperty(exports,"on",{enumerable:!0,get:function(){return $e}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return ih}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Qw}}),Object.defineProperty(exports,"pn",{enumerable:!0,get:function(){return yt}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return mp}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return W}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return kt}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return yT}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return Vn}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return cg}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return CT}}),Object.defineProperty(exports,"sn",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return ah}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return ET}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return mr}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return lg}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return pT}}),Object.defineProperty(exports,"un",{enumerable:!0,get:function(){return ut}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Rp}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return mT}}),Object.defineProperty(exports,"vn",{enumerable:!0,get:function(){return Ue}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return ec}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return vS}}),Object.defineProperty(exports,"wn",{enumerable:!0,get:function(){return ee}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return io}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return sC}}),Object.defineProperty(exports,"xn",{enumerable:!0,get:function(){return Le}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return po}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return bw}}),Object.defineProperty(exports,"yn",{enumerable:!0,get:function(){return Ve}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Ms}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return zv}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return An}});
1791
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.ot(new e.v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.rt.safetyEvaluationFailure)}return[kw(t)]})},zw=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>zw(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Vg(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&h_(n,t)===void 0)return zw(n.body,t)}return[e]},Bw=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||Ny(i,t.scope,n)>0)return!1;let a=W(i,iT(n,void 0,void 0,t.scope));if(a===!1)throw new e.v(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.v(`The operator ${i.name}, which equals ${L(a)},\ncannot be used as a ${r}`);return!0},Vw=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Pw(t,e,n),Ow(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(t.init!==void 0||t.next!==void 0)throw new e.v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let o=[],s=[],c=[],l=n.constants.has(t.specification)?n.constants.get(t.specification):Nw(t.specification,jw(`name`,t.specification,n),n);if(l!==void 0)throw new e.v(`The value of ${t.specification} is equal to ${L(l)}`);let u=jw(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;Fy(u.body,void 0,n,!1).forEach(t=>{let l=t.expression,u=t.path.some(e=>{let t=Vg(e,n);return t?.kind===`Operator`&&Ny(t.body,void 0,n)===1});if(!u&&Bw(t,n,`spec`))return;let p=l.kind===`Identifier`&&!A(l)?n.variableIndex.get(l.name):void 0;if(!u&&l.kind===`Identifier`&&p!==void 0){let t=r[p].range;throw new e.v(`The operator ${l.name}, which equals ${t?e.Z(t):l.name},\ncannot be used as a spec`)}if(l.kind===`UnboundedQuantifier`&&l.isTemporal)throw e.ot(new e.v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.rt.error);if(l.kind===`Always`&&l.expression.kind===`BoxAction`){let r=db(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:Xe.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1792
+ all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:Xe.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),s.length>0)throw new e.v(`The specification contains more than one conjunct of the form [][Next]_v,
1793
+ but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&Ny(l.expression,t.scope,n)<2)throw e.ot(new e.x(`TLC cannot handle the temporal formula ${U(l.expression)}`),e.rt.error);let m=Ny(l,t.scope,n);if(m===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(m===2)throw new e.v(`TLC cannot handle this conjunct of the spec:\n${U(l)}`);o.push(t)}});let p=[...o,...s],m=e=>`$specification${e}`,h=p.reduce((e,t,n)=>t.scope===void 0?e:{name:m(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:m(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:o.length===0?void 0:{kind:`And`,operands:o.map(g),location:Dw},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},Hw=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=Fw(`property`,t,n);if(!a)return;Ny(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;Fy(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(Bw(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&Ny(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!A(e)?Vg(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=Ny(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=U(a),n=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,r=a.kind===`BoxAction`?`To check that action ${o} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${t} (compare page 90 of ${n}).`:a.kind===`AngleAction`?`To check that infinitely many ${o} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${t} (compare page 91 of ${n}).`:`To check that action ${o} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${t}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${n}).`;throw new e.v(`The formula ${o} at ${t} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${r}`)}i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},Uw=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},Ww=(e,t,n)=>t.flatMap(t=>Fw(e,t,n)?[kw(t)]:[]),Gw=(e,t)=>{let n=Vg(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Kw=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.v(`_POSSIBLE lists ${r} more than once`);Pw(`possible`,r,n);let a=kw(r);if(Ny(a.expression,void 0,n)===3)throw new e.v(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return a}),qw=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||A(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Jw=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Vg(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},Yw=(e,t)=>e.flatMap(e=>{let n=Jw(e.expression,t);return(e.scope===void 0&&zd(n,t)===void 0?[n]:zw(e.expression,t)).map(r=>{let i=e.scope===void 0?zd(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:qw(r,i,t),predicate:n}})}),Xw=(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},Zw=/[\u0100-\uffff]/,Qw=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),$w=e=>e.kind===`String`?Zw.test(e.value):e.kind===`Set`&&e.elements.some($w),eT=e=>e.kind===`String`&&Zw.test(e.value)||e.kind===`Apply`&&Qw.has(e.operator)||Be(e).some(eT),tT=(e,t)=>e.constants.some(e=>$w(e.value)||(e.args??[]).some($w))||[...t.definitions.values()].some(e=>eT(e.body)||e.kind===`Function`&&e.bounds.some(e=>eT(e.set))),nT=e=>{if(!It(e))return;let t=Wt(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},rT=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},iT=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),aT=(e,t,n)=>Ig(W(e,t),n),oT=(t,n,r=cT)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.x(r(t,n.environment));return i},sT=(t,n,r)=>{let i=n.kind===`Identifier`?Vg(n.name,r):void 0,a=i?.kind===`Operator`?i.body:n,o=i?.kind===`Operator`?i.bodyRange:void 0;return`TLC expected a ${t} value, but did not find one. ${o&&a.kind!==`Number`?e.Z(o):yg(a)}`},cT=(e,t)=>sT(`boolean`,e,t),lT=(e,t)=>oT(e.expression,t,(n,r)=>(e.predicate!==e.expression&&oT(e.predicate,t),cT(n,r))),uT=()=>{},dT=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=aT(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),fT=(t,n)=>{try{return t(iT(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.x)return{message:t.message};throw t}},pT=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=fT(e=>Bg(W(n.expression,e),n.expression),t);if(e)return{name:yg(n.expression),trace:[],message:e.message}}},mT=(e,t,n,r=!1)=>{let i=tw(t.source,t.loadModule);return nn(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),cn(t),Ia(t.fingerprintPolynomial??0),r&&rn(),{order:i,specification:mw(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},hT=e=>{let t=typeof e.config==`string`?Re(e.config,e.version):e.config,n=mT(t,e,e.onPrint??console.log),r=n.specification;Lw(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=ub(t,i,r.instanceActions);return i.runtime.getSpecification=()=>hb(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:vT(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants),getDescription:o}},gT=(t,n,r)=>{let i=pT(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(Xe.assumptionFalse,t,t),e.rt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(Xe.assumptionEvaluationError,a,ct(Xe.assumptionEvaluationError,a,!0)),e.rt.assumptionViolation},_T=t=>e.ot(new e.x(`${e.K}Could not find operator: ${t.operator} in module: ${t.module}`),e.rt.error),vT=(t,n,r,i,a,o=[],s=[])=>{let c=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw _T(e);return{name:e.operator,key:e.key}}),l=Rw(t.invariants,n),u=Vw(t,n,r,i,a),d=Hw(t,n,a),f=t.properties[0],p=f&&Vg(f,n)?.location.range,m=t.specification,h=m&&Vg(m,n)?.location.range;u.isPropertyFairness&&p&&h&&a?.({kind:`warning`,code:Xe.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${e.Z(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${e.Z(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let g=Yw([...l,...d.invariants],n),_=g.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(_||d.initialPredicates.length>0||n.variables.length>0))throw new e.v(n.runtime.version===`1.7.4`?tt:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&_)throw new e.v(`The configuration file did not specify the next state predicate.`);let v=Yw(s.map(e=>{let t=Vg(e.name,n);return{name:e.name,expression:t?.kind===`Operator`?t.body:Ow(e.name),scope:void 0}}),n),y=[...g,...v],b=[...new Map(y.map(e=>[e.predicate,e])).values()],ee=Ww(`constraint`,[...t.constraints,...c(`constraint`).map(e=>e.name)],n),te=Yw(ee,n),x=Ww(`action constraint`,t.actionConstraints,n),S=n.coverage,ne=(e,t,r=!0)=>t.flatMap(t=>{if(!S)return[];let i=r?Jw(t.expression,n):t.expression,a=io(r?t.name:void 0,i,n),o=no(S,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),re=[...ne(`invariant`,l),...ne(`invariant`,d.invariants,!1)],C=new Map([...l,...d.invariants].map((e,t)=>[Jw(e.expression,n),re[t]])),ie=ne(`constraint`,x),ae=ne(`constraint`,ee),w=new Map(ae.map(e=>[e.expression,e])),oe=[...new Map(te.map(e=>[e.predicate,e])).values()],se=ne(`implied`,d.initialPredicates,!1),ce=ne(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),le=(e,t,r,i)=>{try{return _o(e,t.node,()=>W(t.expression,iT(n,r,i,t.scope)))}catch{return}},ue=(e,t,n)=>S&&e?_o(S,e.node,()=>oT(e.expression,n)):oT(t,n),de=(e,t,n)=>{if(S){for(let r of e){let e=le(S,r,t,n);if(typeof e!=`boolean`)return;if(!e)return S.primary[r.node]++,!1;S.secondary[r.node]++}return!0}};t.rlReward!==void 0&&jw(`rlreward`,t.rlReward,n),t.periodic!==void 0&&jw(`periodic`,t.periodic,n);let fe=Kw(t.possible,n);if(n.variables.length===0)return;let pe=t.symmetry===void 0?void 0:Sw(t.symmetry,n,t.substitutions),T=t.view===void 0?void 0:Pw(`view function`,t.view,n),E=t.view??c(`view`)[0]?.name,D=E===void 0?void 0:kw(E),O=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Dw};return{...e,unchanged:t}}),me=e=>Ny(e.expression,void 0,n)>=2,he=fe.filter(e=>!me(e)),ge=fe.filter(me),_e=n.runtime,ve,ye=()=>{if(ve)return ve;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return ve=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ve},be=(e,t)=>W(e,iT(n,t,void 0)),k=e=>(D!==void 0&&e.forEach(mr),pe===void 0?e:Ew(e,pe,ye())),xe=e=>{let t=k(e);return Ja(D===void 0?ye().map(e=>t[e]):[be(D.expression,t)])},Se=e=>d.initialPredicates.find((t,r)=>{let i=S&&le(S,se[r],e,void 0);return typeof i==`boolean`?!i:!oT(t.expression,iT(n,e,void 0,t.scope))}),Ce=/* @__PURE__ */ new WeakSet,we=(t,r,i)=>{let a=i&&!Ce.has(i)?i:void 0;if(Xw(t,r,a))return!1;try{let e=iT(n,r,void 0,t.scope),i=t.membership;return a&&i?!Ti(r[i.variable],a[i.variable],W(i.set,e)):!lT(t,e)}catch(n){throw i?mt(e.ot(n,e.rt.safetyEvaluationFailure),Xe.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},Te=(e,t,n)=>{let r=C.get(e.predicate),i=S&&r?le(S,r,t,void 0):void 0;return typeof i==`boolean`?!i:y.some(r=>r.predicate===e.predicate&&we(r,t,n))},Ee=tT(t,n);_e.getFingerprint=xe;let De=()=>{let t=fe.find(e=>!_e.possibleCounts.get(e.name));if(!t)return;let r=Gw(t.name,n),i=r?` at ${e.Z(r)}`:``;return{name:t.name,code:Xe.possibleUnwitnessed,message:`The _POSSIBLE predicate ${t.name}${i} 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:j(L(up(_e),!0))}},Oe=T?.body.kind===`Tuple`?T.body.elements:[],ke=Oe.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),Ae=T?.body.kind===`Tuple`&&ke.length===Oe.length&&new Set(ke).size===ke.length,je=(e,t)=>Ae?ye().filter(e=>ke.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${j(L(t[e]))}\n`).join(``):j(L(be(e,t))),Me=(t,r,i)=>oT(t.expression,iT(n,r,i),t=>`${e.K}${cT(t,n)}`),Ne=e=>{let t=Object.fromEntries(ye().map(t=>[n.variables[t],e[t]]));return D===void 0?t:un(t,()=>je(D.expression,e))};return _e.toRecord=Ne,{properties:d,spec:u,toRecord:Ne,evaluateAlias:(t,r,i,a)=>{let o=()=>Ne(r.map(e=>e??En(`null`)));try{Pw(`alias`,t,n);let e=W(Ow(t),iT(n,r,i)),a=nT(e);return a===void 0?o():fn(a,t)}catch(t){if(!(t instanceof e.v||t instanceof e.x))throw t;return{...o(),_ALIASEvalError:lt(t.message,a)}}},isSymmetric:pe!==void 0,isConstrained:te.length>0||x.length>0,getTypedChecks:e=>{if(S!==void 0||fe.length>0||t.periodic!==void 0||[...y,...te].some(e=>e.scope!==void 0)||x.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(e===void 0||D!==void 0)||u.init===void 0||u.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(te.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...n.facts.ids.keys()],s=Uw(u.scope),c=e=>h_(e,n)===void 0&&Id(e,n,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&Md(e,n)&&c(e))||Fd([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...D?[D.expression]:[],...s,...Fb(e??[])],n,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>Se(e)===void 0,actionProperties:d.actionProperties,symmetry:pe,view:D?.expression,variableOrder:ye(),liveness:e}},getTlcOrder:ye,getStoredFingerprints:(e,t)=>D!==void 0||Ee?BigInt64Array.from(e,xe):Xa(t,ye()),getFingerprintState:e=>{if(Ee)return[String(xe(e))];let t=k(e);return D===void 0?t:[be(D.expression,t)]},findViolatedInvariant:(e,t)=>{let n=S===void 0?y.find(n=>we(n,e,t)):b.find(n=>Te(n,e,t));return n&&Ce.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of b)Te(n,e,void 0)&&(Ce.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r,i)=>ue(n,r,iT(t,e,void 0,i));oe.every(e=>i(w.get(e.predicate),e.predicate,e.scope))&&n();for(let e of b)i(C.get(e.predicate),e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find((e,t)=>!i(se[t],e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(oe.every(e=>ue(w.get(e.predicate),e.predicate,iT(n,t,void 0,e.scope)))&&x.every((r,i)=>ue(ie[i],r.expression,iT(n,e,t,r.scope))))||r())||b.every(e=>ue(C.get(e.predicate),e.predicate,iT(n,t,void 0,e.scope))))&&O.every((r,i)=>ue(ce[i],r.box,iT(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>de(ae,e)??te.every(r=>Xw(r,e,t)||lT(r,iT(n,e,void 0))),findFailedInitialPredicate:Se,findViolatedActionProperty:(e,t)=>O.find((r,i)=>{let a=S&&le(S,ce[i],e,t);if(typeof a==`boolean`)return!a;try{return!oT(r.action,iT(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!aT(r.unchanged,iT(n,e,t,r.scope),`a subscript`)}catch(e){throw mt(yT(e),Xe.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>de(ie,e,t)??x.every(n=>Me(n,e,t)),getExcludingConstraints:(t,r)=>[...te.filter(e=>!lT(e,iT(n,r,void 0))),...x.filter(e=>!Me(e,t,r))].map(t=>{let r=Gw(t.name,n);return r?e.Z(r):t.name}),trackStatePossible:he.length===0?uT:e=>dT(he,_e,iT(n,e,void 0)),trackActionPossible:ge.length===0?uT:(e,t)=>dT(ge,_e,iT(n,e,t)),findUnwitnessedPossible:De,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=Ow(t.rlReward),s=W(o,iT(n,r,i));if(typeof s!=`number`)throw new e.x(sT(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=c(`postcondition`),a=t.postconditions.map(e=>{let t=Vg(e,n);return t?t.kind===`Operator`&&t.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!Mw(t)&&h_(t,n)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(a!==void 0){if(r)return;throw e.ot(new e.x(a),e.rt.configParseError)}let o=(t,r)=>{let i=fT(e=>oT(Ow(r),e),n);if(!i)return;let a=Vg(r,n)?.body,o=Gw(r,n),s=o?` at ${a?.kind===`Number`?yg(a):e.Z(o)}`:``;return i.message===void 0?{name:t,code:Xe.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:Xe.postconditionFailed,message:`Evaluating postcondition ${t}${s} failed.\n${i.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let s=De();if(s)return s;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},yT=t=>t instanceof e.A?e.ot(t,t.exitCode):t,bT=(e,t)=>e*((t-e)/2**64),xT=e=>e.includes(`.`)?e:`${e}.0`,ST=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return xT(String(e));let[n,r]=e.toExponential().split(`e`);return`${xT(n)}E${r.replace(`+`,``)}`},CT=e=>e!==void 0&&e>=`0`&&e<=`9`,wT=e=>{if(e===0)return`0.0`;let t=ST(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;CT(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;CT(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;CT(t[n])&&r<2;)i+=t[n++],r++;for(CT(t[n])&&Number(t[n])>=5&&(i=TT(i));CT(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},TT=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${TT(r)}.`:n===`9`?`${TT(r)}0`:`${r}${Number(n)+1}`},ET=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},DT=(e,t,n)=>{if(bT(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},OT=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},kT=[void 0,`lambda`,`tuple`,`record`],AT=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=Ri(e.domain);return t?(a(7),a(kT.indexOf(Nn(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(kT.indexOf(Nn(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},jT=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return En(t.strings[n[r++]]);if(e===5)return On(i(n[r++]));let a=kT[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Pr({kind:`Interval`,low:e,high:e+t-1});return Mn(An(o,i(t)),a)}let o=n[r++],s=i(o);return Mn(An(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return bv}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return an}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return mb}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Uv}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return yr}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return mC}}),Object.defineProperty(exports,"Cn",{enumerable:!0,get:function(){return Re}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return po}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Ib}}),Object.defineProperty(exports,"Dn",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Mo}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Lb}}),Object.defineProperty(exports,"En",{enumerable:!0,get:function(){return ee}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return io}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return jv}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return gi}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Av}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return ya}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Pv}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return Rr}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return Bv}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return Kn}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return W}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return Xi}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return J_}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return Mv}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Tr}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return hb}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Ja}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Wy}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Pb}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Ha}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Cn}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return B_}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return ei}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return Iv}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return En}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return hC}}),Object.defineProperty(exports,"Sn",{enumerable:!0,get:function(){return Be}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return no}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Rb}}),Object.defineProperty(exports,"Tn",{enumerable:!0,get:function(){return ve}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return $a}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Hv}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return On}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Vv}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return An}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Rv}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return Ir}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Vg}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return j_}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return At}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return h_}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return kt}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Lw}}),Object.defineProperty(exports,"_n",{enumerable:!0,get:function(){return ht}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Uf}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return DT}}),Object.defineProperty(exports,"an",{enumerable:!0,get:function(){return Vn}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return ug}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return uC}}),Object.defineProperty(exports,"bn",{enumerable:!0,get:function(){return We}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return ec}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return mT}}),Object.defineProperty(exports,"cn",{enumerable:!0,get:function(){return et}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return oh}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return pT}}),Object.defineProperty(exports,"dn",{enumerable:!0,get:function(){return ft}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Ip}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return P}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return sg}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return iT}}),Object.defineProperty(exports,"fn",{enumerable:!0,get:function(){return dt}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Rp}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Iw}}),Object.defineProperty(exports,"gn",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return zf}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return gT}}),Object.defineProperty(exports,"hn",{enumerable:!0,get:function(){return bt}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return mp}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return ET}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Ph}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return ub}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return za}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return pb}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Wa}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return _T}}),Object.defineProperty(exports,"ln",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return sh}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return hT}}),Object.defineProperty(exports,"mn",{enumerable:!0,get:function(){return wt}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return gp}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return AT}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return cg}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return bT}}),Object.defineProperty(exports,"on",{enumerable:!0,get:function(){return Xe}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return ch}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return rT}}),Object.defineProperty(exports,"pn",{enumerable:!0,get:function(){return M}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return fp}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return Yi}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return wT}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return mr}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return dg}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return OT}}),Object.defineProperty(exports,"sn",{enumerable:!0,get:function(){return Ze}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return ah}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return jT}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return Un}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return lg}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return vT}}),Object.defineProperty(exports,"un",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Lp}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return yT}}),Object.defineProperty(exports,"vn",{enumerable:!0,get:function(){return xt}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Md}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return CS}}),Object.defineProperty(exports,"wn",{enumerable:!0,get:function(){return Ee}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return bo}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return fC}}),Object.defineProperty(exports,"xn",{enumerable:!0,get:function(){return He}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Ms}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Tw}}),Object.defineProperty(exports,"yn",{enumerable:!0,get:function(){return ut}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Fd}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return Nv}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Lr}});