tla-ts 0.0.10-dev.d166e0ae9 → 0.0.10-dev.e3e5dd576
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/deciders.cjs +29 -29
- package/dist/deciders.js +30 -30
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -0
- package/dist/index.d.ts +4 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +42 -42
- package/dist/prove.js +46 -46
- package/dist/run.cjs +40 -42
- package/dist/run.js +41 -43
- package/dist/transfer.cjs +45 -42
- package/dist/transfer.js +39 -36
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +1 -1
- package/src/ast.ts +3 -1
- package/src/check-failure.ts +5 -6
- package/src/check-trace.ts +4 -4
- package/src/check.ts +78 -90
- package/src/cli/tlc-output.ts +16 -2
- package/src/cli/tlc.ts +2 -2
- package/src/codegen.ts +7 -15
- package/src/coverage.ts +187 -1
- package/src/dependencies.ts +7 -2
- package/src/dfid.ts +80 -27
- package/src/environment.ts +38 -7
- package/src/evaluate.ts +221 -47
- package/src/exit-codes.ts +3 -4
- package/src/instances.ts +119 -5
- package/src/levels.ts +541 -191
- package/src/lexer.ts +12 -2
- package/src/liveness-checker.ts +123 -70
- package/src/liveness.ts +1 -1
- package/src/parser.ts +66 -5
- package/src/prover/smt/solver/asserted-formulas.ts +2 -0
- package/src/prover/smt/solver/ast.ts +3 -0
- package/src/prover/smt/solver/bit-blast-tactic.ts +1 -1
- package/src/prover/smt/solver/context.ts +21 -6
- package/src/prover/smt/solver/dependent-expr-state.ts +2 -1
- package/src/prover/smt/solver/dt2bv-tactic.ts +21 -1
- package/src/prover/smt/solver/fd-solver.ts +568 -208
- package/src/prover/smt/solver/logic-tactics.ts +6 -3
- package/src/prover/smt/solver/lp/core-solver.ts +12 -8
- package/src/prover/smt/solver/lp/lar-solver.ts +1 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -1
- package/src/prover/smt/solver/rlimit.ts +3 -3
- package/src/prover/smt/solver/sat/goal2sat.ts +65 -11
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +51 -18
- package/src/prover/smt/solver/sat/pb-constraint.ts +7 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +25 -6
- package/src/prover/smt/solver/sat/sat2goal.ts +66 -45
- package/src/prover/smt/solver/sat/solver.ts +2 -0
- package/src/prover/smt/solver/smt-setup.ts +10 -3
- package/src/prover/smt/solver/smtlib-script.ts +53 -29
- package/src/prover/smt/solver/tactic.ts +18 -6
- package/src/prover/smt/solver/theory-lra-state.ts +1 -1
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/resolve.ts +242 -45
- package/src/sany/generation.ts +3 -2
- package/src/sany/generator-def-entries.ts +123 -36
- package/src/sany/generator-definitions.ts +2 -2
- package/src/sany/generator-expressions.ts +22 -7
- package/src/sany/generator-proofs.ts +12 -9
- package/src/sany/generator.ts +10 -5
- package/src/sany/lexer.ts +12 -4
- package/src/search.ts +84 -9
- package/src/simulate.ts +114 -124
- package/src/standard-definitions.ts +1 -0
- package/src/subexpressions.ts +58 -27
- package/src/successors.ts +27 -10
- package/src/tlc/replay.ts +40 -29
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +8 -4
- package/src/values.ts +15 -1
package/dist/transfer.cjs
CHANGED
|
@@ -6,20 +6,20 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs");let t=require("node:zlib");const n
|
|
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
|
-
`),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),T=/----+ *MODULE/y,le=[/_\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],ue=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`)),de=ue(String.raw`\.\/\\`),fe=ue(String.raw`\.\\\/`),E=String.raw`<(?:[0-9]+|\+|\*)>`,D=[[`_BM0`,[T]],[`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`,de],[`BOR`,fe],[`IDENTIFIER`,le],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${E}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(E,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${E}(?:\*\.*|-\.*|\.+)`,`y`)]]],O=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[T]]],k=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[T]],[`BAND`,de],[`BOR`,fe],[`IDENTIFIER`,le]],pe=(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=>pe(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(D,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===`
|
|
9
|
+
const e=require("./worker.cjs");let t=require("node:zlib");const n=[[`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`]],r=n.map(e=>e[0]),i=new Map(r.map((e,t)=>[e,t]).reverse()),a=t=>{let n=i.get(t);if(n===void 0)throw new e.b(`Unknown SANY token kind ${t}`);return n},o=new Map(n.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),s=Math.max(...[...o.keys()].map(e=>e.length)),c=Array.from({length:s},(e,t)=>s-t),l=/----+ *MODULE/y,u=[/_\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],d=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`)),f=d(String.raw`\.\/\\`),p=d(String.raw`\.\\\/`),m=String.raw`<(?:[0-9]+|\+|\*)>`,h=[[`_BM0`,[l]],[`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`,f],[`BOR`,p],[`IDENTIFIER`,u],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${m}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(m,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${m}(?:\*\.*|-\.*|\.+)`,`y`)]]],g=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[l]]],_=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[l]],[`BAND`,f],[`BOR`,p],[`IDENTIFIER`,u]],v=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),ee=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,y=(e,t,n)=>e.map(e=>({kind:a(e[0]),length:Math.max(...e[1].map(e=>v(e,t,n)))})).reduce(ee,{kind:-1,length:0}),b=(e,t)=>{let n=c.find(n=>o.has(e.slice(t,t+n))),r=y(h,e,t);return n===void 0?r:ee(r,{kind:o.get(e.slice(t,t+n))??-1,length:n})},x=e=>e+8-e%8,te=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
10
|
`?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
|
|
14
|
-
`?o=!0:s===` `&&(i=
|
|
15
|
-
`||e[a]===`\r`?
|
|
16
|
-
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=
|
|
17
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),
|
|
11
|
+
`?o=!0:s===` `&&(i=x(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},S=e=>{let t=te(e);return{line:t.lines[e.length-1]??0,column:t.columns[e.length-1]??0}},ne=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,re=new Set([...o.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),ie=(e,t)=>{let n=0;for(;re.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,v(ne,e,t)))},ae=e=>{let t=te(e),n=0,i=`DEFAULT`,o=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),s=()=>o(a(`EOF`),e.length-1,0),c=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?w(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
12
|
+
`||e[a]===`\r`?w(o+1,0,void 0,i):w(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},l=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return c(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:c(i,a,``)},u=t=>{for(;n<e.length;){let a=y(t,e,n);if(a.length>0){let e=o(a.kind,n,a.length);return n+=a.length,r[a.kind].startsWith(`_BM`)&&(i=`SPEC`),r[a.kind]===`BEGIN_PRAGMA`&&(i=`PRAGMA`),e}n++}return s()};return()=>{if(i===`DEFAULT`)return u(g);if(i===`PRAGMA`)return u(_);for(;n<e.length;){let t=n;if(`
|
|
13
|
+
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=l();if(e!==void 0)return e}else{let r=b(e,t);if(r.length===0){let n=ie(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 c(t,r,a)}let i=o(r.kind,t,r.length);return n+=r.length,i}}return s()}},C=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
14
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),oe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>C.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),w=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${oe(n)}" (${n.charCodeAt(0)}), `}after : "${oe(r)}"`,se=e=>{let t=ae(e);for(let e=t();typeof e!=`string`&&e.kind!==a(`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===` `?x(e):e+1,e.beginColumn);return w(e.beginLine,n,e.image[t],e.image.slice(0,t))}},ce=/* @__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(`.`)),le=/* @__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`]]),ue=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),T=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),E=/* @__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`]]),D=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),de=e=>e.startsWith(`\\`)?parseInt(e.slice(2),D.get(e[1].toLowerCase())):Number(e),O=/-{4,} *MODULE\b/,fe=/* @__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)fe[n.charCodeAt(0)]|=e});const pe=(e,t)=>e<128&&(fe[e]&t)!==0,me=(e,t,n)=>{let r=t;for(;pe(e.charCodeAt(r),n);)r++;return r},he=/* @__PURE__ */ new Map;T.forEach(e=>{let t=e.charCodeAt(0),n=he.get(t)??[];n.push(e),he.set(t,n)});const ge=(e,t)=>{let n=he.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]}},_e=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(E.has(n))return n;let r=e[t];return E.has(r)?r:void 0},ve=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&pe(e.charCodeAt(t+1),2)){let n=e.slice(t+1,me(e,t+1,2)),r=n.length;for(;r>0&&!le.has(n.slice(0,r));)r--;let i=le.get(n.slice(0,r));return{text:i??`\\`,length:i===void 0?1:r+1}}let r=_e(e,t);if(r!==void 0)return{text:E.get(r)??``,length:r.length};let i=ge(e,t);return i?{text:ue.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},k=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ye=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>E.has(e)||k.has(e));return n===void 0?void 0:{text:n,length:n.length}},be=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},xe=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:me(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?me(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return be(e,s?o+1:o,e=>e===`.`)-t},Se=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Ce={n:`
|
|
15
|
+
`,t:` `,r:`\r`,f:`\f`},we=(e,t)=>t===9?e+8-e%8:e+1,Te=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),Ee=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=Te.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=me(e,t+2,i);return a===t+2?0:a-t},De=(t,n=!1)=>{let r=O.exec(t);if(!r){let n=S(t),r=`Expected a module header such as ---- MODULE Name ----`;throw new e.I(`${r} at line ${n.line}, column ${n.column}`,void 0,{reason:r,line:n.line,column:n.column,isEnd:!0})}let i=[],a=/* @__PURE__ */ new Map,o=t.slice(0,r.index).split(`
|
|
16
|
+
`),s=r.index,c=o.length,l=r.index-o[o.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==l||f>s)&&(d=l,f=l,p=0);f<s;f++)p=we(p,t.charCodeAt(f));return we(p,t.charCodeAt(s))},h=(e,t,n,r)=>{let a=m();i.push({kind:e,text:t,spelling:r,line:c,column:a,endColumn:a+n-1}),s+=n},g=e=>{for(let n=0;n<e;n++)t.charCodeAt(s)===10&&(c++,l=s+1),s++},_=n=>new e.I(`${n} at line ${c}, column ${m()}`,void 0,{reason:n,line:c,column:m(),isEnd:s>=t.length});for(;s<t.length;){let e=t.charCodeAt(s);if(e===10||e===32||e===9||e===13){g(1);continue}if(e===92&&t.charCodeAt(s+1)===42){g(be(t,s,e=>e!==`
|
|
17
|
+
`&&e!==`\r`)-s);continue}if(e===40&&t.charCodeAt(s+1)===42){let e=0;do{if(s>=t.length)throw _(`Unterminated comment`);t.startsWith(`(*`,s)?(e++,g(2)):t.startsWith(`*)`,s)?(e--,g(2)):g(1)}while(e>0);continue}if(e===45&&t.startsWith(`----`,s)){let e=be(t,s,e=>e===`-`)-s,n=be(t,s+e,e=>e===` `);t.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,s)){if(h(`ModuleEnd`,`====`,be(t,s,e=>e===`=`)-s),u--,u<=0)break;continue}if(e===34){let e=c,n=m(),r=[];for(g(1);t.charCodeAt(s)!==34;){let e=t.charCodeAt(s);if(s>=t.length||e===10||e===13)throw _(`Unterminated string`);if(e===92){let e=t[s+1];if(e===void 0||!`ntrf\\"`.includes(e))throw _(`Invalid escape in string`);r.push(Ce[e]??e),g(2)}else r.push(t[s]),g(1)}g(1),i.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:m()-1});continue}let r=Ee(t,s,n);if(r>0){h(`Number`,t.slice(s,s+r),r);continue}if(pe(e,7)){let n=me(t,s,7),r=t.slice(s,n),i=me(t,s,1);if(i===n){let e=t.charCodeAt(n)===46?me(t,n+1,1):n,i=e>n+1,a=i?t.slice(s,e):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let n=e===95?`_`:t.slice(s,i);h(n===`_`?`Operator`:`Number`,n,n.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let o=a.get(r)??r;a.set(o,o),h(ce.has(r)?`Keyword`:`Identifier`,o,r.length);continue}let o=t[s];if(e>=128&&k.has(o)){h(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(e===60){let e=xe(t,s,n);if(e>0){h(`Step`,t.slice(s,s+e),e);continue}}let l=ve(t,s);if(l){let e=t.slice(s,s+l.length);h(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw _(`Unexpected character ${JSON.stringify(o)}`)}let v=m();return i.push({kind:`End`,text:``,line:c,column:v,endColumn:v}),i},Oe=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],ke=/* @__PURE__ */ new Set([...Oe,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Ae=[`TYPE`,`TYPE_CONSTRAINT`],je=/* @__PURE__ */ new Set([...Oe,...Ae]),Me=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Ne=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},Pe=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:w(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:w(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=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:[]);case`Selection`:return[e.expression]}},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
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=Ne(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Ee(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=ye(e,n)??ve(e,n),m=Me.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},Fe=(t,n)=>new e.v(`TLC found an error in the configuration file at line ${t}\n${n}`),Ie=(e,t)=>Fe(e,`The keyword ${t} appeared twice.`),Le=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Re=/* @__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`]]),ze=(t,n=`master`)=>{let r=n===`1.7.4`?je:ke,i=Pe(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.at(new e.v(`${e.$(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),e.nt.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 Fe(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 Fe(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Fe(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Fe(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 Fe(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Fe(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 Fe(t,``);r=l()}if(r.text!==`=`)throw Fe(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)?Le.get(e):void 0,i=r.has(e)?Re.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Fe(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 Ie(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 Fe(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Ie(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!Ae.includes(e))throw Fe(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Ie(t,e);c.add(e),h=l()}}return o},Be=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Ve=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(Be),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:[]);case`Selection`:return[e.expression]}},He=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`,Ue=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},We=e=>{let t=Ue(e);return t^t>>>16},Ge=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:We(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},Ke={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:` `}},qe=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},Je=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ye=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Xe=e=>{let t=t=>{let n=be(e,t,qe);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=be(e,t,Je);if(e.startsWith(`..`,n)&&Je(e[n+2]))return{kind:`Constant`,first:t,last:be(e,n+2,Je)-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=Je(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:be(e,t+1,Je)-1,children:[]};if(Ye(n))return{kind:`Constant`,first:t,last:be(e,t,Ye)-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:Xe(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=Ke[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},Ze={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},Qe={none:0,error:1,warning:3,state:4},$e={0:``,1:`Error: `,3:`Warning: `,4:`State `},et=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${$e[n]}${r}`,tt=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===Qe.warning;if(o&&t.errorCodes?.includes(r))throw new e.H(r,a);if(o&&t.isWarningEnabled===!1||i!==Qe.error&&t.suppressedCodes?.includes(r))return;let s=o&&!t.isTool&&n.size===0?`
|
|
20
|
+
(Use the -nowarning option to disable this warning.)`:``,c=et(t.isTool,r,i,`${a}${s}`);o&&n.has(c)||(o&&n.add(c),console.log(c))}}},nt=`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.`,
|
|
22
|
+
a module imported with a parameterized INSTANCE statement.`,rt=[[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,
|
|
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,nt,!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,17 +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
|
|
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 it;const at=()=>it??=rt.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),M=/^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)\)\./,ot=e=>M.test(e)?void 0:at().find(t=>t.pattern.test(e))?.message,st=t=>t instanceof e.A||ot(t.message)?.isEvalException===!0,ct=/* @__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
|
-
`]]),
|
|
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`:(
|
|
72
|
+
`]]),lt=(e,t,n)=>{let r=n?ct.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)}${ut(t.slice(a),n)}`},ut=(e,t)=>{let n=t?ot(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Qe.none} @!@!@\n${lt(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},dt=(e,t=2)=>String(e).padStart(t,`0`),ft=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 ${dt(r%24)}h`:e>36e5?`${dt(r%24)}h ${dt(n)}min`:e>6e4?`${dt(n)}min ${dt(t)}s`:`${dt(t)}s`},pt=e=>`${e.getFullYear()}-${dt(e.getMonth()+1)}-${dt(e.getDate())} ${dt(e.getHours())}:${dt(e.getMinutes())}:${dt(e.getSeconds())}`,mt=/* @__PURE__ */ new WeakMap,ht=(t,n,r)=>{if(!(t instanceof e.x))return t;let i=e.at(new e.x(`${r}\n${t.message}`,t),e.Q(t));return mt.set(i,{code:n,headline:r,inner:t}),i},gt=e=>mt.has(e),_t=e.$(`util.WrongInvocationException`),vt=e.K.slice(0,e.K.indexOf(`
|
|
73
|
+
`)),yt=`${e.K}tlc2.tool.EvalException: `,bt=`${e.K}util.Assert$TLCRuntimeException: `,xt=e=>st(e)?yt:bt,St=t=>{try{return t()}catch(t){throw t instanceof e.x?st(t)?new e.x(`${e.G}${t.message}`):ot(t.message)?t:new e.x(`${e.K}${t.message}`):t}},Ct=[yt,bt,e.K,e.G],wt=(t,n)=>{let r=mt.get(t);if(r)return`${r.headline}\n${wt(r.inner,n)}`;let i=t.message;if(t instanceof e.B)return i;let a=Ct.find(e=>i.startsWith(e))??``;return`${a}${ut(i.slice(a.length),n)}`},Tt=(t,n)=>{let r=mt.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:wt(t,!0)};if(t instanceof e.F)return{code:n?Ze.stackOverflow:Ze.general,message:i,toolMessage:i};if(n&&st(t))return{code:ot(i)?.code??Ze.general,message:i,toolMessage:i};let a=n&&!i.startsWith(vt)&&!(t instanceof e.B),o=t instanceof e.P?_t:e.K,s=a?o:``;return{code:Ze.general,message:`${s}${i}`,toolMessage:`${s}${wt(t,!0)}`}},Et=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Dt=2147483647,Ot=1e6;let kt=Ot;const At=()=>kt,jt=()=>Math.max(kt,10),Mt=()=>`Attempted to construct a set with too many elements (>${kt}).`,Nt=(t,n)=>{if(t.length===jt())throw new e.P(Mt());t.push(n)},Pt=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=jt(),Ft=(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`,It=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),Lt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Rt=e=>typeof e==`object`&&e.kind===`ModelValue`,zt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Bt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:N(e)?`set`:`function`,Vt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let Ht=!1;const Ut=(e,t)=>(Ht=!0,e.writtenKeys=t,e),Wt=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Gt=e=>Wt(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Kt=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Gt(e),qt=(e,t,n,r)=>Ut(Br(e,t.map(e=>n[e])),r),Jt=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(Jt);e.writtenKeys=void 0,e.range.forEach(Jt)}},Yt=e=>{Ht&&typeof e==`object`&&e.kind===`Function`&&(e.writtenKeys=void 0)},Xt=e=>e.every(e=>typeof e==`string`),Zt=(e,t)=>e.length>0&&t.length>0&&Xt(e)!==Xt(t),Qt=(e,t)=>{Ht&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Zt(n,r)?lr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Tn(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:Tn(t,n);if(r!==0)return r}return 0},$t=(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=Tn(n[e],r[e]);if(t!==0)return t}return 0},en=e=>Rt(e)?e.type:void 0,tn=(t,n,r)=>{let i=en(t),a=en(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(Rt(t)&&Rt(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))}`)},nn=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),rn=nn(),an=e=>{Object.assign(rn,nn()),En.clear();for(let t of e)hn(t)},on=()=>{rn.searchRank=rn.size},sn=()=>rn.unorderedString;let cn=!1;const ln={isExpanded:!0,isViewPrinted:!1},un=e=>{cn=e.version===`1.7.4`,kt=e.maxSetSize??Ot,ln.isExpanded=e.isLazyValueExpanded??!0,ln.isViewPrinted=e.isViewPrinted??!1},dn=/* @__PURE__ */ new WeakMap,fn=(e,t)=>(ln.isViewPrinted&&dn.set(e,t),e),pn=/* @__PURE__ */ new WeakMap,mn=(e,t)=>(pn.set(e,t),e),hn=e=>(rn.ranks[e]===void 0&&(rn.ranks[e]=rn.size++),e),gn=e=>rn.ranks[hn(e)],_n=(e,t)=>{if(e===t)return 0;let n=rn.ranks,r=n[e],i=n[t],a=rn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(rn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},vn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),yn=(e,t)=>(vn(e)||vn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),bn=(t,n)=>new e.x(vn(t)?`Attempted to compare overridden value ${j(L(t,!0))} with non-overridden value:\n${j(L(n))}`:`Attempted to compare ${Bt(t)} ${L(t)} with ${Bt(n)} ${L(n)}`),xn=(t,n,r)=>{if(!vn(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(!vn(n))throw bn(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))}`)},Sn={kind:`InfiniteSet`,name:`Any`},Cn=t=>{throw new e.A(`Attempted to compare ANY with the value\n${j(L(t))}`)},wn=e=>{Ht&&Jt(e),e===Sn&&Cn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},Tn=(e,t)=>{if(e===t)return wn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Qt(e,t);if(n===`Set`&&r===`Set`)return $t(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&&tn(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return tn(e,t,!1),n===`ModelValue`?-1:1;if(e===Sn||t===Sn)return Cn(e===Sn?t:e);if(N(e)&&N(t)&&yn(e,t))return xn(e,t,`compare`);let i=N(e);if(i!==N(t))throw bn(e,t);if(n===`Interval`&&r===`Set`){let n=ui(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-ui(t);if(n!==0)return n}return i?$t(F(e),F(t)):Qt(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return _n(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(tn(e,t,!1),Rt(e))return-1;if(Rt(t))return 1;throw bn(e,t)},En=/* @__PURE__ */ new Map,Dn=32768,On=t=>{let n=En.get(t);if(n)return n;if(En.size===Dn)throw new e.S(`TLC supports at most ${Dn} 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:gn(t),hash:Ui(Wi(Gi(t),109)),fingerprint:ea(ta(t)^60)};return En.set(t,r),r},kn=()=>[...En.values()],An=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),jn=e=>{let t=An(e);return t.isNormalized=!0,t},Mn=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let Nn=!1;const Pn=(e,t)=>(t===`lambda`&&(Nn=!0),t!==void 0&&(e.functionClass=t),e),Fn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,In=e=>Pn(e,`lambda`),Ln=e=>Et(e)&&e.isCached===!0;let Rn=!1;const zn=e=>(Rn=!0,e),Bn=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Vn=e=>{Rn&&typeof e==`object`&&Et(e)&&Bn.has(e.kind)&&(e.isCached=!0)},Hn=e=>{(Nn||Rn)&&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(Hn),e.range.forEach(Hn)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Hn):N(e)&&P(e)&&(Vn(e),F(e).elements.forEach(Hn))))},Un=(e,t)=>{if(Vn(e),e===t)return wn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&tn(e,t,!0),Tn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Qt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return $t(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&ui(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==ui(t))return!1;if(Rt(e)||Rt(t))return e.kind===`LazyFunction`&&I(e),tn(e,t,!0),Rt(e)&&Rt(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Un(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=si(e.domain),r=si(t.domain);if(n||r)return n===r;let i=si(e.range),a=si(t.range);return i||a?i===a:Un(e.domain,t.domain)&&Un(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(si(e))return si(t);if(si(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]&&Un(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return si(e)?si(t):!si(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Un(e,t.factors[n]));let n=N(e)&&N(t)&&!(P(e)&&P(t));if(n&&yn(e,t))return xn(e,t,`check equality of`)===0;if(n){if(!vn(e)){let n=F(e);if(!vn(t))return $t(n,F(t))===0}return oa(e)===oa(t)}return Tn(e,t)===0},Wn=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):oa(n)===oa(r);return n},Gn=Wn(!1),Kn=Wn(!0),qn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Jn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=$i(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Kn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Kn(i[e],n))return i[e]}return n.kind===`Set`?qn(n.elements,t):(qn(n.domain,t),qn(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}},Yn=(e,t)=>t.length===0||Fn(e)===`tuple`?1:Bi(t)?.low,Xn=e=>{if(!Lt(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Yn(e,t.domain)}},Zn=e=>{if(!Lt(e))return;let t=I(e);return Xt(t.domain)?t:void 0},Qn=(e,t,n)=>(tn(t,e,n),1),$n={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`}},er=(e,t,n)=>{let r=$n[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))}`},tr=e=>e?`check equality of`:`compare`,nr=(t,n,r,i)=>{let a=Xn(r);if(!a){if(Rt(r))return Qn(r,n,i);throw new e.x(`Attempted to ${tr(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=()=>rr(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 rr(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()},rr=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=cr(e[r],t[r],n);if(i!==0)return i}return 0},ir=(t,n,r)=>{let i=I(t);if(Fn(t)===`tuple`){let e=Lt(n)?hi(n):void 0;return e?i.range.length-e.length||rr(i.range,e,r):nr({...i,low:1},t,n,r)}if(Fn(t)===`record`){let a=Zn(n);if(!a){if(Rt(n))return Qn(n,t,r);throw new e.x(`Attempted to ${tr(r)} record:\n${j(L(t))}\nwith non-record\n${j(L(n))}`)}return i.domain.length-a.domain.length||rr(i.domain,a.domain,r)||rr(i.range,a.range,r)}return nr({...i,low:Yn(t,i.domain)},t,n,r)},ar=(e,t)=>vn(e)||vn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),or=(e,t)=>{let n=zt(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},sr=(t,n,r)=>{if(ar(t,n))return r?+!Un(t,n):Tn(t,n);if(!zt(t))return sr(F(t),n,r);if(!N(n)){if(Rt(n))return Qn(n,t,r);throw new e.x(`Attempted to ${tr(r)} the set ${j(L(t))} with the value:\n${j(L(n))}`)}let i=or(t,n);return i.elements.length-i.otherElements.length||rr(i.elements,i.otherElements,r)},cr=(t,n,r)=>{if(typeof t!=`object`){if(typeof n==typeof t)return r?t===n?0:1:Tn(t,n);if(Rt(n))return Qn(n,t,r);throw new e.x(er(t,n,r))}return t.kind===`ModelValue`?(t.type!==void 0&&tn(t,n,r),Rt(n)?r?t.name===n.name?0:1:t.rank-n.rank:-1):Lt(t)?ir(t,n,r):sr(t,n,r)},lr=(e,t)=>cr(e,t,!1),ur=(e,t)=>cr(e,t,!0)===0,dr=e=>{let t=[];for(let n of e){let e=pr(n,t);e.isFound||t.splice(e.index,0,n)}return t},fr=(e,t)=>{let n=_i.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},pr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=fr(e,()=>lr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},mr=(e,t)=>t.some(t=>fr(t,()=>ur(t,e))),hr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,gr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(gr)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(gr),e.range.forEach(gr)))},_r=e=>{if(!(typeof e!=`object`||Ln(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return _r(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(_r(e.left),_r(e.right));case`FunctionSet`:return _r(e.domain),_r(e.range);case`RecordSet`:return e.sets.forEach(_r);case`ProductSet`:return e.factors.forEach(_r)}},vr=(e,t)=>vi(Un,ur,e,t),yr=e=>{for(let t=1;t<e.length;t++)if(Tn(e[t-1],e[t])>=0)return!1;return!0},br=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},xr=e=>{for(let t=1;t<e.length;t++)Vn(e[t]);if(e.length<2||yr(e))return An(e);let t=[...e].sort(Tn),n=[t[0]];for(let e=1;e<t.length;e++)Tn(n[n.length-1],t[e])!==0&&n.push(t[e]);return An(n)},Sr=e=>{if(br(e))return An(e);let t=vi(xr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Cr=An([]),wr=(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&&Tn(r[a],t)<0;)a++;a<r.length&&Tn(r[a],t)===0||i.push(t)}return i.length===n.length?e:An(i)},Tr=(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&&Tn(r[a],t)<0;)a++;a<r.length&&Tn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:An(i)},Er=(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=Tn(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=An(i);if(e.hash!==0&&e.hash!==Ji){let t=e.hash,n=0;for(;n<a.length;n++){let e=$i(a[n]);if(e===Ji)break;t=t+Ki(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+na(a[e])|0;c.fingerprint=t}return c},Dr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Tn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Tn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Mn(n,r)},Or=e=>{let t=Dr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:Ut(t,e.map(e=>e[0]))},kr=[],Ar=/* @__PURE__ */ new Map,jr=[],Mr=/* @__PURE__ */ new WeakMap,Nr=e=>{let t=kr[e]??Ar.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Ar.set(e,new WeakRef(n)):kr[e]=n,n},Pr=e=>{if(ui(e),e.low===1&&e.high>=1)return Nr(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Fr=e=>e.length>0&&(e===kr[e.length]||e===Ar.get(e.length)?.deref())||Mr.has(e),Ir=e=>{let t=F(e).elements;return Fr(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Lr=e=>{let t=jr[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return jr[e]=n,n},Rr=e=>Pn(Mn(Nr(e.length),e),`tuple`),zr=e=>Pn(Dr(e),`record`),Br=(e,t)=>Pn(Mn(e,t),`record`),Vr=e=>N(e)&&!vn(e),Hr=(e,t=!1)=>`UNION(${L(e.base,t)})`,Ur=(t,n=e=>F(e).elements)=>{if(!Vr(t.base))throw new e.x(`Attempted to enumerate the nonenumerable set:\n${Hr(t)}`);return n(t.base)},Wr=(t,n,r)=>{if(Vr(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(Hr(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)||Gr(e.domain)===!0||Gr(e)===!0;case`RecordSet`:return e.sets.every(P)||Gr(e)===!0;case`ProductSet`:return e.factors.every(P)||Gr(e)===!0;case`Union`:return P(e.base)&&(zt(e.base)?hr(e.base):ni(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}},Gr=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=Gr(e.domain);return t===void 0?void 0:!t&&Gr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Gr(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}},Kr=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},qr=(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},Jr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||vn(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=[]:qr(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return An(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)})},Yr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(An(r.map(t=>e[t])));while(qr(r,e.length))}return t},Xr=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(vn(o))throw new e.x(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Zr=(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 dr(t.elements);case`Interval`:{let e=Pr(t);return e!==kr[e.length]&&Mr.set(e,t),e}case`Subset`:{if(ui(t.base)===0)return Yr([]);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(li(t));return Yr(n)}case`FunctionSet`:{if(!cn&&si(t))return[];if(vn(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=Ir(t.domain);if((r.length>0||cn)&&vn(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 Kr(r.map(()=>i)).map(e=>Mn(r,e))}case`RecordSet`:{if(!cn&&si(t))return[];let e=Xr(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 Kr(e).map(e=>zr(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!cn&&si(t))return[];let e=Xr(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 Kr(e).map(Rr)}case`FilteredSet`:if(!N(t.base)||vn(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(Sr(ni(t.base).filter(t.startPass?.(!0)??(e=>t.test(e,!1))))).elements;case`Union`:{let n=[];return Ur(t).forEach((r,i)=>{let a=Wr(r,i,t);if(Pt(a))throw new e.P(Mt());ni(a).forEach(e=>Nt(n,e))}),F(Sr(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!Vr(t.left)&&!Vr(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===`\\`&&!Vr(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(Sr($r(t))).elements;let n=t.operator===`\\`||Vr(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return Ft(typeof r==`object`&&r.kind===`Interval`?r:ni(r),e=>{bi(e,i)===(t.operator===`\\cap`)&&Nt(a,e)}),F(Sr(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 An(Zr(e));let t=typeof e==`object`&&Et(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=_i.sets;n?.push(e);let r=Zr(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`)?An(r):xr(r);return t&&(t.enumerated=i),i},Qr=e=>{if(!(typeof e!=`object`||Ln(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return Vr(e.base)||F(e),Qr(e.base);case`Union`:if(!zt(e.base)&&Vr(e.base))return Qr(e.base);Ur(e).slice(0,1).forEach(t=>Qr(Wr(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!Vr(e.left)&&F(e),e.operator!==`\\cup`||Vr(e.left)&&Vr(e.right)||F(e),e.operator!==`\\cap`||Vr(e.left)?Qr(e.left):Qr(e.right),e.operator===`\\cup`&&Qr(e.right)}},$r=t=>{if(!Vr(t.left)||!Vr(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(Qr(t.left),Qr(t.right),Pt(t.left))throw new e.P(Mt());let n=ni(t.left),r=Pt(t.right)?void 0:ni(t.right);if(!r||n.length+r.length>jt())throw new e.P(Mt());return[...n,...r]},ei=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=fr(e,()=>$r(e)),n=F(Sr(t)).elements;return e.enumerated=An(n),n},ti=(e,t)=>{if(typeof e!=`object`||Ln(e))return F(e).elements.some(t);let n=_i.sets;n?.push(e),Qr(e);let r=oi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},ni=e=>{let t=[];return ti(e,e=>(t.push(e),!1)),t},ri=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ii=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ii);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ii)&&e.range.every(ii);case`SetOperation`:return e.operator!==`\\cup`&&ii(e.left)&&ii(e.right);case`FilteredSet`:return ii(e.base);case`ProductSet`:return e.factors.every(ii);default:return!1}},ai=e=>typeof e!=`object`||Ln(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ai(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ai(e.left)||ai(e.right):ri(e)?.some(ai)??!1,oi=(e,t)=>{if(e.kind===`Union`)return Ur(e,ni).some((n,r)=>ti(Wr(n,r,e),t));if(e.kind===`FilteredSet`&&Vr(e.base)){let n=e.startPass?.(!1);return n?ti(e.base,e=>n(e)&&t(e)):ti(e.base,n=>e.test(n,!1)&&t(n))}if(ri(e)?.some(ai))return Zr(e,ni).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!Vr(e.left)||!Vr(e.right)?F(e).elements.some(t):ti(e.left,t)||ti(e.right,t);let n=e.operator===`\\`||Vr(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return Vr(r)?ti(r,n=>bi(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},si=t=>{if(typeof t!=`object`||!N(t))throw _i.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(si);case`RecordSet`:return t.sets.some(si);case`FunctionSet`:return!si(t.domain)&&si(t.range);case`Union`:return Ur(t).every((e,n)=>si(Wr(e,n,t)));default:return F(t).elements.length===0}},ci=(t,n,r)=>t.reduce((t,i)=>{let a=t*ui(i,n);if(a>2147483647)throw new e.x(r());return a},1),li=e=>`Overflow when computing the number of elements in:\n${j(L(e))}`,ui=(t,n)=>{if(typeof t!=`object`)throw new e.x(`Attempted to compute the number of elements in the ${Bt(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 ui(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=ui(t.base,n);if(r>=31)throw new e.x(li(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(si(t.domain))return 1;if(si(t.range))return 0;if(ui(t.range,n)===1)return 1}let r=ui(t.domain,n),i=ui(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(li(t));return a}case`RecordSet`:return n!==`1.7.4`&&si(t)?0:ci(t.sets,n,()=>li(t));case`ProductSet`:return n!==`1.7.4`&&si(t)?0:ci(t.factors,n,()=>`Overflow when computing the number of elements in ${j(L(t))}`);default:return Vn(t),F(t).elements.length}},di=e=>`Attempted to check if the set ${j(L(e))}is finite.`,fi=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.x(`Attempted to check if the ${Bt(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 fi(t.base)&&si(t.base);case`Subset`:return fi(t.base);case`FunctionSet`:{let e=fi(t.domain);if(e&&si(t.domain))return!0;let n=fi(t.range);return n&&si(t.range)?!0:n&&(e||ui(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!fi(t))n=!1;else if(si(t))return!0;return n}case`Union`:if(!Vr(t.base))throw new e.x(`Attempted to check if the nonenumerable set:\n${Hr(t)}\nis a finite set.`);return F(t.base).elements.every(fi);case`SetOperation`:if(t.operator===`\\cup`)return fi(t.left)&&fi(t.right);if(t.operator===`\\cap`){if(!fi(t.left)&&!fi(t.right))throw new e.x(di(t));return!0}if(fi(t.left))return!0;if(!fi(t.right))throw new e.x(di(t));return!1;case`FilteredSet`:if(!fi(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}},pi=(e,t,n=Tn)=>{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},mi=(t,n)=>{let r=t.elements;if(r.length>jt())throw new e.P(Mt());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=pi(r,e);return!i[t]&&(i[t]=!0,!0)}),o=An(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},hi=t=>{if(typeof t!=`object`||!Lt(t))return;if(t.kind===`LazyFunction`&&(!N(t.domain)||vn(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},gi=(e,t)=>{let n=`Attempted to check if the value:\n${j(L(e))}\nis an element of the`;if(!Lt(t))return`${n} ${Bt(t)} ${j(L(t))}`;let r=Fn(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))}`},_i={sets:void 0},vi=(t,n,r,i)=>{let a=_i.sets,o=_i.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)}},yi=e=>(_i.sets??[]).slice(e).some(e=>typeof e==`object`&&_i.callStack?.sources.has(e)===!0),bi=(e,t)=>{let n=_i.sets;if(n===void 0)return Ti(e,t);n.push(t);let r=Ti(e,t);return n.pop(),r},xi=(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},Si=(e,t)=>pi(t.elements,e)!==-1,Ci=(e,t)=>t.isNormalized?pr(e,t.elements).isFound:mr(e,hr(t)),wi=(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},Ti=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return xi(e,t)??Ei(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Ei(e,t)},Ei=(t,n)=>{if(!N(n))throw new e.x(gi(t,n));switch(n.kind){case`Set`:return Vn(t),vi(Si,Ci,t,n);case`MixedSet`:return mr(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!Rt(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(Rt(t))return wi(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)||vn(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=>bi(e,n.base));case`FunctionSet`:{if(!Lt(t)){if(Rt(t))return wi(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))}`)}Yt(t);let r=I(t),i=Yn(t,r.domain);return(i===void 0?vr(n.domain,An(r.domain)):vr({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>bi(e,n.range))}case`RecordSet`:{Yt(t);let r=Lt(t)?I(t):void 0;if(!r||!Xt(r.domain)){if(Rt(t))return wi(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=pi(r.domain,e);return i!==-1&&bi(r.range[i],n.sets[t])})}case`ProductSet`:{let r=Lt(t)?hi(t):void 0;if(r===void 0){let r=Lt(t)&&I(t).domain.every(e=>typeof e==`number`);if(Rt(t))return wi(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)=>bi(e,n.factors[t]))}case`FilteredSet`:try{return bi(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.x)||!st(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(!Vr(n.base))throw new e.x(`Attempted to check if:\n ${j(L(t))}\nis an element of the non-enumerable set:\n ${j(Hr(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=>bi(t,e))}case`SetOperation`:return n.operator===`\\cup`?bi(t,n.left)||bi(t,n.right):bi(t,n.left)&&bi(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=hi(t);if(r===void 0){if(Rt(t))return wi(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=>bi(e,n.base))}default:throw new e.x(gi(t,n))}},Di=(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?bi(e,n):e.range.every((e,r)=>Di(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)||ui(t.domain),!N(t.domain))throw new e.x(`The domains of formal parameters must be enumerable.`);let n=Ir(t.domain);return t.enumerated=Mn(n,n.map(e=>t.apply(e))),t.enumerated}throw new e.x(`Expected a function but found ${L(t)}`)},Oi=(e,t,n)=>{let r=j(L(e)),i=j(L(t)),a=n===`1.7.4`;switch(Fn(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.`}},ki=(e,t)=>{if(!cn)return Oi(e,t);let n=j(L(t));return Fn(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ai=(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},ji=t=>new e.x(`Attempted to apply function with integer domain to the non-integer argument ${j(L(t))}`),Mi=(e,t)=>pi(e.domain,t),Ni=(e,t,n)=>{let r=Wt(e);throw cn||r!==e.domain||r.length<32?r.forEach(e=>ur(e,t)):pi(r,t,lr),n},Pi=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=Fn(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&&!cn&&typeof n!=`number`&&Fr(i))throw ji(n)}let a=Ai(i,n);return a===-1?vi(Mi,Ni,t,n):a},Fi=(e,t,n,r)=>`In applying the function\n${j(L(e))},\nthe ${t} is:\n${j(L(n))}\nwhich ${r}.\n`,Ii=(t,n)=>new e.x(Fi(t,`argument list`,n,`does not match its formal parameter`)),Li=(t,n,r)=>{let i=t.domain,a=hi(r);if(a===void 0)throw Ii(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 Ii(t,r);let s=a[o],c=`argument number ${o+1}`;if(!bi(s,i.factors[o]))throw new e.x(Fi(t,c,s,n===void 0?`is not in the function's domain ${L(i)}`:`is not in its domain`));if(n!==void 0&&hi(s)?.length!==n)throw new e.x(Fi(t,c,s,`does not match its formal parameter`))}),a.length>n.length)throw Ii(t,r)},Ri=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!bi(t,e.lambdaDomain),zi=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return zi(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return Li(t,i,n),t.apply(n);if(!bi(n,t.domain))throw new e.x(Fn(t)===`lambda`?Oi(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??Oi;if(Ri(t,n))throw new e.x(i(t,n));let a=Pi(t,n,i);if(a===-1)throw new e.x(i(t,n));return t.range[a]},Bi=e=>Fr(e)?Mr.get(e)??Lr(e.length):void 0,Vi=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=Bi(t.domain);if(n)return n;let r=An(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Hi=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(t.boundTupleLengths!==void 0&&hi(n)===void 0)throw Ii(t,n);if(!bi(n,t.domain))return t;let e=r(t.apply(n));return Pn({kind:`LazyFunction`,domain:t.domain,apply:r=>vr(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},Fn(t))}if(!Lt(t))throw new e.x(`Attempted to apply EXCEPT construct to the value ${j(L(t))}.`);let a=I(t);if(Ri(a,n))return a;let o=Pi(a,n,ki);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=Pn(Mn(a.domain,s),Fn(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==Ji){let e=$i(l);if(e!==Ji){let t=$i(a.domain[o]);u.hash=c===l?a.hash:a.hash-qi(t,$i(c))+qi(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-ra(e,c)+ra(e,l)|0}return u},Ui=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Wi=(e,t)=>Math.imul(e^t,16777619),Gi=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Ui(t)},Ki=e=>Ui(e+2654435769|0),qi=(e,t)=>Ui(Math.imul(e,668265261)+t|0),Ji=795548749,Yi=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=$i(t[e]);if(r===Ji)return Ji;n=n+Ki(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=$i(e.domain[n]),i=$i(e.range[n]);if(r===Ji||i===Ji)return Ji;t=t+qi(r,i)|0}return t},Xi=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(Xi);return}let n=I(t);n.domain.forEach(Xi),n.range.forEach(Xi)},Zi=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{$i(t)===Ji&&Xi(t);return}catch(t){if(!(t instanceof e.x))throw t;return t}},Qi=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[]}},$i=e=>typeof e==`number`?Ui(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Gi(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Yi(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?$i(I(e)):Ji:P(e)?$i(F(e)):Ji,ea=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},ta=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return ea(t)},na=e=>ea(aa(e)+2135587861|0),ra=(e,t)=>ea(Math.imul(aa(e),374761393)+aa(t)|0),ia=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+na(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ra(e.domain[n],e.range[n])|0;return t},aa=e=>typeof e==`number`?ea(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?ta(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ia(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?aa(I(e)):P(e)?aa(F(e)):ta(oa(e)),oa=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):sa(e),sa=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${oa(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(oa).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${oa(e)}:${oa(n.range[t])}`).join(`,`)})`},ca={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},la=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ca[e])}"`,ua=1999,da=e=>e.reduce((e,t)=>e===0?0:e*ui(t),1),fa=e=>{if(e.kind===`Subset`)return ui(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=si(e.domain)?0:ui(e.domain);return(t===0?1:ui(e.range)**t)<=ua?F(e):void 0}return da(e.kind===`RecordSet`?e.sets:e.factors)<=ua?F(e):void 0},pa=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&Lt(t.base)&&(t.base.kind===`Function`||P(t.base.domain)))return fa(t);if(P(t))try{return fa(t)}catch(t){if(t instanceof e.x)return;throw t}},ma=(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 Hr(e,t)}},ha=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),ga=t=>{if(P(t.domain))try{return I(t)}catch(t){if(t instanceof e.x||e.tt(t))return;throw t}},_a=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||Fn(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 la(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=ln.isExpanded?pa(e,t):void 0;return n?r(n):ma(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?ln.isExpanded||!e.source?ga(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&&cn&&Fn(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Fn(e)!==`lambda`);if(i.domain.length===0&&Fn(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]]):Kt(i);return Fn(e)===`record`||i.domain.every(e=>typeof e==`string`&&ha(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},va=(t,n)=>{if(t===void 0)return!1;try{return Un(t,n)}catch(t){if(t instanceof e.x)return!1;throw t}},ya=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,ba=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(ya,(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`:(Ue(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},xa=(t,n)=>{let r=n?void 0:dn.get(t);if(r)return r();let i=Object.entries(t),a=pn.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],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`Selection`:m(e.expression,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:$v,negate:ey,equivalent:ty,body:ny,condition:(e,t)=>{if(typeof e!=`boolean`)throw Iv(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Lv(t,n,e);return e},apply:Li,expectFunction:Yv,tuple:Ir,set:br,record:Rr,writtenRecord:Kt,equal:Vn,enumerate:ly,choiceElements:Rb,noChoice:e=>{throw zb(e)},filterPredicate:Lb,isReducible:Ft,finiteElements:e=>F(e).elements,addBounded:Mt,normalizedSet:kn,isBeyondBound:Nt,cardinality:ci,functionDomain:Pr,sortedFunction:An,unassigned:(e,t)=>{throw Wv(e,t)},prime:ab,keepLazyContext:Xv,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>qv(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),e.kind!==`Selection`&&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,mb(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,Pb(t,e.environment))}(${i}, ${gs(e,t,r)});`,u=Ds(e,t.bound.set,r);r.locals.set(n,s);let d=Ib(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,jb(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=Iy(t.operator,e.environment);if(i?.kind!==`Builtin`)return _s(e,t,n);if(i.name===`DOMAIN`)return`${ps(e,Bv(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,Vv(t,i.evaluateBinary))}(${Ds(e,r[0],n)}, ${Ds(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&_b(r[0],a))return`${ps(e,i.evaluateUnary)}(${Ds(e,r[0],n)})`;let o=r.length===2&&_b(r[0],a)&&_b(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=qy(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=qy(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`:{Eb(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=zv(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,Rv(t))}(${r(t.record)})`;case`Record`:{let i=Vb(t.fields);if(Hb(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&&!Ab(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
|
-
`)}\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 ----------------------------
|
|
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||!va(n[e[0]],e[1])).map(t=>{let n=ba(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(``)},Sa=[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 Ca=Sa[0];const wa=()=>Ca,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),ja=/* @__PURE__ */ new Int32Array(256),Ma=/* @__PURE__ */ new Int32Array(256);let Na=0,Pa=0,Fa=0,Ia=0;const La=e=>{let t=(e^Ia)&255;Ia=(Ia>>>8|Fa<<24)^ka[t],Fa=Fa>>>8^Ta[t]},Ra=e=>{let t=Sa[e];Ca=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);Ta[e]=Number(BigInt.asIntN(32,t>>32n)),ka[e]=Number(BigInt.asIntN(32,t))}let i=[Ta,Ea,Da,Oa],a=[ka,Aa,ja,Ma];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)^ka[o],i[e][r]=t[r]>>>8^Ta[o]}}Na=Number(BigInt.asIntN(32,t>>32n)),Pa=Number(BigInt.asIntN(32,t))};Ra(0);const za=e=>{let t=Ia^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Ia=Fa^Ma[n]^ja[r]^Aa[i]^ka[a],Fa=Oa[n]^Da[r]^Ea[i]^Ta[a]},Ba=e=>{if(typeof e==`boolean`)return La(0),La(e?116:102),2;if(typeof e==`number`)return La(1),za(e),5;if(typeof e==`string`){La(3),za(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)za(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++)La(e.charCodeAt(n));return 5+e.length}return La(21),za(gn(e.name)+1),5},Va=e=>{let t=Fa,n=Ia;Fa=0,Ia=0;let r=[Ba(e),Fa,Ia];return Fa=t,Ia=n,r},Ha=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,Ua=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];`,Wa={integer:e=>`${Ha(`1`)} ${Ua(e)}`,boolean:e=>`${Ha(`0`)} ${Ha(`(${e} ? 116 : 102)`)}`,set:e=>`${Ha(`5`)} ${Ua(e)}`,function:e=>`${Ha(`9`)} ${Ua(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${Ua(`0`)} } for (; r > 0; r--) { ${Ha(`0`)} } h ^= ${t}; l ^= ${n}; }`},Ga=()=>({H0:Ta,H1:Ea,H2:Da,H3:Oa,L0:ka,L1:Aa,L2:ja,L3:Ma,initialHigh:Na,initialLow:Pa}),Ka=(e,t)=>{let n=Fa,r=Ia;Ia=e[0],Fa=e[1],Ya(t),e[0]=Ia,e[1]=Fa,Fa=n,Ia=r},qa=e=>{La(5),za(e)},Ja=e=>{La(9),za(e)},Ya=e=>{if(typeof e!=`object`||Rt(e))Ba(e);else if(Lt(e)){let t=I(e);Ja(t.domain.length);for(let e=0;e<t.domain.length;e++)Ya(t.domain[e]),Ya(t.range[e])}else{let t=F(e).elements;qa(t.length);for(let e of t)Ya(e)}},Xa=e=>{let t=Fa,n=Ia;Fa=Na,Ia=Pa;for(let t of e)Ya(t);let r=BigInt(Fa>>>0)<<32n|BigInt(Ia>>>0);return Fa=t,Ia=n,r},Za=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=Fa,a=Ia;for(let n=0;n<e;n++)Fa=Na,Ia=Pa,t(n),r[2*n]=Ia,r[2*n+1]=Fa;return Fa=i,Ia=a,n},Qa=(e,t)=>Za(e.length,n=>{for(let r of t)Ya(e[n][r])}),$a=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),eo=1024,to=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*eo),relations:[]}),no=(e,t)=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,coverage:t}),ro=(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},io=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,ao=(e,t,n,r,i)=>{let a=t===`next`?io(e,t,r):void 0;if(a!==void 0)return a;let o=ro(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},oo=(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,so=(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.X(o):`Unknown location`}`:oo(i.body.location.range,o)||!o?`${i.name} ${e.X(a)}`:`${i.name} ${e.X(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},co=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,lo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,uo=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},fo=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[(Ue(t.name)&2147483647)%e.length].unshift(t));t=e}t[(Ue(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},po=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),mo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),ho=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),go=(e,t,n)=>{let r=new Set(n.map(co)),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&&!$a.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=ro(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(co(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`?ho(t.bounds):t.params.map(e=>e.name);m(t.body,mo(n,e.scope)),t.kind===`Function`&&po(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,mo(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,mo(e.params,t));return;case`Selection`:m(e.expression,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)}),fo(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,lo(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,uo(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,lo(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,mo(ho(e.bounds),t)),r(po(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,mo(ho(e.bounds),t)),r(po(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,mo(ho([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,mo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,mo(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()})},_o=(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=_o(e,r,n);if(t!==-1)return t}}return-1},vo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=_o(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:_o(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},yo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},bo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},xo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},So=(e,t,n,r,i)=>{let a=It(n)?n:t!==`\\`&&It(r)?r:void 0;if(a===void 0||typeof i!=`object`)return i;let o=a===n?r:n;if(t===`\\cup`){if(si(a)||!It(o))return i;let t=e.values.get(o);t!==void 0&&(e.secondary[t]+=ui(o)+1)}let s=t===`\\cup`?void 0:e.values.get(a);if(e.values.get(i)===s)return i;let c=i===n||i===r||e.values.has(i)?{...i}:i;return s!==void 0&&e.values.set(c,s),c},Co=(e,t,n)=>{let r=0;return{next:()=>(t!==void 0&&e.secondary[t]++,r++<n),reset:()=>{r=0}}},wo=(e,t,n)=>{if(n.some(e=>si(e)))return{next:()=>!1,reset:()=>void 0};let r=n.map(t=>Eo(e,t,ui(t),!1)),i=()=>{for(let e=r.length-1;e>0;e--){if(r[e].next())return!0;r[e].reset(),r[e].next()}return r.length>0&&r[0].next()},a=!r.every(e=>e.next());return{next:()=>!a&&(e.secondary[t]+=Math.max(r.length,1),a=!i(),!0),reset:()=>{r.forEach(e=>{e.reset(),e.next()}),a=!1}}},To=(e,t)=>{let n=typeof t==`object`?e.values.get(t):void 0;if(n!==void 0&&typeof t==`object`){if(t.kind===`RecordSet`)return wo(e,n,t.sets);if(t.kind===`FunctionSet`)return wo(e,n,Array.from({length:ui(t.domain)},()=>t.range))}},Eo=(e,t,n,r)=>{let i=typeof t==`object`?e.values.get(t):void 0;if(typeof t==`object`&&(t.kind===`Subset`||!r&&t.kind===`FilteredSet`))return Co(e,void 0,n);let a=To(e,t);if(!a||i===void 0)return Co(e,i,n);if(!r)return a;let o=0;for(;a.next();)o++;return e.secondary[i]+=o,Co(e,i,o)},Do=(e,t,n)=>{let r=typeof t==`object`&&t.kind===`Subset`?e.values.get(t):void 0;r!==void 0&&typeof n==`object`&&e.values.set(n,r)},Oo=(e,t,n,r)=>{let i=Array.isArray(n)?n.length:n.high-n.low+1;return typeof t!=`object`||t.kind!==`Subset`||!Array.isArray(n)?Eo(e,t,i,r):(n.forEach(n=>Do(e,t,n)),Co(e,void 0,i))},ko=e=>(e.every(e=>e.next()),()=>{for(let t=0;t<e.length;t++){if(e[t].next()||t===e.length-1)return;e[t].reset(),e[t].next()}}),Ao=(e,t,n)=>ko(t.map((t,r)=>Oo(e,t,n[r],!0))),jo=(e,t,n)=>{let r=n.map(e=>ui(e)),i=ko(n.map((t,n)=>Eo(e,t,r[n],!1))),a=r.reduce((e,t)=>e*t,1);for(let e=0;e<a;e++)i();e.secondary[t]+=a},Mo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},No=(e,t)=>t.forEach((t,n)=>{let r=Xa([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*eo+i;e.registers[o]=Math.max(e.registers[o],Mo(a)+1)}),Po=(e,t)=>{let n=e.registers.subarray(t*eo,(t+1)*eo),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*eo*eo/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*eo?a===0?i:eo*Math.log(eo/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Fo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Io=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Fo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Lo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Ro=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],zo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Bo=(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}},Vo=(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||Ro(t,e))&&Lo(n,r),zo(t,e).forEach(e=>a(e).forEach(e=>Lo(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.X(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=zo(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>Lo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=Ro(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,Io(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 zo(t,n).forEach(e=>{a(e),c(e,0)}),r},Ho=[`init`,`next`,`invariant`,`constraint`,`implied`],Uo=(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,Wo=e=>Ho.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Uo(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Uo(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Go=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.X(a):`Unknown location`}`,distinct:Po(t,i)}}),relations:Wo(t).map(e=>({kind:e.kind,label:e.label,...Bo(t,e),expressions:Vo(t,e.node)}))}),Ko=(e,t,n)=>{let r=io(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]]]},qo=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Jo=(t,n)=>qo.has(t)?new e.x(n):new e.A(n),Yo=(t,n,r,i)=>new e.A(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${j(L(i))}`),Xo=(t,n,r=t)=>{if(!N(t)||vn(t))throw new e.A(`Applying ${n} to the following value,\nwhich is not a finite set:\n${j(L(r))}`);return F(t)},Zo=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Zo(r))throw Jo(n,`${n} expects a value as argument ${t+1}`);return r},Qo=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Jo(n,`${n} expects a boolean but received ${L(r)}`);return r},$o=(e,t,n)=>{let r=e[t];if(r===void 0||!Zo(r))throw Jo(n,`${n} expects an operator as argument ${t+1}`);return r},es=(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}),ts=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ns=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),rs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),is=e=>e>2147483647||e<-2147483648,as=t=>new e.A(`Overflow when computing ${t}`),os={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`},ss={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},cs={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`},ls={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},us=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ss[e.operator];if(e.kind!==`Function`)return os[e.kind];let t=Fn(e);return t===void 0?`FcnRcdValue`:ls[t]},ds=e=>cs[us(e)],fs=(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}`),ps=(t,n)=>{let r=r=>(...i)=>{let a=_i.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.x)||r instanceof e.y)throw r;let i=yi(a);throw _i.sets&&(_i.sets.length=a),t.isLazy!==!0&&r instanceof e.A&&!i?r:fs(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw fs(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},ms=(e,t)=>{if(typeof e!=`number`)throw fs(t,`Cannot cast tlc2.value.impl.${us(e)} to tlc2.value.impl.IntValue`);return e},hs=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,gs=(e,t,n,r)=>{let i=hs(e,n,`IntValue`,2);return rs(t,(e,n)=>{let a=ms(n,i),o=ms(e,i),s=r(o,a);if(is(s))throw as(`${o}${t}${a}`);return s})},_s=(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},vs=(e,t,n=e)=>rs(e,(e,r)=>t(_s(e,`first`,n),_s(r,`second`,n))),ys=(e,t,n)=>({...ns(e,t,n),isLazy:!0}),bs=(e,t,n)=>{let r=$o(e,t,n);return()=>r.call([])},xs=/* @__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(`,`),Ss=[[`\\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`,`≀`],[`^+`,`⁺`]],Cs=new Map(Ss.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),ws=e=>e.split(`!`).map(e=>Cs.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),Ts=/* @__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(`,`),Es=/* @__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(`.`),Ds=/* @__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(`.`),Os=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
78
77
|
Nat == { }
|
|
79
78
|
a+b == {a, b}
|
|
80
79
|
a-b == CHOOSE n : b + n = a
|
|
@@ -390,24 +389,28 @@ _CheckName(name) ==
|
|
|
390
389
|
=> (PrintT(counts) /\\ FALSE)
|
|
391
390
|
_PrintCounts == PrintT(_Counts)
|
|
392
391
|
=============================================================================
|
|
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=w(`EOF`),zs=w(`IDENTIFIER`),Bs=w(`DEFBREAK`),Vs=(e,t)=>Array.from({length:w(t)-w(e)+1},(t,n)=>w(e)+n),Hs=new Set(Vs(`op_57`,`op_119`)),Us=new Set(Vs(`op_1`,`op_119`)),Ws=new Set(Vs(`op_57`,`op_70`)),Gs=/* @__PURE__ */ new Set([...Vs(`ACTION`,`EXCEPT`),w(`EXTENDS`),...Vs(`IF`,`SF`),w(`STATE`),...Vs(`THEN`,`WITH`),w(`US`),...Vs(`op_112`,`op_116`)]),Ks=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),qs=new Map([...Ks(`postfix`,160,160,!0,`[`),...Ks(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Ks(`prefix`,120,120,!1,`-.`),...Ks(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Ks(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Ks(`prefix`,40,40,!0,`\\lnot`),...Ks(`nfix`,100,130,!0,`\\times`),...Ks(`infix`,140,140,!1,`^`,`^^`),...Ks(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Ks(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Ks(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Ks(`infix`,100,110,!0,`|`,`||`,`%%`),...Ks(`infix`,100,110,!1,`%`),...Ks(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Ks(`infix`,90,140,!1,`\\wr`),...Ks(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Ks(`infix`,90,130,!1,`!!`),...Ks(`infix`,90,90,!1,`...`,`..`),...Ks(`infix`,80,80,!0,`\\intersect`,`\\union`),...Ks(`infix`,80,80,!1,`\\`),...Ks(`infix`,70,70,!1,`<:`,`:>`),...Ks(`infix`,60,60,!0,`@@`),...Ks(`infix`,50,140,!0,`\\cdot`),...Ks(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Ks(`infix`,30,30,!0,`\\land`,`\\lor`),...Ks(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Ks(`infix`,10,10,!1,`=>`)]),Js=new Map([...qs,...As.flatMap(e=>e.slice(1).map(t=>[t,qs.get(e[0])]))]),Ys=Js.get(`[`),Xs={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Zs=e=>({type:`tokens`,kinds:new Set(e)}),Qs=e=>typeof e==`string`?e.startsWith(`<`)?Zs([w(e.slice(1,-1))]):{type:`call`,name:e}:e,B=(...e)=>({type:`sequence`,units:e.map(Qs)}),V=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:B(e))}),$s=e=>(...t)=>({type:e,body:B(...t)}),H=$s(`zeroOrMore`),ec=$s(`oneOrMore`),U=$s(`optional`),W=e=>({type:`action`,run:t=>e(t)??void 0}),G=e=>W(t=>{t.expecting=e}),K=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&B(...e.expansion),semantic:e.semantic}),tc=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),nc=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=tc(e,n);return n},rc=(...e)=>{let t=e.map(w);return e=>t.includes(nc(e,1).kind)},ic=(e,t=nc(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},ac=e=>{let t=nc(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},oc=e=>rc(`CASESEP`)(e)&&ic(e),sc=e=>{let t=nc(e,1);Gs.has(t.kind)&&(t.kind=zs)},cc=(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}`,lc=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),uc=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},dc=e=>e.operatorStacks[e.operatorStacks.length-1],fc=(e,t)=>e.low>t.high,pc=(e,t)=>e.high<t.low,mc=e=>e.fix===`prefix`?e:Js.get(`${e.name}.`),hc=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Ys?lc(`FcnAppl`,[n,...r.node.heirs]):lc(`PostfixExpr`,[n,r.node]),operator:void 0})},gc=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:lc(`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:lc(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},_c=e=>{let t=dc(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 hc(t,n),_c(e);if(i.operator!==void 0){let t=mc(r.operator);return t!==void 0&&fc(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${cc(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 ${cc(e,a.node.first,a.node.last)} and expression at location ${cc(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return pc(a.operator,r.operator)?void 0:fc(a.operator,r.operator)?(gc(t,a.operator),_c(e)):`Precedence conflict between ops ${a.operator.name} in block ${cc(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=mc(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(pc(s,r.operator))return;if(!fc(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${cc(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return gc(t,s),_c(e);let c=cc(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===Xs?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},vc=e=>W(t=>{let n=dc(t),r=uc(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:_c(t)}),yc=vc(()=>!1),bc=vc(()=>!0),xc=W(e=>{e.lastOperator=Js.get(e.token.image)}),Sc=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},Cc=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Sc(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},wc=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!ic(e,n.first.beginColumn))return n;let t=wc(e,n);if(t!==void 0)return t}},Tc=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&&Hs.has(e.kind),i=e.token,a=tc(e,i);i.next=void 0;let o=tc(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===zs&&(e=e.next)}else if(e.kind===zs){let t=e.next;!r(t)||Ws.has(t.kind)||Us.has(t.kind)&&t.next?.kind!==zs||(e=t.next?.kind===w(`SUBSTITUTE`)?i:Us.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Bs&&(e.next={kind:Bs,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=tc(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Ec=e=>{let t=nc(e,1);if(t.kind===w(`LAB`)){let n=1;for(;n!==0;)if(t=tc(e,t),t.kind===w(`LAB`)&&n++,t.kind===w(`RAB`)&&n--,t.kind===Rs)return!1;return tc(e,t).kind===w(`IN`)}if(t.kind!==zs)return!1;for(t=tc(e,t);t.kind===w(`COMMA`);){if(t=tc(e,t),t.kind!==zs)return!1;t=tc(e,t)}return t.kind===w(`IN`)},Dc=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Oc=e=>e.proofLevels.at(-1)??-1,kc=e=>{let t=nc(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:rc(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Oc(e)>=0&&Dc(t)>Oc(e):rc(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Ac=(e,t)=>{let n=Dc(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},jc=e=>W(t=>Ac(t,t.token)?void 0:`${cc(t,t.token)}: ${e}`),Mc=Zs([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(w)),Nc=Zs([...Mc.kinds,w(`op_76`)]),Pc=Zs(Us),Fc=Zs(Ws),Ic=Zs([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(w)),Lc=()=>H(K({expansion:[V(Mc,`<op_77>`)],semantic:ic}),V(`PrefixOp`,`InfixOp`),bc),Rc=()=>V(B(K({expansion:[`OpenStart`],semantic:ic}),`OpenExpression`,yc),B(K({semantic:ic}),`ExtendableExpr`)),zc=()=>V(B(`<MODULE>`,G(`identifier`),`Identifier`),`Expression`),Bc=()=>V(B(K({semantic:e=>rc(`ASSUME`,`BOXASSUME`)(e)||nc(e,2).kind===w(`COLONCOLON`)&&[w(`ASSUME`),w(`BOXASSUME`)].includes(nc(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Vc=()=>[`JuncItem`,H(K({semantic:ac}),`JuncItem`)],Hc=e=>W(t=>{t.expecting=e,sc(t)}),Uc=e=>W(t=>{t.isTerminalProof=e}),Wc=(e,...t)=>B(...t.slice(0,-1),G(`==`),`<DEF>`,W(t=>{Tc(t),t.expecting=e}),t[t.length-1]),q=(e,t,n)=>({message:e,body:B(...t),exit:n}),Gc={CompilationUnit:q(void 0,[W(Tc),U(`Prelude`),`Module`]),Prelude:q(void 0,[`<BEGIN_PRAGMA>`,H(V(`<NUMBER>`,`<IDENTIFIER>`))]),Module:q(`Module definition`,[G(`---- MODULE`),`BeginModule`,G(`EXTENDS clause or module body`),`Extends`,G(`Module body`),`Body`,G(`==== or more Module body`),`EndModule`]),BeginModule:q(`Begin module`,[G(`---- MODULE (beginning of module)`),V(`<_BM0>`,`<_BM1>`,`<_BM2>`),Hc(`Identifier`),`Identifier`,W(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:q(void 0,[`<END_MODULE>`]),Extends:q(`Extends`,[U(`<EXTENDS>`,Hc(`Identifier`),`Identifier`,G(`comma or module body`),H(`<COMMA>`,Hc(`Identifier`),`Identifier`))]),Body:q(`Module body`,[G(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),H(V(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,B(K({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,B(K({amount:2}),`Instance`),B(K({amount:2}),`Assumption`),B(K({amount:2}),`Theorem`),B(K({amount:1}),`Module`,W(Tc)),B(K({semantic:e=>rc(`USE`)(e)&&nc(e,2).kind!==w(`ONLY`)||rc(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:q(`variable declaration`,[`<VARIABLE>`,G(`Identifier`),`Identifier`,G(`comma or module body`),H(`<COMMA>`,G(`Identifier`),`Identifier`)]),ParamDeclaration:q(`Parameter declaration`,[G(`CONSTANT`),`ParamSubDecl`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G(`,`),H(`<COMMA>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:q(`Recursive`,[G(`RECURSIVE`),`<RECURSIVE>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G(`,`),H(`<COMMA>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G("`,' or `)'"))]),ConstantDeclarationItems:q(`Constant declaration items`,[G(`Identifier, _ or prefix op`),V(B(`Identifier`,G(`(, comma, or Module Body`),U(K({amount:2}),`<LBR>`,G(`_`),`<US>`,G(`comma or )`),H(`<COMMA>`,G(`_`),`<US>`,G(`comma or )`)),`<RBR>`)),B(`NonExpPrefixOp`,G(`_`),`<US>`),B(`<US>`,G(`prefix or postfix operator`),V(B(`InfixOp`,G(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:q(`Definition`,[G(`LOCAL, Identifier or Operator Symbol`),U(`<LOCAL>`),`<DEFBREAK>`,G(`LOCAL, Identifier or Operator Symbol`),V(Wc(`Expression`,K({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,G(`[`),`<LSB>`,G(`Identifier`),`QuantBound`,G(`COMMA or ]`),H(`<COMMA>`,G(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Wc(`Expression`,K({expansion:[`<IDENTIFIER>`,Fc]}),`PostfixLHS`,`Expression`),Wc(`Expression`,K({expansion:[`<IDENTIFIER>`,Pc]}),`InfixLHS`,`Expression`),Wc(`Expression or Instance`,K({expansion:[`<IDENTIFIER>`,V(`<LBR>`,`<DEF>`)]}),`IdentLHS`,V(`Expression`,`Instantiation`)),Wc(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:q(`Identifier tuple`,[`<LAB>`,G(`Identifier or >>`),U(`Identifier`,G(`COMMA or >>`),H(`<COMMA>`,G(`COMMA or >>`),`Identifier`,G(`COMMA or >>`))),`<RAB>`]),IdentLHS:q(`Identifier LHS`,[`Identifier`,G(`( or ==`),U(`<LBR>`,G(`Identifier Declaration, prefix op, _ or )`),V(`IdentDecl`,`SomeFixDecl`),G(`COMMA or )`),H(`<COMMA>`,G(`Identifier Declaration, prefix op or _`),V(`IdentDecl`,`SomeFixDecl`),G(`COMMA or )`)),`<RBR>`)]),PrefixLHS:q(`Prefix LHS`,[Nc,G(`Identifier`),`Identifier`]),InfixLHS:q(`Infix LHS`,[`Identifier`,Pc,`Identifier`]),PostfixLHS:q(`Postfix LHS`,[`Identifier`,Fc]),IdentDecl:q(`Identifier Declation`,[`Identifier`,G(`( or ...`),U(`<LBR>`,G(`_`),`<US>`,G(`COMMA or )`),H(`<COMMA>`,G(`_`),`<US>`,G(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:q(`Op. Symbol Declaration`,[V(B(`NonExpPrefixOp`,G(`_`),`<US>`),B(`<US>`,G(`infix or postfix operator`),V(B(`InfixOp`,G(`_`),`<US>`),`PostfixOp`)))]),Instance:q(`Instance`,[G(`LOCAL or instance`),U(`<LOCAL>`),`Instantiation`,G(`COMMA or Module Body`)]),Instantiation:q(`NonLocalInstance`,[`<INSTANCE>`,Hc(`Module identifier`),`Identifier`,G(`WITH or another definition.`),U(`<WITH>`,G(``),`Substitution`,G(``),H(K({amount:3}),`<COMMA>`,G(``),`Substitution`,G(``)))]),Substitution:q(`Substitution`,[V(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),G(`<-`),`<SUBSTITUTE>`,G(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:q(void 0,[Mc,xc]),NonExpPrefixOp:q(void 0,[Nc,xc]),InfixOp:q(`Infix Op`,[Pc,xc]),PostfixOp:q(void 0,[Fc,xc]),Identifier:q(void 0,[`<IDENTIFIER>`]),Assumption:q(`Assumption`,[G(`ASSUM...`),V(`<ASSUMPTION>`,`<ASSUME>`),U(K({amount:2}),U(`<DEFBREAK>`),`Identifier`,G(`==`),`<DEF>`),W(e=>{Tc(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:q(`Assume-Prove`,[V(B(`Identifier`,`<COLONCOLON>`,`AssumeProve`),B(V(`<ASSUME>`,`<BOXASSUME>`),G(`Expression, Declaration, or AssumeProve`),Bc(),G("PROVE or `,'"),H(`<COMMA>`,G(`Expression, Declaration, or AssumeProve`),Bc(),G("PROVE or `,'")),V(`<PROVE>`,`<BOXPROVE>`),G(`Expression`),`Expression`))]),NewSymb:q(`NEW symbol declaration`,[G(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),V(B(K({amount:2}),V(B(K({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),G(`Constant declaration`),V(B(K({amount:2}),`IdentDecl`,U(`<IN>`,W(e=>{let t=uc(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${cc(e,t.first,t.last)}`:void 0}),G(`Expression`),`Expression`)),`SomeFixDecl`)),B(K({amount:2}),U(`<NEW>`),`<VARIABLE>`,G(`Identifier`),`Identifier`),B(K({amount:2}),U(`<NEW>`),V(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),G(`Declaration`),V(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:q(`Domain binding`,[U(`<IN>`,G(`Expression`),`Expression`)]),Theorem:q(`Theorem`,[G(`THEOREM, PROPOSITION`),V(`<THEOREM>`,`<PROPOSITION>`),G(`Identifier, Assume-Prove or Expression`),U(K({amount:2}),`Identifier`,G(`==`),`<DEF>`),W(Tc),V(B(K({amount:3}),K({semantic:rc(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),U(K({semantic:kc}),`Proof`)]),Proof:q(`Proof`,[W(e=>{e.proofLevels.push(-1)}),V(B(K({semantic:e=>rc(`BY`)(e)||nc(e,2).kind===w(`BY`)}),`UseOrHideOrBy`),B(K({amount:2}),U(`<PROOF>`),V(`<OBVIOUS>`,`<OMITTED>`)),B(U(K({amount:2}),`<PROOF>`),H(K({semantic:e=>nc(e,2).kind!==w(`QED`)}),`Step`,G(`a proof step`)),`QEDStep`)),W(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:q(`UseOrHideOrBy`,[V(B(U(`<PROOF>`),`<BY>`,Uc(!0),U(`<ONLY>`)),B(`<USE>`,Uc(!1),U(`<ONLY>`)),B(`<HIDE>`,Uc(!1))),G("an expression, `MODULE' or `DEF'"),U(zc(),H(`<COMMA>`,G(`MODULE or expression`),zc(),W(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),U(`<DF>`,G(`MODULE or expression`),zc(),H(`<COMMA>`,G(`MODULE or expression`),zc(),W(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),W(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:q(`QED step`,[G(`Step number`),Ic,jc(`QED step's number has bad level.`),G(`QED`),`<QED>`,U(K({semantic:kc}),`Proof`)]),Step:q(`Step`,[G(`Step number`),Ic,jc(`step's number has bad level.`),G(`proof step`),V(B(K({semantic:rc(`USE`,`HIDE`)}),`UseOrHideOrBy`),B(K({semantic:rc(`INSTANCE`)}),`Instantiation`),B(K({semantic:rc(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),U(K({semantic:kc}),W(e=>{let t=uc(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${cc(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:q(`DefStep`,[U(`<DEFINE>`),ec(K({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:q(`HaveStep`,[`<HAVE>`,G(`expression`),`Expression`]),TakeStep:q(`TakeStep`,[`<TAKE>`,G(`identifier`),V(B(K({expansion:[V(B(`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,G(`comma or step`),H(`<COMMA>`,G(`identifier or tuple of identifiers`),`QuantBound`,G(`comma or proof step`))),B(`Identifier`,G(`comma or proof step`),H(`<COMMA>`,G(`identifier`),`Identifier`,G(`comma or proof step`))))]),WitnessStep:q(`WitnessStep`,[`<WITNESS>`,G(`expression`),`Expression`,H(`<COMMA>`,G(`expression`),`Expression`,G(`comma or colon`))]),PickStep:q(`PickStep`,[`<PICK>`,G(`identifier`),V(B(K({expansion:[`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,G(`comma, or colon`),H(`<COMMA>`,G(`identifier`),`Identifier`,G(`comma or colon`))),B(`QuantBound`,G(`comma or colon`),H(`<COMMA>`,G(`identifier or tuple of identifiers`),`QuantBound`,G(`comma or colon`)))),`<COLON>`,G(`expression`),`Expression`]),CaseStep:q(`CaseStep`,[`<CASE>`,G(`expression`),`Expression`]),AssertStep:q(`AssertStep`,[U(`<SUFFICES>`,G(`expression or ASSUME/PROVE`)),V(`Expression`,B(K({semantic:rc(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:q(void 0,[V(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:q(void 0,[V(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:q(`String`,[`<STRING_LITERAL>`]),Number:q(void 0,[`<NUMBER_LITERAL>`,U(K({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,H(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:q(void 0,[V(B(K({amount:2,expansion:[V(Nc,Pc,Fc),Zs([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(w))],semantic:ic}),V(`NonExpPrefixOp`,B(`InfixOp`,W(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${cc(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),B(K({expansion:[`<LAMBDA>`],semantic:ic}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:q(`Quantified form`,[V(`<EXISTS>`,`<FORALL>`),V(B(K({expansion:[`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,H(`<COMMA>`,`Identifier`)),B(`QuantBound`,H(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:q(`Bound Quantified Expression`,[V(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,H(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:q(`Quant Bound`,[V(`IdentifierTuple`,B(`Identifier`,H(`<COMMA>`,`Identifier`,G(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:q(`Some { } form`,[`<LBC>`,U(V(B(K({semantic:Ec}),V(`IdentifierTuple`,`Identifier`),G(`\\in`),`<IN>`,`Expression`,G(`':', ',' or '}'`),U(V(B(`<COLON>`,`Expression`),ec(`<COMMA>`,`Expression`)))),B(K({expansion:[V(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,H(`<COMMA>`,`Expression`)),B(K({expansion:[V(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,H(`<COMMA>`,`QuantBound`)),B(`Expression`,U(V(B(`<COLON>`,W(e=>{let t=uc(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`,H(`<COMMA>`,`QuantBound`)),ec(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:q(`Some [] Form`,[`<LSB>`,V(B(K({semantic:Ec}),`QuantBound`,H(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),B(K({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,H(`<COMMA>`,`FieldVal`),`<RSB>`),B(K({semantic:e=>nc(e,2).kind===w(`MAPTO`)&&Gs.has(nc(e,1).kind)}),W(e=>{nc(e,1).kind=zs}),`FieldVal`,H(`<COMMA>`,`FieldVal`),`<RSB>`),B(K({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,H(`<COMMA>`,`FieldSet`),`<RSB>`),B(`Expression`,V(B(H(`<COMMA>`,`Expression`),`<RSB>`,W(e=>{let t=e.frames[e.frames.length-1];t.node=lc(`FcnAppl`,t.heirs),e.lastOperator=Ys})),B(`<ARROW>`,`Expression`,`<RSB>`),B(`<EXCEPT>`,`ExceptSpec`,H(`<COMMA>`,`ExceptSpec`),`<RSB>`),B(`<ARSB>`,`ReducedExpression`))))]),FieldVal:q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:q(`Except Spec`,[`<BANG>`,ec(`ExceptComponent`,G(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:q(`Except Component`,[V(B(`<DOT>`,W(sc),`Identifier`,W(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),B(`<LSB>`,`Expression`,H(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:q(`Some << -- >> or >>_ Form`,[`<LAB>`,U(`Expression`,H(`<COMMA>`,`Expression`)),V(`<RAB>`,B(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:q(void 0,[`Identifier`,U(K({amount:2}),`OpArgs`),V(B(`<BANG>`,`NoOpExtension`),W(e=>{e.isFairnessHooked=e.token.kind===w(`RBR`)}))]),ReducedExpression:q(`restricted form of expression`,[V(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:q(`Fairness Expression`,[W(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),V(`<WF>`,`<SF>`),`ReducedExpression`,U(K({amount:2}),`<LBR>`,`Expression`,`<RBR>`,W(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`,H(K({semantic:e=>oc(e)&&nc(e,2).kind!==w(`OTHER`)}),`<CASESEP>`,`CaseArm`),U(K({semantic:oc}),`<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`,[ec(V(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:q(`AND-OR Junction`,[W(e=>{let t=nc(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),V(B(K({expansion:[`<OR>`]}),...Vc()),B(K({expansion:[`<AND>`]}),...Vc())),W(e=>{e.junctions.pop()})]),JuncItem:q(`Junction Item`,[V(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=wc(t,e.heirs[1]);return n&&`Item at ${cc(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${cc(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:q(`(Un)Bounded Choose`,[`<CHOOSE>`,V(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:q(`Lambda`,[`<LAMBDA>`,G(`Identifier`),`Identifier`,G("`,' or `:'"),H(`<COMMA>`,G(`Identifier`),`Identifier`,G("`,' or `:'")),`<COLON>`,G(`Expression`),`Expression`]),Expression:q(`Expression`,[W(e=>{e.operatorStacks.push([])}),Lc(),Rc()],(e,t)=>{let n=dc(t);n.push({node:e.heirs[0],operator:Xs});let r=_c(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:q(`ExtendableExpr`,[V(B(K({expansion:[V(`<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`),yc,H(V(B(K({expansion:[`PostfixOp`],semantic:ic}),`PostfixOp`,bc),B(K({expansion:[`<DOT>`],semantic:ic}),`<DOT>`,W(sc),K({semantic:ic}),`Identifier`,W(e=>{let t=dc(e);t[t.length-1].operator!==void 0&&hc(t,t.length),t[t.length-1]={node:lc(`RecordComponent`,[t[t.length-1].node,uc(e,2),uc(e,1)]),operator:void 0}})),B(K({expansion:[`<LSB>`],semantic:ic}),G(`function argument`),`SBracketCases`,vc(e=>e.kind===`FcnAppl`)))),U(V(B(K({expansion:[`InfixOp`],semantic:ic}),`InfixOp`,bc,Lc(),Rc()),B(K({expansion:[`<COLONCOLON>`],semantic:ic}),`<COLONCOLON>`,W(e=>{let t=dc(e);if(!Cc(t[t.length-1].node))return`\`::' at ${cc(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,W(e=>{let t=dc(e),n=uc(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!pc(r,e.lastOperator)){let t=uc(e,3);return`Removing label at ${cc(e,t.first,t.last)} would change expression parsing.`}t.push({node:lc(`Label`,[uc(e,3),uc(e,2),n]),operator:void 0})}))))]),PrimitiveExp:q(`Primitive expression`,[V(B(K({expansion:[`String`],semantic:ic}),`String`),B(K({expansion:[`<NUMBER_LITERAL>`],semantic:ic}),`Number`),B(V(`Identifier`,B(V(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),W(e=>Oc(e)<0&&e.proofLevels.length<=1?`${cc(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${cc(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,B(K({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),U(K({amount:2}),`OpArgs`),H(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Sc(e.heirs)===void 0?e.heirs.length===1?lc(`GeneralId`,e.heirs):void 0:lc(`OpApplication`,e.heirs)}),BangExt:q(`Bang Extension`,[`<BANG>`,V(B(V(B(K({expansion:[`Identifier`],semantic:e=>nc(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),U(K({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:q(`StructOp`,[G("`<<' , `>>' , `:' , `@' , or number"),V(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,B(K({semantic:e=>nc(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${cc(t,n.first,n.last)}`:void 0}),OpenStart:q(void 0,[V(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Kc=/* @__PURE__ */ new Map,qc=e=>{let t=Kc.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=qc(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,qc(Gc[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 Kc.set(e,n),n},Jc=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Yc=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=tc(e,e.scanPosition)),e.scanPosition=tc(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`},Xc=(e,t)=>{if(t.type===`tokens`)return Yc(e,t.kinds);if(t.type===`call`)return Xc(e,Gc[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Jc(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=Xc(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||Jc(e,t.semantic)?Xc(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Xc(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=Xc(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Zc=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Xc(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},Qc=(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||qc(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!qc(a).hasSemanticStart?qc(a).first.has(nc(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Zc(e,i,a)&&(o===void 0||o(e))}),$c=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,Xc(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=tc(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Rs){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=tc(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${we(e.token.image)}" `},el=(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??$c(e)}\n\nResidual stack trace follows:\n${r}`,!1},tl=(e,t)=>{let n=tc(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,el(e))},nl=(e,t)=>{let n=Gc[t];n.message!==void 0&&(e.messages.push({name:n.message,token:nc(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!rl(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 el(e,i);let a=r.node??(r.heirs.length===0?void 0:lc(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},rl=(e,t)=>{if(t.type===`tokens`)return tl(e,t.kinds);if(t.type===`call`)return nl(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||el(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||el(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||rl(e,t));if(t.type===`choice`){let n=Qc(e,t.alternatives);return n===-1?el(e):rl(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!rl(e,t.body))return!1;if(t.type===`optional`)return Qc(e,[t.body])===-1||rl(e,t.body);for(;Qc(e,[t.body])===0;)if(!rl(e,t.body))return!1;return!0},il=e=>{let t=Se(e),n={kind:Rs,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=rl(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(`
|
|
394
|
-
`)},
|
|
395
|
-
`,
|
|
392
|
+
`]]),ks=/* @__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)`]])]]),As=a(`EOF`),js=a(`IDENTIFIER`),Ms=a(`DEFBREAK`),Ns=(e,t)=>Array.from({length:a(t)-a(e)+1},(t,n)=>a(e)+n),Ps=new Set(Ns(`op_57`,`op_119`)),Fs=new Set(Ns(`op_1`,`op_119`)),Is=new Set(Ns(`op_57`,`op_70`)),Ls=/* @__PURE__ */ new Set([...Ns(`ACTION`,`EXCEPT`),a(`EXTENDS`),...Ns(`IF`,`SF`),a(`STATE`),...Ns(`THEN`,`WITH`),a(`US`),...Ns(`op_112`,`op_116`)]),Rs=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),zs=new Map([...Rs(`postfix`,160,160,!0,`[`),...Rs(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Rs(`prefix`,120,120,!1,`-.`),...Rs(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Rs(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Rs(`prefix`,40,40,!0,`\\lnot`),...Rs(`nfix`,100,130,!0,`\\times`),...Rs(`infix`,140,140,!1,`^`,`^^`),...Rs(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Rs(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Rs(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Rs(`infix`,100,110,!0,`|`,`||`,`%%`),...Rs(`infix`,100,110,!1,`%`),...Rs(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Rs(`infix`,90,140,!1,`\\wr`),...Rs(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Rs(`infix`,90,130,!1,`!!`),...Rs(`infix`,90,90,!1,`...`,`..`),...Rs(`infix`,80,80,!0,`\\intersect`,`\\union`),...Rs(`infix`,80,80,!1,`\\`),...Rs(`infix`,70,70,!1,`<:`,`:>`),...Rs(`infix`,60,60,!0,`@@`),...Rs(`infix`,50,140,!0,`\\cdot`),...Rs(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Rs(`infix`,30,30,!0,`\\land`,`\\lor`),...Rs(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Rs(`infix`,10,10,!1,`=>`)]),Bs=new Map([...zs,...Ss.flatMap(e=>e.slice(1).map(t=>[t,zs.get(e[0])]))]),Vs=Bs.get(`[`),Hs={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Us=e=>({type:`tokens`,kinds:new Set(e)}),Ws=e=>typeof e==`string`?e.startsWith(`<`)?Us([a(e.slice(1,-1))]):{type:`call`,name:e}:e,B=(...e)=>({type:`sequence`,units:e.map(Ws)}),V=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:B(e))}),Gs=e=>(...t)=>({type:e,body:B(...t)}),H=Gs(`zeroOrMore`),Ks=Gs(`oneOrMore`),U=Gs(`optional`),W=e=>({type:`action`,run:t=>e(t)??void 0}),G=e=>W(t=>{t.expecting=e}),K=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&B(...e.expansion),semantic:e.semantic}),qs=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Js=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=qs(e,n);return n},Ys=(...e)=>{let t=e.map(a);return e=>t.includes(Js(e,1).kind)},Xs=(e,t=Js(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Zs=e=>{let t=Js(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Qs=e=>Ys(`CASESEP`)(e)&&Xs(e),$s=e=>{let t=Js(e,1);Ls.has(t.kind)&&(t.kind=js)},ec=(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}`,tc=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),nc=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},rc=e=>e.operatorStacks[e.operatorStacks.length-1],ic=(e,t)=>e.low>t.high,ac=(e,t)=>e.high<t.low,oc=e=>e.fix===`prefix`?e:Bs.get(`${e.name}.`),sc=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Vs?tc(`FcnAppl`,[n,...r.node.heirs]):tc(`PostfixExpr`,[n,r.node]),operator:void 0})},cc=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:tc(`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:tc(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},lc=e=>{let t=rc(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 sc(t,n),lc(e);if(i.operator!==void 0){let t=oc(r.operator);return t!==void 0&&ic(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${ec(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 ${ec(e,a.node.first,a.node.last)} and expression at location ${ec(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return ac(a.operator,r.operator)?void 0:ic(a.operator,r.operator)?(cc(t,a.operator),lc(e)):`Precedence conflict between ops ${a.operator.name} in block ${ec(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=oc(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(ac(s,r.operator))return;if(!ic(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${ec(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return cc(t,s),lc(e);let c=ec(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===Hs?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},uc=e=>W(t=>{let n=rc(t),r=nc(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:lc(t)}),dc=uc(()=>!1),fc=uc(()=>!0),pc=W(e=>{e.lastOperator=Bs.get(e.token.image)}),mc=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},hc=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?mc(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},gc=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Xs(e,n.first.beginColumn))return n;let t=gc(e,n);if(t!==void 0)return t}},_c=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(a),n=(e,...t)=>t.some(t=>e.kind===a(t)),r=e=>e!==void 0&&Ps.has(e.kind),i=e.token,o=qs(e,i);i.next=void 0;let s=qs(e,o);for(o.next=i;!t.includes(s.kind)&&!n(o,`THEOREM`,`PROPOSITION`);){if(n(o,`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===js&&(e=e.next)}else if(e.kind===js){let t=e.next;!r(t)||Is.has(t.kind)||Fs.has(t.kind)&&t.next?.kind!==js||(e=t.next?.kind===a(`SUBSTITUTE`)?i:Fs.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Ms&&(e.next={kind:Ms,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=o,o=s,s=qs(e,o),o.next=i}for(;i!==void 0;)o.next=s,s=o,o=i,i=o.next;o.next=s},vc=e=>{let t=Js(e,1);if(t.kind===a(`LAB`)){let n=1;for(;n!==0;)if(t=qs(e,t),t.kind===a(`LAB`)&&n++,t.kind===a(`RAB`)&&n--,t.kind===As)return!1;return qs(e,t).kind===a(`IN`)}if(t.kind!==js)return!1;for(t=qs(e,t);t.kind===a(`COMMA`);){if(t=qs(e,t),t.kind!==js)return!1;t=qs(e,t)}return t.kind===a(`IN`)},yc=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),bc=e=>e.proofLevels.at(-1)??-1,xc=e=>{let t=Js(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Ys(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||bc(e)>=0&&yc(t)>bc(e):Ys(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Sc=(e,t)=>{let n=yc(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},Cc=e=>W(t=>Sc(t,t.token)?void 0:`${ec(t,t.token)}: ${e}`),wc=Us([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(a)),Tc=Us([...wc.kinds,a(`op_76`)]),Ec=Us(Fs),Dc=Us(Is),Oc=Us([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(a)),kc=()=>H(K({expansion:[V(wc,`<op_77>`)],semantic:Xs}),V(`PrefixOp`,`InfixOp`),fc),Ac=()=>V(B(K({expansion:[`OpenStart`],semantic:Xs}),`OpenExpression`,dc),B(K({semantic:Xs}),`ExtendableExpr`)),jc=()=>V(B(`<MODULE>`,G(`identifier`),`Identifier`),`Expression`),Mc=()=>V(B(K({semantic:e=>Ys(`ASSUME`,`BOXASSUME`)(e)||Js(e,2).kind===a(`COLONCOLON`)&&[a(`ASSUME`),a(`BOXASSUME`)].includes(Js(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Nc=()=>[`JuncItem`,H(K({semantic:Zs}),`JuncItem`)],Pc=e=>W(t=>{t.expecting=e,$s(t)}),Fc=e=>W(t=>{t.isTerminalProof=e}),Ic=(e,...t)=>B(...t.slice(0,-1),G(`==`),`<DEF>`,W(t=>{_c(t),t.expecting=e}),t[t.length-1]),q=(e,t,n)=>({message:e,body:B(...t),exit:n}),Lc={CompilationUnit:q(void 0,[W(_c),U(`Prelude`),`Module`]),Prelude:q(void 0,[`<BEGIN_PRAGMA>`,H(V(`<NUMBER>`,`<IDENTIFIER>`))]),Module:q(`Module definition`,[G(`---- MODULE`),`BeginModule`,G(`EXTENDS clause or module body`),`Extends`,G(`Module body`),`Body`,G(`==== or more Module body`),`EndModule`]),BeginModule:q(`Begin module`,[G(`---- MODULE (beginning of module)`),V(`<_BM0>`,`<_BM1>`,`<_BM2>`),Pc(`Identifier`),`Identifier`,W(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:q(void 0,[`<END_MODULE>`]),Extends:q(`Extends`,[U(`<EXTENDS>`,Pc(`Identifier`),`Identifier`,G(`comma or module body`),H(`<COMMA>`,Pc(`Identifier`),`Identifier`))]),Body:q(`Module body`,[G(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),H(V(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,B(K({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,B(K({amount:2}),`Instance`),B(K({amount:2}),`Assumption`),B(K({amount:2}),`Theorem`),B(K({amount:1}),`Module`,W(_c)),B(K({semantic:e=>Ys(`USE`)(e)&&Js(e,2).kind!==a(`ONLY`)||Ys(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:q(`variable declaration`,[`<VARIABLE>`,G(`Identifier`),`Identifier`,G(`comma or module body`),H(`<COMMA>`,G(`Identifier`),`Identifier`)]),ParamDeclaration:q(`Parameter declaration`,[G(`CONSTANT`),`ParamSubDecl`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G(`,`),H(`<COMMA>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:q(`Recursive`,[G(`RECURSIVE`),`<RECURSIVE>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G(`,`),H(`<COMMA>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G("`,' or `)'"))]),ConstantDeclarationItems:q(`Constant declaration items`,[G(`Identifier, _ or prefix op`),V(B(`Identifier`,G(`(, comma, or Module Body`),U(K({amount:2}),`<LBR>`,G(`_`),`<US>`,G(`comma or )`),H(`<COMMA>`,G(`_`),`<US>`,G(`comma or )`)),`<RBR>`)),B(`NonExpPrefixOp`,G(`_`),`<US>`),B(`<US>`,G(`prefix or postfix operator`),V(B(`InfixOp`,G(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:q(`Definition`,[G(`LOCAL, Identifier or Operator Symbol`),U(`<LOCAL>`),`<DEFBREAK>`,G(`LOCAL, Identifier or Operator Symbol`),V(Ic(`Expression`,K({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,G(`[`),`<LSB>`,G(`Identifier`),`QuantBound`,G(`COMMA or ]`),H(`<COMMA>`,G(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Ic(`Expression`,K({expansion:[`<IDENTIFIER>`,Dc]}),`PostfixLHS`,`Expression`),Ic(`Expression`,K({expansion:[`<IDENTIFIER>`,Ec]}),`InfixLHS`,`Expression`),Ic(`Expression or Instance`,K({expansion:[`<IDENTIFIER>`,V(`<LBR>`,`<DEF>`)]}),`IdentLHS`,V(`Expression`,`Instantiation`)),Ic(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:q(`Identifier tuple`,[`<LAB>`,G(`Identifier or >>`),U(`Identifier`,G(`COMMA or >>`),H(`<COMMA>`,G(`COMMA or >>`),`Identifier`,G(`COMMA or >>`))),`<RAB>`]),IdentLHS:q(`Identifier LHS`,[`Identifier`,G(`( or ==`),U(`<LBR>`,G(`Identifier Declaration, prefix op, _ or )`),V(`IdentDecl`,`SomeFixDecl`),G(`COMMA or )`),H(`<COMMA>`,G(`Identifier Declaration, prefix op or _`),V(`IdentDecl`,`SomeFixDecl`),G(`COMMA or )`)),`<RBR>`)]),PrefixLHS:q(`Prefix LHS`,[Tc,G(`Identifier`),`Identifier`]),InfixLHS:q(`Infix LHS`,[`Identifier`,Ec,`Identifier`]),PostfixLHS:q(`Postfix LHS`,[`Identifier`,Dc]),IdentDecl:q(`Identifier Declation`,[`Identifier`,G(`( or ...`),U(`<LBR>`,G(`_`),`<US>`,G(`COMMA or )`),H(`<COMMA>`,G(`_`),`<US>`,G(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:q(`Op. Symbol Declaration`,[V(B(`NonExpPrefixOp`,G(`_`),`<US>`),B(`<US>`,G(`infix or postfix operator`),V(B(`InfixOp`,G(`_`),`<US>`),`PostfixOp`)))]),Instance:q(`Instance`,[G(`LOCAL or instance`),U(`<LOCAL>`),`Instantiation`,G(`COMMA or Module Body`)]),Instantiation:q(`NonLocalInstance`,[`<INSTANCE>`,Pc(`Module identifier`),`Identifier`,G(`WITH or another definition.`),U(`<WITH>`,G(``),`Substitution`,G(``),H(K({amount:3}),`<COMMA>`,G(``),`Substitution`,G(``)))]),Substitution:q(`Substitution`,[V(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),G(`<-`),`<SUBSTITUTE>`,G(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:q(void 0,[wc,pc]),NonExpPrefixOp:q(void 0,[Tc,pc]),InfixOp:q(`Infix Op`,[Ec,pc]),PostfixOp:q(void 0,[Dc,pc]),Identifier:q(void 0,[`<IDENTIFIER>`]),Assumption:q(`Assumption`,[G(`ASSUM...`),V(`<ASSUMPTION>`,`<ASSUME>`),U(K({amount:2}),U(`<DEFBREAK>`),`Identifier`,G(`==`),`<DEF>`),W(e=>{_c(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:q(`Assume-Prove`,[V(B(`Identifier`,`<COLONCOLON>`,`AssumeProve`),B(V(`<ASSUME>`,`<BOXASSUME>`),G(`Expression, Declaration, or AssumeProve`),Mc(),G("PROVE or `,'"),H(`<COMMA>`,G(`Expression, Declaration, or AssumeProve`),Mc(),G("PROVE or `,'")),V(`<PROVE>`,`<BOXPROVE>`),G(`Expression`),`Expression`))]),NewSymb:q(`NEW symbol declaration`,[G(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),V(B(K({amount:2}),V(B(K({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),G(`Constant declaration`),V(B(K({amount:2}),`IdentDecl`,U(`<IN>`,W(e=>{let t=nc(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${ec(e,t.first,t.last)}`:void 0}),G(`Expression`),`Expression`)),`SomeFixDecl`)),B(K({amount:2}),U(`<NEW>`),`<VARIABLE>`,G(`Identifier`),`Identifier`),B(K({amount:2}),U(`<NEW>`),V(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),G(`Declaration`),V(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:q(`Domain binding`,[U(`<IN>`,G(`Expression`),`Expression`)]),Theorem:q(`Theorem`,[G(`THEOREM, PROPOSITION`),V(`<THEOREM>`,`<PROPOSITION>`),G(`Identifier, Assume-Prove or Expression`),U(K({amount:2}),`Identifier`,G(`==`),`<DEF>`),W(_c),V(B(K({amount:3}),K({semantic:Ys(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),U(K({semantic:xc}),`Proof`)]),Proof:q(`Proof`,[W(e=>{e.proofLevels.push(-1)}),V(B(K({semantic:e=>Ys(`BY`)(e)||Js(e,2).kind===a(`BY`)}),`UseOrHideOrBy`),B(K({amount:2}),U(`<PROOF>`),V(`<OBVIOUS>`,`<OMITTED>`)),B(U(K({amount:2}),`<PROOF>`),H(K({semantic:e=>Js(e,2).kind!==a(`QED`)}),`Step`,G(`a proof step`)),`QEDStep`)),W(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:q(`UseOrHideOrBy`,[V(B(U(`<PROOF>`),`<BY>`,Fc(!0),U(`<ONLY>`)),B(`<USE>`,Fc(!1),U(`<ONLY>`)),B(`<HIDE>`,Fc(!1))),G("an expression, `MODULE' or `DEF'"),U(jc(),H(`<COMMA>`,G(`MODULE or expression`),jc(),W(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),U(`<DF>`,G(`MODULE or expression`),jc(),H(`<COMMA>`,G(`MODULE or expression`),jc(),W(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),W(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:q(`QED step`,[G(`Step number`),Oc,Cc(`QED step's number has bad level.`),G(`QED`),`<QED>`,U(K({semantic:xc}),`Proof`)]),Step:q(`Step`,[G(`Step number`),Oc,Cc(`step's number has bad level.`),G(`proof step`),V(B(K({semantic:Ys(`USE`,`HIDE`)}),`UseOrHideOrBy`),B(K({semantic:Ys(`INSTANCE`)}),`Instantiation`),B(K({semantic:Ys(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),U(K({semantic:xc}),W(e=>{let t=nc(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${ec(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:q(`DefStep`,[U(`<DEFINE>`),Ks(K({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:q(`HaveStep`,[`<HAVE>`,G(`expression`),`Expression`]),TakeStep:q(`TakeStep`,[`<TAKE>`,G(`identifier`),V(B(K({expansion:[V(B(`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,G(`comma or step`),H(`<COMMA>`,G(`identifier or tuple of identifiers`),`QuantBound`,G(`comma or proof step`))),B(`Identifier`,G(`comma or proof step`),H(`<COMMA>`,G(`identifier`),`Identifier`,G(`comma or proof step`))))]),WitnessStep:q(`WitnessStep`,[`<WITNESS>`,G(`expression`),`Expression`,H(`<COMMA>`,G(`expression`),`Expression`,G(`comma or colon`))]),PickStep:q(`PickStep`,[`<PICK>`,G(`identifier`),V(B(K({expansion:[`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,G(`comma, or colon`),H(`<COMMA>`,G(`identifier`),`Identifier`,G(`comma or colon`))),B(`QuantBound`,G(`comma or colon`),H(`<COMMA>`,G(`identifier or tuple of identifiers`),`QuantBound`,G(`comma or colon`)))),`<COLON>`,G(`expression`),`Expression`]),CaseStep:q(`CaseStep`,[`<CASE>`,G(`expression`),`Expression`]),AssertStep:q(`AssertStep`,[U(`<SUFFICES>`,G(`expression or ASSUME/PROVE`)),V(`Expression`,B(K({semantic:Ys(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:q(void 0,[V(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:q(void 0,[V(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:q(`String`,[`<STRING_LITERAL>`]),Number:q(void 0,[`<NUMBER_LITERAL>`,U(K({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,H(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:q(void 0,[V(B(K({amount:2,expansion:[V(Tc,Ec,Dc),Us([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(a))],semantic:Xs}),V(`NonExpPrefixOp`,B(`InfixOp`,W(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${ec(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),B(K({expansion:[`<LAMBDA>`],semantic:Xs}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:q(`Quantified form`,[V(`<EXISTS>`,`<FORALL>`),V(B(K({expansion:[`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,H(`<COMMA>`,`Identifier`)),B(`QuantBound`,H(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:q(`Bound Quantified Expression`,[V(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,H(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:q(`Quant Bound`,[V(`IdentifierTuple`,B(`Identifier`,H(`<COMMA>`,`Identifier`,G(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:q(`Some { } form`,[`<LBC>`,U(V(B(K({semantic:vc}),V(`IdentifierTuple`,`Identifier`),G(`\\in`),`<IN>`,`Expression`,G(`':', ',' or '}'`),U(V(B(`<COLON>`,`Expression`),Ks(`<COMMA>`,`Expression`)))),B(K({expansion:[V(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,H(`<COMMA>`,`Expression`)),B(K({expansion:[V(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,H(`<COMMA>`,`QuantBound`)),B(`Expression`,U(V(B(`<COLON>`,W(e=>{let t=nc(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`,H(`<COMMA>`,`QuantBound`)),Ks(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:q(`Some [] Form`,[`<LSB>`,V(B(K({semantic:vc}),`QuantBound`,H(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),B(K({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,H(`<COMMA>`,`FieldVal`),`<RSB>`),B(K({semantic:e=>Js(e,2).kind===a(`MAPTO`)&&Ls.has(Js(e,1).kind)}),W(e=>{Js(e,1).kind=js}),`FieldVal`,H(`<COMMA>`,`FieldVal`),`<RSB>`),B(K({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,H(`<COMMA>`,`FieldSet`),`<RSB>`),B(`Expression`,V(B(H(`<COMMA>`,`Expression`),`<RSB>`,W(e=>{let t=e.frames[e.frames.length-1];t.node=tc(`FcnAppl`,t.heirs),e.lastOperator=Vs})),B(`<ARROW>`,`Expression`,`<RSB>`),B(`<EXCEPT>`,`ExceptSpec`,H(`<COMMA>`,`ExceptSpec`),`<RSB>`),B(`<ARSB>`,`ReducedExpression`))))]),FieldVal:q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:q(`Except Spec`,[`<BANG>`,Ks(`ExceptComponent`,G(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:q(`Except Component`,[V(B(`<DOT>`,W($s),`Identifier`,W(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),B(`<LSB>`,`Expression`,H(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:q(`Some << -- >> or >>_ Form`,[`<LAB>`,U(`Expression`,H(`<COMMA>`,`Expression`)),V(`<RAB>`,B(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:q(void 0,[`Identifier`,U(K({amount:2}),`OpArgs`),V(B(`<BANG>`,`NoOpExtension`),W(e=>{e.isFairnessHooked=e.token.kind===a(`RBR`)}))]),ReducedExpression:q(`restricted form of expression`,[V(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:q(`Fairness Expression`,[W(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),V(`<WF>`,`<SF>`),`ReducedExpression`,U(K({amount:2}),`<LBR>`,`Expression`,`<RBR>`,W(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`,H(K({semantic:e=>Qs(e)&&Js(e,2).kind!==a(`OTHER`)}),`<CASESEP>`,`CaseArm`),U(K({semantic:Qs}),`<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`,[Ks(V(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:q(`AND-OR Junction`,[W(e=>{let t=Js(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),V(B(K({expansion:[`<OR>`]}),...Nc()),B(K({expansion:[`<AND>`]}),...Nc())),W(e=>{e.junctions.pop()})]),JuncItem:q(`Junction Item`,[V(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=gc(t,e.heirs[1]);return n&&`Item at ${ec(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${ec(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:q(`(Un)Bounded Choose`,[`<CHOOSE>`,V(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:q(`Lambda`,[`<LAMBDA>`,G(`Identifier`),`Identifier`,G("`,' or `:'"),H(`<COMMA>`,G(`Identifier`),`Identifier`,G("`,' or `:'")),`<COLON>`,G(`Expression`),`Expression`]),Expression:q(`Expression`,[W(e=>{e.operatorStacks.push([])}),kc(),Ac()],(e,t)=>{let n=rc(t);n.push({node:e.heirs[0],operator:Hs});let r=lc(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:q(`ExtendableExpr`,[V(B(K({expansion:[V(`<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`),dc,H(V(B(K({expansion:[`PostfixOp`],semantic:Xs}),`PostfixOp`,fc),B(K({expansion:[`<DOT>`],semantic:Xs}),`<DOT>`,W($s),K({semantic:Xs}),`Identifier`,W(e=>{let t=rc(e);t[t.length-1].operator!==void 0&&sc(t,t.length),t[t.length-1]={node:tc(`RecordComponent`,[t[t.length-1].node,nc(e,2),nc(e,1)]),operator:void 0}})),B(K({expansion:[`<LSB>`],semantic:Xs}),G(`function argument`),`SBracketCases`,uc(e=>e.kind===`FcnAppl`)))),U(V(B(K({expansion:[`InfixOp`],semantic:Xs}),`InfixOp`,fc,kc(),Ac()),B(K({expansion:[`<COLONCOLON>`],semantic:Xs}),`<COLONCOLON>`,W(e=>{let t=rc(e);if(!hc(t[t.length-1].node))return`\`::' at ${ec(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,W(e=>{let t=rc(e),n=nc(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!ac(r,e.lastOperator)){let t=nc(e,3);return`Removing label at ${ec(e,t.first,t.last)} would change expression parsing.`}t.push({node:tc(`Label`,[nc(e,3),nc(e,2),n]),operator:void 0})}))))]),PrimitiveExp:q(`Primitive expression`,[V(B(K({expansion:[`String`],semantic:Xs}),`String`),B(K({expansion:[`<NUMBER_LITERAL>`],semantic:Xs}),`Number`),B(V(`Identifier`,B(V(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),W(e=>bc(e)<0&&e.proofLevels.length<=1?`${ec(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${ec(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,B(K({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),U(K({amount:2}),`OpArgs`),H(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:mc(e.heirs)===void 0?e.heirs.length===1?tc(`GeneralId`,e.heirs):void 0:tc(`OpApplication`,e.heirs)}),BangExt:q(`Bang Extension`,[`<BANG>`,V(B(V(B(K({expansion:[`Identifier`],semantic:e=>Js(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),U(K({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:q(`StructOp`,[G("`<<' , `>>' , `:' , `@' , or number"),V(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,B(K({semantic:e=>Js(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${ec(t,n.first,n.last)}`:void 0}),OpenStart:q(void 0,[V(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Rc=/* @__PURE__ */ new Map,zc=e=>{let t=Rc.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=zc(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,zc(Lc[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 Rc.set(e,n),n},Bc=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Vc=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=qs(e,e.scanPosition)),e.scanPosition=qs(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`},Hc=(e,t)=>{if(t.type===`tokens`)return Vc(e,t.kinds);if(t.type===`call`)return Hc(e,Lc[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Bc(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=Hc(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||Bc(e,t.semantic)?Hc(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Hc(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=Hc(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Uc=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Hc(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},Wc=(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||zc(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!zc(a).hasSemanticStart?zc(a).first.has(Js(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Uc(e,i,a)&&(o===void 0||o(e))}),Gc=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,Hc(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=qs(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===As){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=qs(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${oe(e.token.image)}" `},Kc=(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??Gc(e)}\n\nResidual stack trace follows:\n${r}`,!1},qc=(e,t)=>{let n=qs(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,Kc(e))},Jc=(e,t)=>{let n=Lc[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Js(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Yc(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 Kc(e,i);let a=r.node??(r.heirs.length===0?void 0:tc(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Yc=(e,t)=>{if(t.type===`tokens`)return qc(e,t.kinds);if(t.type===`call`)return Jc(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Kc(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Kc(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Yc(e,t));if(t.type===`choice`){let n=Wc(e,t.alternatives);return n===-1?Kc(e):Yc(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Yc(e,t.body))return!1;if(t.type===`optional`)return Wc(e,[t.body])===-1||Yc(e,t.body);for(;Wc(e,[t.body])===0;)if(!Yc(e,t.body))return!1;return!0},Xc=e=>{let t=ae(e),n={kind:As,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=Yc(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(`
|
|
393
|
+
`)},Zc=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Qc=(e,t)=>`${e}:${t}`,$c=(e,t)=>{let n=De(t).filter(e=>e.kind!==`End`).map(Se),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
394
|
+
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[Qc(e.line,e.column),t]))}},el=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,tl=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},nl=(e,t)=>e.tokenIndexes.get(Qc(t.line,t.column))??Math.min(tl(e,t,!1),e.tokens.length-1),rl=(e,t)=>Math.max(tl(e,t,!0)-1,0),il=(e,t)=>{let n=e.tokens[t].text,r=Zc.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(el(e,a,n))i++;else if(el(e,a,r)&&(i--,i===0))return a;return t},al=(e,t)=>({start:nl(e,t.start),end:rl(e,t.end)}),ol=(e,t)=>{let n=t.location.range;if(n)return al(e,n);let r=nl(e,t.location);return{start:r,end:il(e,r)}},sl=(e,t)=>{let n=t.start-1,r=t.end+1;return el(e,n,`(`)&&el(e,r,`)`)&&il(e,n)===r?sl(e,{start:n,end:r}):t},cl=(e,t)=>{let n=t.start-1,r=t.end+1;return el(e,n,`(`)&&il(e,n)===r&&(el(e,n-1,`(`)||el(e,n-1,`,`))?cl(e,{start:n,end:r}):t},ll=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),ul=(e,t)=>ll(e,{start:t,end:t}),dl=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?x(r):r+1,r>=n)return i;i++}return i},fl=(e,t)=>{let n=e.tokens[t],r=dl(e,n.line,n.column);return e.source.slice(r,dl(e,n.line,n.endColumn)+1)},pl=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},ml=t=>{let n=$c(``,t),r=n.tokens.reduce((e,t,r)=>{if(!pl(n,r))return e;let i=dl(n,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},t);if(r!==t&&Xc(t)!==void 0)throw new e.I(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return r},hl=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:dl(e,n.line,n.endColumn)+1,a=e.source.slice(i,dl(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
395
|
+
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},gl=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},_l=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(el(e,i,r))return i;return-1},vl=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`Product`,`N_Times`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),yl=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),bl=(e,t)=>el(e,t.start,`(`)&&il(e,t.start)===t.end,xl=(e,t)=>sl(e,ol(e,t)),Sl=(e,t,n)=>xl(e,t.args[0]).start===n.start?t.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:e.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Cl=(e,t,n)=>bl(e,n)?`N_ParenExpr`:t.kind===`String`?fl(e,n.start):t.kind===`Apply`?Sl(e,t,n):t.kind===`And`||t.kind===`Or`?t.isBulleted?t.kind===`And`?`N_ConjList`:`N_DisjList`:`N_InfixExpr`:vl.get(t.kind),wl=(e,t,n)=>{if(t.kind===`String`&&!bl(e,n))return!1;if(t.kind===`Identifier`&&!t.name.includes(`!`))return!0;let r=Cl(e,t,n);return r===void 0||yl.has(r)?void 0:!0},Tl=(e,t,n)=>{let r=(t,n=t)=>ll(e,{start:t,end:n}),i=(t,n=xl(e,t))=>({last:ll(e,n),lastKind:Cl(e,t,n)}),a=(e,t)=>({hasChildlessFirstChild:!1,last:r(n.start+1,e),lastKind:t}),o=(t,n)=>{let i=xl(e,t);return{hasChildlessFirstChild:wl(e,t,i),last:r(i.end+1),lastKind:n}};if(bl(e,n))return{hasChildlessFirstChild:!1,...i(t,{start:n.start+1,end:n.end-1})};switch(t.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...i(t.kind===`If`?t.condition:t.action)};case`Tuple`:case`SetEnumeration`:{let a=t.elements[0];return a===void 0?{hasChildlessFirstChild:!1,last:r(n.end),lastKind:e.tokens[n.end].text}:{hasChildlessFirstChild:!1,...i(a)}}case`Except`:return{hasChildlessFirstChild:!1,...i(t.function)};case`FunctionSet`:return{hasChildlessFirstChild:!1,...i(t.domain)};case`SetMap`:return{hasChildlessFirstChild:!1,...i(t.expression)};case`WeakFairness`:case`StrongFairness`:return{hasChildlessFirstChild:!1,...i(t.subscript)};case`Case`:return a(xl(e,t.arms[0].body).end,`N_CaseArm`);case`Record`:case`RecordSet`:return a(xl(e,t.fields[0].value).end,t.kind===`Record`?`N_FieldVal`:`N_FieldSet`);case`FunctionConstruction`:case`Forall`:case`Exists`:return a(xl(e,t.bounds[0].set).end,`N_QuantBound`);case`Choose`:case`SetFilter`:return(t.kind===`Choose`?t.pattern:t.bound.pattern).kind===`Tuple`?a(il(e,n.start+1),`N_IdentifierTuple`):void 0;case`Decimal`:{let t=e.tokens[n.start],i=t.column+t.text.indexOf(`.`);return{hasChildlessFirstChild:!1,last:{...r(n.start),beginColumn:i,endColumn:i},lastKind:`.`}}case`Let`:return a(xl(e,t.body).start-2,`N_LetDefinitions`);case`Product`:return o(t.factors[0],`N_GenInfixOp`);case`And`:case`Or`:{if(t.operands.length===1)return;if(!t.isBulleted&&t.operands.length>2)return{hasChildlessFirstChild:void 0,last:r(xl(e,t.operands[t.operands.length-1]).start-1),lastKind:`N_GenInfixOp`};if(!t.isBulleted)return o(t.operands[0],`N_GenInfixOp`);let n=xl(e,t.operands[1]);return{hasChildlessFirstChild:!0,last:r(n.start-1,n.end),lastKind:t.kind===`And`?`N_ConjItem`:`N_DisjItem`}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...i(t.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:wl(e,t.expression,xl(e,t.expression)),last:r(n.end),lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=t.kind===`FunctionApplication`?t.function:t.record,i=xl(e,n),a=i.end+1;return{hasChildlessFirstChild:wl(e,n,i),last:r(a),lastKind:e.tokens[a].text}}case`Apply`:{let a=Sl(e,t,n);return a===`N_OpApplication`?t.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:r(n.start+1,n.end),lastKind:`N_OpArgs`}:a===`N_PrefixExpr`?{hasChildlessFirstChild:!0,...i(t.args[0],{start:n.start+1,end:n.end})}:o(t.args[0],a===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`)}}},El=(e,t)=>{let n=xl(e,t),r=ll(e,n),i=Tl(e,t,n),a=t.kind===`Number`||t.kind===`String`||(t.kind===`And`||t.kind===`Or`)&&t.operands.length===1;return i===void 0&&a||i!==void 0&&i.hasChildlessFirstChild===void 0?[{location:r,message:`DEF clause entry should describe a defined operator.`}]:i?.hasChildlessFirstChild===void 0||i.lastKind===void 0?[]:[...i.hasChildlessFirstChild?[{location:r,message:`Was expecting a GeneralId.`}]:[],...i.lastKind===`N_OpArgs`?[{location:i.last,message:"Selector `!(...)' should not have argument(s)."}]:[{location:i.last,message:`Unexpected token found.`},{location:i.last,message:`Need name or step number here, not \`${i.lastKind}'.`}],{location:r,message:`DEF clause entry should describe a defined operator.`}]},Dl={low:15,high:15},Ol={low:16,high:16},J=(e,t,n)=>({low:e,high:t,isAssociative:n}),kl=new Map([[`=>`,J(1,1,!1)],[`<=>`,J(2,2,!1)],[`~>`,J(2,2,!1)],[`-+->`,J(2,2,!1)],[`/\\`,J(3,3,!0)],[`\\/`,J(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,J(5,5,!1)]),[`\\cdot`,J(5,14,!0)],[`@@`,J(6,6,!0)],[`:>`,J(7,7,!1)],[`<:`,J(7,7,!1)],[`\\cup`,J(8,8,!0)],[`\\cap`,J(8,8,!0)],[`\\`,J(8,8,!1)],[`..`,J(9,9,!1)],[`...`,J(9,9,!1)],[`##`,J(9,13,!0)],[`$`,J(9,13,!0)],[`$$`,J(9,13,!0)],[`??`,J(9,13,!0)],[`!!`,J(9,13,!1)],[`\\sqcap`,J(9,13,!0)],[`\\sqcup`,J(9,13,!0)],[`\\uplus`,J(9,13,!0)],[`\\wr`,J(9,14,!1)],[`+`,J(10,10,!0)],[`++`,J(10,10,!0)],[`(+)`,J(10,10,!0)],[`\\oplus`,J(10,10,!0)],[`%`,J(10,11,!1)],[`%%`,J(10,11,!0)],[`|`,J(10,11,!0)],[`||`,J(10,11,!0)],[`\\X`,J(10,13,!1)],[`-`,J(11,11,!0)],[`--`,J(11,11,!0)],[`(-)`,J(11,11,!0)],[`\\ominus`,J(11,11,!0)],[`*`,J(13,13,!0)],[`**`,J(13,13,!0)],[`/`,J(13,13,!1)],[`//`,J(13,13,!1)],[`\\div`,J(13,13,!1)],[`\\o`,J(13,13,!0)],[`(.)`,J(13,13,!0)],[`\\odot`,J(13,13,!0)],[`(/)`,J(13,13,!1)],[`\\oslash`,J(13,13,!1)],[`(\\X)`,J(13,13,!0)],[`\\otimes`,J(13,13,!0)],[`&`,J(13,13,!0)],[`&&`,J(13,13,!0)],[`\\star`,J(13,13,!0)],[`\\bullet`,J(13,13,!0)],[`\\bigcirc`,J(13,13,!0)],[`^`,J(14,14,!1)],[`^^`,J(14,14,!1)]]),Al=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,jl=/* @__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}]]),Ml={low:17,high:17},Nl=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),Pl=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),Fl=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Il=/* @__PURE__ */ new Set([...Fl,`'`]),Ll=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Rl=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),zl=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Bl=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Vl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Il]),Hl=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Ul=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Wl=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Gl=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Kl=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),ql=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Jl=/* @__PURE__ */ new Set([``,`*`,`-`]),Yl={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},Xl=(e,t)=>e.line-t.line||e.column-t.column,Zl=(e,t)=>({start:Xl(e.start,t.start)<=0?e.start:t.start,stop:Xl(e.stop,t.stop)>=0?e.stop:t.stop}),Ql=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),$l={printed:``,set:``},eu={printed:`
|
|
396
|
+
`,set:``},tu={printed:`
|
|
396
397
|
`,set:`
|
|
397
|
-
`},
|
|
398
|
-
`)}\n`},ql=(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`||Bl.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)?`====`:Tl.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}},T=(e,t=ne())=>se(e,t,t),le=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}},ue=e=>{let t=p;p=void 0;let n=e();return p=t,n},de=e=>{h.push(o);let t=e();return h.pop(),t},fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ae(e),E=(e,t=0)=>{let n=C(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=C();if(e.kind===`End`)throw T(`Unexpected end of expression`);return o++,e},O=e=>E(e)?(o++,!0):!1,k=e=>{if(!E(e))throw T(`Expected ${JSON.stringify(e)} but found ${ie(C())}`);return D()},pe=()=>{let e=C();if(e.kind!==`Identifier`)throw T(`Expected an identifier but found ${ie(e)}`);if(ae(e))throw T(`Unexpected keyword ${e.text}`);return o++,e.text},me=()=>{let e=o;return{name:pe(),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`&&(gl.has(e.text)||sl.has(e.text)||ml.has(e.text))?(o++,e.text):pe()},_e=!1,ve=()=>C().kind===`Identifier`||!fe(C())?pe():(_e=!0,D().text),ye=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},be=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},xe=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;C(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;C(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},Se=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;C(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return C(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},Ce=()=>{if(!O(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(E(`>>`)?[]:be(me));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},we=()=>{let e=()=>{let e=be(Ce);k(`\\in`);let t=ue(M);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!i||xe(1));)D(),t.push(e());return t.flat()},Te=()=>{let e=C();if(i&&Bl.has(e.text)){let t=o;D();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`||E(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(x(o,o)),n.push(pe()),e&&E(`(`)?Ae():[]),s=[a(!i)];for(;E(`!`)&&C(1).kind===`Identifier`;)D(),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(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=o,t=Ve();return{subscript:t.location.range?t:S(t,e),lastArgs:[]}}throw T(`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`&&E(`==`,ml.has(n.text)?3:4))},De=e=>{let t=C(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&xl.has(t.text)||Ee(e)},Oe=()=>{let e=C(),t=e.kind===`Operator`&&(sl.has(e.text)||hl.has(e.text))&&De(e);if(i&&e.kind!==`String`&&(hl.has(e.text)||yl.has(e.text)&&e.text!==`'`&&!pl.has(e.text)||vl.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`&&yl.has(e.text)&&De(e)){o++;let t=v(e);if(pl.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:Wl(e.text,n,t),operator:e.text,location:v(e)},o-1)}if(E(`LAMBDA`)){let t=o;D();let n=he(be(me));k(`:`);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=le(M);if(n)return n;throw T(`Unexpected ${ie(C())}`)},ke,Ae=()=>ye(()=>{let e=o;k(`(`);let t=be(Oe);return k(`)`),ke=x(e),t}),je=()=>{let e=D();s.push(e.column);let t=[M()],n=()=>{for(;Hl(ne())&&ne().text===e.text&&ne().column===e.column;)o++,t.push(M())};return i?ue(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:v(e)}},Me=e=>ye(()=>{let t=v(e),n=C().kind===`Identifier`,r=E(`|->`,1)&&(n||fe(C()));if(r||n&&E(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=v(C()),i=e();return n.range=x(t),k(r?`|->`:`:`),{name:i,value:M(),location:n}},a=[i(()=>n?pe():D().text),...O(`,`)?be(()=>i(pe)):[]];return k(`]`),{kind:e,fields:a,location:t}}if(xe()){let e=o,n=we();if(!i||E(`|->`)){k(`|->`);let e=M();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=M();if(O(`->`)){let e=M();return k(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(O(`EXCEPT`)){let e=be(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!fe(C()))throw T(`Expected a field name but found ${ie(C())}`);if(!i&&E(`@`))throw T(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:be(()=>M())}),k(`]`);return k(`=`),{path:e,value:M()}});return k(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!E(`]_`)){let e=[a];for(;O(`,`);)e.push(M());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:a,subscript:Te().subscript,location:t}}),Ne=()=>{let e=o,t=S(He(),e),n=v(D());return S({kind:`Apply`,operator:`\\in`,args:[t,ue(M)],location:n},e)},Pe=e=>ye(()=>{let t=v(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(xe()&&(C(1).text===`\\in`||E(`<<`))){let e=o,n=Ce();k(`\\in`);let r=ue(M);if(O(`:`)){let e=ue(M);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=C().kind===`Identifier`&&E(`\\in`,1)?Ne():M();if(O(`:`)){let e=we();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(M());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Fe=e=>{let t=v(e),n=ye(()=>E(`>>`)||E(`>>_`)?[]:be(()=>M()));if(O(`>>_`)){if(n.length!==1)throw se(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:ue(Te).subscript,location:t}}return k(`>>`),{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 k(`:`),{kind:n,bounds:e,body:M(),location:t}}let i=he(be(me));return k(`:`),{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(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:M(),otherRange:x(n),location:v(e)};let r=M();k(`->`),t.push({condition:r,body:M()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:v(e)}},Re=()=>{let e=C(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||bl.has(e.text)||e.kind===`Operator`&&(sl.has(e.text)||ml.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&gl.has(e.text))},ze=()=>{let e=D();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:E(`(`)?Ae():[]}},Be=(e,t,n,r,i)=>{let a=[{kind:`Name`,name:e,args:t}],s=[x(r,r)],c=[n];for(;Re();){D();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=D(),a=v(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=be(pe);return k(`:`),{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=he(O(`(`)?be(me):[]);o.names.length>0&&k(`)`),k(`::`);let s=x(t),c=M();if(!i&&e!==void 0&&l!==void 0&&Vl(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=E(`(`);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`&&(Ul(r.text)||r.text===`'`&&!i);if(u&&E(`(`)){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=ye(()=>M());return k(`)`),Gl.set(e,x(t)),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();k(`THEN`);let t=M();return k(`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);!O(`IN`);){if(i&&E(`RECURSIVE`))throw T(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){n.push(...ht());continue}let r=ct(!i&&O(`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=O(`\\in`)?M():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:M(),location:a}}case`WF_`:case`SF_`:{let e=Te(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ye(()=>{k(`(`);let e=M();return k(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw T(`Unexpected ${ie(r)}`,r)},A=(e,t,n)=>{l=u={low:t,high:n};let r=M(n+1),i=C(),a=ml.has(i.text)?al.high:sl.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`&&Hl(t))return je();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[A(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[A(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),Wl(t.text,A(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{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=()=>{D();let e=ye(()=>be(()=>M()));return ye(()=>k(`]`)),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(ml.has(n.text)&&e<=15){D(),l=al,r=S(We(n,r),t);continue}if(n.text===`[`){let e=Ge();l=ol,r=S({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&fe(C(1))){D();let e=D().text;r=S({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=sl.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(D(),o.low>12&&E(`-`))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`)&&dl.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`&&ml.has(e.text)&&E(`(`,1)?le(()=>ye(()=>{D(),D();let t=M(),n=o-1;return k(`)`),{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!==`!`&&(Rl.has(n.text)&&e++,zl.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>E(`(`,1)&&Xe()?le(()=>ye(()=>{D(),D();let t=M();k(`,`);let n=M();return k(`)`),{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?sl.get(n.text):void 0;if(!e){if(E(`[`)){let e=Ge();return Ye(t,`Postfix`,ul,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&fe(C(1))){D();let e=D().text;return Ye(t,`Postfix`,ul,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(Ze(n)){o=t;return}return D(),{...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:cl(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!ml.has(n.text))return;if(j(n)){o=t;return}return D(),Ye(t,`Postfix`,al,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&Hl(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?ll.get(n.text):void 0;if(l)return D(),Ye(t,`Prefix`,l,e=>Wl(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!qe(n))return;let u=n.kind===`Operator`&&fl.has(n.text);return Je(u?Ve():ue(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=()=>de(()=>{let e=le(()=>Qe(!0));if(e===void 0){let e=ne();throw e.kind===`End`?T(`Unexpected end of expression`,e):se(`required expressions(s) missing before '${oe(e)}'`,e)}return ue(()=>{let t=[e];for(;;){let e=le(()=>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(!O(`(`))return[];let e=mt();return k(`)`),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`&&sl.has(C(1).text)&&C(2).kind===`Identifier`&&E(`==`,3)){let e=me(),t=D().text,n=me();return k(`==`),i(t,[lt(e),lt(n)])}let a=t.kind!==`String`&&gl.has(t.text),s=t.kind===`Identifier`&&ml.has(C(1).text)&&E(`==`,2);if(a||s){let e=a?t.text:C(1).text;a&&D();let n=me();return s&&D(),k(`==`),i(e,[lt(n)])}let c=pe();if(O(`[`)){let t=ye(()=>we());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:M(),isLocal:e,isRecursive:_(c),location:r}}let l=o,u=ot();return k(`==`),E(`INSTANCE`)?{...dt(c,u,e,r),definitionRange:x(l)}:i(c,u)},dt=(e,t,n,r)=>{let i=o;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:O(`WITH`)?be(()=>{let e=o,t=ge(),n=x(e);return k(`<-`),{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(E(`_`)&&C(1).kind===`Operator`&&(sl.has(C(1).text)||ml.has(C(1).text)))return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(C().kind!==`String`&&(gl.has(C().text)||i&&C().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!O(`(`))return{name:t,arity:0,location:e};let n=be(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},mt=()=>be(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`&&Rl.has(e.text)&&t++,e.kind===`Operator`&&zl.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=C(),t=C(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,gt(1)):t.kind===`Operator`&&ml.has(t.text)?E(`==`,2):t.kind===`Operator`&&sl.has(t.text)?C(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&gl.has(e.text)&&t.kind===`Identifier`&&E(`==`,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(`.`)&&!El.has(xt(e)),Ct=e=>{let t=xt(e);if(El.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 Cl.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`?Fl.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},Dt=()=>{let e=o,t=C();return t.kind===`Operator`&&!_l.has(t.text)&&Ul(t.text)?(o++,S({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:v(t)},e)):O(`MODULE`)?S({kind:`ModuleFact`,name:pe(),location:v(t)},e):M()},Ot=()=>{let e=o,t=C(),n=be(()=>{let e=C();if((e.kind!==`Identifier`||ae(e))&&e.kind!==`Operator`)throw T(`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=()=>be(i?Ot:Dt),At=()=>{let e=le(M);if(!e)return[];let t=[e];return de(()=>{for(;E(`,`);){let e=le(()=>(D(),M()));if(!e)return;t.push(e)}}),t},jt=()=>{let e=i?At():Et()?be(Dt):[],t=O(`DEF`)||O(`DEFS`);if(i&&e.length===0&&!t)throw T(`Expected a fact`);return{facts:e,defs:t?kt():[]}},Mt=()=>{let e=o,t=D(),n=t.text===`USE`&&O(`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=O(`NEW`),r=i?o:e,a=i?v(C()):t,s=C().kind===`Keyword`?Il.get(C().text):void 0;if(!n&&s===void 0)throw T(`Expected a declaration but found ${ie(C())}`);if(s!==void 0&&D(),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=ft(),l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw se(`declared symbol with arguments before \\in`);return l&&D(),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`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Ft();if(C().kind===`Keyword`&&Ll.has(C().text))return i?ue(Nt):Nt();if(!i)return M();let e=le(M);if(e===void 0)throw T(`Expected a hypothesis`);return e},N=()=>{let e=[Pt()];return de(()=>{for(;;){let t=le(()=>(k(`,`),Pt()));if(t===void 0)break;e.push(t)}}),e},Ft=()=>{let e=o,t=v(k(`ASSUME`)),n=()=>{let n=i?N():be(Pt);return k(`PROVE`),S({kind:`AssumeProve`,assumptions:n,conclusion:M(),location:t},e)};return i?ue(n):n()},It=e=>{let t=0;for(;C(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return C(t).kind===`Identifier`&&E(e,t+1)},Lt=()=>{let e=C();if(E(`USE`)||E(`HIDE`))return Mt();if(!i&&E(`INSTANCE`)){let t=o;return S(dt(void 0,[],!1,v(e)),t)}if(E(`DEFINE`)||_t()){let t=o;O(`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(O(`HAVE`))return{kind:`Have`,expression:M()};if(O(`TAKE`)){let e=xe(),t=he(e?[]:be(me)),n=e?we():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:be(()=>M())};if(O(`PICK`)){let e=It(`:`),t=he(e?be(me):[]),n=e?[]:we();return k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:M()}}return O(`CASE`)?{kind:`Case`,expression:M()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ft():M()}},Rt=e=>{let t=C();if(t.kind!==`Step`)throw T(`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(E(`QED`,1)),n=o,r=O(`QED`)?{kind:`Qed`}:Lt(),i=x(e),a=x(n),s=wt(C());if(s&&!wl.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(O(`BY`)){let t=x(o-1);return{kind:`By`,isOnly:O(`ONLY`),...jt(),keyword:t,location:e}}let t=C();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=x(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=v(C());O(`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`&&Cl.has(C().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Al(e);let n=t.defs[t.defs.length-1]?.location.range;return kl(Al({...e,end:e.start}),Al(n??t.keyword))},Gt=()=>{let e=o,t=v(C()),n=O(`PROOF`),r=Bt(t);if(r){let t=S(r,e);return{kind:`Leaf`,proof:t,span:Al(t.keyword),first:e,end:o-1}}let i=C();if(i.kind!==`Step`)throw T(`Expected a step number but found ${ie(i)}`);let a=o;D();let s=o,c=O(`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 Pl(`Unexpected end of (sub)proof at level ${n} before QED step`,r,Nl);if(a.kind===`Leaf`)throw Pl(`Expecting a proof step but found a${Dl[a.proof.kind]} leaf proof`,a.span,Nl);if(!i&&a.isProof)throw Pl(`PROOF keyword found in step that does not begin subproof`,a.span,Ml);let o=a.token.text[1];if(o===`+`&&!i)throw Pl(`<+> used but no subproof expected`,a.span,Ml);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=wl.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=kl(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:kl(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 Pl(`extra step(s) after finished proof`,r.span,jl,`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`||!E(`==`,1))return;let e=pe();return D(),e},Zt=()=>{if(!i)return M();let e=ne(),t=le(M);if(t)return t;throw T(`Expected "====" but found ${ie(e)}`,e)},Qt=e=>{let t=o,n=D(),r=Xt(),a=E(`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=D(),n=Xt();return S({name:n,expression:M(),isAxiom:t.text===`AXIOM`,location:v(t)},e)},en=()=>{let e=v(k(`----`));k(`MODULE`);let t=ve();k(`----`);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),O(`EXTENDS`)&&be(()=>{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(E(`MODULE`,1)){let e=en();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=v(D()),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(D()),r=be(()=>{let e=o,t=v(C());return S({name:pe(),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(E(`USE`)&&E(`ONLY`,1))throw T(`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(D()),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(D(),E(`INSTANCE`)){tn(n,S(dt(void 0,[],!0,v(r)),t));continue}tn(n,S(ut(!0),t));continue}r.kind===`Keyword`&&Sl.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=_e?il(t):void 0;if(rn!==void 0)throw new e.I(rn);return nn},Jl=e=>ql(e,`tlc`),Yl=(e,t)=>ql(e,`tlc`,t),Xl=e=>ql(e,`tlapm`),Zl=e=>ql(e,`sany`),Ql={kind:`Local`},$l=`$subexpression`,eu=/* @__PURE__ */ new WeakMap,tu=/* @__PURE__ */ new WeakMap,nu=/* @__PURE__ */ new WeakMap,ru=/* @__PURE__ */ new WeakMap,iu=/* @__PURE__ */ new WeakMap,au=/* @__PURE__ */ new WeakMap,ou=/* @__PURE__ */ new WeakSet,su=/* @__PURE__ */ new WeakSet,cu=e=>su.has(e)||lu(au.get(e))!==void 0,lu=e=>e?.find(e=>e.isEmpty?cu(e.node):ou.has(e.node))?.error,uu=/* @__PURE__ */ new WeakMap,du=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},fu=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),pu=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,mu=(e,t)=>pu(e,t)?-1:+!!pu(t,e),hu=e=>e.kind===`Operator`?e.params.length:0,gu=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],_u=e=>e.name.includes(`!`),vu=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},yu=(e,t,n)=>{let r=t.bindings.get(e);return r&&pu(r.position,t.location)&&(!n||pu(r.position,n.start))?r:void 0},bu=(t,n)=>t!==void 0&&n!==void 0&&e.Z(t)===e.Z(n),xu=(t,n,r,i)=>{if(n===void 0)return!0;if(bu(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},Su=(e,t,n,r)=>xu(t,vu(e,t)??yu(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Cu=(e,t,n)=>{xu(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},wu=(e,t,n,r)=>t.reduce((e,t,i)=>Su(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Tu=(e,t,n)=>t.reduce((e,t)=>Su(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Eu=e=>e.kind===`Name`?[e.name]:e.names,Du=e=>e.flatMap(e=>Eu(e.pattern)),Ou=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?yu(e,t,void 0)!==void 0:pu(n.location,t.location))?n:void 0},ku=(e,t)=>{let n=Ou(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??hu(n),params:r?.params??gu(n),kind:`Definition`,range:n.location.range}}let r=yu(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},Au=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,ju=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,Mu=(e,t,n)=>vu(t,e)??ku(e,n),Nu=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Pu=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Nu(e.location,e.spelling??t)},Fu=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},Iu=`In module --TLA+ BUILTINS--`,Lu=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),Ru=(t,n,r)=>r.errors.push({location:e.Z(n),message:`Cannot take subexpression of \`${Ms(t)}'.`}),zu=e=>!/^[\p{L}\d_]/u.test(e),Bu=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Vu=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Hu=(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])}})},Uu=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Hu(e.name,[],void 0):Hu(e.operator,e.args,e.argumentCounts),Wu=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Gu=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Du(e.bounds),body:e.body,sets:Wu(e.bounds)};case`SetMap`:return{names:Du(e.bounds),body:e.expression,sets:Wu(e.bounds)};case`SetFilter`:return{names:Eu(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Eu(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}},Ku=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`:case`Selection`: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}},qu=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Ju=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Yu=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`&&e.kind!==`Selection`)return e.kind===`Let`?Yu(e.body,t):Be(e).reduce((e,n)=>e??Yu(n,t),void 0)},Xu=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Xu(i,t,n||Ju(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Yu(e.set,t):Yu(e,t)},Zu=e=>e.kind===`Label`?Zu(e.body):e,Qu=e=>typeof e==`number`?`argument selector ${e}`:e,$u=`within the scope of a declaration
|
|
399
|
-
from outside that declaration's scope.`,ed=(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`&&Zu(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:Xu(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?Yu(i.body,t.name):void 0};if(!a?.label)return o(r,`Cannot find label \`${t.name}'.`);if(r===1&&c.kind===`AssumeProve`&&Ju(c,a.position)&&s)return o(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${$u}`);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`?Qu(t.operand):t.kind===`At`?`@`:`!(...)`,f=e=>t.kind===`Operand`?Vu(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=Zu(i);if(ou.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(cu(e))return o(r,`Choosing operand \`${a}' of subexpression with no operands.`);let n=Gu(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:Ku(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,ou.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(Ju(i,h)&&(!l.isGoal||s))return o(r,`Accessing ASSUME/PROVE clause ${$u}`);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`&&ou.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}.`)},td=(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)},nd=(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=vu(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)},rd=(e,t,n,r)=>{if(!qu(e))return!1;let i=Uu(e),a=i[0],o=i.length>1&&a.kind===`Name`?vu(t,a.name)?.goal??ju(a.name,n):void 0;return o&&{node:ed(e,i,o,n,r)}},id=(e,t,n)=>{let r=vu(t,e)??yu(e,n,void 0);return r?r.kind===`Instance`:dd(e,t,n)!==void 0&&[...n.bindings.keys()].some(t=>t.startsWith(`${e}!`))},ad=(t,n,r,i)=>{let a=t.location;if(vd(t,r,i))return;let o=uu.get(t);if(o!==void 0)return o;if(du(n))return t.kind===`Apply`?t.args.length:0;let s=vu(r,n);if(s?.nonFactStep){i.errors.push({location:e.Z(Pu(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(Pu(t,n)),message:`${c} proof step selected instead of expression.`});return}if(rd(t,r,i,!1)||Bu(n)&&s)return t.kind===`Apply`?t.args.length:0;if(id(n,r,i)){let r=Pu(t,n);i.errors.push({location:e.Z({...r,start:{line:r.end.line,column:r.end.column-n.slice(n.lastIndexOf(`!`)+1).length+1}}),message:`Operator name ${n} is incomplete.`});return}if(s&&t.kind!==`OperatorReference`&&(t.resolution=Ql),s)return s.arity;let l=ku(n,i);if(l)return t.kind===`Identifier`?t.name=l.key:t.operator=l.key,uu.set(t,l.arity),l.arity;let u=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``,d=u===``?void 0:vu(r,u)??ku(u,i);if(d&&!Lu.has(d.kind)){Ru(u,t.kind!==`OperatorReference`&&t.selectorRanges?.[0]||Pu(t,n),i);return}if(t.kind!==`OperatorReference`&&u!==``&&bd(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!==``&&Au(u,i))return t.kind===`Apply`?t.args.length:0;let f=Fu(t),p=t.kind===`OperatorReference`||f!==void 0;if(!zu(n)||Bu(n)||!p){i.errors.push({location:e.Z(Pu(t,n)),message:`Unknown operator: \`${Ms(n)}'.`});return}let m=t.spelling??n;i.errors.push({location:e.Z(f===`prefix`&&m===`-.`?Nu(a,`-`):Pu(t,n)),message:`Could not find declaration or definition of symbol '${m}'.`}),f&&ou.add(t),f&&a.range&&i.errors.push({location:e.Z(a.range),message:`Couldn't resolve ${f} operator symbol \`${m}'.`})},od=(e,t,n)=>(e.forEach(e=>Y(e.set,t,n)),e.reduce((e,t)=>wu(e,Eu(t.pattern),t.pattern.ranges,n),t)),sd=(e,t)=>e.kind===`Identifier`&&e.name===t&&A(e)||Be(e).some(e=>sd(e,t)),cd=(e,t)=>{e.kind===`FunctionConstruction`&&sd(e.body,t)&&(e.isRecursive=!0),Be(e).forEach(e=>cd(e,t))},ld=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Du(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`?od(t.bounds,n,a):Tu(n,t.params,a),u=vu(l,o)??yu(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=gu(t)),t.kind===`Function`?(Y(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),cd(t.body,o),t.isSelfReferential=sd(t.body,o)):Y(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:xu(o,vu(n,o)??yu(o,a,s),{kind:`Definition`,arity:hu(t),range:s},a)},ud=(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(vu(e,t.name)?.isPending)return e;let n={name:t.name,arity:hu(t),params:gu(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=xu(t.name,vu(e,t.name)??yu(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)=>mu(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?jd(t,e,r):l(e,t),e)},f=d(t.reduce((e,t)=>{let n=du(t.name)?e:d(e,e=>!pu(t.location,e.location)),a={name:t.name,arity:hu(t),kind:`Definition`,range:t.location.range,parent:n};if(_u(t))return{...a,params:gu(t)};let s=i.some(e=>e.location===t.location),c=r.isGenerated||t.isLocal||du(t.name),l=s?{...r,isGenerated:!0,errors:[],warnings:[]}:c?{...r,isGenerated:c}:r;return ld(t,n,l,o)?{...a,params:gu(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},dd=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:vu(t,r)??yu(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},fd=(t,n,r)=>{if(!qu(t))return!1;let i=Uu(t),a=i.findIndex(e=>e.kind!==`Name`),o=dd(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},pd=(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)},md=(t,n,r)=>{let i=t.location.range,a=t=>{i&&r.errors.push({location:e.Z(i),message:t})},o=nu.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)ou.add(t),a(`LAMBDA expression used where an expression is required.`);else if(t.kind===`OperatorReference`){let e=ad(t,t.operator,n,r);e!==void 0&&a(`The operator ${Ms(t.operator)} requires ${e} arguments.`)}else Y(t,n,r)},hd=(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=dd(i,o,s)?.range??Mu(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 md(t,o,s),!0;let d=Gl.get(t);if(d)return c(d,`An expression appears as argument number ${r+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let f=eu.get(t)??t,p=f.kind===`Subexpression`||f.kind===`Apply`&&f.argumentCounts?.at(-1)===0?Uu(f):[],m=p.findIndex(e=>`args`in e&&e.args.length>0);if(m!==-1&&qu(f)){let e=p[m];return c(f.selectorRanges?.[m],`Selector \`${e.kind===`Name`?e.name:`!(...)`}' should not have argument(s).`),!1}if(t.kind===`Lambda`){if(eu.has(t)?Y(t,o,s):yd(t,o,s),lu(au.get(t)))return!1;let e=t.params.length===n;return!e&&eu.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(f!==t){let e=lu(au.get(t));return e&&s.errors.push(e),e||c(f.location.range,`Expected arity ${n} but found operator of arity 0.`),!1}if(t.kind===`Subexpression`)return Y(t,o,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 h=t.kind===`Identifier`?t.name:t.operator,g=Mu(h,o,s)?.params??[],_=ad(t,h,o,s);return t.kind===`Identifier`&&_!==void 0&&_!==n&&c(Pu(t,h),`Expected arity ${n} but found operator of arity ${_}.`),t.kind===`OperatorReference`&&_!==void 0&&_!==n&&l(h,_),_===n&&g.every(e=>e===0)},gd=(t,n,r)=>{let i=t.operator,a=Mu(i,n,r),o=fd(t,n,r)?void 0:ad(t,i,n,r);if(o!==void 0&&o!==t.args.length&&r.errors.push({location:e.Z(t.argumentsRange??Pu(t,i)),message:`The operator ${Ms(i)} requires ${o-(dd(i,n,r)?.arity??0)} arguments.`}),o!==t.args.length){su.add(t);return}let s=a&&(a.kind===`Definition`?a.params:t.args.map(()=>0));if(s===void 0){t.args.forEach(e=>_d(e,n,r));return}let c=t.selectorRanges?.at(-1)??Pu(t,i),l=i===$l,u=t.args.slice(0,s.length).map((e,t)=>{let a=l?iu.get(e):void 0;return hd(e,s[t],a?.index??t,a?.operator??i,a?.range??c,n,l?{...r,isGenerated:!1}:r)});pd(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.`})})},_d=(e,t,n)=>{e.kind===`Identifier`?ad(e,e.name,t,n):Y(e,t,n)},vd=(e,t,n)=>{let r=tu.get(e);return r?(r.applications.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>hd(r,e.params[i],i,e.operator,e.range,t,n))),n.errors.push(lu(r.nulls)??r.error),!0):!1},yd=(e,t,n)=>Y(e.body,wu(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),Y=(t,n,r)=>{if(eu.has(t)&&!r.isGenerated){let e=lu(au.get(t));if(e){r.errors.push(e);return}Y(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>Y(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&&(su.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=fd(t,n,r)?void 0:ad(t,i,n,r);if(a===0){let e=Mu(i,n,r),a=e?.kind;(a===`Variable`||a===`Theorem`||a?.startsWith(`New`)||Au(i,r))&&su.add(t),pd(e,i,0,Pu(t,i),r);return}a!==void 0&&r.errors.push({location:e.Z(Pu(t,i)),message:`The operator ${Ms(i)} requires ${a} arguments.`}),su.add(t);return}case`OperatorReference`:ad(t,t.operator,n,r);return;case`Apply`:gd(t,n,r);return;case`Lambda`:eu.has(t)?yd(t,n,r):t.location.range&&(ou.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`:Y(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&&Y(t.other,n,r);return;case`Let`:Y(t.body,ud(t.definitions,n,r,t.instances,t.recursive),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:Y(t.body,od(t.bounds,n,r),a(Du(t.bounds)));return;case`UnboundedQuantifier`:Y(t.body,wu(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&Y(t.set,n,r),Y(t.body,wu(n,Eu(t.pattern),t.pattern.ranges,r),a(Eu(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:Y(t.predicate,od([t.bound],n,r),a(Eu(t.bound.pattern)));return;case`SetMap`:Y(t.expression,od(t.bounds,n,r),a(Du(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??Nu(i.location,i.name)),message:`Non-unique fields in constructor.`}),Y(i.value,n,r)});return;case`Except`:Y(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),Y(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:Y(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(td(t,r))return;Y(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),nd(t,n,r);return;case`Subexpression`:xd(t,n,r)&&su.add(t);return;case`Selection`:return}},bd=(t,n,r,i,a,o)=>{let s=vu(a,t)??yu(t,o,void 0);return!s?.isPending||!r||!i?!1:n.length===s.arity?(n.forEach(e=>Y(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)},xd=(t,n,r)=>{if(fd(t,n,r)||vd(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&&ku(s.slice(0,t+1).join(`!`),r)),l=s.length>1&&(vu(n,s[0])??yu(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?ku(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=vu(n,i.name),o=t??ku(i.name,r);if(o===void 0&&!Au(i.name,r)||o?.kind===`Instance`)return r.errors.push({location:e.Z(a),message:`Unknown operator: \`${Ms(i.name)}'.`}),!0;if(o&&(!Lu.has(o.kind)||t?.nonFactStep))return Ru(i.name,a,r),!0}if(i.kind===`Name`&&bd(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=>_d(e,n,r));let h=rd(t,n,r,!1);return h?h.node===void 0:!1},Sd=(t,n)=>{let r=t.location.range;!n.isModuleKnown(t.name,t.location)&&r&&n.errors.push({location:e.Z({...r,start:{line:r.end.line,column:r.end.column-t.name.length+1}}),message:`Module \`${t.name}' used without being extended or instantiated.`})},Cd=(t,n,r,i)=>{if(t.kind===`ModuleFact`){Sd(t,i);return}if(t.kind===`ExceptAt`&&t.location.range)return i.errors.push({location:e.Z(t.location.range),message:"Unknown operator: `@'."}),Iu;let a=Td(t,n,r,i);if(eu.has(t))return Y(t,r,i),a;if(fd(t,r,i))return a;let o=rd(t,r,i,!0);if(o){let n=o.node?.kind;return n===void 0?Iu:n===`AssumeProve`||n===`NewSymbol`?void 0:t.location.range&&e.Z(t.location.range)}if(t.kind===`Subexpression`)return xd(t,r,i)?Iu:a;let s=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;return t.kind===`Identifier`&&vu(r,s)?.nonFactStep?(i.errors.push({location:e.Z(Pu(t,s)),message:`Step number of non-fact used as a fact`}),Iu):(Au(s,i)||vu(r,s)?.goal||t.kind===`Identifier`&&id(s,r,i)||Y(t,r,i),a)},wd=(t,n,r)=>{if(t.kind===`ModuleFact`)return Sd(t,r),r.isModuleKnown(t.name,t.location);let i=t.location.range,a=t.kind===`Identifier`?t.name:t.kind===`OperatorReference`?t.operator:``;if(a===``||!i)return!0;let o=vu(n,a),s=o??ku(a,r)??yu(a,r,i);return s===void 0&&Au(a,r)||(s===void 0&&r.errors.push({location:e.Z(i),message:`Unknown operator: \`${Ms(a)}'.`}),o?.nonFactStep===`Define`)||(o?.nonFactStep&&r.errors.push({location:e.Z(i),message:`DEF clause entry refers to a non-definition step.`}),s&&Lu.has(s.kind)&&!Bu(a))?!0:(r.errors.push({location:e.Z(i),message:`DEF clause entry should describe a defined operator.`}),!1)},Td=(t,n,r,i)=>{let a=t.location.range&&e.Z(t.location.range);if(eu.has(t))return lu(au.get(t))?Iu:n.location.range&&e.Z(n.location.range);if(tu.has(t)||t.kind===`ExceptAt`)return Iu;switch(t.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let e=Uu(t)[0];if(t.kind===`Subexpression`||e.kind!==`Name`)return;let n=t.kind===`Identifier`?t.name:t.operator,o=vu(r,e.name)?.goal??ju(e.name,i);if(Au(n,i)||o||Bu(n)&&vu(r,n)||t.kind===`Identifier`&&id(n,r,i))return;let s=Mu(n,r,i),c=t.kind===`Apply`?t.args.length:0;return s?.arity===c?a:Iu}default:return a}},Ed=(t,n,r)=>{let i=ru.get(t.facts)??t.facts,a=t.facts.map((e,t)=>Cd(e,i[t],n,r)),o=t.facts.filter(e=>e.kind!==`ModuleFact`||r.isModuleKnown(e.name,e.location)).length,s=t.defs.filter(e=>wd(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
|
|
400
|
-
the name of a theorem, assumption, or step.`})});let c=t.location.range;o+s===0&&c&&r.errors.push({location:e.Z(c),message:t.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},Dd=(e,t,n)=>(e.set&&Y(e.set,t,n),Su(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Od=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Dd(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Od(t,e.scope,e.unit,!0):Y(t,e.scope,e.unit),e),{scope:t,unit:n});return Y(e.conclusion,i.scope,i.unit),i.scope},kd=(e,t,n)=>e.kind===`AssumeProve`?Od(e,t,n):(Y(e,t,n),t),Ad=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ed(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Nd(t,e,r),t)},jd=(e,t,n)=>{let r=zd(e,t,n);return e.name===void 0?r:Su(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Md=(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:Wu(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}},Nd=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=Md(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=(t,n)=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,nonFactStep:n};switch(r.kind){case`Assert`:{let a=kd(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ad(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 Ad(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 Ed(r,t,n),s(t,r.kind);case`Instance`:return s(jd(r,t,i),r.kind);case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?jd(t,e,i):ud([t],e,n),t),r.kind);case`Have`:case`Case`:return Y(r.expression,t,i),Ad(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>Y(e,t,i)),o(t);case`Take`:return o(wu(od(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=wu(od(r.bounds,t,i),r.names,r.nameRanges,i);return Y(r.body,a,{...i,labelParams:[...i.labelParams,...Du(r.bounds),...r.names]}),Ad(e.proof,o(t),n),o(a)}default:return Ad(e.proof,o(t),n),o(t)}},Pd=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:kd(e.statement,void 0,t);e.name!==void 0&&Cu(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ad(e.proof,n,t),r&&(r.isInProof=!1)},Fd={line:0,column:0},Id=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Ld=(e,t)=>{let n=new Map([...fu,...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},Rd=(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){md(n,o,a);return}let i=Gl.get(n);if(n.kind===`Lambda`&&!i){yd(n,o,a),n.params.length!==t.arity&&r&&s(t,e.Z(r));return}if(n.kind===`OperatorReference`&&!i){let i=ad(n,n.operator,o,a);i===void 0?s(t,Iu):i!==t.arity&&r&&s(t,e.Z(r));return}if(n.kind!==`Identifier`||i){let n=i??r;n&&a.errors.push({location:e.Z(n),message:`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${Ms(t.name)}'.`}),s(t,Iu);return}let c=ad(n,n.name,o,a);c!==void 0&&c!==t.arity&&a.errors.push({location:e.Z(Pu(n,n.name)),message:`Expected arity ${t.arity} but found operator of arity ${c}.`}),c!==t.arity&&s(t,Iu)},l=t.location.range,u=n.filter(e=>vu(o,e.name)!==void 0||ku(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=ad(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:ad(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},zd=(e,t,n)=>{let r=n.getInstance(e);return Rd(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>Su(e,t[0],t[1],n),t)},Bd=(e,t,n,r)=>{let i=Ld(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),Rd(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,isModuleKnown:r.isModuleKnown,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])??Fd}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Vd=(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)=>mu(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},Hd=(t,n)=>{let r=Ld(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([...fu,...n.bound].map(e=>[e[0],{...e[1],position:Fd}])),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,isModuleKnown:n.isModuleKnown,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=>Cu(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Vd([...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=xu(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=>{Id(t,e)?Y(e.body,void 0,n):ld(e,void 0,n,o)&&a.set(e.name,{kind:`Definition`,arity:hu(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>c(e.location,void 0,!1,t=>{Tu(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>Cu(n,e,t)),e.name!==void 0&&Cu(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=>{Y(e.expression,void 0,t),e.name!==void 0&&Cu(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=>Pd(e,t))),...t.uses.map(e=>c(e.location,void 0,!1,t=>Ed(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)},Ud=/* @__PURE__ */ new WeakSet,Wd=/* @__PURE__ */ new WeakMap,Gd=(e,t)=>{if(t.length===0)return e;let n={...e};return Ud.has(e)&&Ud.add(n),Wd.set(n,[...t,...Wd.get(e)??[]]),n},Kd=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Qd(e,(e,r)=>Kd(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},qd=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Jd=/* @__PURE__ */ new WeakMap,Yd=e=>Jd.get(e)??e.name,Xd=(e,t)=>(Yd(t)!==e.name&&Jd.set(e,Yd(t)),e),Zd=(e,t)=>Xd(e.kind===`Function`?{...e,bounds:qd(e.bounds,e=>t(e,[])),body:t(e.body,Du(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Qd=(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=>Zd(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:qd(e.bounds,n),body:t(e.body,Du(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,Eu(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,Eu(e.bound.pattern))};case`SetMap`:return{...e,bounds:qd(e.bounds,n),expression:t(e.expression,Du(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`Selection`:return{...e,expression:n(e.expression)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},$d=(e,t)=>{Qd(e,(e,n)=>(t(e,n),e))},ef=`LAMBDA`,tf=e=>`${e}@SUBSTITUTION`,nf=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(nf),rf=(e,t)=>{if(e.kind!==`Identifier`)return!nf(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&&!nf(n.body)},af=(e,t=/* @__PURE__ */ new Set)=>{let n=Ve(e),r=n===void 0||t.has(n)?[]:[n];return $d(e,(e,n)=>r.push(...af(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},of=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}},sf=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),cf=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},lf=(e,t)=>e.map(e=>({pattern:cf(e.pattern,t),set:e.set})),uf=(e,t)=>e.kind===`Function`?{...e,bounds:lf(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},df=(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=>Xd({...uf(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:lf(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:cf(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:cf(e.bound.pattern,n),set:e.bound.set}};default:return e}},ff=e=>`${e}@ENABLED`,pf=(e,t)=>e.modes.get(t)??e,mf=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!A(e)&&t.instantiation.variables.has(e.name),hf=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>hf(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(mf(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?hf(r.body,t,/* @__PURE__ */ new Map):void 0},gf=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return mf(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ff(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Sf(e.expression,pf(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Sf(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Sf(e.subscript,pf(t,`Primed`),n),location:r},Sf(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=hf(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:ff(r),location:e.location},location:e.location},Sf({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},_f=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Ql}),vf=(e,t)=>e.map(e=>_f(e.name,t)),yf=(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:vf(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),bf=(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:[...vf(t,r),...i.map(e=>_f(e,r))],location:r},location:r}},xf=(e,t)=>e.instantiation.isParameterized(t)?wf(e,t):void 0,Sf=(t,n,r)=>{let i=e=>Sf(e,n,r);if(t.kind===`Selection`&&[...r].every(e=>e[0]===e[1])){let e=t.expression,r=n.selections.get(e)??i(e);return n.selections.set(e,r),{...t,expression:r}}let a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!A(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:Sf(t.expression,pf(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:Sf(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},pf(n,`Enabled`),r)};let c=gf(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||!rf(e,a)))return Gd(e,[t]);if(e&&r){let n=tf(t.name);return r.set(n,e),_f(n,t.location)}let i=xf(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&&hu(s)>0?bf(i,o,hu(s),t.location):{kind:`Apply`,operator:i,args:vf(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||Ud.has(t),l=e=>(c&&Ud.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:ef,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:ef,args:r,resolution:Ql},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=xf(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...vf(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 Gd(e,[t]);let r=xf(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?bf(r,o,hu(i),t.location):{...t,operator:r}}let l=of(n),u=Qd(t,(e,t)=>t.length===0?i(e):Sf(e,n,sf(r,t,l)));return df(u,r,l)},Cf=(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:_f(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},wf=(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=of(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o,selections:/* @__PURE__ */ new Map}:e,c=uf(Zd(i,(e,t)=>Sf(e,s,sf(/* @__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&&Wd.set(l,[u,...Wd.get(i.body)??[]]),Cf({...c,body:l},r.params,i.location)}):t},Tf=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>af(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t,selections:/* @__PURE__ */ new Map};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>xf(i,e)??e,getQualifiedKey:t=>{let n=xf(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Cf(r,e.params,r.location)):t}}},Ef=e=>e.kind===`Let`&&e.instances!==void 0||Be(e).some(Ef),Df=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Qd(e,e=>Df(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>pu(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}},Of=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,kf=(e,t)=>e.definitions.some(e=>Ef(e.body))||e.assumptions.some(e=>Ef(e.expression))||e.theorems.some(e=>{let t=Of(e);return t!==void 0&&Ef(t)})?{...e,definitions:e.definitions.map(e=>Zd(e,e=>Df(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Df(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Of(e);return n===void 0?e:{...e,statement:Df(n,t,[])}})}:e,Af=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}])),jf={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]}},Mf=(e,t)=>{let n=jf[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Nf={Constant:0,Variable:1,State:1,Action:2,Temporal:3},Pf=(e,t)=>`${e}${t}`,Ff=(e,t,n)=>`${e}${t}${n}`,If=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Lf=(e,t,n)=>`${e},${t},${n}`,Rf=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),zf=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Bf=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Vf=(e,t)=>{t.constraints.forEach((t,n)=>zf(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>Bf(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},X=(e,t,n,r)=>({...Rf(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Hf=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Uf=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Wf=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],{...X(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),Gf=X(`'`,2,[1],[0]),Kf=X(`UNCHANGED`,2,[1],[0]),qf=X(`ENABLED`,1,[2],[0]),Jf=X(`[]`,3,[3],[0]),Yf=X(`<>`,3,[3],[0]),Xf=X(`$ConjList`,0,[3],[1]),Zf=X(`$DisjList`,0,[3],[1]),Qf=X(`$IfThenElse`,0,[3],[1]),$f=X(`$Case`,0,[3],[1]),ep=X(`$BoundedForall`,0,[3],[1]),tp=X(`$BoundedExists`,0,[3],[1]),np=X(`$UnboundedForall`,0,[3],[1]),rp=X(`$UnboundedExists`,0,[3],[1]),ip=X(`$TemporalForall`,3,[3],[0]),ap=X(`$TemporalExists`,3,[3],[0]),op=X(`$BoundedChoose`,0,[2],[1]),sp=X(`$UnboundedChoose`,0,[2],[1]),cp=X(`$SetEnumerate`,0,[2],[1]),lp=X(`$Tuple`,0,[2],[1]),up=X(`$SetOfFcns`,0,[2],[1]),dp=X(`$CartesianProd`,0,[2],[1]),fp=X(`$SubsetOf`,0,[2],[1]),pp=X(`$SetOfAll`,0,[2],[1]),mp=X(`$FcnConstructor`,0,[3],[1]),hp=X(`$RcdConstructor`,0,[3],[1]),gp=X(`$SetOfRcds`,0,[2],[1]),_p=X(`$Except`,0,[2],[1]),vp=X(`$Pair`,0,[3],[1]),yp=X(`$Seq`,0,[2],[1]),bp=X(`$FcnApply`,0,[2,2],[1,1]),xp=X(`$RcdSelect`,0,[2,0],[1,1]),Sp=X(`$SquareAct`,2,[2,1],[0,0]),Cp=X(`$AngleAct`,2,[2,1],[0,0]),wp=X(`$WF`,3,[1,2],[0,0]),Tp=X(`$SF`,3,[1,2],[0,0]),Ep=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity,level:0}])]),Dp=e=>e.map(e=>({name:e,arity:0})),Op=(t,n)=>n.location.range?e.Y(`${t}.`,n.location.range):new e.I(`${t} at line ${n.location.line}, column ${n.location.column}`),kp=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Ap=e=>e.kind!==`Let`&&e.kind!==`Label`,jp=t=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:r.level,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:y(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=y(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Wf.get(e)??Af.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},a=(e,t,n)=>{let r=Rf(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(Ff(e,n,t))}),Bf(r.argConstraints,Pf(e,n),t.data.level),Vf(r,t.data)}),r},o=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);n.forEach((n,r)=>{if(n.kind===`Value`&&n.data.level>Hf(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(Lf(e,n,r)),c=Rf(Math.max(t.level,...n.filter((e,n)=>Uf(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)=>{Uf(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)=>zf(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||zf(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>zf(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||zf(c.constraints,e,Hf(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=>zf(c.constraints,e,Hf(r,a)))}))}),t.argParams.forEach(e=>{let t=If(e),n=o(t.operator);n?.kind===`Operator`&&zf(c.constraints,t.param,Hf(n.data,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Bf(c.argConstraints,t,e))),n.forEach((e,r)=>{if(e.kind!==`Declared`)return;let i=e.declared;Array.from({length:i.arity},(e,n)=>Bf(c.argConstraints,Pf(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Bf(c.argConstraints,Pf(i.name,a),e.data.level)}))}),t.argParams.forEach(e=>{let t=If(e),n=o(t.operator);n&&Bf(c.argConstraints,Pf(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(If(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=If(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(Ff(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(Ff(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(Ff(r.name,a,e)))}))}),c},s=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:v(`LAMBDA`,Dp(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let r=i(n,t);if(r.kind===`Defined`&&(r.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:r.levels};if(r.kind===`Declared`&&r.arity>0){let e=Rf();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:r.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Rf()}}return{kind:`Value`,data:h(e,t)}},c=(e,t)=>e.map(e=>s(e,t)),l=(t,n,r,i=[],a=Du(i))=>{let s=c(n,Ep(r,Dp(a))),l=i.map(e=>h(e.set,r)),u=o(t,s,l,a),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):Eu(d)[0]} \nexceeds the maximum level allowed by the operator`)}return u},u=(e,t)=>e.kind===`Declared`?a(e.name,e.level,t):o(e.levels,t),d=(e,t,n)=>{let r=e.map(e=>e.data.level);if(r.includes(2)&&r.includes(3))throw Op(`${n} has both temporal formula and action as arguments`,t)},f=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Op(`Action used where only temporal formula or state predicate allowed`,e);kp.has(e.operator)&&d(t,e,Ms(e.operator))},p=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Ap(n)&&n.kind!==r)throw Op(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},m=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=h(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=>Vf(i,y(e,n))),i},h=(t,n)=>{try{return g(t,n)}catch(n){throw!(n instanceof e.I)||n.sany?n:Op(n.message,t)}},g=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Rf();case`Identifier`:return u(i(e.name,t),[]);case`Apply`:{let n=c(e.args,t);return f(e,n),u(i(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return s(e,t).data;case`And`:case`Or`:{let n=c(e.operands,t),r=e.kind===`And`;return d(n,e,e.isBulleted?`${r?`Conjunction`:`Disjunction`} list`:r?`\\land`:`\\lor`),o(r?Xf:Zf,n)}case`Prime`:return l(Gf,[e.expression],t);case`Unchanged`:return l(Kf,[e.expression],t);case`Enabled`:return l(qf,[e.expression],t);case`Always`:case`Eventually`:{let n=s(e.expression,t);return p(e,n.data.level),o(e.kind===`Always`?Jf:Yf,[n])}case`If`:return l(Qf,[e.condition,e.consequent,e.alternative],t);case`Case`:return l($f,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return m(e,t);case`Forall`:case`Exists`:{let n=l(e.kind===`Forall`?ep:tp,[e.body],t,e.bounds),r=n.level===3?e.bounds.find(e=>h(e.set,t).level===2):void 0;if(r)throw Op(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return l(e.isTemporal?e.quantifier===`Forall`?ip:ap:e.quantifier===`Forall`?np:rp,[e.body],t,[],e.names);case`Choose`:return l(e.set?op:sp,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],Eu(e.pattern));case`SetEnumeration`:return l(cp,e.elements,t);case`Tuple`:return l(lp,e.elements,t);case`FunctionSet`:return l(up,[e.domain,e.range],t);case`Product`:return l(dp,e.factors,t);case`SetFilter`:return l(fp,[e.predicate],t,[e.bound]);case`SetMap`:return l(pp,[e.expression],t,e.bounds);case`FunctionConstruction`:return l(mp,[e.body],t,e.bounds);case`Record`:return l(hp,e.fields.map(e=>e.value),t);case`RecordSet`:return l(gp,e.fields.map(e=>e.value),t);case`Except`:return o(_p,[s(e.function,t),...e.updates.map(e=>({kind:`Value`,data:o(vp,[{kind:`Value`,data:o(yp,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:Rf()}:e.args.length===1?s(e.args[0],t):{kind:`Value`,data:l(lp,e.args,t)}))},s(e.value,t)])}))]);case`FunctionApplication`:return o(bp,[s(e.function,t),e.args.length===1?s(e.args[0],t):{kind:`Value`,data:l(lp,e.args,t)}]);case`Bracket`:return Rf();case`FieldAccess`:return o(xp,[s(e.record,t),{kind:`Value`,data:Rf()}]);case`BoxAction`:case`AngleAction`:return l(e.kind===`BoxAction`?Sp:Cp,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return l(e.kind===`WeakFairness`?wp:Tp,[e.subscript,e.action],t);case`Label`:return h(e.body,t);case`Selection`:{let n=e.expression,i=r.get(n);if(i)return i;let a=h(n,t);return r.set(n,a),a}case`Subexpression`:return Rf()}},_=(e,t,n=!1,r=/* @__PURE__ */ new Set)=>{let a=(e,i=n,a=t)=>_(e,a,i,r),o=(e,o)=>{let s=i(e,t);s.kind===`Declared`?(n&&r.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,[]),r;case`Apply`:return o(e.operator,e.args),r;case`Lambda`:case`Let`:case`Selection`:return r;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)),r;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Ep(t,Dp(e.names))),r;default:return $d(e,(e,r)=>a(e,n,Ep(t,Dp(r)))),r}},v=(e,t,n,r)=>{let i=Ep(r,t),a=h(n,i),o=e=>t.some(t=>t.name===e),s=_(n.kind===`Selection`?n.expression:n,i),c={...Rf(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(Pf(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(Ff(e.name,n,t.name))).map(e=>Lf(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(If(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=If(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},y=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Rf(),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=v(e.name,i,a,t);return n.set(e,o),o};return{analyze:h,analyzeDefinition:y,toOperand:s}},Mp=(t,n,r,i=[])=>{let a=new Map(n),o=t.assumptions.flatMap(t=>{if(t.kind===`NewSymbol`){let n=t.set&&r.analyze(t.set,a),o=t.location.range;return n?.level===3&&o&&i.push({location:e.Z(o),message:`Level error:
|
|
401
|
-
Temporal formula used as set.`}),a.set(t.name,{kind:`Formal`,arity:t.arity,level:Nf[t.level]}),n?[n]:[]}return[t.kind===`AssumeProve`?Mp(t,a,r,i):r.analyze(t,a)]});o.push(r.analyze(t.conclusion,a));let s=Rf(Math.max(...o.map(e=>e.level)));return o.forEach(e=>{e.params.forEach(e=>s.params.add(e)),Vf(s,e)}),s},Np=(t,n,r,i)=>{let a=jp(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`?Mp(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=[];n.kind===`Assert`&&n.statement.kind===`AssumeProve`&&Mp(n.statement,/* @__PURE__ */ new Map,a,r);let i=()=>s(t)===3,u=n.kind===`Pick`&&n.bounds.length>0&&i()?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[...r,...l(t.proof),...u,...t.proof?.kind===`Steps`&&i()?c(t.proof):[]]}):[],u=Vd([...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=[],r=t.statement.kind===`AssumeProve`?Mp(t.statement,/* @__PURE__ */ new Map,a,n):a.analyze(t.statement,/* @__PURE__ */ new Map),i=[...n,...l(t.proof),...r.level===3?c(t.proof):[]];if(i.length>0)throw e.J(i)}})),...r],i);if(u.length>0)throw e.J(u,!1,void 0,i)},Pp=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Fp=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Ip=/* @__PURE__ */ new Set([...Pp,...Fp,`Enabled`]),Lp=/* @__PURE__ */ new Set([`~>`,`-+->`]),Rp=/* @__PURE__ */ new Set([...Lp,`\\cdot`]),zp=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Bp=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Vp=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),Hp=(e,t)=>zp.has(e)||t.builtins.get(e)?.isStateLevel===!0,Up=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Pp.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Fp.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Lp.has(e.operator))return 224},o=/* @__PURE__ */ new Map,s=(e,n,c)=>{let l=e.kind;if(l===`Selection`){let t=o.get(e.expression)??0,r=n?c?1:2:c?4:8;if((t&r)!==0)return;o.set(e.expression,t|r)}let u=c?1:513;(Ip.has(l)||l===`UnboundedQuantifier`&&e.isTemporal===!0||l===`Apply`&&Rp.has(e.operator))&&(r[0]|=u),Ip.has(l)&&(r[0]|=16);let d=a(e);n&&d!==void 0&&(r[0]|=d);let f=n&&d===void 0,p=Ve(e);if(p!==void 0&&A(e)&&t.variableIndex.has(p)&&(c||(r[0]|=512),f&&(r[0]|=32)),p!==void 0&&!A(e)){let e=t.substitutions.get(p)??p,n=t.definitions.get(e),a=t.constants.has(p),o=t.variableIndex.get(p);if((o!==void 0||t.builtins.get(p)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=u),o!==void 0&&(f&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:f,isOperatorArgument:c||l===`OperatorReference`||l===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{Hp(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),Bp.has(e)&&(r[0]|=8),Vp.has(e)&&(r[0]|=256),!a&&Hp(e,t)&&(r[0]|=16);let n=t.builtins.get(e);f&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}Be(e).forEach(e=>s(e,f,c||l===`Lambda`))};return e.forEach(e=>s(e,!0,!1)),{row:r,edges:i}},Wp=(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},Gp=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),Kp=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=Up(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=Wp(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Wp(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=Wp(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!Gp(t[e],l[e*r]|p[e*r])))),h=Wp(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}},qp=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Jp(ze(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Jp=(e,t)=>{let n=t.facts.words,r=Up(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=qp(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]}Gp(e.callee,r[0])||(i[0]|=r[0]&270)}),i},Yp=(e,t)=>!(qp(e,t)[0]&513),Xp=(e,t)=>!(qp(e,t)[0]&512),Zp={any:2,repeated:4,streamed:8,replayed:260,varying:258},Qp=(e,t,n)=>(Jp(e,t)[0]&Zp[n])!==0,$p=(e,t,n=`any`)=>(qp(e,t)[0]&Zp[n])!==0,em=(e,t)=>{let n=qp(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},tm=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},nm=(e,t)=>{let n=Jp([e],t);return n[0]&16?void 0:tm(n)},rm=(e,t)=>!!(Jp([e],t)[0]&1),im=(t,n,r)=>new e.A(`Applying ${t} to the following value,\nwhich is not ${n}:\n${j(L(r))}`),am=e=>It(e)?I(e):void 0,om=`a function with a finite domain`,sm=(e,t,n)=>{let r=R(e,t,n),i=am(r);if(!i)throw im(n,om,r);return i},cm=(e,t)=>{let n=R(e,1,t),r=am(n),i=r&&fm(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Io(`second`,t,`bag`,n);return i},lm=(e,t,n)=>{let r=t[n];if(!r||!dm(r))throw Io(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},um=(e,t)=>{if(!N(e)||!P(e))throw t();return F(e).elements},dm=e=>e.range.every(e=>typeof e==`number`&&e>0),fm=(e,t)=>{let n=e.domain.findIndex(e=>gr(t,e));return n===-1?void 0:e.range[n]},pm=(e,t)=>{if(typeof e==`number`)return e;throw t()},mm=(e,t,n)=>{let r=pm(e,n)+pm(t,n);if(Go(r))throw Ko(`${e}+${t}`);return r},hm=(e,t,n,r,i)=>{let a=pm(e.range[t],r),o=fm(n,e.domain[t]);if(o===void 0)return a;let s=a-pm(o,i);if(Go(s))throw Ko(`${a}-${o}`);return s},gm=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>gr(t,e[0]));a?a[1]=mm(a[1],n,r):e.push([t,n])},_m=e=>e.domain.map((t,n)=>[t,e.range[n]]),vm=An([],[]),ym=t=>[Vo(`EmptyBag`,vm),z(`IsABag`,1,e=>{let t=am(R(e,0,`IsABag`));return t!==void 0&&dm(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=sm(e,0,`BagCardinality`),r=()=>im(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return mm(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=cm(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>cm(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>am(R(e,t,`(+)`))),n=lm(e,t,0),r=lm(e,t,1),i=_m(n),a=()=>Io(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>gm(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=am(t),i=am(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=hm(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=um(n,()=>im(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??vm;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=am(e);if(!t)throw i();return t},o=_m(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>gm(o,e,t.range[n],i))}),Tr(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=am(t),i=am(n);if(!r)throw im(`\\sqsubseteq`,om,t);if(!i)throw im(`\\sqsubseteq`,om,n);let a=()=>im(`\\sqsubseteq`,`a bag`,t),o=()=>im(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=fm(i,e);return pm(r.range[t],a)<=(n===void 0?0:pm(n,o))})}),Ho(`BagOfAll`,2,e=>{let t=Bo(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=am(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)=>gm(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(sm(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=um(t,()=>im(`BagToSet`,om,t));return An([...n],n.map(()=>1))})],bm={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},Z={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},xm={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Sm=[{lower:`true`,upper:`TRUE`,token:Z.true},{lower:`false`,upper:`FALSE`,token:Z.false},{lower:`null`,upper:`NULL`,token:Z.null}],Cm=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
402
|
-
`],[`r`,`\r`],[`f`,`\f`]]),wm=1024,Tm=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=Z.none,c=0,l=[bm.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===bm.emptyArray||e===bm.nonemptyArray?`[${d[t]}]`:e===bm.emptyDocument||e===bm.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()}
|
|
398
|
+
`},nu=(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}`}}),ru=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),iu=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),au=/* @__PURE__ */ new Set([`NEW`,...iu.keys()]),ou=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),su=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),cu=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),lu=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?kl.has(e.operator):Fl.has(e.operator)),uu=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,du=e=>kl.has(e)||Fl.has(e)||e===`-.`,fu=(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}}},pu=/* @__PURE__ */ new WeakMap,mu=/* @__PURE__ */ new WeakMap,hu=e=>{if(pu.has(e))return;let t=e.kind===`UnboundedQuantifier`?{name:e.names[0],range:e.nameRanges?.[0]}:e.kind===`Choose`&&e.pattern.kind===`Name`?{name:e.pattern.name,range:e.pattern.ranges?.[0]}:e.kind===`SetFilter`&&e.bound.pattern.kind===`Name`?{name:e.bound.pattern.name,range:e.bound.pattern.ranges?.[0]}:void 0,n=t?.range;return t&&n?{kind:`Identifier`,name:t.name,location:{...n.start,range:n}}:void 0},gu=(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(`
|
|
399
|
+
`)}\n`},_u=(t,n,r=De(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(Se),o=0,s=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],ee=[],y=[],b=(e,t=o-1)=>{let n=e===t?y[e]:void 0;if(n)return n;let r=a[t];v[e]??=_(a[e]),ee[t]??={line:r.line,column:r.endColumn};let i={module:d[0].name,start:v[e],end:ee[t]};return e===t&&(y[e]=i),i},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>a[Math.min(o+e,a.length-1)],S=(e=0)=>{let t=te(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),re=e=>i&&(e.kind===`Keyword`||cu.has(e.text)),ie=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},ae=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:ql.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:re(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(t,n=te(),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,oe(t,n,o,r));return f!==void 0&&h.set(s,f),s},oe=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[m[0]-1],s=r?`Unexpected ${ae(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?ie(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},w=(e,t=te())=>C(e,t,t),se=t=>{let n={cursor:o,frame:f,restorePoints:m.length,offsideColumns:s.length,recursiveScopes:u.length},r=++p;f=r;try{let e=t();return f=n.frame,e}catch(t){if(!(t instanceof e.I)||h.get(t)!==r)throw t;o=n.cursor,f=n.frame,m.length=n.restorePoints,s.length=n.offsideColumns,u.length=n.recursiveScopes;return}},ce=e=>{let t=f;f=void 0;let n=e();return f=t,n},le=e=>{m.push(o);let t=e();return m.pop(),t},ue=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!re(e),T=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},E=()=>{let e=S();if(e.kind===`End`)throw w(`Unexpected end of expression`);return o++,e},D=e=>T(e)?(o++,!0):!1,O=e=>{if(!T(e))throw w(`Expected ${JSON.stringify(e)} but found ${ne(S())}`);return E()},fe=()=>{let e=S();if(e.kind!==`Identifier`)throw w(`Expected an identifier but found ${ne(e)}`);if(re(e))throw w(`Unexpected keyword ${e.text}`);return o++,e.text},pe=()=>{let e=o;return{name:fe(),range:b(e)}},me=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),he=()=>{let e=S();return e.kind!==`String`&&(Rl.has(e.text)||kl.has(e.text)||Il.has(e.text))?(o++,e.text):fe()},ge=!1,_e=()=>S().kind===`Identifier`||!ue(S())?fe():(ge=!0,E().text),ve=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},ye=(e=0)=>{if(T(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||T(`,`,t);)t++;return T(`>>`,t)&&T(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(T(`\\in`,t+1))return!0;if(!T(`,`,t+1))return!1;t+=2}return!1},be=()=>{if(T(`::`))return!0;if(!T(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&T(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&T(`)`,e+1)&&T(`::`,e+2)},xe=()=>{if(!D(`<<`)){let e=pe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=me(T(`>>`)?[]:k(pe));return O(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>{let e=()=>{let e=k(xe);O(`\\in`);let t=ce(M);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;T(`,`)&&(!i||ye(1));)E(),t.push(e());return t.flat()},we=()=>{let e=S();if(i&&cu.has(e.text)){let t=o;E();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(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(b(o,o)),n.push(fe()),e&&T(`(`)?Ae():[]),s=[a(!i)];for(;T(`!`)&&S(1).kind===`Identifier`;)E(),s.push(a(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(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:x(t,e),lastArgs:[]}}throw w(`Expected a subscript but found ${ne(e)}`)},Te=e=>{let t=S(1),n=S(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(`==`,Il.has(n.text)?3:4))},Ee=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||T(`,`,1)||T(`)`,1)||t.kind===`Keyword`&&Ul.has(t.text)||Te(e)},Oe=()=>{let e=S(),t=e.kind===`Operator`&&(kl.has(e.text)||Ll.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Ll.has(e.text)||Vl.has(e.text)&&e.text!==`'`&&!Fl.has(e.text)||Bl.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&Ee(e))throw C(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw C(`\\X may not be used as an infix operator`,e);if(t)return o++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},o-1);if(e.kind!==`String`&&Vl.has(e.text)&&Ee(e)){o++;let t=_(e);if(Fl.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:fu(e.text,n,t),operator:e.text,location:_(e)},o-1)}if(T(`LAMBDA`)){let t=o;E();let n=me(k(pe));O(`:`);let r=M();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!i)return M();let n=se(M);if(n)return n;throw w(`Unexpected ${ne(S())}`)},ke,Ae=()=>ve(()=>{let e=o;O(`(`);let t=k(Oe);return O(`)`),ke=b(e),t}),je=()=>{let e=E();s.push(e.column);let t=[M()],n=()=>{for(;uu(te())&&te().text===e.text&&te().column===e.column;)o++,t.push(M())};return i?ce(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},Me=e=>ve(()=>{let t=_(e),n=S().kind===`Identifier`,r=T(`|->`,1)&&(n||ue(S()));if(r||n&&T(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=_(S()),i=e();return n.range=b(t),O(r?`|->`:`:`),{name:i,value:M(),location:n}},a=[i(()=>n?fe():E().text),...D(`,`)?k(()=>i(fe)):[]];return O(`]`),{kind:e,fields:a,location:t}}if(ye()){let e=o,n=Ce();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(()=>{let e=[o];O(`!`);let t=[];for(;T(`.`)||T(`[`);)if(e.push(o),D(`.`)){if(!ue(S()))throw w(`Expected a field name but found ${ne(S())}`);if(!i&&T(`@`))throw w(`@ used in !.@`);t.push(E().text)}else O(`[`),t.push(k(()=>M())),O(`]`);e.push(o,o+1),O(`=`);let n=M();e.push(o);let r=t=>b(e[t],e[t+1]-1);return{path:t.map((t,n)=>typeof t==`string`?{kind:`Field`,name:t}:{kind:`Index`,args:t,tupleRange:r(2*n+1<e.length-1?2*n+1:n+1)}),value:n,range:b(e[0])}});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:we().subscript,location:t}}),Ne=()=>{let e=o,t=x(A(),e),n=_(E());return x({kind:`Apply`,operator:`\\in`,args:[t,ce(M)],location:n},e)},Pe=e=>ve(()=>{let t=_(e);if(D(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(S(1).text===`\\in`||T(`<<`))){let e=o,n=xe();O(`\\in`);let r=ce(M);if(D(`:`)){let e=ce(M);return O(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=S().kind===`Identifier`&&T(`\\in`,1)?Ne():M();if(D(`:`)){let e=Ce();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=_(e),n=ve(()=>T(`>>`)||T(`>>_`)?[]:k(()=>M()));if(D(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:ce(we).subscript,location:t}}return O(`>>`),{kind:`Tuple`,elements:n,location:t}},Ie=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Ce();return O(`:`),{kind:n,bounds:e,body:M(),location:t}}let i=me(k(pe));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:b(n),location:_(e)};let r=M();O(`->`),t.push({condition:r,body:M()})}while(D(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Re=()=>{let e=S(1);return T(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Hl.has(e.text)||e.kind===`Operator`&&(kl.has(e.text)||Il.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Rl.has(e.text))},ze=()=>{let e=E();if(e.kind===`Number`)return{kind:`Operand`,operand:de(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=[b(r,r)],c=[n];for(;Re();){E();let e=o;ke=void 0;let t=ze();s.push(t.kind===`Bound`?b(e):b(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)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Ve=e=>{let t=o,r=E(),a=_(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=k(fe);return O(`:`),{kind:`Lambda`,params:e,body:M(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:de(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 C(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw C(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?Ct(r)??r.text:r.text;if(be()){let o=me(D(`(`)?k(pe):[]);o.names.length>0&&O(`)`),O(`::`);let s=b(t),l=M();if(!i&&e!==void 0&&c!==void 0&&lu(l)&&e.high>=c.low)throw C(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:s,body:l,location:a}}let o=T(`(`);if(n===`@`&&!o&&!Re())return{kind:`ExceptAt`,location:a};let l=o?Ae():[];return Re()?Be(n,l,o?ke:void 0,t,a):o?{kind:`Apply`,operator:n,args:l,argumentsRange:ke,location:a}:{kind:`Identifier`,name:n,location:a}}let l=r.kind===`Operator`&&(du(r.text)||r.text===`'`&&!i);if(l&&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(l&&!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=ve(()=>M());return O(`)`),pu.set(e,b(t)),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(u.push(/* @__PURE__ */ new Set);!D(`IN`);){if(i&&T(`RECURSIVE`))throw w(`Unexpected keyword RECURSIVE`);if(D(`RECURSIVE`)){n.push(...ht()),d[d.length-1].hasRecursiveLet=!0;continue}let r=ct(!i&&D(`LOCAL`));r.kind===`Instance`?t.push(r):e.push(r)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:M(),location:a}}case`CHOOSE`:{let e=xe(),t=D(`\\in`)?M():void 0;return O(`:`),{kind:`Choose`,pattern:e,set:t,body:M(),location:a}}case`WF_`:case`SF_`:{let e=we(),t=!T(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ve(()=>{O(`(`);let e=M();return O(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw w(`Unexpected ${ne(r)}`,r)},He=(e,t,n)=>{c=l={low:t,high:n};let r=M(n+1),i=S(),a=Il.has(i.text)?Dl.high:kl.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw C(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},A=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&uu(t))return je();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return E(),{kind:`Apply`,operator:`~`,args:[He(t,4,4)],location:n};case`-`:return E(),{kind:`Apply`,operator:`-.`,args:[He(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return E(),fu(t.text,He(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return E(),{kind:`Apply`,operator:t.text,args:[He(t,10,13)],location:n}}return Ve(e)},Ue=(e,t,n,r,i)=>{let a=_(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:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ge=()=>{E();let e=ve(()=>k(()=>M()));return ve(()=>O(`]`)),e},Ke=e=>{let t=o,n=A(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(Il.has(n.text)&&e<=15){E(),c=Dl,r=x(We(n,r),t);continue}if(n.text===`[`){let e=Ge();c=Ol,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&ue(S(1))){E();let e=E().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=kl.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 C(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(E(),o.low>12&&T(`-`))throw C(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=M(o.high+1),u=i?.text===n.text;r=x(Ue(n,r,s,u,b(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`)&&Nl.has(e.text),Je=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:x(e,t)}),Ye=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),Xe=e=>e.kind===`Operator`&&Il.has(e.text)&&T(`(`,1)?se(()=>ve(()=>{E(),E();let t=M(),n=o-1;return O(`)`),{end:n,expression:We(e,t)}})):void 0,j=()=>{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!==`!`&&(ou.has(n.text)&&e++,su.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>T(`(`,1)&&j()?se(()=>ve(()=>{E(),E();let t=M();O(`,`);let n=M();return O(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,Qe=e=>{let t=o,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?kl.get(n.text):void 0;if(!e){if(T(`[`)){let e=Ge();return Ye(t,`Postfix`,Ml,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(T(`.`)&&ue(S(1))){E();let e=E().text;return Ye(t,`Postfix`,Ml,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,b(e[0].start,e[1].end).end)),isLeft:Al(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!Il.has(n.text))return;if(Xe(n)){o=t;return}return E(),Ye(t,`Postfix`,Dl,e=>We(n,e[0].expression))}if(n.kind===`Operator`&&uu(n))return Je(je(),t);let s=a?Ze(n):void 0;if(s)return Je(s,t);let c=Xe(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?jl.get(n.text):void 0;if(l)return E(),Ye(t,`Prefix`,l,e=>fu(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!qe(n))return;let u=n.kind===`Operator`&&Pl.has(n.text);return Je(u?Ve():ce(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=b(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 C(`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=()=>le(()=>{let e=se(()=>Qe(!0));if(e===void 0){let e=te();throw e.kind===`End`?w(`Unexpected end of expression`,e):C(`required expressions(s) missing before '${ae(e)}'`,e)}return ce(()=>{let t=[e];for(;;){let e=se(()=>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 C(`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=_(S()),t=M(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},ct=e=>{let t=o;return x(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=S(),n=o,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,o-2),...st(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&kl.has(S(1).text)&&S(2).kind===`Identifier`&&T(`==`,3)){let e=pe(),t=E().text,n=pe();return O(`==`),i(t,[lt(e),lt(n)])}let a=t.kind!==`String`&&Rl.has(t.text),s=t.kind===`Identifier`&&Il.has(S(1).text)&&T(`==`,2);if(a||s){let e=a?t.text:S(1).text;a&&E();let n=pe();return s&&E(),O(`==`),i(e,[lt(n)])}let c=fe();if(D(`[`)){let t=ve(()=>Ce());return O(`]`),O(`==`),{kind:`Function`,name:c,bounds:t,body:M(),isLocal:e,isRecursive:g(c),location:r}}let l=o,u=ot();return O(`==`),T(`INSTANCE`)?{...dt(c,u,e,r),definitionRange:b(l)}:i(c,u)},dt=(e,t,n,r)=>{let i=o;return O(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:_e(),substitutions:D(`WITH`)?k(()=>{let e=o,t=he(),n=b(e);return O(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:b(i)}},ft=()=>{let e=o;return x(pt(),e)},pt=()=>{let e=_(S());if(T(`_`)&&S(1).kind===`Operator`&&(kl.has(S(1).text)||Il.has(S(1).text)))return E(),{name:E().text,arity:D(`_`)?2:1,location:e};if(S().kind!==`String`&&(Rl.has(S().text)||i&&S().kind===`Operator`)&&T(`_`,1)){let t=E().text;return E(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=fe();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=>u[u.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&ou.has(e.text)&&t++,e.kind===`Operator`&&su.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?T(`(`,1)||T(`[`,1)?T(`==`,gt(1)):t.kind===`Operator`&&Il.has(t.text)?T(`==`,2):t.kind===`Operator`&&kl.has(t.text)?S(2).kind===`Identifier`&&T(`==`,3):T(`==`,1):e.kind!==`String`&&Rl.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(`.`)&&!Jl.has(xt(e)),Ct=e=>{let t=xt(e);if(Jl.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 Gl.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=S();return e.kind===`Step`?St(e):e.kind===`Keyword`?ru.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},Dt=()=>{let e=o,t=S();return t.kind===`Operator`&&!zl.has(t.text)&&du(t.text)?(o++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):D(`MODULE`)?x({kind:`ModuleFact`,name:fe(),location:_(t)},e):M()},Ot=()=>{let e=o,t=S(),n=k(()=>{let e=S();if((e.kind!==`Identifier`||re(e))&&e.kind!==`Operator`)throw w(`Expected a definition name but found ${ne(e)}`,e);return o++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},kt=()=>k(()=>{if(i)return Ot();let e=Dt(),n=(e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!pu.has(e);return e.kind!==`ModuleFact`&&!n&&mu.set(e,El($c(d[0].name,t),e)),e}),At=()=>{let e=se(M);if(!e)return[];let t=[e];return le(()=>{for(;T(`,`);){let e=se(()=>(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 w(`Expected a fact`);return{facts:e,defs:t?kt():[]}},Mt=()=>{let e=o,t=E(),n=t.text===`USE`&&D(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...jt(),keyword:r,location:_(t)},e)},Nt=()=>{let e=o,t=_(S()),n=D(`NEW`),r=i?o:e,a=i?_(S()):t,s=S().kind===`Keyword`?iu.get(S().text):void 0;if(!n&&s===void 0)throw w(`Expected a declaration but found ${ne(S())}`);if(s!==void 0&&E(),s===`Variable`){let e=pe();return x({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 C(`declared symbol with arguments before \\in`);return l&&E(),x({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(S().kind===`Identifier`&&T(`::`,1)&&T(`ASSUME`,2)&&(E(),E()),T(`ASSUME`))return N();if(S().kind===`Keyword`&&au.has(S().text))return i?ce(Nt):Nt();if(!i)return M();let e=se(M);if(e===void 0)throw w(`Expected a hypothesis`);return e},Ft=()=>{let e=[Pt()];return le(()=>{for(;;){let t=se(()=>(O(`,`),Pt()));if(t===void 0)break;e.push(t)}}),e},N=()=>{let e=o,t=_(O(`ASSUME`)),n=()=>{let n=i?Ft():k(Pt);return O(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:M(),location:t},e)};return i?ce(n):n()},It=e=>{let t=0;for(;S(t).kind===`Identifier`&&T(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&T(e,t+1)},Lt=()=>{let e=S();if(T(`USE`)||T(`HIDE`))return Mt();if(!i&&T(`INSTANCE`)){let t=o;return x(dt(void 0,[],!1,_(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:_(e)};return x(r,t)}if(D(`HAVE`))return{kind:`Have`,expression:M()};if(D(`TAKE`)){let e=ye(),t=me(e?[]:k(pe)),n=e?Ce():[];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=me(e?k(pe):[]),n=e?[]:Ce();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`)?N():M()}},Rt=e=>{let t=S();if(t.kind!==`Step`)throw w(`Expected a step number but found ${ne(t)}`,t);if(!Tt(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&bt(t)<0&&Ct(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return o++,{name:Ct(t),token:t.text,location:_(t)}},zt=()=>{let e=o,t=Rt(T(`QED`,1)),n=o,r=D(`QED`)?{kind:`Qed`}:Lt(),i=b(e),a=b(n),s=wt(S());if(s&&!Kl.has(r.kind))throw C(`Proof of a step that does not take a proof`);let c=s?Ht():void 0;return x({...t,body:r,head:i,statement:a,proof:c},e)},Bt=e=>{if(D(`BY`)){let t=b(o-1);return{kind:`By`,isOnly:D(`ONLY`),...jt(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;E();let n=b(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=_(S());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(),x(t,e)},Ut=()=>S().kind===`Step`||S().kind===`Keyword`&&Gl.has(S().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Ql(e);let n=t.defs[t.defs.length-1]?.location.range;return Zl(Ql({...e,end:e.start}),Ql(n??t.keyword))},Gt=()=>{let e=o,t=_(S()),n=D(`PROOF`),r=Bt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:Ql(t.keyword),first:e,end:o-1}}let i=S();if(i.kind!==`Step`)throw w(`Expected a step number but found ${ne(i)}`);let a=o;E();let s=o,c=D(`QED`)?{kind:`Qed`}:Lt(),l=b(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(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={..._(a[i.first]),range:b(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 nu(`Unexpected end of (sub)proof at level ${n} before QED step`,r,tu);if(a.kind===`Leaf`)throw nu(`Expecting a proof step but found a${Yl[a.proof.kind]} leaf proof`,a.span,tu);if(!i&&a.isProof)throw nu(`PROOF keyword found in step that does not begin subproof`,a.span,eu);let o=a.token.text[1];if(o===`+`&&!i)throw nu(`<+> used but no subproof expected`,a.span,eu);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=Kl.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:{..._(a.token),range:b(a.start,l)}},d=Zl(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:Zl(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 nu(`extra step(s) after finished proof`,r.span,$l,`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(S().kind!==`Identifier`||!T(`==`,1))return;let e=fe();return E(),e},Zt=()=>{if(!i)return M();let e=te(),t=se(M);if(t)return t;throw w(`Expected "====" but found ${ne(e)}`,e)},Qt=e=>{let t=o,n=E(),r=Xt(),a=T(`ASSUME`)?N():Zt(),s=i?Jt():wt(S())?Ht():void 0,c=x({name:r,statement:a,proof:s,location:_(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 x({name:n,expression:M(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},en=()=>{let e=_(O(`----`));O(`MODULE`);let t=_e();O(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[],hasRecursiveLet:!1};for(d.push(n),u.push(/* @__PURE__ */ new Set),D(`EXTENDS`)&&k(()=>{let e=o;n.extends.push(_e()),n.extendsRanges.push(b(e))});;){let t=o,r=S();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.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=_(E()),r=mt();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(E()),r=k(()=>{let e=o,t=_(S());return x({name:fe(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(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 w(`Expected a module unit but found ${ne(r)}`);let e=Mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(E()),r=ht();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:tn(n,x(dt(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(E(),T(`INSTANCE`)){tn(n,x(dt(void 0,[],!0,_(r)),t));continue}tn(n,x(ut(!0),t));continue}r.kind===`Keyword`&&Wl.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=ge?Xc(t):void 0;if(rn!==void 0)throw new e.I(rn);return nn},vu=e=>_u(e,`tlc`),yu=(e,t)=>_u(e,`tlc`,t),bu=e=>_u(e,`tlapm`),xu=e=>_u(e,`sany`),Su=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},Cu=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,wu=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,Tu=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Eu=(e,t)=>(e&2147483647)%t,Du=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Eu(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},Ou=(e,t,n=t)=>e.buckets[Eu(Ue(n),e.buckets.length)].find(e=>e.key===t)?.value,ku=(e,t,n,r=t)=>{let i=Ue(r),a=e.buckets[Eu(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&Du(e),e.buckets[Eu(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},Au=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),ju=`\0module `,Mu=()=>({table:Tu(),symbols:[]}),Nu=e=>e.kind===`Module`?ju+e.name:e.name,Pu=(e,t)=>{ku(e.table,Nu(t),t,t.name),e.symbols.push(t)},Fu=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Iu=(e,t)=>Ou(e.table,t),Lu=(e,t)=>Ou(e.table,ju+t,t),Ru=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),zu=(e,t)=>Au(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),Bu=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Vu={kind:`Local`},Hu=`$subexpression`,Uu=/* @__PURE__ */ new WeakMap,Wu=/* @__PURE__ */ new WeakMap,Gu=/* @__PURE__ */ new WeakMap,Ku=/* @__PURE__ */ new WeakMap,qu=/* @__PURE__ */ new WeakMap,Ju=/* @__PURE__ */ new WeakMap,Yu=/* @__PURE__ */ new WeakMap,Xu=/* @__PURE__ */ new WeakSet,Zu=/* @__PURE__ */ new WeakSet,Qu=e=>Zu.has(e)||ed(Ju.get(e))!==void 0,$u=e=>e?.find(e=>e.isEmpty?Qu(e.node):Xu.has(e.node)),ed=e=>$u(e)?.error,td=/* @__PURE__ */ new WeakMap,nd=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},rd=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),id=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ad=(e,t)=>id(e,t)?-1:+!!id(t,e),od=e=>e.kind===`Operator`?e.params.length:0,sd=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],cd=e=>e.name.includes(`!`),ld=e=>e.kind===`Function`&&!cd(e)?e.bounds.length:void 0,ud=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},dd=(e,t,n)=>{let r=t.bindings.get(e);return r&&id(r.position,t.location)&&(!n||id(r.position,n.start))?r:void 0},fd=(t,n)=>t!==void 0&&n!==void 0&&e.X(t)===e.X(n),pd=(t,n,r,i)=>{if(n===void 0)return!0;if(fd(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.X(a),s=n.range&&e.X(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${ws(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 '${ws(t)}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${ws(t)}. \nThis duplicates the one at ${s}.`}),!1},md=(e,t,n,r)=>pd(t,ud(e,t)??dd(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,hd=(e,t,n)=>{pd(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},gd=(e,t,n,r)=>t.reduce((e,t,i)=>md(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),_d=(e,t,n)=>t.reduce((e,t)=>md(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),vd=e=>e.kind===`Name`?[e.name]:e.names,yd=e=>e.flatMap(e=>vd(e.pattern)),bd=(e,t)=>{let n=t.definitions.get(e),r=dd(e,t,void 0);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?r!==void 0:id(n.location,t.location)&&(r===void 0||!id(r.position,n.location)))?n:void 0},xd=(e,t)=>{let n=bd(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??od(n),params:r?.params??sd(n),kind:`Definition`,range:n.location.range,functionArity:ld(n)}}let r=dd(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},Sd=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,Cd=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,wd=(e,t,n)=>ud(t,e)??xd(e,n),Td=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ed=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Td(e.location,e.spelling??t)},Dd=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},Od=`In module --TLA+ BUILTINS--`,kd=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),Ad=(t,n,r)=>r.errors.push({location:e.X(n),message:`Cannot take subexpression of \`${ws(t)}'.`}),jd=e=>!/^[\p{L}\d_]/u.test(e),Md=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Nd=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Pd=(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])}})},Fd=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Pd(e.name,[],void 0):Pd(e.operator,e.args,e.argumentCounts),Id=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ld=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:yd(e.bounds),body:e.body,sets:Id(e.bounds)};case`SetMap`:return{names:yd(e.bounds),body:e.expression,sets:Id(e.bounds)};case`SetFilter`:return{names:vd(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:vd(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}},Rd=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`:case`Selection`: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}},zd=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Bd=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Vd=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind===`Lambda`||e.kind===`Selection`)return;if(e.kind===`Let`)return Vd(e.body,t);let n=Yu.get(e);if(!(e.kind===`Apply`&&n===void 0&&Qu(e)))return e.kind===`FunctionApplication`&&Qu(e)?Vd(e.function,t):Ve(e).slice(0,n).reduce((e,n)=>e??Vd(n,t),void 0)},Hd=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Hd(i,t,n||Bd(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Vd(e.set,t):Vd(e,t)},Ud=e=>e.kind===`Label`?Ud(e.body):e,Wd=e=>typeof e==`number`?`argument selector ${e}`:e,Gd=`within the scope of a declaration
|
|
400
|
+
from outside that declaration's scope.`,Kd=(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.X(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`&&Ud(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:Hd(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?Vd(i.body,t.name):void 0};if(!a?.label)return o(r,`Cannot find label \`${t.name}'.`);if(r===1&&c.kind===`AssumeProve`&&Bd(c,a.position)&&s)return o(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${Gd}`);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`){if(n[r-1].kind!==`Name`)return o(r-1,`!: should not follow an operand selector.`);let e=n[r+1];if(e===void 0?r!==1:e.kind!==`Name`)return o(r,`\`!:' can be used only after a name and either at the end after an
|
|
401
|
+
operator name or before an operator name.`);continue}let a=t.kind===`Operand`?Wd(t.operand):t.kind===`At`?`@`:`!(...)`,f=e=>t.kind===`Operand`?Nd(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=Ud(i);if(Xu.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(Qu(e))return o(r,`Choosing operand \`${a}' of subexpression with no operands.`);let n=Ld(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:Rd(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,Xu.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(Bd(i,h)&&(!l.isGoal||s))return o(r,`Accessing ASSUME/PROVE clause ${Gd}`);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`&&Xu.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}.`)},qd=(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.X(t.location.range),message:r}),!0)},Jd=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.X(i),o=t.params.filter((i,a)=>{let o=ud(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.X(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)},Yd=(e,t,n,r)=>{if(!zd(e))return!1;let i=Fd(e),a=i[0],o=i.length>1&&a.kind===`Name`?ud(t,a.name)?.goal??Cd(a.name,n):void 0;return o&&{node:Kd(e,i,o,n,r)}},Xd=(e,t,n)=>{let r=ud(t,e)??dd(e,n,void 0);return r?r.kind===`Instance`:rf(e,t,n)!==void 0&&[...n.bindings.keys()].some(t=>t.startsWith(`${e}!`))},Zd=(t,n,r,i)=>{let a=t.location;if(pf(t,r,i))return;let o=td.get(t);if(o!==void 0)return o;if(nd(n))return t.kind===`Apply`?t.args.length:0;let s=ud(r,n);if(s?.nonFactStep){i.errors.push({location:e.X(Ed(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.X(Ed(t,n)),message:`${c} proof step selected instead of expression.`});return}if(Yd(t,r,i,!1)||Md(n)&&s)return t.kind===`Apply`?t.args.length:0;if(Xd(n,r,i)){let a=ud(r,n)??dd(n,i,void 0),o=t.kind===`Apply`?t.args.length:0;if(a?.kind===`Instance`&&a.arity!==o){i.errors.push({location:e.X(t.kind===`Apply`&&t.argumentsRange||Ed(t,n)),message:`The operator ${n} requires ${a.arity} arguments.`});return}let s=Ed(t,n);i.errors.push({location:e.X({...s,start:{line:s.end.line,column:s.end.column-n.slice(n.lastIndexOf(`!`)+1).length+1}}),message:`Operator name ${n} is incomplete.`});return}if(s&&t.kind!==`OperatorReference`&&(t.resolution=Vu),s)return s.arity;if(Cd(n,i)?.statement.kind===`AssumeProve`)return 0;let l=xd(n,i);if(l)return t.kind===`Identifier`?t.name=l.key:t.operator=l.key,td.set(t,l.arity),l.arity;let u=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``,d=u===``?void 0:ud(r,u)??xd(u,i);if(d&&(!kd.has(d.kind)||ud(r,u)?.nonFactStep)){Ad(u,t.kind!==`OperatorReference`&&t.selectorRanges?.[0]||Ed(t,n),i);return}if(t.kind!==`OperatorReference`&&u!==``&&hf(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!==``&&Sd(u,i))return t.kind===`Apply`?t.args.length:0;let f=Dd(t),p=t.kind===`OperatorReference`||f!==void 0;if(!jd(n)||Md(n)||!p){i.errors.push({location:e.X(Ed(t,n)),message:`Unknown operator: \`${ws(n)}'.`});return}let m=t.spelling??n;i.errors.push({location:e.X(f===`prefix`&&m===`-.`?Td(a,`-`):Ed(t,n)),message:`Could not find declaration or definition of symbol '${m}'.`}),f&&Xu.add(t),f&&a.range&&i.errors.push({location:e.X(a.range),message:`Couldn't resolve ${f} operator symbol \`${m}'.`})},Qd=(e,t,n)=>(e.forEach(e=>Y(e.set,t,n)),e.reduce((e,t)=>gd(e,vd(t.pattern),t.pattern.ranges,n),t)),$d=(e,t)=>e.kind===`Identifier`&&e.name===t&&A(e)||Ve(e).some(e=>$d(e,t)),ef=(e,t)=>{e.kind===`FunctionConstruction`&&$d(e.body,t)&&(e.isRecursive=!0),Ve(e).forEach(e=>ef(e,t))},tf=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?yd(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.X(s),message:t})},l=t.kind===`Function`?Qd(t.bounds,n,a):_d(n,t.params,a),u=ud(l,o)??dd(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${ws(o)} defined at wrong LET/IN level.`):u&&!d?c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${ws(o)} already defined or declared.`):u&&t.kind===`Function`&&u.arity>0?c(`Function ${ws(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 ${ws(o)} has different arity than its RECURSIVE declaration.`),u&&d&&t.kind===`Operator`&&(u.params=sd(t)),t.kind===`Function`?(Y(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),ef(t.body,o),t.isSelfReferential=$d(t.body,o)):Y(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:pd(o,ud(n,o)??dd(o,a,s),{kind:`Definition`,arity:od(t),range:s},a)},nf=(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(ud(e,t.name)?.isPending)return e;let n={name:t.name,arity:od(t),params:sd(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=pd(t.name,ud(e,t.name)??dd(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)=>ad(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?Of(t,e,r):l(e,t),e)},f=d(t.reduce((e,t)=>{let n=nd(t.name)?e:d(e,e=>!id(t.location,e.location)),a={name:t.name,arity:od(t),kind:`Definition`,range:t.location.range,parent:n,functionArity:ld(t)};if(cd(t))return{...a,params:sd(t),functionArity:ud(n,t.name)?.functionArity};let s=i.some(e=>e.location===t.location),c=r.isGenerated||t.isLocal||nd(t.name),l=s?{...r,isGenerated:!0,errors:[],warnings:[]}:c?{...r,isGenerated:c}:r;return tf(t,n,l,o)?{...a,params:sd(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.X(i),message:`Symbol ${ws(n.name)} declared in RECURSIVE statement but not defined.`})}),f},rf=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ud(t,r)??dd(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},af=(t,n,r)=>{if(!zd(t))return!1;let i=Fd(t),a=i.findIndex(e=>e.kind!==`Name`),o=rf(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.X(l),message:`The operator ${o.name} requires ${o.arity} arguments.`}),!0},of=(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.X(i),message:`Wrong number of arguments (${r}) given to operator '${ws(n)}', \nwhich requires ${o.length} arguments.`}),!0)},sf=(t,n,r)=>{let i=t.location.range,a=t=>{i&&r.errors.push({location:e.X(i),message:t})},o=Gu.get(t);if(t.kind===`Lambda`&&t.operator!==void 0)a(`The operator ${ws(t.operator)} requires 1 arguments.`);else if(o)r.errors.push(o);else if(t.kind===`Lambda`&&i)Xu.add(t),a(`LAMBDA expression used where an expression is required.`);else if(t.kind===`OperatorReference`){let e=Zd(t,t.operator,n,r);e!==void 0&&a(`The operator ${ws(t.operator)} requires ${e} arguments.`)}else Y(t,n,r)},cf=e=>{let t=e.kind===`Subexpression`||e.kind===`Apply`&&e.argumentCounts?.at(-1)===0?Fd(e):[],n=t.findIndex(e=>`args`in e&&e.args.length>0);if(n===-1||!zd(e))return;let r=t[n];return{index:n,range:e.selectorRanges?.[n],message:`Selector \`${r.kind===`Name`?r.name:`!(...)`}' should not have argument(s).`}},lf=(t,n,r,i,a,o,s)=>{let c=(t,n)=>{t&&s.errors.push({location:e.X(t),message:n})},l=(t,l)=>{let u=rf(i,o,s)?.range??wd(i,o,s)?.range;u&&c(a,`Operator with incorrect arity passed as argument. \nOperator '${ws(t)}' of arity ${l} is argument number ${r+1} (counting from 1) to operator \`${e.X(u)}', \nbut an operator of arity ${n} was expected.`)},u=t.location.range;if(n===0)return sf(t,o,s),!0;let d=pu.get(t);if(d)return c(d,`An expression appears as argument number ${r+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let f=Uu.get(t)??t,p=cf(f);if(p)return c(p.range,p.message),!1;if(t.kind===`Lambda`){if(Uu.has(t)?Y(t,o,s):mf(t,o,s),ed(Ju.get(t)))return!1;let e=t.params.length===n;return!e&&Uu.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(f!==t){let e=ed(Ju.get(t));return e&&s.errors.push(e),e||c(f.location.range,`Expected arity ${n} but found operator of arity 0.`),!1}if(t.kind===`Subexpression`)return Y(t,o,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 m=t.kind===`Identifier`?t.name:t.operator,h=wd(m,o,s)?.params??[],g=Zd(t,m,o,s);return t.kind===`Identifier`&&g!==void 0&&g!==n&&c(Ed(t,m),`Expected arity ${n} but found operator of arity ${g}.`),t.kind===`OperatorReference`&&g!==void 0&&g!==n&&l(m,g),g===n&&h.every(e=>e===0)},uf=(t,n,r)=>{let i=t.operator,a=wd(i,n,r),o=af(t,n,r)?void 0:Zd(t,i,n,r);if(o!==void 0&&o!==t.args.length&&r.errors.push({location:e.X(t.argumentsRange??Ed(t,i)),message:`The operator ${ws(i)} requires ${o-(rf(i,n,r)?.arity??0)} arguments.`}),o!==t.args.length){Zu.add(t);return}let s=a&&(a.kind===`Definition`?a.params:t.args.map(()=>0));if(s===void 0){t.args.forEach(e=>df(e,n,r));return}let c=t.selectorRanges?.at(-1)??Ed(t,i),l=i===Hu,u=t.args.slice(0,s.length).map((e,t)=>{let a=l?qu.get(e):void 0;return lf(e,s[t],a?.index??t,a?.operator??i,a?.range??c,n,l?{...r,isGenerated:!1}:r)});of(a,i,t.args.length,t.location.range,r)||u.forEach((n,a)=>{!n&&t.location.range&&r.errors.push({location:e.X(t.location.range),message:`Argument number ${a+1} to operator '${l?`LAMBDA`:i}' \nshould be a ${s[a]}-parameter operator.`})})},df=(e,t,n)=>{e.kind===`Identifier`?Zd(e,e.name,t,n):Y(e,t,n)},ff=(e,t,n)=>e.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>lf(r,e.params[i],i,e.operator,e.range,t,n))),pf=(e,t,n)=>{let r=Wu.get(e);return r?(ff(r.applications,t,n),n.errors.push(ed(r.nulls)??r.error),!0):!1},mf=(e,t,n)=>Y(e.body,gd(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),Y=(t,n,r)=>{if(Uu.has(t)&&!r.isGenerated){let e=$u(Ju.get(t));if(e){ff(e.applications,n,r),r.errors.push(e.error);return}Y(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>Y(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&&(Zu.add(t),r.errors.push({location:e.X(t.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let i=t.name,a=af(t,n,r)?void 0:Zd(t,i,n,r);if(a===0){let a=wd(i,n,r),o=a?.kind;(o===`Variable`||o===`Theorem`||o?.startsWith(`New`)||Sd(i,r))&&Zu.add(t);let s=ud(n,i);if((s?s.goal:Cd(i,r))?.statement.kind===`AssumeProve`){r.errors.push({location:e.X(Ed(t,i)),message:`ASSUME/PROVE used where an expression is required.`});return}of(a,i,0,Ed(t,i),r);return}a!==void 0&&r.errors.push({location:e.X(Ed(t,i)),message:`The operator ${ws(i)} requires ${a} arguments.`}),Zu.add(t);return}case`OperatorReference`:Zd(t,t.operator,n,r);return;case`Apply`:uf(t,n,r);return;case`Lambda`:Uu.has(t)?mf(t,n,r):t.location.range&&(Xu.add(t),r.errors.push({location:e.X(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`:Y(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&&Y(t.other,n,r);return;case`Let`:Y(t.body,nf(t.definitions,n,r,t.instances,t.recursive),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:Y(t.body,Qd(t.bounds,n,r),a(yd(t.bounds)));return;case`UnboundedQuantifier`:Y(t.body,gd(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&Y(t.set,n,r),Y(t.body,gd(n,vd(t.pattern),t.pattern.ranges,r),a(vd(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:Y(t.predicate,Qd([t.bound],n,r),a(vd(t.bound.pattern)));return;case`SetMap`:Y(t.expression,Qd(t.bounds,n,r),a(yd(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.X(i.location.range??Td(i.location,i.name)),message:`Non-unique fields in constructor.`}),Y(i.value,n,r)});return;case`Except`:Y(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),Y(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:{let a=t.function,o=a.kind===`Identifier`?a.name:a.kind===`Apply`?a.operator:void 0,s=o===void 0?void 0:wd(o,n,r)?.functionArity;Y(a,n,r);let c=t.args.length;if(s===void 0||c<2||s===c||Qu(a)){i(t.args);return}Zu.add(t),t.location.range&&r.errors.push({location:e.X(t.location.range),message:`Function '${o}' is defined with ${s} parameters, but is applied to ${c} arguments.`});return}case`FieldAccess`:Y(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(qd(t,r))return;Y(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),Jd(t,n,r);return;case`Subexpression`:gf(t,n,r)&&Zu.add(t);return;case`Selection`:return}},hf=(t,n,r,i,a,o)=>{let s=ud(a,t)??dd(t,o,void 0);return!s?.isPending||!r||!i?!1:n.length===s.arity?(n.forEach(e=>Y(e,a,o)),o.errors.push({location:e.X(r),message:`Subexpression of \`${t}' used inside the operator's definition.`}),!0):(o.errors.push({location:e.X(i),message:`The operator ${t} requires ${s.arity} arguments.`}),!0)},gf=(t,n,r)=>{if(af(t,n,r)||pf(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&&(xd(s.slice(0,t+1).join(`!`),r)?.kind??`Instance`)!==`Instance`),l=s.length>1&&(ud(n,s[0])??dd(s[0],r,void 0))?.kind===`Instance`,u=t.selectorRanges?.[o-1];if(l&&c===-1&&a&&u)return r.errors.push({location:e.X({module:a.module,start:a.start,end:u.end}),message:`Unknown operator: \`${ws(s.join(`!`))}'.`}),!0;let d=s.slice(0,c+1).join(`!`),f=c>0?xd(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.X(m),message:`The operator ${ws(d)} requires ${f.arity} arguments.`}),!0;if(i.kind===`Name`&&t.selectors[1].kind!==`Name`&&a){let t=ud(n,i.name),o=t??xd(i.name,r);if(o===void 0&&!Sd(i.name,r)||o?.kind===`Instance`)return r.errors.push({location:e.X(a),message:`Unknown operator: \`${ws(i.name)}'.`}),!0;if(o&&(!kd.has(o.kind)||t?.nonFactStep))return Ad(i.name,a,r),!0}if(i.kind===`Name`&&hf(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=>df(e,n,r));let h=Yd(t,n,r,!1);return h?h.node===void 0:!1},_f=(t,n)=>{let r=t.location.range;!n.isModuleKnown(t.name,t.location)&&r&&n.errors.push({location:e.X({...r,start:{line:r.end.line,column:r.end.column-t.name.length+1}}),message:`Module \`${t.name}' used without being extended or instantiated.`})},vf=(t,n,r,i)=>{if(t.kind===`ModuleFact`){_f(t,i);return}if(t.kind===`ExceptAt`&&t.location.range)return i.errors.push({location:e.X(t.location.range),message:"Unknown operator: `@'."}),Od;let a=Sf(t,n,r,i);if(Uu.has(t))return Y(t,r,i),a;if(af(t,r,i))return a;let o=Yd(t,r,i,!0);if(o){let n=o.node?.kind;return n===void 0?Od:n===`AssumeProve`||n===`NewSymbol`?void 0:t.location.range&&e.X(t.location.range)}if(t.kind===`Subexpression`)return gf(t,r,i)?Od:a;let s=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;return t.kind===`Identifier`&&ud(r,s)?.nonFactStep?(i.errors.push({location:e.X(Ed(t,s)),message:`Step number of non-fact used as a fact`}),Od):(Sd(s,i)||ud(r,s)?.goal||t.kind===`Identifier`&&Xd(s,r,i)||Y(t,r,i),a)},yf=(t,n,r)=>{if(t.kind===`ModuleFact`)return _f(t,r),r.isModuleKnown(t.name,t.location);let i=mu.get(t)??[];if(r.errors.push(...i.map(e=>({location:Cu(e.location),message:e.message}))),i.length>0)return!1;let a=hu(t),o=a??Uu.get(t)??t,s=o.location.range;if(!s)return!0;let c=o.kind===`Identifier`?o.name:o.kind===`Apply`||o.kind===`OperatorReference`?o.operator:``,l=ud(n,c),u=l??xd(c,r)??dd(c,r,s);return u===void 0&&Sd(c,r)||(zd(o)&&Fd(o).length>1&&(u===void 0||cf(o))?xf(t,o,n,r):c===``||bf(c,l,u,s,r))?!0:(r.errors.push({location:e.X((a?t:o).location.range??s),message:`DEF clause entry should describe a defined operator.`}),!1)},bf=(t,n,r,i,a)=>(r===void 0&&a.errors.push({location:e.X(i),message:`Unknown operator: \`${ws(t)}'.`}),n?.nonFactStep===`Define`||(n?.nonFactStep&&a.errors.push({location:e.X(i),message:`DEF clause entry refers to a non-definition step.`}),r!==void 0&&kd.has(r.kind)&&!Md(t))),xf=(t,n,r,i)=>{let a=(t,n)=>(t&&i.errors.push({location:e.X(t),message:n}),!1),o=cf(n);if(o?.index===0)return a(o.range,o.message);let s=Fd(n),c=n.selectorRanges,l=Wu.get(t);if(!l&&!Uu.has(t)){let e=s[0],t=e.kind===`Name`?e.name:``,l=ud(r,t),u=l??xd(t,i);if(u&&(!kd.has(u.kind)||l?.nonFactStep)&&c?.[0])return Ad(t,c[0],i),!1;if(o)return a(o.range,o.message);if(Yd(n,r,i,!1))return!1;let d=c?.[0],f=c?.[s.findLastIndex(e=>e.kind===`Name`)],p=s.flatMap(e=>e.kind===`Name`?[e.name]:[]);return a(d&&f&&{...d,end:f.end},`Unknown operator: \`${ws(p.join(`!`))}'.`)}if(o)return a(o.range,o.message);let u=l?ed(l.nulls)??l.error:ed(Ju.get(t));return u?(i.errors.push(u),!1):s.at(-1)?.kind===`Name`&&s.at(-2)?.kind!==`Name`},Sf=(t,n,r,i)=>{let a=t.location.range&&e.X(t.location.range);if(Uu.has(t))return ed(Ju.get(t))?Od:n.location.range&&e.X(n.location.range);if(Wu.has(t)||t.kind===`ExceptAt`)return Od;switch(t.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let e=Fd(t)[0];if(t.kind===`Subexpression`||e.kind!==`Name`)return;let n=t.kind===`Identifier`?t.name:t.operator,o=ud(r,e.name)?.goal??Cd(e.name,i);if(Sd(n,i)||o||Md(n)&&ud(r,n)||t.kind===`Identifier`&&Xd(n,r,i))return;let s=wd(n,r,i),c=t.kind===`Apply`?t.args.length:0;return s?.arity===c?a:Od}default:return a}},Cf=(t,n,r)=>{let i=Ku.get(t.facts)??t.facts,a=t.facts.map((e,t)=>vf(e,i[t],n,r)),o=t.facts.filter(e=>e.kind!==`ModuleFact`||r.isModuleKnown(e.name,e.location)).length,s=t.defs.filter(e=>yf(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
|
|
402
|
+
the name of a theorem, assumption, or step.`})});let c=t.location.range;o+s===0&&c&&r.errors.push({location:e.X(c),message:t.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},wf=(e,t,n)=>(e.set&&Y(e.set,t,n),md(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Tf=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:wf(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Tf(t,e.scope,e.unit,!0):Y(t,e.scope,e.unit),e),{scope:t,unit:n});return Y(e.conclusion,i.scope,i.unit),i.scope},Ef=(e,t,n)=>e.kind===`AssumeProve`?Tf(e,t,n):(Y(e,t,n),t),Df=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Cf(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Af(t,e,r),t)},Of=(e,t,n)=>{let r=If(e,t,n);return e.name===void 0?r:md(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},kf=(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:Id(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}},Af=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=kf(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=(t,n)=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,nonFactStep:n};switch(r.kind){case`Assert`:{let a=Ef(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Df(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 Df(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 Cf(r,t,n),s(t,r.kind);case`Instance`:return s(Of(r,t,i),r.kind);case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?Of(t,e,i):nf([t],e,n),t),r.kind);case`Have`:case`Case`:return Y(r.expression,t,i),Df(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>Y(e,t,i)),o(t);case`Take`:return o(gd(Qd(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=gd(Qd(r.bounds,t,i),r.names,r.nameRanges,i);return Y(r.body,a,{...i,labelParams:[...i.labelParams,...yd(r.bounds),...r.names]}),Df(e.proof,o(t),n),o(a)}default:return Df(e.proof,o(t),n),o(t)}},jf=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ef(e.statement,void 0,t);e.name!==void 0&&hd(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Df(e.proof,n,t),r&&(r.isInProof=!1)},Mf={line:0,column:0},Nf=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Pf=(e,t)=>{let n=new Map([...rd,...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},Ff=(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 '${ws(e.name)}', and it must have arity ${e.arity}.`}),c=(t,n)=>{let r=n.location.range;if(t.arity===0){sf(n,o,a);return}let i=pu.get(n),c=i?void 0:Uu.get(n);if(c){let r=n.kind===`Lambda`?n.params.length:0,i=ed(Ju.get(n));n.kind===`Lambda`?Y(n,o,a):i&&a.errors.push(i),!i&&r!==t.arity&&c.location.range&&a.errors.push({location:e.X(c.location.range),message:`Expected arity ${t.arity} but found operator of arity ${r}.`}),(i||r!==t.arity)&&s(t,Od);return}if(n.kind===`Subexpression`&&!i){Y(n,o,a),s(t,Od);return}if(n.kind===`Lambda`&&!i){mf(n,o,a),n.params.length!==t.arity&&r&&s(t,e.X(r));return}if(n.kind===`OperatorReference`&&!i){let i=Zd(n,n.operator,o,a);i===void 0?s(t,Od):i!==t.arity&&r&&s(t,e.X(r));return}if(n.kind!==`Identifier`||i){let n=i??r;n&&a.errors.push({location:e.X(n),message:`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${ws(t.name)}'.`}),s(t,Od);return}let l=Zd(n,n.name,o,a);l!==void 0&&l!==t.arity&&a.errors.push({location:e.X(Ed(n,n.name)),message:`Expected arity ${t.arity} but found operator of arity ${l}.`}),l!==t.arity&&s(t,Od)},l=t.location.range,u=n.filter(e=>ud(o,e.name)!==void 0||xd(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=Zd(t.expression,t.declaration.name,o,a);n&&l&&a.errors.push({location:e.X(l),message:`Wrong number of arguments (0) given to operator '${ws(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.X(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.X(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:Zd(t.expression,t.declaration.name,o,a))!==t.declaration.arity&&l&&s(t.declaration,e.X(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.X(l),message:`Substitution missing for symbol ${ws(t.name)} declared at ${e.X(n)} \nand instantiated in module ${r}.`})}),d},If=(e,t,n)=>{let r=n.getInstance(e);return Ff(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>md(e,t[0],t[1],n),t)},Lf=(e,t,n,r)=>{let i=Pf(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),Ff(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,isModuleKnown:r.isModuleKnown,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])??Mf}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Rf=(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)=>ad(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},zf=(t,n)=>{let r=Pf(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([...rd,...n.bound].map(e=>[e[0],{...e[1],position:Mf}])),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,isModuleKnown:n.isModuleKnown,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=>hd(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Rf([...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.X(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=pd(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=>{Nf(t,e)?Y(e.body,void 0,n):tf(e,void 0,n,o)&&a.set(e.name,{kind:`Definition`,arity:od(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>c(e.location,void 0,!1,t=>{_d(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>hd(n,e,t)),e.name!==void 0&&hd(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=>{Y(e.expression,void 0,t),e.name!==void 0&&hd(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=>jf(e,t))),...t.uses.map(e=>c(e.location,void 0,!1,t=>Cf(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.X(r),message:`Symbol ${ws(n.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Bf=/* @__PURE__ */ new WeakSet,Vf=/* @__PURE__ */ new WeakMap,Hf=(e,t)=>{if(t.length===0)return e;let n={...e};return Bf.has(e)&&Bf.add(n),Vf.set(n,[...t,...Vf.get(e)??[]]),n},Uf=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Yf(e,(e,r)=>Uf(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},Wf=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Gf=/* @__PURE__ */ new WeakMap,Kf=e=>Gf.get(e)??e.name,qf=(e,t)=>(Kf(t)!==e.name&&Gf.set(e,Kf(t)),e),Jf=(e,t)=>qf(e.kind===`Function`?{...e,bounds:Wf(e.bounds,e=>t(e,[])),body:t(e.body,yd(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Yf=(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=>Jf(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Wf(e.bounds,n),body:t(e.body,yd(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,vd(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,vd(e.bound.pattern))};case`SetMap`:return{...e,bounds:Wf(e.bounds,n),expression:t(e.expression,yd(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=>({...e,path:e.path.map(e=>e.kind===`Index`?{...e,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`Selection`:return{...e,expression:n(e.expression)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Xf=[],Zf=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n],Xf)},Qf=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n].set,Xf)},$f=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return;case`Apply`:case`Bracket`:return Zf(e.args,t);case`Lambda`:return t(e.body,e.params);case`And`:case`Or`:return Zf(e.operands,t);case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`Selection`:return t(e.expression,Xf);case`If`:return t(e.condition,Xf),t(e.consequent,Xf),t(e.alternative,Xf);case`Case`:for(let n=0;n<e.arms.length;n++)t(e.arms[n].condition,Xf),t(e.arms[n].body,Xf);e.other&&t(e.other,Xf);return;case`Let`:{let n=e.definitions.map(e=>e.name);return e.definitions.forEach(e=>{e.kind===`Function`?(Qf(e.bounds,e=>t(e,n)),t(e.body,[...n,...yd(e.bounds)])):t(e.body,[...n,...e.params.map(e=>e.name)])}),t(e.body,n)}case`Forall`:case`Exists`:case`FunctionConstruction`:return Qf(e.bounds,t),t(e.body,yd(e.bounds));case`UnboundedQuantifier`:return t(e.body,e.names);case`Choose`:return e.set&&t(e.set,Xf),t(e.body,vd(e.pattern));case`SetEnumeration`:case`Tuple`:return Zf(e.elements,t);case`SetFilter`:return t(e.bound.set,Xf),t(e.predicate,vd(e.bound.pattern));case`SetMap`:return Qf(e.bounds,t),t(e.expression,yd(e.bounds));case`FunctionSet`:return t(e.domain,Xf),t(e.range,Xf);case`Record`:case`RecordSet`:for(let n=0;n<e.fields.length;n++)t(e.fields[n].value,Xf);return;case`Except`:t(e.function,Xf);for(let n=0;n<e.updates.length;n++){let r=e.updates[n];for(let e=0;e<r.path.length;e++){let n=r.path[e];n.kind===`Index`&&Zf(n.args,t)}t(r.value,Xf)}return;case`FunctionApplication`:return t(e.function,Xf),Zf(e.args,t);case`FieldAccess`:return t(e.record,Xf);case`Product`:return Zf(e.factors,t);case`BoxAction`:case`AngleAction`:return t(e.action,Xf),t(e.subscript,Xf);case`WeakFairness`:case`StrongFairness`:return t(e.subscript,Xf),t(e.action,Xf);case`Label`:return t(e.body,Xf);case`Subexpression`:e.selectors.forEach(e=>{`args`in e&&Zf(e.args,t)})}},ep=`LAMBDA`,tp=e=>`${e}@SUBSTITUTION`,np=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(np),rp=(e,t)=>{if(e.kind!==`Identifier`)return!np(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&&!np(n.body)},ip=(e,t=/* @__PURE__ */ new Set)=>{let n=He(e),r=n===void 0||t.has(n)?[]:[n];return $f(e,(e,n)=>r.push(...ip(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},ap=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}},op=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),sp=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},cp=(e,t)=>e.map(e=>({pattern:sp(e.pattern,t),set:e.set})),lp=(e,t)=>e.kind===`Function`?{...e,bounds:cp(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},up=(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=>qf({...lp(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:cp(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:sp(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:sp(e.bound.pattern,n),set:e.bound.set}};default:return e}},dp=e=>`${e}@ENABLED`,fp=(e,t)=>e.modes.get(t)??e,pp=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!A(e)&&t.instantiation.variables.has(e.name),mp=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>mp(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(pp(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?mp(r.body,t,/* @__PURE__ */ new Map):void 0},hp=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return pp(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:dp(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:xp(e.expression,fp(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[xp(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:xp(e.subscript,fp(t,`Primed`),n),location:r},xp(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=mp(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:dp(r),location:e.location},location:e.location},xp({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},gp=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Vu}),_p=(e,t)=>e.map(e=>gp(e.name,t)),vp=(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:_p(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),yp=(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:[..._p(t,r),...i.map(e=>gp(e,r))],location:r},location:r}},bp=(e,t)=>e.instantiation.isParameterized(t)?Cp(e,t):void 0,xp=(t,n,r)=>{let i=e=>xp(e,n,r);if(t.kind===`Selection`&&[...r].every(e=>e[0]===e[1])){let e=t.expression,r=n.selections.get(e)??i(e);return n.selections.set(e,r),{...t,expression:r}}let a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!A(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:xp(t.expression,fp(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:xp(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},fp(n,`Enabled`),r)};let c=hp(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||!rp(e,a)))return Hf(e,[t]);if(e&&r){let n=tp(t.name);return r.set(n,e),gp(n,t.location)}let i=bp(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&&od(s)>0?yp(i,o,od(s),t.location):{kind:`Apply`,operator:i,args:_p(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||Bf.has(t),l=e=>(c&&Bf.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:ep,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:ep,args:r,resolution:Vu},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=bp(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[..._p(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 Hf(e,[t]);let r=bp(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?yp(r,o,od(i),t.location):{...t,operator:r}}let l=ap(n),u=Yf(t,(e,t)=>t.length===0?i(e):xp(e,n,op(r,t,l)));return up(u,r,l)},Sp=(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:gp(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Cp=(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=ap(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o,selections:/* @__PURE__ */ new Map}:e,c=lp(Jf(i,(e,t)=>xp(e,s,op(/* @__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&&Vf.set(l,[u,...Vf.get(i.body)??[]]),Sp({...c,body:l},r.params,i.location)}):t},wp=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ip(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t,selections:/* @__PURE__ */ new Map};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>bp(i,e)??e,getQualifiedKey:t=>{let n=bp(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Sp(r,e.params,r.location)):t}}},Tp=e=>e.kind===`Let`&&e.instances!==void 0||Ve(e).some(Tp),Ep=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Yf(e,e=>Ep(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>id(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}},Dp=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Op=(e,t)=>e.definitions.some(e=>Tp(e.body))||e.assumptions.some(e=>Tp(e.expression))||e.theorems.some(e=>{let t=Dp(e);return t!==void 0&&Tp(t)})?{...e,definitions:e.definitions.map(e=>Jf(e,e=>Ep(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ep(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Dp(e);return n===void 0?e:{...e,statement:Ep(n,t,[])}})}:e,kp=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],isCorrect:!0,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}])),Ap={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]}},jp=(e,t)=>{let n=Ap[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Mp={Constant:0,Variable:1,State:1,Action:2,Temporal:3},Np=(e,t)=>`${e}${t}`,Pp=(e,t,n)=>`${e}${t}${n}`,Fp=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Ip=(e,t,n)=>`${e},${t},${n}`,Lp=(e=0)=>({level:e,isCorrect:!0,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Rp=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),zp=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Bp=(e,t)=>{t.constraints.forEach((t,n)=>Rp(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>zp(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},X=(e,t,n,r)=>({...Lp(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Vp=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Hp=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Up=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],{...X(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),Wp=X(`'`,2,[1],[0]),Gp=X(`UNCHANGED`,2,[1],[0]),Kp=X(`ENABLED`,1,[2],[0]),qp=X(`[]`,3,[3],[0]),Jp=X(`<>`,3,[3],[0]),Yp=X(`$ConjList`,0,[3],[1]),Xp=X(`$DisjList`,0,[3],[1]),Zp=X(`$IfThenElse`,0,[3],[1]),Qp=X(`$Case`,0,[3],[1]),$p=X(`$BoundedForall`,0,[3],[1]),em=X(`$BoundedExists`,0,[3],[1]),tm=X(`$UnboundedForall`,0,[3],[1]),nm=X(`$UnboundedExists`,0,[3],[1]),rm=X(`$TemporalForall`,3,[3],[0]),im=X(`$TemporalExists`,3,[3],[0]),am=X(`$BoundedChoose`,0,[2],[1]),om=X(`$UnboundedChoose`,0,[2],[1]),sm=X(`$SetEnumerate`,0,[2],[1]),cm=X(`$Tuple`,0,[2],[1]),lm=X(`$SetOfFcns`,0,[2],[1]),um=X(`$CartesianProd`,0,[2],[1]),dm=X(`$SubsetOf`,0,[2],[1]),fm=X(`$SetOfAll`,0,[2],[1]),pm=X(`$FcnConstructor`,0,[3],[1]),mm=X(`$RcdConstructor`,0,[3],[1]),hm=X(`$SetOfRcds`,0,[2],[1]),gm=X(`$Except`,0,[2],[1]),_m=X(`$Pair`,0,[3],[1]),vm=X(`$Seq`,0,[2],[1]),ym=X(`$FcnApply`,0,[2,2],[1,1]),bm=X(`$RcdSelect`,0,[2,0],[1,1]),xm=X(`$SquareAct`,2,[2,1],[0,0]),Sm=X(`$AngleAct`,2,[2,1],[0,0]),Cm=X(`$WF`,3,[1,2],[0,0]),wm=X(`$SF`,3,[1,2],[0,0]),Tm=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity,level:0}])]),Em=e=>e.map(e=>({name:e,arity:0})),Dm=e=>e.kind===`Operator`?e.params:[],Om=e=>e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,km=(e,t)=>{let n=new Map(t);return e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n})),n},Am=(e,t,n)=>{let r=Dm(e);return{...Lp(),name:e.name,formals:r,maxLevels:r.map(()=>t),weights:r.map(()=>n),minMaxLevels:r.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}},jm=(e,t,n=!0)=>{let r=[],i=[],a=[],o=[],s=0,c=0,l=()=>{let t=a.length;for(;t>0&&o[t-1]===void 0;)t--;let n=o[t-1]??e;for(let e=t;e<a.length;e++){let t=a[e];n=Array.isArray(t)?Tm(n,Em(t)):t.kind===`Let`?km(t,n):t.kind===`Function`?Tm(n,Em(yd(t.bounds))):Tm(n,t.params),o[e]=n}return n},u=(e,t)=>{a.push(e),o.push(void 0),f(t),a.pop(),o.pop()},d=(e,t)=>t.length===0?f(e):u(t,e),f=e=>{if(e.kind!==`Let`)return $f(e,d);if(a.push(e),o.push(void 0),c++,e.recursive)h(Mm(e));else for(let t=0;t<e.definitions.length;t++)p(e.definitions[t]);c--,f(e.body),a.pop(),o.pop()},p=e=>{if(e.kind===`Function`)for(let t=0;t<e.bounds.length;t++)f(e.bounds[t].set);if(u(e,e.body),s===0)return;let t=i[c]??=/* @__PURE__ */ new Set;e.isRecursive&&t.delete(e.name)?s--:r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:t.size>0})},m=(e,t)=>{s===0&&r.push({location:t,members:[]});let n=i[c]??=/* @__PURE__ */ new Set;e.forEach(e=>{n.has(e.name)||(n.add(e.name),s++)}),e.forEach(e=>r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:!0}))},h=e=>{let t=/* @__PURE__ */ new Map;e.forEach(e=>{if(e.kind!==`Definition`||!e.definition.isRecursive)return;let n=t.get(e.definition.name);n?n.push(e.definition):t.set(e.definition.name,[e.definition])}),e.forEach(e=>{e.kind===`Recursive`?m(e.declarations.flatMap(e=>t.get(e.name)??[]),e.location):(s!==0||n)&&(e.kind===`Assumption`?f(e.assumption.expression):e.kind===`Theorem`&&e.theorem.statement.kind!==`AssumeProve`?f(e.theorem.statement):e.kind===`Definition`&&p(e.definition))})};return Array.isArray(t)?h(t):f(t),r},Mm=e=>[...(e.recursive??[]).map(e=>({location:e.location,unit:{kind:`Recursive`,declarations:[e],location:e.location}})),...e.definitions.map(e=>({location:e.location,unit:{kind:`Definition`,definition:e}}))].toSorted((e,t)=>id(e.location,t.location)?-1:1).map(e=>e.unit),Nm=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Pm=e=>e.includes(2)&&e.includes(3),Fm=e=>pu.get(e)??e.location.range,Im=e=>e.kind!==`Let`&&e.kind!==`Label`,Lm=t=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=[],o=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:r.level,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:S(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=S(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Up.get(e)??kp.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},s=(e,t,n)=>{let r=Lp(Math.max(t,...n.map(e=>e.data.level)));return r.isCorrect=n.every(e=>e.data.isCorrect),r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(Pp(e,n,t))}),zp(r.argConstraints,Np(e,n),t.data.level),Bp(r,t.data)}),r},c=(e,t,n=[],r=[])=>{let i=e=>r.includes(e),o=t.flatMap((t,n)=>t.kind===`Value`&&t.data.level>Vp(e,n)?[{operand:t,index:n}]:[]);o.filter(t=>e.isCorrect&&t.operand.data.isCorrect).forEach(t=>a.push(`Level error in applying operator ${ws(e.name)}:\nThe level of argument ${t.index+1} exceeds the maximum level allowed by the operator`));let s=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},c=(t,n,r)=>e.conditions.has(Ip(t,n,r)),l=Lp(Math.max(e.level,...t.filter((t,n)=>Hp(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return l.isCorrect=o.length===0&&t.every(e=>e.data.isCorrect)&&n.every(e=>e.isCorrect),e.params.forEach(e=>l.params.add(e)),t.forEach((t,n)=>{Hp(e,n)===1&&t.data.params.forEach(e=>l.params.add(e))}),n.forEach(e=>e.params.forEach(e=>l.params.add(e))),r.forEach(e=>l.params.delete(e)),e.constraints.forEach((e,t)=>Rp(l.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Rp(l.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Rp(l.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Rp(l.constraints,t,Vp(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>Rp(l.constraints,e,Vp(r,a)))}))}),e.argParams.forEach(e=>{let t=Fp(e),n=s(t.operator);n?.kind===`Operator`&&Rp(l.constraints,t.param,Vp(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>zp(l.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>zp(l.argConstraints,Np(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{c(r,t,a)&&zp(l.argConstraints,Np(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=Fp(e),n=s(t.operator);n&&zp(l.argConstraints,Np(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Fp(e).param)||l.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>l.argParams.add(e))),e.argParams.forEach(e=>{let t=Fp(e),n=s(t.operator);if(n)n.kind===`Declared`&&l.argParams.add(Pp(n.declared.name,t.index,t.param));else{let n=s(t.param);if(!n){l.argParams.add(e);return}n.data.params.forEach(e=>l.argParams.add(Pp(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>l.argParams.add(Pp(r.name,a,e)))}))}),l},l=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:x(`LAMBDA`,Em(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let r=o(n,t);if(r.kind===`Defined`&&(r.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:r.levels};if(r.kind===`Declared`&&r.arity>0){let e=Lp();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:r.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Lp()}}return{kind:`Value`,data:ee(e,t)}},u=(e,t)=>e.map(e=>l(e,t)),d=(t,n,r,i=[],o=yd(i))=>{let s=u(n,Tm(r,Em(o))),l=i.map(e=>ee(e.set,r)),d=c(t,s,l,o);return l.forEach((n,r)=>{if(n.level<=2||(d.isCorrect=!1,!n.isCorrect))return;let o=i[r].pattern,s=o.ranges?.[0];a.push(`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${s?e.X(s):vd(o)[0]} \nexceeds the maximum level allowed by the operator`)}),d},f=(e,t)=>e.kind===`Declared`?s(e.name,e.level,t):c(e.levels,t),p=(e,t)=>{Pm(e)&&a.push(`${t} has both temporal formula and action as arguments`)},m=(e,t)=>{(e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2)&&a.push(`Action used where only temporal formula or state predicate allowed`),Nm.has(e.operator)&&p(t.map(e=>e.data.level),ws(e.operator))},h=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;t===2&&Im(n)&&n.kind!==r&&a.push(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`)},g=(e,t)=>{let n=km(e,t);e.recursive&&jm(t,e).forEach(e=>re(e.members));let r=e.definitions.map(e=>S(e,n)),i=ee(e.body,n),a={level:i.level,isCorrect:i.isCorrect&&r.every(e=>e.isCorrect),params:new Set(i.params),constraints:new Map(i.constraints),argConstraints:new Map(i.argConstraints),argParams:new Set(i.argParams)};return r.forEach(e=>Bp(a,e)),a},_=(t,n,r)=>a.length===t?r:(n&&a.splice(t).forEach(t=>i.push({location:e.X(n),message:`${t}.`})),{...r,isCorrect:!1}),v=(e,t)=>{let n=a.length;return _(n,e,t())},ee=(e,t)=>{let n=a.length;return _(n,e.location.range,y(e,t))},y=(t,n)=>{switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Lp();case`Identifier`:return f(o(t.name,n),[]);case`Apply`:{let e=u(t.args,n);return m(t,e),f(o(t.operator,n),e)}case`OperatorReference`:case`Lambda`:return l(t,n).data;case`And`:case`Or`:{let r=t.kind===`And`;if(t.isBulleted){let e=u(t.operands,n);return p(e.map(e=>e.data.level),`${r?`Conjunction`:`Disjunction`} list`),c(r?Yp:Xp,e)}let a=r?`\\land`:`\\lor`,o=Fm(t.operands[0]),s=[],d=0,f=!1;t.operands.forEach((r,c)=>{let u=l(r,n);s.push(u);let m=[d,u.data.level];if(d=Math.max(d,u.data.level),c===0)return;let h=Fm(r);c===t.operands.length-1||!o||!h?p(m,a):Pm(m)&&(i.push({location:e.X({...o,end:h.end}),message:`${a} has both temporal formula and action as arguments.`}),f=!0)});let m=c(r?Yp:Xp,s);return f?{...m,isCorrect:!1}:m}case`Prime`:return d(Wp,[t.expression],n);case`Unchanged`:return d(Gp,[t.expression],n);case`Enabled`:return d(Kp,[t.expression],n);case`Always`:case`Eventually`:{let e=l(t.expression,n);return h(t,e.data.level),c(t.kind===`Always`?qp:Jp,[e])}case`If`:return d(Zp,[t.condition,t.consequent,t.alternative],n);case`Case`:return d(Qp,[...t.arms.flatMap(e=>[e.condition,e.body]),...t.other?[t.other]:[]],n);case`Let`:return g(t,n);case`Forall`:case`Exists`:{let r=d(t.kind===`Forall`?$p:em,[t.body],n,t.bounds),a=r.level===3?t.bounds.find(e=>ee(e.set,n).level===2):void 0,o=a?.set.location.range;return o&&i.push({location:e.X(o),message:`Action-level bound of quantified temporal formula.`}),a?{...r,isCorrect:!1}:r}case`UnboundedQuantifier`:return d(t.isTemporal?t.quantifier===`Forall`?rm:im:t.quantifier===`Forall`?tm:nm,[t.body],n,[],t.names);case`Choose`:return d(t.set?am:om,[t.body],n,t.set?[{pattern:t.pattern,set:t.set}]:[],vd(t.pattern));case`SetEnumeration`:return d(sm,t.elements,n);case`Tuple`:return d(cm,t.elements,n);case`FunctionSet`:return d(lm,[t.domain,t.range],n);case`Product`:return d(um,t.factors,n);case`SetFilter`:return d(dm,[t.predicate],n,[t.bound]);case`SetMap`:return d(fm,[t.expression],n,t.bounds);case`FunctionConstruction`:return d(pm,[t.body],n,t.bounds);case`Record`:return d(mm,t.fields.map(e=>e.value),n);case`RecordSet`:return d(hm,t.fields.map(e=>e.value),n);case`Except`:return c(gm,[l(t.function,n),...t.updates.map(e=>({kind:`Value`,data:c(_m,[{kind:`Value`,data:v(e.range,()=>c(vm,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:Lp()}:e.args.length===1?l(e.args[0],n):{kind:`Value`,data:v(e.tupleRange,()=>d(cm,e.args,n))})))},l(e.value,n)])}))]);case`FunctionApplication`:return c(ym,[l(t.function,n),t.args.length===1?l(t.args[0],n):{kind:`Value`,data:d(cm,t.args,n)}]);case`Bracket`:return Lp();case`FieldAccess`:return c(bm,[l(t.record,n),{kind:`Value`,data:Lp()}]);case`BoxAction`:case`AngleAction`:return d(t.kind===`BoxAction`?xm:Sm,[t.action,t.subscript],n);case`WeakFairness`:case`StrongFairness`:return d(t.kind===`WeakFairness`?Cm:wm,[t.subscript,t.action],n);case`Label`:return ee(t.body,n);case`Selection`:{let e=t.expression,i=r.get(e);if(i)return i;let a=ee(e,n);return r.set(e,a),a}case`Subexpression`:return Lp()}},b=(e,t,n=!1,r=/* @__PURE__ */ new Set)=>{let i=(e,i=n,a=t)=>b(e,a,i,r),a=(e,a)=>{let s=o(e,t);s.kind===`Declared`?(n&&r.add(e),a.forEach(e=>i(e))):a.forEach((e,t)=>i(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return a(e.name,[]),r;case`Apply`:return a(e.operator,e.args),r;case`Lambda`:case`Let`:case`Selection`:return r;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Ve(e).forEach(e=>i(e,!0)),r;case`UnboundedQuantifier`:return i(e.body,n||e.isTemporal===!0,Tm(t,Em(e.names))),r;default:return $f(e,(e,r)=>i(e,n,Tm(t,Em(r)))),r}},x=(e,t,n,r)=>{let i=Tm(r,t),a=ee(n,i),o=e=>t.some(t=>t.name===e),s=b(n.kind===`Selection`?n.expression:n,i),c={...Lp(a.level),isCorrect:a.isCorrect,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(Np(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(Pp(e.name,n,t.name))).map(e=>Ip(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(Fp(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Fp(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},te=/* @__PURE__ */ new Set,S=(e,t)=>{let r=n.get(e);if(r&&!te.delete(e))return r;let i=r??Am(e,3,0);n.set(e,i);let a=x(e.name,Dm(e),Om(e),t),o={...a,level:Math.max(i.level,a.level),params:/* @__PURE__ */ new Set([...i.params,...a.params]),argParams:/* @__PURE__ */ new Set([...i.argParams,...a.argParams]),maxLevels:a.maxLevels.map((e,t)=>Math.min(e,i.maxLevels[t])),weights:a.weights.map((e,t)=>Math.max(e,i.weights[t])),nonLeibniz:/* @__PURE__ */ new Set([...i.nonLeibniz,...a.nonLeibniz])};return n.set(e,o),o},ne=t=>t.forEach(t=>{let n=t.definition.location.range;t.definition.isRecursive&&n&&S(t.definition,t.scope).maxLevels.forEach((r,a)=>{r>=2||i.push({location:e.X(n),message:`Argument ${a+1} of recursive operator ${ws(t.definition.name)} is primed`})})}),re=e=>{if(e.length===0||n.has(e[0].definition))return;let t=e.filter(e=>e.definition.isRecursive);t.forEach(e=>n.set(e.definition,Am(e.definition,2,1)));let r=e=>(e.definition.isRecursive&&te.add(e.definition),S(e.definition,e.scope));e.forEach(e=>{r(e),ne([e])});let i=t.map(e=>S(e.definition,e.scope)),a=Math.max(0,...i.map(e=>e.level)),o=i.flatMap(e=>[...e.params]);e.forEach(e=>{let t=S(e.definition,e.scope);n.set(e.definition,{...t,level:Math.max(t.level,a),params:/* @__PURE__ */ new Set([...t.params,...o])}),e.isRechecked&&!e.definition.isRecursive&&te.add(e.definition)}),e.forEach(r)};return{analyze:ee,analyzeDefinition:S,checkPrimedArguments:ne,checkRecursiveSection:re,toOperand:l,errors:i}},Rm=(t,n,r)=>{let i=new Map(n),a=t.assumptions.flatMap(t=>{if(t.kind===`NewSymbol`){let n=t.set&&r.analyze(t.set,i),a=t.location.range;return n?.level===3&&a&&r.errors.push({location:e.X(a),message:`Level error:
|
|
403
|
+
Temporal formula used as set.`}),i.set(t.name,{kind:`Formal`,arity:t.arity,level:Mp[t.level]}),n?[n]:[]}return[t.kind===`AssumeProve`?Rm(t,i,r):r.analyze(t,i)]});a.push(r.analyze(t.conclusion,i));let o=Lp(Math.max(...a.map(e=>e.level)));return a.forEach(e=>{e.params.forEach(e=>o.params.add(e)),Bp(o,e)}),o},zm=(t,n,r,i)=>{let a=Lm(n),o=(e,t)=>Math.max(0,...e.map(e=>a.analyze(e,t).level)),s=(e,t)=>{let n=e.body;return n.kind===`Have`||n.kind===`Case`?o([n.expression],t):n.kind===`Witness`?o(n.expressions,t):n.kind===`Take`?o(n.bounds.map(e=>e.set),t):n.kind===`Pick`?o([n.body,...n.bounds.map(e=>e.set)],t):n.kind===`Assert`?n.statement.kind===`AssumeProve`?Rm(n.statement,t,a).level:o([n.statement],t):0},c=(e,t)=>e.forEach(e=>{e.kind!==`ModuleFact`&&a.analyze(e,t)}),l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.X(t.statement),r=()=>s(t,/* @__PURE__ */ new Map)===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.`}],...l(t.proof)]:t.body.kind===`Qed`?l(t.proof):[]}):[],u=(t,n)=>{if(t?.kind===`By`)return c(t.facts,n),a.errors.splice(0);if(t?.kind!==`Steps`)return[];let r=new Map(n);return t.steps.flatMap(t=>{let n=t.body;(n.kind===`Use`||n.kind===`Hide`)&&c(n.facts,r),n.kind===`Define`&&n.definitions.forEach(e=>{e.kind!==`Instance`&&(r.set(e.name,{kind:`Let`,definition:e,scope:r}),a.analyzeDefinition(e,r))});let i=s(t,r)===3,d=n.kind===`Pick`&&n.bounds.length>0&&i?n.bounds.filter(e=>o([e.set],r)!==0).flatMap(t=>t.set.location.range?[{location:e.X(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...a.errors.splice(0),...u(t.proof,r),...d,...t.proof?.kind===`Steps`&&i?l(t.proof):[]]})},d=/* @__PURE__ */ new Map,f=e=>{let t=d.get(e);if(t!==void 0)return t;let n=e.kind===`AssumeProve`?Rm(e,/* @__PURE__ */ new Map,a).level:a.analyze(e,/* @__PURE__ */ new Map).level;return d.set(e,n),n},p=[...t.theorems,...t.assumptions.map(e=>({...e,statement:e.expression}))],m=new Set(p.map(e=>e.statement)),h=jm(/* @__PURE__ */ new Map,t.units,t.hasRecursiveLet),g=(e,t)=>({location:e,check:e=>{t(),e.push(...a.errors.splice(0))}});return{sections:h.map(e=>g(e.location,()=>a.checkRecursiveSection(e.members))),check:n=>[(n?h:[]).map(e=>g(e.location,()=>a.checkPrimedArguments(e.members))),t.definitions.filter(e=>!e.name.includes(`!`)&&!m.has(e.body)).map(e=>g(e.location,()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map))),p.filter(e=>e.name!==void 0).map(e=>g(e.location,()=>f(e.statement))),[...t.assumptions.map(t=>({location:t.location,check:n=>{let r=f(t.expression);n.push(...a.errors.splice(0));let i=t.location.range;r!==0&&i&&n.push({location:e.X(i),message:`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${r}.`})}})),...t.theorems.map(e=>({location:e.location,check:t=>{let n=f(e.statement);t.push(...a.errors.splice(0),...u(e.proof,/* @__PURE__ */ new Map),...n===3?l(e.proof):[],...a.errors.splice(0))}})),...t.uses.map(e=>g(e.location,()=>c(e.facts,/* @__PURE__ */ new Map))),...r]].flatMap(e=>Rf(e,i))}},Bm=1024,Vm=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Hm=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Um=/* @__PURE__ */ new Set([...Vm,...Hm,`Enabled`]),Wm=/* @__PURE__ */ new Set([`~>`,`-+->`]),Gm=/* @__PURE__ */ new Set([...Wm,`\\cdot`]),Km=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),qm=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Jm=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),Ym=(e,t)=>Km.has(e)||t.builtins.get(e)?.isStateLevel===!0,Xm=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Vm.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Hm.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Wm.has(e.operator))return 224},o=/* @__PURE__ */ new Map,s=(e,n,c)=>{let l=e.kind;if(l===`Selection`){let t=o.get(e.expression)??0,r=n?c?1:2:c?4:8;if((t&r)!==0)return;o.set(e.expression,t|r)}let u=c?1:513;(Um.has(l)||l===`UnboundedQuantifier`&&e.isTemporal===!0||l===`Apply`&&Gm.has(e.operator))&&(r[0]|=u),Um.has(l)&&(r[0]|=16);let d=a(e);n&&d!==void 0&&(r[0]|=d);let f=n&&d===void 0,p=He(e);if(p!==void 0&&A(e)&&t.variableIndex.has(p)&&(c||(r[0]|=512),f&&(r[0]|=32)),p!==void 0&&!A(e)){let e=t.substitutions.get(p)??p,n=t.definitions.get(e),a=t.constants.has(p),o=t.variableIndex.get(p);if((o!==void 0||t.builtins.get(e)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=u),o!==void 0&&(f&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:f,isOperatorArgument:c||l===`OperatorReference`||l===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{Ym(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),qm.has(e)&&(r[0]|=8),Jm.has(e)&&(r[0]|=256),e===`TLCEval`&&(r[0]|=Bm),!a&&Ym(e,t)&&(r[0]|=16);let n=t.builtins.get(e);f&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}Ve(e).forEach(e=>s(e,f,c||l===`Lambda`))};return e.forEach(e=>s(e,!0,!1)),{row:r,edges:i}},Zm=(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},Qm=1294,$m=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),eh=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=Xm(Be(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&Qm,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Zm(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Zm(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=Zm(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!$m(t[e],l[e*r]|p[e*r])))),h=Zm(a,r,m,Qm);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&Qm:e),words:r}},th=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?nh(Be(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},nh=(e,t)=>{let n=t.facts.words,r=Xm(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=th(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]}$m(e.callee,r[0])||(i[0]|=r[0]&Qm)}),i},rh=(e,t)=>!(th(e,t)[0]&513),ih=(e,t)=>!(th(e,t)[0]&512),ah={any:2,repeated:4,streamed:8,replayed:260,varying:258},oh=(e,t,n)=>(nh(e,t)[0]&ah[n])!==0,sh=(e,t,n=`any`)=>(th(e,t)[0]&ah[n])!==0,ch=(e,t)=>!!(nh([e],t)[0]&Bm),lh=(e,t)=>{let n=th(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},uh=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},dh=(e,t)=>{let n=nh([e],t);return n[0]&16?void 0:uh(n)},fh=(e,t)=>!!(nh([e],t)[0]&1),ph=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),mh=()=>({implication:kb,negate:Ab,equivalent:jb,body:Mb,condition:(e,t)=>{if(typeof e!=`boolean`)throw fb(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw pb(t,n,e);return e},apply:zi,expectFunction:Tb,tuple:Rr,set:Sr,record:Br,writtenRecord:qt,equal:Un,enumerate:zb,choiceElements:vS,noChoice:e=>{throw yS(e)},filterPredicate:_S,isReducible:It,finiteElements:e=>F(e).elements,addBounded:Nt,normalizedSet:jn,isBeyondBound:Pt,cardinality:ui,functionDomain:Ir,sortedFunction:Mn,unassigned:(e,t)=>{throw bb(e,t)},prime:Lx,keepLazyContext:Eb,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Cb(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let hh,gh;const _h=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},vh=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),yh=e=>`local${e.counter++}`,bh=(e,t=/* @__PURE__ */ new Set)=>{let n=He(e);return n!==void 0&&t.add(n),e.kind!==`Selection`&&Ve(e).forEach(e=>bh(e,t)),t},xh=(e,t,n)=>{if(n.locals.size===0)return n.context;let r=ch(t,e.environment),i=bh(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=vh(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},Sh=(e,t,n)=>`${vh(e,Kx(t,e.environment))}(${xh(e,t,n)})`,Ch=(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})`},wh=(e,t,n,r)=>{let i=yh(e),a=yh(e),o=yh(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} }`},Th=(e,t,n)=>{let r=t.kind===`Forall`;return Ch(e,n,n=>{let i=t.bounds.map(()=>yh(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(${Mh(e,r.set,n)}, ${vh(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=yh(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Mh(e,t.body,n)}, ${vh(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>wh(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Eh=(e,t,n,r,i)=>Ch(e,i,i=>{let a=yh(e),o=yh(e),s=vh(e,t),c=`choiceElements(${Mh(e,n,i)}, ${s}, ${vh(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Mh(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${wh(e,a,o,l)} return noChoice(${s});`}),Dh=(e,t,n,r)=>Ch(e,r,r=>{let i=yh(e),a=yh(e),o=yh(e),s=yh(e),c=vh(e,t),l=`if (!isReducible(${i})) return ${vh(e,mS(t,e.environment))}(${i}, ${xh(e,t,r)});`,u=Mh(e,t.bound.set,r);r.locals.set(n,s);let d=gS(t,e.environment)?` else break;`:``,f=`if (filterPredicate(${Mh(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});${d}`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${wh(e,a,s,f)} return normalizedSet(${o});`}),Oh=(e,t,n,r)=>Ch(e,r,r=>{let i=yh(e),a=yh(e),o=yh(e),s=yh(e),c=yh(e),l=yh(e),u=vh(e,dS(t,e.environment)),d=xh(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Mh(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Mh(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} = []; ${wh(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),kh=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Mh(e,r[0],n),a=Mh(e,r[1],n),o=vh(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Mh(e,r[0],n)}, ${vh(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Mh(e,r[0],n)}, ${Mh(e,r[1],n)}, ${vh(e,t)})`;if(A(t))return Sh(e,t,n);let i=mx(t.operator,e.environment);if(i?.kind!==`Builtin`)return Sh(e,t,n);if(i.name===`DOMAIN`)return`${vh(e,gb(t))}(${Mh(e,r[0],n)})`;if(i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2)return`${vh(e,_b(t,i.evaluateBinary))}(${Mh(e,r[0],n)}, ${Mh(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Yx(r[0],a))return`${vh(e,i.evaluateUnary)}(${Mh(e,r[0],n)})`;let o=r.length===2&&Yx(r[0],a)&&Yx(r[1],a);return i.evaluateBinary&&o?`${vh(e,i.evaluateBinary)}(${Mh(e,r[0],n)}, ${Mh(e,r[1],n)})`:Sh(e,t,n)},Ah=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(A(e))return!1;let r=Tx(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Ah(e.expression,t,n);case`FieldAccess`:return Ah(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Ah(e,t,n));default:return!1}},jh=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return jh(e.record);case`FunctionApplication`:return[e.function,...e.args].every(jh);default:return!1}},Mh=(e,t,n)=>{let r=(t,r=n)=>Mh(e,t,r);switch(t.kind){case`Number`:return Vt(t.value)?String(t.value):Sh(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 Sh(e,t,n);let i=Tx(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=vh(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?vh(e,i.value):Sh(e,t,n)}case`Apply`:return kh(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=vh(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)}, ${vh(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{oS(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Ah(t.function,n,e.environment)?r(t.function):jh(t.function)?r(t.function,i):Sh(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${vh(e,t)}))`,o=hb(e.environment.runtime.version),s=o?`, ${vh(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`${vh(e,mb(t))}(${r(t.record)})`;case`Record`:{let i=xS(t.fields);if(SS(i))return Sh(e,t,n);let a=vh(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}, ${vh(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${vh(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?Sh(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`)?Th(e,t,n):Sh(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Eh(e,t,t.set,t.pattern.name,n):Sh(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!uS(t)?Oh(e,t,r.pattern.name,n):Sh(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Dh(e,t,t.bound.pattern.name,n):Sh(e,t,n);default:return Sh(e,t,n)}},Nh=(e,t)=>{if(!ph.has(e.kind)||(gh??=_h(),!gh))return;let n={environment:t,references:[],helpers:[],counter:0},r=Mh(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(`
|
|
404
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return hh??=mh(),Function(...Object.keys(hh),...i,a)(...Object.values(hh),...n.references)},Ph=(t,n,r)=>new e.A(`Applying ${t} to the following value,\nwhich is not ${n}:\n${j(L(r))}`),Fh=e=>Lt(e)?I(e):void 0,Ih=`a function with a finite domain`,Lh=(e,t,n)=>{let r=R(e,t,n),i=Fh(r);if(!i)throw Ph(n,Ih,r);return i},Rh=(e,t)=>{let n=R(e,1,t),r=Fh(n),i=r&&Hh(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Yo(`second`,t,`bag`,n);return i},zh=(e,t,n)=>{let r=t[n];if(!r||!Vh(r))throw Yo(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},Bh=(e,t)=>{if(!N(e)||!P(e))throw t();return F(e).elements},Vh=e=>e.range.every(e=>typeof e==`number`&&e>0),Hh=(e,t)=>{let n=e.domain.findIndex(e=>vr(t,e));return n===-1?void 0:e.range[n]},Uh=(e,t)=>{if(typeof e==`number`)return e;throw t()},Wh=(e,t,n)=>{let r=Uh(e,n)+Uh(t,n);if(is(r))throw as(`${e}+${t}`);return r},Gh=(e,t,n,r,i)=>{let a=Uh(e.range[t],r),o=Hh(n,e.domain[t]);if(o===void 0)return a;let s=a-Uh(o,i);if(is(s))throw as(`${a}-${o}`);return s},Kh=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>vr(t,e[0]));a?a[1]=Wh(a[1],n,r):e.push([t,n])},qh=e=>e.domain.map((t,n)=>[t,e.range[n]]),Jh=Mn([],[]),Yh=t=>[es(`EmptyBag`,Jh),z(`IsABag`,1,e=>{let t=Fh(R(e,0,`IsABag`));return t!==void 0&&Vh(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=Lh(e,0,`BagCardinality`),r=()=>Ph(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return Wh(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=Rh(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Rh(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>Fh(R(e,t,`(+)`))),n=zh(e,t,0),r=zh(e,t,1),i=qh(n),a=()=>Yo(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>Kh(i,e,r.range[t],a,n.domain.length)),Dr(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=Fh(t),i=Fh(n);if(!r)throw Yo(`first`,`(-)`,`bag`,t);if(!i)throw Yo(`second`,`(-)`,`bag`,n);let a=()=>Yo(`first`,`(-)`,`bag`,t),o=()=>Yo(`second`,`(-)`,`bag`,n);return Dr(r.domain.flatMap((e,t)=>{let n=Gh(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=Bh(n,()=>Ph(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Jh;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=Fh(e);if(!t)throw i();return t},o=qh(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>Kh(o,e,t.range[n],i))}),Dr(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=Fh(t),i=Fh(n);if(!r)throw Ph(`\\sqsubseteq`,Ih,t);if(!i)throw Ph(`\\sqsubseteq`,Ih,n);let a=()=>Ph(`\\sqsubseteq`,`a bag`,t),o=()=>Ph(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Hh(i,e);return Uh(r.range[t],a)<=(n===void 0?0:Uh(n,o))})}),ts(`BagOfAll`,2,e=>{let t=$o(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=Fh(n);if(!r)throw Yo(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>Yo(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>Kh(i,t.call([e]),r.range[n],a)),Dr(i)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!Lt(r))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${ds(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=I(r),a=F(Sr(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 xr(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Mn(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>Vi(Lh(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Bh(t,()=>Ph(`BagToSet`,Ih,t));return Mn([...n],n.map(()=>1))})],Xh={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},Z={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},Zh={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Qh=[{lower:`true`,upper:`TRUE`,token:Z.true},{lower:`false`,upper:`FALSE`,token:Z.false},{lower:`null`,upper:`NULL`,token:Z.null}],$h=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
405
|
+
`],[`r`,`\r`],[`f`,`\f`]]),eg=1024,tg=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=Z.none,c=0,l=[Xh.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===Xh.emptyArray||e===Xh.nonemptyArray?`[${d[t]}]`:e===Xh.emptyDocument||e===Xh.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()}
|
|
403
406
|
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
|
|
404
407
|
`.includes(e),v=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
405
|
-
`){i++,a=r;return}if(e===`\r`)return}},
|
|
406
|
-
`)i++,a=r+1;else if(t.startsWith(e,r))return!0;return!1},
|
|
407
|
-
`)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(
|
|
408
|
-
`,r)&&(r+=5),l[e]=
|
|
409
|
-
`)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},
|
|
410
|
-
`&&(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=Z.none},w=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=Z.none},oe=()=>{let e=ne();return e!==Z.endObject&&e!==Z.endArray&&e!==Z.eof},se=()=>{let e=ne(),t=e===Z.unquotedName?ie():C(e===Z.singleQuotedName?`'`:`"`);return s=Z.none,u[l.length-1]=t,t},ce=e=>e===Z.true||e===Z.false?e===Z.true:e===Z.null?null:e===Z.number?(r+=c,{literal:t.slice(r-c,r)}):e===Z.unquoted?ie():C(e===Z.singleQuoted?`'`:`"`),T=()=>{let e=ne();if(e===Z.beginArray){ae(bm.emptyArray);let e=[];for(;oe();)e.push(T());return w(),e}if(e===Z.beginObject){ae(bm.emptyObject);let e=/* @__PURE__ */ new Map;for(;oe();)e.set(se(),T());return w(),e}let t=ce(e);return s=Z.none,d[l.length-1]++,t};if(ne()===Z.eof)return null;let le=T();return o=!1,le!==null&&ne(),le},Em=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Dm=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Om=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),km=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},Am=(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')`)},jm=t=>new e.x(`Cannot convert value: unsupported value type tlc2.value.impl.${Zo(t)}`),Mm=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Nm=e=>`[${e.map(Lm).join(`,`)}]`,Pm=e=>`{${Gt(e).map(e=>`${Mm(typeof e[0]==`string`?e[0]:L(e[0]))}:${Lm(e[1])}`).join(`,`)}}`,Fm=e=>{let t=I(e),n=pi(t);return n?Nm(n):Pm(t)},Im=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Lm=e=>typeof e==`string`?Mm(e):typeof e==`object`?e.kind===`ModelValue`?Mm(e.name):Zo(e)===`RecordValue`?Pm(I(e)):Rm(e):String(e),Rm=e=>{let t=Zo(e);if(t===`TupleValue`)return Nm(I(e).range);if(Im(t))return Fm(e);if(zr(e))return Nm(F(e).elements);throw jm(e)},zm=e=>e.map(e=>`${Lm(e)}\n`).join(``),Bm=e=>{let t=Zo(e);if(t===`RecordValue`)return Pm(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Lm(e)}`).join(`,`)}}`;if(Im(t))return Fm(e);throw jm(e)},Vm=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(Vm));if(t instanceof Map)return Lr([...t].map(e=>[pn(e[0]),Vm(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},Hm=t=>{if(typeof t!=`string`)throw new e.x(`Cannot cast tlc2.value.impl.${Zo(t)} to tlc2.value.impl.StringValue`);return t},Um=(e,t)=>{let n=Li(e,t);if(typeof n!=`string`)throw Am(n,`StringValue`);return n},Wm=t=>{if(!Dm.has(t.toLowerCase()))throw Om.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}`)},Gm=(t,n,r,i)=>{let a=r.find(e=>!Em.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))},Km=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},qm=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.x(`${n} (No such file or directory)`);return r},Jm=e=>[es(Uo(`ToJson`,1,e=>pn(Lm(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(Rm(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(Bm(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=Hm(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!pi(r)&&!km(r))throw Io(`second`,`JsonSerialize`,`sequence or record`,r);return Km(e,n),e.writeFile?.(n,Lm(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=Hm(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=pi(r);if(!i)throw Io(`second`,`ndJsonSerialize`,`sequence`,r);return Km(e,n),e.writeFile?.(n,zm(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=>Vm(Tm(qm(e,Hm(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(qm(e,Hm(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Vm(Tm(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Ym=(e,t)=>[es(os(`Serialize`,3,(n,r)=>{let i=ss(n,2,`Serialize`)(),a=km(i);if(!a)throw Io(`third`,`ndJsonSerialize`,`sequence`,i);if(Um(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 Am(l,`TupleValue`);let u=Um(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Am(e,`StringValue`);return e});return Wm(u),Gm(e,c,d,zm(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)`)],Xm={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Zm=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(Xm.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(Xm.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(Xm.boolean),s(+!!e);return}if(typeof e==`number`){s(Xm.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(Xm.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(Xm.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(Xm.set),l(t.length),t.forEach(p);return}let n=I(e),m=Nn(e);m===`tuple`?(s(Xm.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(Xm.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(Xm.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))},Qm=e=>[es(Uo(`_TLCTraceSerialize`,2,t=>{let n=Hm(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Zm(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`)],$m=25214903917n,eh=(1n<<48n)-1n,th=e=>{let t=(BigInt.asUintN(64,e)^$m)&eh,n=e=>(t=t*$m+11n&eh,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^$m)&eh},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}},nh=[],rh=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},ih=()=>{for(let e=1277011;nh.length<1341;e++)rh(e)&&nh.push(e);return nh},ah=e=>{let t=ih(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},oh=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},sh=e=>{for(let t=Math.max(e,9);;t++){let e=oh(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)}}},ch=(e,t,n)=>{if(t<=0)return[];let r=sh(t),i=BigInt(n.nextInt(t)),a=BigInt(ah(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},lh=(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))},uh=(1n<<63n)-1n-24n,dh=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(uh*BigInt(n)+i)%t;return r<0n?r+t:r})},fh=(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,ph=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}}},mh=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,hh=(e,t,n,r)=>{if(ai(t))return[];let i=r===`1.7.4`?lh:ch;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=mh(t,r)?void 0:ph(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?dh(e,t,n):i(e,Number(t),n)).map(e=>a.create(fh(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},gh=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Lo(t.domain,`RandomElement`,t).elements];return An(e,e.map(()=>gh(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Lr(t.names.map((e,r)=>[e,gh(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Ir(t.factors.map(e=>gh(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]},_h=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Io(t,n,`nonnegative integer`,e);return e},vh=(e,t,n,r)=>yr(Array.from({length:t},()=>yr(e.filter(()=>r.nextDouble()<n)))),yh=(e,t)=>{let n=`RandomSetOfSubsets`,r=_h(R(e,0,n),`first`,n),i=_h(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 vh(o,r,o.length===0?0:i/o.length,t.getRandom())},bh=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,xh=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Sh=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(bh.test(t))return Number(t.replace(/[fFdD]$/,``));let n=xh.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},Ch=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=_h(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=Sh(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 vh(F(o).elements,r,a,e.getRandom())}),wh=t=>[es(z(`RandomSubset`,2,n=>{let r=_h(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=mh(i,t.version);if(a&&a.reduce((e,t)=>e*F(t).elements.length,1)>At())throw new e.x(jt());return yr(hh(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=>yh(e,t)),z(`TestRandomSetOfSubsets`,3,e=>Ir(Array.from({length:5},()=>F(yh(e,t)).elements.length)))],Th=(e,t=0n)=>{let n=th(t),r=th(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},Eh=e=>Tr([...e.possibleCounts].map(e=>[e[0],e[1]])),Dh=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Eh(e)]]),Oh=e=>Lr([[`name`,e??`UnnamedAction`],[`location`,Lr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),kh=/* @__PURE__ */ new WeakSet,Ah=e=>Mn(Er(e),`record`),jh=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(pn);let r=[[`action`,yr(e)],[`state`,yr(t)]],i=Ah(n?r:[...r,[`console`,!1]]);return kh.add(i),i},Mh=(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 jh([...a,...o],i,r)},Nh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Dh(e).get(t)},Ph=(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))}`)},Fh=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:Q(e),Ih=e=>e.every(e=>e!==void 0),Lh=(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=>Lh(e,t,n)),o=i?ry(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Lh(o.body,t,n))),Math.max(0,...a)},Rh=(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 (${Fh(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=>Nh(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||!Ih(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??jh([],[])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(typeof n!=`object`||!kh.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=>{$(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&&(!Ih(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?Fh(o.expression):``}`);if(s||!i?.next||!Ih(a)||!i.state||!Ih(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=Lh(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?ry(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`?$(i.body,n):$({kind:`Identifier`,name:r,location:i.location},n)})]},zh=(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,()=>Eh(t)),Uo(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Eh(t),!0)),!1)}),Uo(`_PrintCounts`,0,()=>(e(L(Eh(t),!0)),!0))],Bh=e=>`${e.getUTCFullYear()}.${ut(e.getUTCMonth()+1)}.${ut(e.getUTCDate())}.${ut(e.getUTCHours())}${ut(e.getUTCMinutes())}${ut(e.getUTCSeconds())}`,Vh=e=>Tr([...e].map(e=>[e[0],Ir([e[1]])])),Hh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Uh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Wh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Gh=(t,n,r)=>{if(t.version===`1.7.4`?!Uh.has(n)||!t.isStarted&&Wh.has(n):!t.isStarted&&Hh.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 Ah([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return Ah([[`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 Ah([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,pn(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,pn(Bh(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return Oh(void 0);case`all`:return Vh(t.registers);case`all:named`:return Vh(Dh(t))}if(n.startsWith(`s:`)){let r=Dh(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.`)},Kh=(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 Gh(t,n,r?.state)},qh=e=>e.length===0?[[]]:e.flatMap((t,n)=>qh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Jh=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(Jh),e.kind===`Function`&&e.range.forEach(Jh))},Yh=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)}},Xh=(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=Yh(ss(e,0,`TLCEval`)());return t===void 0&&Jh(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=Lo(R(e,0,`Permutations`),`Permutations`).elements;return yr(qh(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)=>Kh(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)=>Kh(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=>(Ph(n,t,R(e,0,`TLCSet`),R(e,1,`TLCSet`)),!0)),Vo(`Any`,bn),z(`RandomElement`,1,e=>gh(R(e,0,`RandomElement`),n.getRandom()))],Zh=`----------------------------- MODULE Bags --------------------------------
|
|
408
|
+
`){i++,a=r;return}if(e===`\r`)return}},ee=e=>{for(;r+e.length<=t.length;r++)if(t[r]===`
|
|
409
|
+
`)i++,a=r+1;else if(t.startsWith(e,r))return!0;return!1},y=()=>{for(;r<t.length;){let e=t[r++];if(e===`
|
|
410
|
+
`)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(ee(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),v();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},b=()=>{let e=y();if(e===void 0)throw h();return e},x=()=>{let e=Qh.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return Z.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 Z.none}return r+n<t.length&&_(t[r+n])?Z.none:(r+=n,e.token)},te=()=>{let e=Zh.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===eg)return Z.none;let a=t[r+i];if(a===`-`){if(e===Zh.none)e=Zh.sign;else if(e===Zh.exponentE)e=Zh.exponentSign;else return Z.none}else if(a===`+`){if(e!==Zh.exponentE)return Z.none;e=Zh.exponentSign}else if(a===`e`||a===`E`){if(e!==Zh.digit&&e!==Zh.fractionDigit)return Z.none;e=Zh.exponentE}else if(a===`.`){if(e!==Zh.digit)return Z.none;e=Zh.decimal}else if(a<`0`||a>`9`){if(_(a))return Z.none;break}else if(e===Zh.sign||e===Zh.none)n=a===`0`,e=Zh.digit;else if(e===Zh.digit){if(n)return Z.none}else e===Zh.decimal?e=Zh.fractionDigit:(e===Zh.exponentE||e===Zh.exponentSign)&&(e=Zh.exponentDigit)}return i===eg||e!==Zh.digit&&e!==Zh.fractionDigit&&e!==Zh.exponentDigit?Z.none:(c=i,Z.number)},S=()=>{let e=l.length-1,n=l[e];if(n===Xh.emptyArray)l[e]=Xh.nonemptyArray;else if(n===Xh.nonemptyArray){let e=b();if(e===`]`)return Z.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===Xh.emptyObject||n===Xh.nonemptyObject){if(l[e]=Xh.danglingName,n===Xh.nonemptyObject){let e=b();if(e===`}`)return Z.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=b();if(t===`"`)return Z.doubleQuotedName;if(t===`'`)return g(),Z.singleQuotedName;if(t===`}`){if(n!==Xh.nonemptyObject)return Z.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return Z.unquotedName;throw m(`Expected name`)}else if(n===Xh.danglingName){l[e]=Xh.nonemptyObject;let n=b();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===Xh.emptyDocument){if(y()===void 0)return Z.eof;r--,t.startsWith(`)]}'
|
|
411
|
+
`,r)&&(r+=5),l[e]=Xh.nonemptyDocument}else if(n===Xh.nonemptyDocument){if(y()===void 0)return Z.eof;g(),r--}let i=y();if(i===void 0){if(n===Xh.emptyDocument)return Z.eof;throw h()}if(i===`]`&&n===Xh.emptyArray)return Z.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==Xh.emptyArray&&n!==Xh.nonemptyArray)throw m(`Unexpected value`);return g(),r--,Z.null}if(i===`'`)return g(),Z.singleQuoted;if(i===`"`)return Z.doubleQuoted;if(i===`[`)return Z.beginArray;if(i===`{`)return Z.beginObject;r--;let a=x();if(a!==Z.none)return a;let o=te();if(o!==Z.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),Z.unquoted},ne=()=>(s===Z.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=$h.get(e);if(n!==void 0)return n;if(e===`
|
|
412
|
+
`)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},ie=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===`
|
|
413
|
+
`&&(i++,a=r)}throw m(`Unterminated string`)},ae=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},C=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=Z.none},oe=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=Z.none},w=()=>{let e=ne();return e!==Z.endObject&&e!==Z.endArray&&e!==Z.eof},se=()=>{let e=ne(),t=e===Z.unquotedName?ae():ie(e===Z.singleQuotedName?`'`:`"`);return s=Z.none,u[l.length-1]=t,t},ce=e=>e===Z.true||e===Z.false?e===Z.true:e===Z.null?null:e===Z.number?(r+=c,{literal:t.slice(r-c,r)}):e===Z.unquoted?ae():ie(e===Z.singleQuoted?`'`:`"`),le=()=>{let e=ne();if(e===Z.beginArray){C(Xh.emptyArray);let e=[];for(;w();)e.push(le());return oe(),e}if(e===Z.beginObject){C(Xh.emptyObject);let e=/* @__PURE__ */ new Map;for(;w();)e.set(se(),le());return oe(),e}let t=ce(e);return s=Z.none,d[l.length-1]++,t};if(ne()===Z.eof)return null;let ue=le();return o=!1,ue!==null&&ne(),ue},ng=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),rg=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),ig=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),ag=e=>{if(!Lt(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?zr(n):void 0},og=(t,n)=>{let r=`tlc2.value.impl.${us(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')`)},sg=t=>new e.x(`Cannot convert value: unsupported value type tlc2.value.impl.${us(t)}`),cg=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),lg=e=>`[${e.map(pg).join(`,`)}]`,ug=e=>`{${Kt(e).map(e=>`${cg(typeof e[0]==`string`?e[0]:L(e[0]))}:${pg(e[1])}`).join(`,`)}}`,dg=e=>{let t=I(e),n=hi(t);return n?lg(n):ug(t)},fg=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,pg=e=>typeof e==`string`?cg(e):typeof e==`object`?e.kind===`ModelValue`?cg(e.name):us(e)===`RecordValue`?ug(I(e)):mg(e):String(e),mg=e=>{let t=us(e);if(t===`TupleValue`)return lg(I(e).range);if(fg(t))return dg(e);if(Vr(e))return lg(F(e).elements);throw sg(e)},hg=e=>e.map(e=>`${pg(e)}\n`).join(``),gg=e=>{let t=us(e);if(t===`RecordValue`)return ug(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${pg(e)}`).join(`,`)}}`;if(fg(t))return dg(e);throw sg(e)},_g=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 hn(t);if(Array.isArray(t))return Rr(t.map(_g));if(t instanceof Map)return zr([...t].map(e=>[hn(e[0]),_g(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||is(n))throw new e.x(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},vg=t=>{if(typeof t!=`string`)throw new e.x(`Cannot cast tlc2.value.impl.${us(t)} to tlc2.value.impl.StringValue`);return t},yg=(e,t)=>{let n=zi(e,t);if(typeof n!=`string`)throw og(n,`StringValue`);return n},bg=t=>{if(!rg.has(t.toLowerCase()))throw ig.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}`)},xg=(t,n,r,i)=>{let a=r.find(e=>!ng.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))},Sg=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Cg=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.x(`${n} (No such file or directory)`);return r},wg=e=>[ps(ns(`ToJson`,1,e=>hn(pg(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),ps(ns(`ToJsonArray`,1,e=>hn(mg(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),ps(ns(`ToJsonObject`,1,e=>hn(gg(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),ps(ns(`JsonSerialize`,2,t=>{let n=vg(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!hi(r)&&!ag(r))throw Yo(`second`,`JsonSerialize`,`sequence or record`,r);return Sg(e,n),e.writeFile?.(n,pg(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`),ps(ns(`ndJsonSerialize`,2,t=>{let n=vg(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=hi(r);if(!i)throw Yo(`second`,`ndJsonSerialize`,`sequence`,r);return Sg(e,n),e.writeFile?.(n,hg(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`),ps(ns(`JsonDeserialize`,1,t=>_g(tg(Cg(e,vg(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),ps(ns(`ndJsonDeserialize`,1,t=>Rr(Cg(e,vg(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>_g(tg(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Tg=(e,t)=>[ps(ys(`Serialize`,3,(n,r)=>{let i=bs(n,2,`Serialize`)(),a=ag(i);if(!a)throw Yo(`third`,`ndJsonSerialize`,`sequence`,i);if(yg(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=bs(n,0,`Serialize`)(),s=hi(o);if(!s)throw Yo(`first`,`Serialize`,`sequence`,o);let c=bs(n,1,`Serialize`)();if(typeof c!=`string`)throw Yo(`second`,`ndJsonSerialize`,`sequence`,c);let l=zi(a,`openOptions`);if(us(l)!==`TupleValue`)throw og(l,`TupleValue`);let u=yg(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw og(e,`StringValue`);return e});return bg(u),xg(e,c,d,hg(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)`)],Eg={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Dg=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=kn(),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(Eg.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(Eg.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(Eg.boolean),s(+!!e);return}if(typeof e==`number`){s(Eg.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(Eg.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(Eg.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(Eg.set),l(t.length),t.forEach(p);return}let n=I(e),m=Fn(e);m===`tuple`?(s(Eg.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(Eg.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(Eg.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))},Og=e=>[ps(ns(`_TLCTraceSerialize`,2,t=>{let n=vg(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Dg(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`)],kg=25214903917n,Ag=(1n<<48n)-1n,jg=e=>{let t=(BigInt.asUintN(64,e)^kg)&Ag,n=e=>(t=t*kg+11n&Ag,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^kg)&Ag},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}},Mg=[],Ng=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Pg=()=>{for(let e=1277011;Mg.length<1341;e++)Ng(e)&&Mg.push(e);return Mg},Fg=e=>{let t=Pg(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Ig=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},Lg=e=>{for(let t=Math.max(e,9);;t++){let e=Ig(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)}}},Rg=(e,t,n)=>{if(t<=0)return[];let r=Lg(t),i=BigInt(n.nextInt(t)),a=BigInt(Fg(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},zg=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Dt),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Bg=(1n<<63n)-1n-24n,Vg=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Bg*BigInt(n)+i)%t;return r<0n?r+t:r})},Hg=(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,Ug=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Ir(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>Mn(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>zr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:Rr}}},Wg=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Gg=(e,t,n,r)=>{if(si(t))return[];let i=r===`1.7.4`?zg:Rg;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=Wg(t,r)?void 0:Ug(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?Vg(e,t,n):i(e,Number(t),n)).map(e=>a.create(Hg(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Kg=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Xo(t.domain,`RandomElement`,t).elements];return Mn(e,e.map(()=>Kg(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return zr(t.names.map((e,r)=>[e,Kg(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Rr(t.factors.map(e=>Kg(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=Xo(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]},qg=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Yo(t,n,`nonnegative integer`,e);return e},Jg=(e,t,n,r)=>xr(Array.from({length:t},()=>xr(e.filter(()=>r.nextDouble()<n)))),Yg=(e,t)=>{let n=`RandomSetOfSubsets`,r=qg(R(e,0,n),`first`,n),i=qg(R(e,1,n),`second`,n),a=R(e,2,n);if(!N(a)||!P(a))throw Yo(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw Yo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Yo(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Jg(o,r,o.length===0?0:i/o.length,t.getRandom())},Xg=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Zg=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Qg=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Xg.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Zg.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},$g=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=qg(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw Yo(`second`,n,`string literal representing a probability`,i);let a=Qg(i);if(a===void 0||a<0||a>1)throw Yo(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!N(o)||vn(o)||!fi(o))throw Yo(`third`,n,`finite set`,o);let s=ui(o);if(32-Math.clz32(r)>s&&r>1<<s)throw Yo(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Jg(F(o).elements,r,a,e.getRandom())}),e_=t=>[ps(z(`RandomSubset`,2,n=>{let r=qg(R(n,0,`RandomSubset`),`first`,`RandomSubset`),i=R(n,1,`RandomSubset`);if(!Vr(i)||!fi(i))throw Yo(`second`,`RandomSubset`,`a finite set`,i);let a=Wg(i,t.version);if(a&&a.reduce((e,t)=>e*F(t).elements.length,1)>jt())throw new e.x(Mt());return xr(Gg(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=>Yg(e,t)),z(`TestRandomSetOfSubsets`,3,e=>Rr(Array.from({length:5},()=>F(Yg(e,t)).elements.length)))],t_=(e,t=0n)=>{let n=jg(t),r=jg(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>zr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Xa,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},n_=e=>Dr([...e.possibleCounts].map(e=>[e[0],e[1]])),r_=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,n_(e)]]),i_=e=>zr([[`name`,e??`UnnamedAction`],[`location`,zr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),a_=/* @__PURE__ */ new WeakSet,o_=e=>Pn(Or(e),`record`),s_=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(hn);let r=[[`action`,xr(e)],[`state`,xr(t)]],i=o_(n?r:[...r,[`console`,!1]]);return a_.add(i),i},c_=(e,t,n,r=!0)=>{let i=e.map((e,t)=>Rr([t+1,zr(Object.entries(e))])),a=i.slice(1).map((e,n)=>Rr([i[n],t[n],e])),o=n?[Rr([i[i.length-1],n.action,i[n.start]])]:[];return s_([...a,...o],i,r)},l_=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return r_(e).get(t)},u_=(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))}`)},d_=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:Q(e),f_=e=>e.every(e=>e!==void 0),p_=(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=Ve(e).map(e=>p_(e,t,n)),o=i?Nb(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(p_(o.body,t,n))),Math.max(0,...a)},m_=(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[ys(`AssertError`,2,t=>{let r=$o(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.x(`In computing AssertError, a non-string expression (${d_(r)}) was used as the err of an AssertError(err, exp).`);let i=bs(t,0,`AssertError`)();try{bs(t,1,`AssertError`)()}catch(t){if(t instanceof e.x)return ut(t.message,n.isTool)===i;throw t}return!1}),ns(`TLCGetOrDefault`,2,e=>l_(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),ns(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!f_(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?Rr(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return zr(i===void 0?t:[[`_action`,i],...t])})):Rr([zr([])])}),ns(`CounterExample`,0,()=>n.counterExample??s_([],[])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(typeof n!=`object`||!a_.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(zi(n,`state`)).elements.map(e=>hi(e)??[]);return Rr(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 On(n)}),ys(`TLCDefer`,1,(e,t)=>{let r=$o(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{$(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...ys(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!f_(a)||i?.next&&n.isSeen(a)))return!0;let o=$o(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.x(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${ds(s)}) was used as the condition of an IF.\n${o.expression?d_(o.expression):``}`);if(s||!i?.next||!f_(a)||!i.state||!f_(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=e=>t(et(n.isTool,Ze.moduleOverrideStdout,Qe.none,e));for(;;){u(`Extend behavior of length ${n.getLevel(c)} with a "${l?.name}" step [<Action ${l?.location.range&&e.X(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(`${xa(n.toRecord(c)).trimEnd()}\n~>\n${xa(n.toRecord(a)).trimEnd()}`);else if(t[0]===`d`)u(xa(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},ys(`TLCCache`,2,(e,t)=>{let i=$o(e,0,`TLCCache`),o=oa(bs(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=p_(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=Zi(t);if(n)throw n;return Number(BigInt.asIntN(32,Xa([t])))}),ys(`TLCEvalDefinition`,1,(t,n)=>{let r=bs(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?Nb(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`?$(i.body,n):$({kind:`Identifier`,name:r,location:i.location},n)})]},h_=(e,t)=>[ns(`_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}),ns(`_Counts`,0,()=>n_(t)),ns(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(n_(t),!0)),!1)}),ns(`_PrintCounts`,0,()=>(e(L(n_(t),!0)),!0))],g_=e=>`${e.getUTCFullYear()}.${dt(e.getUTCMonth()+1)}.${dt(e.getUTCDate())}.${dt(e.getUTCHours())}${dt(e.getUTCMinutes())}${dt(e.getUTCSeconds())}`,__=e=>Dr([...e].map(e=>[e[0],Rr([e[1]])])),v_=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),y_=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),b_=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),x_=(t,n,r)=>{if(t.version===`1.7.4`?!y_.has(n)||!t.isStarted&&b_.has(n):!t.isStarted&&v_.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 o_([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return o_([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,wa()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return o_([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,hn(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,hn(g_(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return i_(void 0);case`all`:return __(t.registers);case`all:named`:return __(r_(t))}if(n.startsWith(`s:`)){let r=r_(t).get(n);if(r===void 0)throw new e.A(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return hn(t.properties.get(n.slice(2))??n);throw new e.A(`TLCGet(${n}) was undefined.`)},S_=(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 x_(t,n,r?.state)},C_=e=>e.length===0?[[]]:e.flatMap((t,n)=>C_([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),w_=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(w_),e.kind===`Function`&&e.range.forEach(w_))},T_=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:Mn(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},E_=(t,n)=>[z(`Print`,2,e=>(t(_a([R(e,0,`Print`),R(e,1,`Print`)]).map(j).join(` `)),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(j(_a([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.nt.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Dr([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=Lt(t)?I(t):void 0,i=Lt(n)?I(n):void 0;if(!r)throw Yo(`first`,`@@`,`function`,t);if(!i)throw Yo(`second`,`@@`,`function`,n);let a=Gt(r),o=Gt(i).filter(e=>!a.some(t=>vr(e[0],t[0])));return Or([...a,...o])}),z(`ToString`,1,e=>hn(L(R(e,0,`ToString`),!0))),{...ys(`TLCEval`,1,(e,t)=>{let n=T_(bs(e,0,`TLCEval`)());return t===void 0&&w_(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=Xo(R(e,0,`Permutations`),`Permutations`).elements;return xr(C_(t).map(e=>Dr(t.map((t,n)=>[t,e[n]]))))}),ts(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=hi(t);if(!n)throw Yo(`first`,`SortSeq`,`natural number`,t);let r=$o(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw Yo(`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)}),Rr(a)}),n.version===`1.7.4`?ps({...ns(`TLCGet`,1,(e,t)=>S_(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):ps(ys(`TLCGet`,1,(e,t)=>S_(n,bs(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)`),ns(`TLCSet`,2,e=>(u_(n,t,R(e,0,`TLCSet`),R(e,1,`TLCSet`)),!0)),es(`Any`,Sn),z(`RandomElement`,1,e=>Kg(R(e,0,`RandomElement`),n.getRandom()))],D_=`----------------------------- MODULE Bags --------------------------------
|
|
411
414
|
(**************************************************************************)
|
|
412
415
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
413
416
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -560,7 +563,7 @@ CopiesIn(e, B) ==
|
|
|
560
563
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
561
564
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
562
565
|
5 Dec 98 : Initial version.
|
|
563
|
-
`,
|
|
566
|
+
`,O_=/* @__PURE__ */ new Map([[`Bags`,D_],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
564
567
|
(***************************************************************************)
|
|
565
568
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
566
569
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -1692,7 +1695,7 @@ _TLCTrace ==
|
|
|
1692
1695
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1693
1696
|
|
|
1694
1697
|
=============================================================================
|
|
1695
|
-
`]])
|
|
1698
|
+
`]]),k_=new Map([...[...O_].filter(e=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e[0])),[`Bags`,D_.replace(`
|
|
1696
1699
|
LOCAL INSTANCE Naturals
|
|
1697
1700
|
`,`
|
|
1698
1701
|
EXTENDS TLC
|
|
@@ -1784,12 +1787,12 @@ _TEPosition ==
|
|
|
1784
1787
|
ELSE TLCGet("level") + 1
|
|
1785
1788
|
|
|
1786
1789
|
=============================================================================
|
|
1787
|
-
`]]),eg=(e=`master`)=>e===`1.7.4`?$h:Qh,tg=(e,t)=>e.every(e=>vi(e,t)),ng=yr([!1,!0]);mr(ng);const rg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return wr(rg(e,t,r),rg(e,r,n))},ig=[`\\cup`,`\\cap`,`\\`],ag=e=>typeof e==`object`&&e.kind===`MixedSet`,og=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,sg=(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)}),og(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)},cg=(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},lg=(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`?cg(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},ug=(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}},dg=[Vo(`TRUE`,!0),Vo(`FALSE`,!1),Vo(`BOOLEAN`,ng),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,`<=>`)),ug(`/\\`,(e,t)=>e&&t()),ug(`\\/`,(e,t)=>e||t()),ug(`=>`,(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 lg(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)?tg(F(t.base).elements,n.base):!$r(t,e=>!vi(e,n))}),...ig.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)&&!ag(r)&&!ag(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=og(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>vi(e,s)))),s},(e,n)=>sg(t,e,n),r,i)}return Ft(r)?sg(t,r,i):t!==`\\`&&Ft(i)?sg(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 ag(t)||r.some(ag)?a():r.length===0?xr:gi(e=>fi(rg(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)})],fg=ns(`Integers`,`Neg`,`IntValue`,1),pg=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}})]},mg=pg(`Naturals`),hg=pg(`Integers`),gg=e=>{let t=mg.indexOf(e);return t===-1?void 0:hg[t]},_g=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`))]},vg=[Vo(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...mg,..._g(`Naturals`)],yg=[Vo(`Int`,{kind:`InfiniteSet`,name:`Int`}),...hg,..._g(`Integers`),z(`-.`,1,e=>{let t=ts(R(e,0,`-`),fg);if(Go(-t))throw Ko(`-${t}`);return-t})],bg=(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},xg=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:bg(e,t,n)},Sg=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw Io(n,`SubSeq`,`natural number`,r);return r},Cg=(e,t,n)=>typeof e==`string`?pn(e.slice(t,n)):Ir(e.slice(t,n)),wg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Tg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Eg=(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},Dg=t=>Eg(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>xg(e,0,wg(``,`Len`)).length),z(`\\o`,2,t=>{let n=xg(t,0,Tg(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=bg(t,1,Tg(`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(`${Tg(`t \\o s`,`string`)}\n${j(L(r))}`);return pn(n+r)}),z(`Append`,2,e=>Ir([...bg(e,0,Tg(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=bg(t,0,wg(``,`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=xg(t,0,wg(``,`Tail`));if(n.length===0)throw new e.A(`Attempted to apply Tail to the empty sequence.`);return Cg(n,1)}),z(`SubSeq`,3,t=>{let n=xg(t,0,wg(`first `,`SubSeq`)),r=Sg(t,1,`second`),i=Sg(t,2,`third`);if(r>i)return Cg(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 Cg(n,r-1,i)}),Ho(`SelectSeq`,2,t=>{let n=Bo(t,1,`SelectSeq`);return Ir(bg(t,0,wg(`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}))})]),Og=t=>Eg(`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)})]),kg=[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)`)],Ag=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return kg;if(e===`AnySet`)return[Vo(`ANY`,bn)];if(e===`IOUtils`)return Ym(r,a);if(e===`_TLCTrace`)return Qm(r);if(!eg(n.version).has(e))return;let o=Ng(e,t,n,r,i);return e===`Randomization`&&o?[...o,Ch(n)]:o},jg=/* @__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`]]]),Mg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Ng=(e,t,n,r,i)=>{switch(e){case`Naturals`:return vg;case`Integers`:return yg;case`Sequences`:return Dg(n.version);case`FiniteSets`:return Og(n.version);case`TLC`:return Eg(`TLC`,Xh(t,n));case`Randomization`:return wh(n);case`_Possible`:return zh(t,n);case`Json`:return Jm(r);case`Bags`:return Eg(`Bags`,ym(i));case`TLCExt`:return Eg(`TLCExt`,Rh(t,n));default:return}},Pg=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Wd.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 cb(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,hi.sets=a}},Fg=(e,t,n)=>e.coverage?ho(e.coverage,t,n):-1,Ig=(e,t,n)=>e.coverage?_o(e.coverage,t,n):n(),Lg=(e,t,n,r)=>Ig(e,t,()=>$(n,r)),Rg=(e,t,n,r)=>{let i=Lg(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},zg=(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},Bg=e=>!e.includes(void 0),Vg=e=>e.variables.map(()=>void 0),Hg=(e,t,n)=>{let r=[...e];return r[t]=n,r},Ug=(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}},Wg=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,Gg=e=>e.kind===`Identifier`?e.name:void 0,Kg=(e,t,n)=>{if(t.kind===`Label`)return Kg(e,t.body,n);let r=Gg(t);if(r===void 0)return;let i=Kv(n,r);if(i?.kind===`Thunk`)return Kg(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=Iy(r,e);return o?.kind===`Closure`&&o.params.length===0?Kg(e,o.body,o.scope):void 0},qg=(e,t,n)=>{if(t.kind===`Prime`)return Kg(e,t.expression,n);if(t.kind===`Label`)return qg(e,t.body,n);let r=Gg(t);if(r===void 0)return;let i=Kv(n,r);if(i?.kind===`Thunk`)return qg(e,i.expression,i.scope);if(i)return;let a=Iy(r,e);return a?.kind===`Closure`&&a.params.length===0?qg(e,a.body,a.scope):void 0},Jg=t=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean expression.`);return t},Yg=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Xg=(e,t,n,r)=>{let i=Qg(e,t,n,r);return i&&e.coverage&&!e.isInit&&go(e.coverage,r),i},Zg=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(go(r,n),go(r,r.roots[n])),e.onState(t),!0},Qg=(e,t,n,r)=>t===void 0?Bg(n)?Zg(e,n,r):e.onIncomplete?.(n)??!1:Bg(n)&&Yg(e)?e_(e,t,n,r):t.kind===`Predicate`?t_(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?__(e,t.expression,t.rest,t.scope,n,t.node):$g(e,t,n)&&Xg(e,t.rest,n,t.node),$g=(e,t,n)=>{let r=e.environment,i=Lg(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Lg(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Gv(t,r.runtime.version):t}})();try{return!gr(i,a)}catch(t){throw e.callStack&&cb(e.callStack,[i],t),t}},e_=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return __(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?$g(e,i,n):Jg(Lg(e,i.node,i.expression,zg(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Zg(e,n,r)},t_=(e,t,n,r,i,a)=>n_(e,t,n,r,i,Fg(e,a,t)),n_=(t,n,r,i,a,o)=>Pg(t,n,()=>{switch(n.kind){case`Let`:{let e=zg(t,i,a),s=n.definitions,c=t.coverage?$y(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):$y(s,e);return t_(t,n.body,r,c,a,o)}case`Label`:return t_(t,n.body,r,i,a,o);case`Selection`:return t_(t,n.expression,r,i,a,o);default:if(d_.has(n.kind))throw new e.x(`The state relation is not a boolean expression.`);return Pg(t,n,()=>h_(t,n,r,i,a,o))}}),r_=(e,t,n,r,i)=>Jg(t)&&Xg(e,n,r,i),i_=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),a_=(e,t,n,r,i,a)=>{let o=zg(e,r,i);if(t.kind===`Identifier`){let s=Kv(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return t_(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return t_(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:Iy(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&Yp(c,e.environment))?t_(e,l.body,n,l.scope,i,a):r_(e,Rg(e,a,t,o),n,i,a)}let s=Ly(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Ig(e,a,()=>Yy(s,t.args,o));return t_(e,s.body,n,r,i,a)}let c=i_.has(t.operator)?Lg(e,a,t,o):Rg(e,a,t,o);return r_(e,c,n,i,a)},o_=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Xg(e,t,Hg(n,r,i),a):gr(o,i)&&Xg(e,t,n,a)},s_=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),c_=(e,t,n)=>(e.coverage&&vo(e.coverage,t,n.length+1),n),l_=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?Kg(t.environment,s,i):qg(t.environment,s,i),u=zg(t,i,a);if(l===void 0)return Lg(t,o,n,u)===!0&&Xg(t,r,a,o);let d=Lg(t,o,c,u),f=a[l];if(n.operator===`=`)return o_(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 Lg(t,o,n,u)===!0&&Xg(t,r,a,o);if(!zr(p))throw new e.x(`The right side of \\IN is not enumerable.`);return c_(t,p,ei(p)).reduce((e,n)=>Xg(t,r,Hg(a,l,n),o)||e,!1)},u_=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),d_=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),f_={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},p_=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:f_[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${Q(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${Q(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${Q(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${Q(e)}`},m_=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Ig(e,r,()=>fy(t.bounds,t=>{let r=$(t,n),i=ly(r,t,a);return Array.isArray(i)&&c_(e,r,i),i}));return my(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},h_=(t,n,r,i,a,o)=>{let s=zg(t,i,a);switch(n.kind){case`Identifier`:return a_(t,n,r,i,a,o);case`Apply`:return u_.has(n.operator)&&n.args.length===2?l_(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?Jg(Lg(t,o,n.args[0],s))?t_(t,n.args[1],r,i,a,o):Xg(t,r,a,o):a_(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)=>s_(`Predicate`,t,i,o,e),r);return t_(t,e[0],n,i,a,o)}let s=e[e.length-1];return n_(t,Ug(n,e.length-1),s_(`Predicate`,s,i,o,r),i,a,Wg(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>t_(t,n,r,i,a,o)||e,!1);let s=n_(t,Ug(n,e.length-1),r,i,a,Wg(t,o)),c=t_(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:return m_(t,n,s,o).reduce((e,i)=>t_(t,n.body,r,i,a,o)||e,!1);case`Forall`:{let e=m_(t,n,s,o);if(e.length===0)return Xg(t,r,a,o);let i=e.slice(1).reduce((e,t)=>s_(`Predicate`,n.body,t,o,e),r);return t_(t,n.body,i,e[0],a,o)}case`If`:return t_(t,Jg(Lg(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>Jg(Lg(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 t_(t,c,r,i,a,o)}case`FunctionApplication`:{let e=by(Lg(t,o,n.function,t.isInit?s:Xv(s)));if(e){let i=Ig(t,o,()=>xy(e,n,s));return t_(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return __(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=t_(t,n.action,r,i,a,o);return __(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return t_(t,n.action,s_(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?p_(n):void 0;if(c!==void 0)throw new e.x(c);return r_(t,Lg(t,o,n,s),r,a,o)},g_=(e,t,n)=>e.runtime.warn(Xe.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${Q(n)}`),__=(e,t,n,r,i,a)=>Pg(e,t,()=>{let o=Fg(e,a,t),s=Kg(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)?(g_(e.environment,s,t),!1):o_(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Xg(e,n,i,o);let c=s.reduceRight((e,t)=>s_(`Unchanged`,t,r,o,e),n);return __(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Kv(r,t.name);if(a?.kind===`Thunk`)return __(e,a.expression,n,a.scope,i,o);let s=a?void 0:Iy(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return __(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=zg(e,r,i),s=Ly(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return __(e,s.body,n,Yy(s,t.args,a),i,o)}let c=e.environment,l=Lg(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Lg(e,o,t,{environment:c,scope:r,state:i,next:void 0});return gr(l,u)&&Xg(e,n,i,o)}),v_=(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}),y_=/* @__PURE__ */ Error(`The replay found a successor`),b_=(e,t,n,r)=>{let i=()=>{throw y_},a=r.coverage?.current??-1,o=v_(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=s_(`Changed`,e.subscript,t,a,void 0);t_(o,e.action,n,t,Vg(r),a)}else t_(o,e,void 0,t,Vg(r),a);return!1}catch(e){if(e!==y_)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},x_=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=v_(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>s_(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);t_(o,i.expression,s,i.scope,Vg(t),i.node??-1)},S_=(e,t,n,r)=>{if(e.some(e=>d_.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;C_(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},C_=(e,t,n,r,i,a)=>{let o=v_(r,`next`,n,i,a);t_(o,e.expression,void 0,e.scope,Vg(r),t)},w_=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Kg(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=Kv(r,e.name)?void 0:Iy(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,$y(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`Selection`:a(e.expression,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`){qg(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Kv(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Ly(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:Iy(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,Yy(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??[])},T_=/* @__PURE__ */ new WeakMap,E_=/* @__PURE__ */ new WeakMap,D_=(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},O_=(e,t,n)=>{let r=e.slice();return r[t]=n,r},k_=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,A_=(t,n)=>{let r=new e.x(n);return t.isInit?r:e.ot(r,e.rt.error)},j_=(e,t,n,r)=>{let i=Fv(n);return r&&d_.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 ${k_(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},M_=(e,t,n)=>{let r=Qo(t),i=Q(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 ${k_(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1788
|
-
`:``}${i}`},N_=(e,t,n)=>I_(e,t,$(t,n)),P_=new Set(dg.map(e=>e.name)),F_=e=>e.kind===`Apply`?P_.has(e.operator):e.kind!==`Identifier`&&!d_.has(e.kind),I_=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=j_(t,r,n,i);throw t.isInit&&i&&F_(n)?new e.B(a):A_(t,a)},L_=(e,t,n,r)=>r.environment.callStack?$(n,r):(e[t]??=hb(n,r.environment))(r),R_=e=>e===`=`||e===`\\in`||e===`\\subseteq`,z_=(e,t,n)=>{let r=n?T_:E_,i=r.get(e);if(i)return i;let a=yv(e,t,n),o=n?void 0:vv(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},B_=(e,t)=>{if(t.constants.has(e))return;let n=ry(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},V_=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return V_(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=B_(e.name,t);if(a&&!r.has(a))return r.add(a),V_(a.body,t,n,r)},H_=(e,t,n)=>V_(e,t,!n),U_=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return U_(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=$y(e.definitions,D_(r,t,n));return U_(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Kv(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return U_(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=B_(e.name,r.environment);if(s)return U_(s.body,void 0,n,r,i)},W_=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||A(e))||!t&&e.kind===`Prime`,G_=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>G_(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=B_(e.name,t);if(i)return n.add(e.name),G_(i.body,t,n)},K_=/* @__PURE__ */ new Set([`Label`,`Selection`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),q_=(e,t,n)=>K_.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||R_(e.operator)&&(W_(e.args[0],n)||H_(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,J_=/* @__PURE__ */ new Set,Y_=(e,t)=>{if(A(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return $d(e,(e,i)=>{let a=r?Y_(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},X_=(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:ry(r,t);return i&&!n.has(i)&&(n.add(i),X_(i.body,t,n))?!0:Be(e).some(e=>X_(e,t,n))},Z_=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=H_(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=G_(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return q_(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:z_(e,t,n)}},Q_=(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(nm(e,t)===void 0||X_(e,t,/* @__PURE__ */ new Set))return!0;let n=Y_(e,J_);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)}},$_=(e,t,n)=>{let r=e.map(e=>Z_(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Yg(t);for(let s=e;s<r.length;s++){if(s>0&&f&&xv(u)){d??=D_(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){g_(t.environment,o.index,o.expression);return}let s=n.expression,c=L_(a,e,s,d);if(!I_(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=D_(t,n,u);let r=L_(i,s,e.expression,d);if(!I_(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=D_(t,n,u);let r=L_(i,s,e.value,d),a=u[e.index];if(a===void 0)u=O_(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])){g_(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)},ev=e=>{let t=p_(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw A_(n,t);N_(n,e,D_(n,r,i))&&s(i,a)}},tv=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=D_(r,i,a);if(a[l]!==void 0){N_(r,e,u)&&c(a,o);return}let d=$(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 ${k_(r)}, the right side of \\IN is not enumerable.`;throw A_(r,`${t}\n${Q(e)}`)}let p=ei(f);if(r.generator){for(let e of hh(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(O_(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(O_(a,l,p[e]),o)}},nv=/* @__PURE__ */ new WeakMap,rv=e=>{let t=nv.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(rv),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return nv.set(e,n),n},iv=(e,t)=>{let n=e.args[0],r=ev(e),i=(e,r,i)=>U_(n,r,i,e,!t)??-1,a=tv(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=$(e.args[1],D_(t,n,o));l(O_(o,u,d),s)}},av=(e,t,n)=>{let r=Q(e);return(i,a,o,s,c,l)=>{let u=D_(i,a,o),d=$(e.function,n?u:Xv(u)),f=by(d);if(f!==void 0){z_(f.body,t,n)(i,xy(f,e,u),o,s,c,l);return}if(!It(d))throw A_(i,`In computing ${k_(i)}, a non-function (${Qo(d)}) was applied as a function.\n${r}`);let p=$(e,u);if(typeof p!=`boolean`)throw A_(i,`In computing ${k_(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},ov=(e,t)=>{let n=rv(e);return G_(e,t)?$_([n],t,!1):e.kind===`Tuple`?z_(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Kv(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){z_(rv(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=D_(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Ly(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){z_(rv(n.body),t,!1)(r,Yy(n,e.args,u),a,o,s,c);return}}N_(r,n,u)&&c(a,o)}},sv=(e,t,n)=>{let r=e.operator,i=ev(e),a=A(e)?void 0:Iy(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=bb(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=z_(a.body,t,n),o(e,i(D_(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=D_(a,o,s),f=Ly(e,d);f?.kind===`Closure`?z_(f.body,t,n)(a,Yy(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},cv=(e,t,n)=>{let r=ev(e),i=A(e)?void 0:B_(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Kv(s,e.name);f?.kind===`Thunk`&&!f.isReleased?z_(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&jy(i,t)!==void 0?r(o,s,c,l,u,d):(a??=z_(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},lv=(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=V_(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},uv=e=>e.kind===`And`?e.operands.flatMap(uv):[e],dv=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&q_(e,t,!1),fv=e=>{let t=[];return(n,r,i)=>{let a=D_(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!I_(n,i,L_(t,r,i,a)))return}}},pv=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=uv(e),r=n.findIndex(e=>!dv(e,t)||lv(e,t)),i=r===-1?void 0:lv(n[r],t);return i?{...i,before:r===0?void 0:fv(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>pv(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=Iy(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=pv(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&&bb(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(D_(e,t,n)),n))}},mv=(e,t,n)=>{let r=Kv(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},hv=(e,t,n)=>{let r=e.map(e=>z_(e,t,n)),i=n?[]:e.map(e=>pv(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&&mv(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)}}},gv=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=ah(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},_v=(e,t)=>{let n=z_(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=D_(r,i,a),u=t.runtime.version,d=fy(e.bounds,e=>$(e,l)).map((n,r)=>hh(sy(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,Jv(i,l,e)))};f(d.length-1,i)}},vv=(e,t)=>{if(e.kind===`Exists`)return _v(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>z_(e,t,!1));return e.isBulleted?gv(n):n.reduce((e,t)=>gv([e,t]))},yv=(t,n,r)=>{let i=e=>z_(e,n,r);switch(t.kind){case`And`:return $_(t.operands,n,r);case`Or`:return hv(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=sy($(a.set,D_(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,qv(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Q_(t,n);if(o){let e=$_(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=D_(r,i,a),d=fy(t.bounds,e=>sy($(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=qv(n,o.names[t],e);if(t===d.length-1){let e=D_(r,i,a);if(!o.guards.every(t=>N_(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{hy(t.bounds,D_(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&nm(t,n)!==void 0&&!X_(t.body,n,/* @__PURE__ */ new Set)?Y_(t,J_):void 0;return(n,r,i,o,s,c)=>{let l=[];hy(t.bounds,D_(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Kv(r,e)?.kind===`Value`)){u.every(e=>N_(n,t.body,D_(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&xv(i)?u.slice(r).every(e=>N_(n,t.body,D_(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=$(t.condition,D_(r,i,a));if(typeof l!=`boolean`)throw A_(r,M_(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=D_(r,i,a),u=e.find(e=>{let t=$(e.condition,l);if(typeof t==`boolean`)return t;throw A_(r,`In computing ${k_(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Qo(t)}) was used as a guard condition of a CASE.\n${Fv(e.source)}`)})?.body??n;if(!u)throw A_(r,`In computing ${k_(r)}, TLC encountered a CASE with no conditions true.\n${Q(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=tb(t.definitions,n);return(n,i,a,o,s,c)=>e(n,$y(t.definitions,D_(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.x(`UNCHANGED appears in an initial predicate at ${Mv(t)}`)}:ov(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 N_(e,r,D_(e,t,i))}catch(t){throw e.isEnabled?Gv(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 hv([t.action,rv(t.subscript)],n,r);case`Label`:return i(t.body);case`Selection`:return i(t.expression);case`Identifier`:return cv(t,n,r);case`FunctionApplication`:return av(t,n,r);case`Apply`:{let e=t.args;if(R_(t.operator)){let i=H_(e[0],n,r);if(i!==void 0)return t.operator===`=`?$_([t],n,r):tv(t,()=>i);if(W_(e[0],r))return iv(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=$(e[0],D_(r,i,a));if(typeof l!=`boolean`){let e=Qo(l),n=Q(t);throw A_(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 sv(t,n,r)}default:return ev(t)}},bv=e=>e.variables.map(()=>void 0),xv=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Sv=(t,n)=>{let r=n.state;if(!r||!xv(r))throw new e.x(`ENABLED needs a complete state at ${Mv(t)}`);let i=n.environment;if(i.callStack||i.coverage&&i.coverage.current!==-1)return b_(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return z_(t,i,!1)(a,n.scope,bv(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Cv=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};z_(t,n,!0)(o,i,bv(n),void 0,!1,t=>{if(!o.isStopped){if(!xv(t)){if(a){o.isStopped=a([...t]);return}throw e.ot(new e.C([...t]),e.rt.error)}o.isStopped=r(t)}})},wv=(e,t,n)=>{let r=[];return Cv(e,t,e=>(r.push(e),!1),n),r},Tv=(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 z_(t,r,!1)(c,a,bv(r),void 0,!1,(t,n)=>{if(!c.isStopped){if(!xv(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},Ev=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return z_(e,n,!1)(i,r,bv(n),void 0,!1,e=>{xv(e)||i.successors++}),i.successors>0},Dv=(e,t,n,r)=>{let i=[];return Tv(e,t,n,e=>(i.push(e),!1),r),i},Ov=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),kv=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Av=e=>kv.has(e.kind)||e.kind===`Apply`&&Ov.has(e.operator),jv=(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}},Mv=e=>`line ${e.location.line}, column ${e.location.column}`,Q=t=>{let n=t.location.range;return n?e.Z(n):Mv(t)},Nv={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Pv=(t,n)=>new e.x(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${Q(n)}`),Fv=e=>e.kind===`Number`?e.text??String(e.value):Q(e),Iv=(t,n)=>new e.x(`A non-boolean expression (${Qo(n)}) was used as the condition of an IF.\n${Q(t)}`),Lv=(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${Fv(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${Q({...t,location:{...t.location,range:{...i,end:a}}})}`)},Rv=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${j(L(e))}\n${Q(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${Q(t)}`);let o=Nn(a);if(o===`tuple`)throw ki(n);return Li(a.kind===`LazyFunction`?I(a):a,n,o===`record`?r:i)}},zv=e=>e===`1.7.4`?(t,n)=>Ei(t,n,e):void 0,Bv=t=>n=>{if(!It(n))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${Qo(n)})\n${Q(t)}`);return zi(n)},Vv=(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${Q(t)}`);return n(r,i)},Hv=t=>e.ot(new e.x(`TLC can't handle real numbers.\n${t.text}`),e.rt.configParseError),Uv=t=>e.ot(new e.x(`TLC can't handle a number this big.\n${t.text??t.value}`),e.rt.error),Wv=(t,n)=>new e.z(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Q(n)}`,t),Gv=(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,Kv=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},qv=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Jv=(t,n,r)=>{if(n.kind===`Name`)return qv(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)=>qv(e,t,i[n]),t)},Yv=(t,n)=>{if(It(t))return t;throw new e.x(`A non-function (${Qo(t)}) was applied as a function.\n${Q(n)}`)},Xv=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Zv=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Qv=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Expected ${n} to be a boolean but found ${L(t)}`);return t},$v=(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${Q(n)}`);return t},ey=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to apply the operator ~ to a non-boolean\n(${Qo(t)})\n${Q(n)}`);return!t},ty=(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${Q(r)}`);return t===n},ny=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${Fv(n)}`);return t},ry=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),iy=(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.`},ay=(t,n,r)=>{if(!N(t)||gn(t)){let i=L(t),a=r===`1.7.4`?void 0:iy(t,i);throw new e.x(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Fv(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Fv(n)}\n${a}`)}},oy=(e,t,n)=>(ay(e,t,n),typeof e==`object`&&e.kind===`Interval`?Mr(e):Kr(e)??Qr(e)),sy=(e,t,n)=>n===`1.7.4`?(ay(e,t,n),Kr(e)??ei(e)):oy(e,t,n),cy=e=>{if(typeof e==`object`&&e.kind===`Interval`)return ci(e),e},ly=(e,t,n)=>cy(e)??sy(e,t,n),uy=(e,t,n)=>cy(e)??oy(e,t,n),dy=(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},fy=(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),[]),py=(e,t)=>fy(e,e=>ly($(e,t),e,t.environment.runtime.version)),my=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):dy(t[n],t=>i(n-1,Jv(a,e[n].pattern,t)));return i(e.length-1,n)},hy=(e,t,n)=>my(e,py(e,t),t.scope,n),gy=(e,t)=>{let n=fy(e,e=>$(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},_y=(e,t,n)=>{if(e.length===1)return Jv(t,e[0].pattern,n);let r=pi(n)??[];return e.reduce((e,t,n)=>Jv(e,t.pattern,r[n]),t)},vy=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,yy=e=>Object.assign(e.value,{lambda:e}),by=e=>vy(e)?e.lambda:void 0,xy=(t,n,r)=>{let i=t.value,a=n.args.map(e=>$(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${Q(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 _y(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${Q(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`?``:`
|
|
1789
|
-
`}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 _y(c,t.scope,o)},Sy=(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:Fv(t)}},Cy=(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}},wy=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Ty=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Ey=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Dy=(e,t)=>{let n=gy(e.bounds,t),r=wy(n,(n,r)=>$(e.body,Zv(t,_y(e.bounds,qv(void 0,e.name,r),n))),Cy(Sy(e.bounds,e.body),e.bounds,n),Ty(e.bounds));yy({value:r,bounds:e.bounds,body:e.body,scope:qv(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Dy(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?Pn(i):i},Oy=(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}},ky=(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=>Dy(t,e):hb(Ey(t),n):hb(t.body,n),Ay=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=ky(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Zv(e,void 0)):e=>a[i]??r(Zv(e,void 0));return t.definitionEvaluators.set(e,o),o},jy=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},My=(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)||!Xp(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(()=>Oy(t,ky(t,n)(a)));mr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.x)&&!e.nt(t))throw t}}),Ny=(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}},Py=(e,t)=>{let n=e.cache;if(n!==void 0&&Ny(t.state,e.state)&&Ny(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,()=>$(e.expression,Zv(t,e.scope))):$(e.expression,Zv(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},Fy=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Iy=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Iy(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Fy(r):t.builtins.get(e)},Ly=(e,t)=>A(e)?Ry(e.operator,t):Iy(e.operator,t.environment)??Ry(e.operator,t),Ry=(e,t)=>{let n=Kv(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Iy(e,t.environment)},zy=e=>e.kind===`Closure`?e.params.length:e.arity,By=(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:Ry(r,n);if(!i)throw new e.x(`Expected an operator argument at ${Mv(t)}`);return i},Vy=(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)=>qv(e,n.name,t[r]),e.scope);return $(e.body,Zv(n,r))},Hy=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:zy(e),call:n=>Vy(e,n,t)},Uy=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ry(e.name,t);return n!==void 0&&zy(n)>0},Wy=(e,t)=>e.map(e=>Uy(e,t)?Hy(By(e,t),t):$(e,t)),Gy=(t,n)=>new e.x(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),Ky=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),qy=(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 qy(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([])}},Jy=(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=Ky(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=A(e)?void 0:qy(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=Kv(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Ky(e,t)}}return t=>Ky(e,t)},Yy=(e,t,n,r)=>{if(t.length!==e.params.length)throw Gy(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:By(t[a],n)}:(r?.[a]??Jy(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Xy=(e,t,n,r)=>e.kind===`Closure`?$(e.body,Zv(n,Yy(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>$(e,n))):e.isLazy?e.evaluate(vb(t,n),n):e.evaluate(Wy(t,n),n),Zy=/* @__PURE__ */ new WeakMap,Qy=e=>{let t=Zy.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return Zy.set(e,n),n},$y=(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:Qy(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},eb=(t,n,r)=>{let i=Kv(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Py(i,r);if(i?.kind===`Operator`){if(zy(i.operator)===0)return Vy(i.operator,[],r);throw new e.x(`Operator ${t} is used without arguments`)}let a=qy(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw Wv(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Ay(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${Q(n)}`)},tb=(e,t)=>({impure:new Set(e.filter(e=>$p(e,t))),streamed:new Set(e.filter(e=>$p(e,t,`streamed`)))}),nb=e=>[...e.facts.ids.keys()].some(t=>$p(t,e)),rb=e=>[...e.facts.ids.keys()].some(t=>$p(t,e,`repeated`)),ib=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,ab=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),ob=e=>t=>{let n=e(t);return Vn(n,e(ab(t)))},sb=(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=ib(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Av(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=jv(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 cb(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}},cb=(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},lb=(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}},ub=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}}),db=(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 Lv(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},fb=(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)}},pb=(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}},mb=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Wb(e,t),i=t.callStack,a=i&&Wd.get(e),o=i?sb(e,r,t,i):r,s=i&&a?fb(e,a,o,i):o,c=t.coverage,l=c?pb(e,s,c):s;return t.evaluators.set(e,l),l},hb=(e,t)=>{if(t.callStack||t.coverage)return mb(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Os(e,t)??mb(e,t);return t.entryEvaluators.set(e,r),r},$=(e,t)=>hb(e,t.environment)(t),gb=(e,t)=>{let n=e.name,r=A(e)?void 0:qy(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Wv(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??=Ay(e,t))(r)}return t=>eb(n,e,t)},_b=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||A(e))return!0;let n=Iy(e.name,t);return n===void 0||zy(n)===0},vb=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>$(e,t),expression:e})),yb=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(vb(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&_b(t[0],n)){let e=mb(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&_b(t[0],n)&&_b(t[1],n);if(i&&a){let e=mb(t[0],n),r=mb(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Wy(t,n),n)},bb=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Gy(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Jy(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:By(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},xb=(e,t,n)=>{let r=bb(e,t,n),i;return t=>(i??=hb(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Sb=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=mb(r[0],n),i=mb(r[1],n);return n=>!$v(e(n),t,`P`)||$v(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=mb(r[0],n);return n=>ey(e(n),t)}if(t.operator===`<=>`){let e=mb(r[0],n),i=mb(r[1],n);return n=>ty(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw Pv(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=A(t)?void 0:Iy(t.operator,n);if(i?.kind===`Closure`)return xb(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=mb(r[0],n),i=Bv(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Ud.has(t)&&!rm(r[0],n),a=n.tlcEvalValues;return n=>{if(!e||n.scope!==void 0)return i.evaluate(vb(r,n),n);let o=a.get(t);if(o!==void 0)return o;let s=i.evaluate(vb(r,n),void 0);return a.set(t,s),s}}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2){let e=mb(r[0],n),a=mb(r[1],n),o=Vv(t,i.evaluateBinary);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return yb(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=>Jy(e,n));return i=>{let o=Ry(t.operator,i);if(o)return Xy(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 ${Mv(t)}`)}},Cb=(e,t)=>{let n=e.kind===`Forall`,r=mb(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=mb(i.set,t);return s=>dy(ly(o(s),i.set,t.runtime.version),t=>ny(r(Zv(s,qv(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=fy(a,e=>ly(mb(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?ny(r(Zv(o,a)),e)!==n:dy(s[t],e=>c(t-1,qv(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>hy(a,t,i=>ny(r(Zv(t,i)),e)!==n)?!n:n},wb=(e,t)=>{if(e.kind===`Tuple`)return Ir(e.names.map(e=>{let n=Kv(t,e);return n?.kind===`Value`&&n.value}));let n=Kv(t,e.name);return n?.kind===`Value`?n.value:void 0},Tb=/* @__PURE__ */ new WeakSet,Eb=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Tb.add(e)},Db=/* @__PURE__ */ new WeakMap,Ob=e=>{if(Db.has(e))return Db.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 Db.set(e,r),r},kb=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Kv(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Ab=e=>Tb.has(e),jb=(t,n)=>{let r=Ab(t),i=mb(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(Zv(t,qv(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=fy(a,(n,r)=>uy(a.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return my(a,r,t.scope,e=>{let r=a.length===1?wb(o.pattern,e)??!1:Ir(a.map(t=>wb(t.pattern,e)??!1));return n.push([r,i(Zv(t,e))]),!1}),Tr(n)},l=Sy(a,t.body),u=Ty(a),d=Ob(t.body),f=(e,n)=>{let r=kb(n.scope,d),o=Zv(n,r),s=yy({value:wy(e,e=>i(Zv(o,_y(a,r,e))),Cy(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 lb(p,t,e),e}},createLazy:f}},Mb=(e,t)=>{let n=jb(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=mb(r[0].set,t);return t=>n(e(t),t)}return e=>n(gy(r,e),e)},Nb=(e,t)=>{let n=Tb.has(e);n&&Eb(e.function);let r=mb(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=>mb(e,t))}),value:mb(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(Zv(i,qv(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${Q(e.function)}`)}return n}},Pb=(t,n)=>{let r=mb(t.predicate,n),i=t.bound.pattern,a=Fv(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(Zv(r,Jv(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},mb(t.predicate,e),-1)});return(e,t,n=-1)=>l(e,t,r,n)},Fb=e=>A(e)||e.kind===`OperatorReference`||Be(e).some(Fb),Ib=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!Fb(e.predicate)&&!Qp([e.predicate],t,`varying`),Lb=(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${Fv(n.predicate)}`);return t},Rb=(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${Q(n)}`);return hr(t),uy(t,r,i)},zb=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${Q(t)}`),Bb=(t,n)=>{if(t.kind===`SetFilter`){let e=mb(t.predicate,n),r=mb(t.bound.set,n),i=Pb(t,n),a=t.bound.pattern,o=n.coverage,s=Ib(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(Zv(n,Jv(n.scope,a,i)));if(Lb(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=mb(t.expression,n);return n=>{let r=[];return hy(t.bounds,n,t=>(Mt(r,e(Zv(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${Q(t)}`)};let i=mb(t.body,n),a=mb(r,n);return n=>{let o=Rb(a(n),t,r,n.environment.runtime.version),s,c=t.pattern;if(dy(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${Q(t)}`);let a=Jv(n.scope,c,r);return ny(i(Zv(n,a)),t)?(s=wb(c,a),!0):!1}),s===void 0)throw zb(t);return s}},Vb=e=>[...e].sort((e,t)=>Cn(e.name,t.name)),Hb=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Ub=(e,t)=>{let n=Vb(e),r=e.map(e=>mb(e.value,t));if(Hb(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)))},Wb=(t,n)=>{let r=e=>mb(e,n);switch(t.kind){case`Number`:{let e=t.value;return Bt(e)?()=>e:()=>{throw Uv(t)}}case`Decimal`:return()=>{throw Hv(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return gb(t,n);case`Apply`:return Sb(t,n);case`Bracket`:return()=>{throw new e.x(`A bracket without a function or subscript is not an expression at ${Mv(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.x(`An operator cannot be used as a value at ${Mv(t)}`)};case`And`:{let e=t.operands.map(r);return db(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw Lv(t,r,i);if(!i)return!1}return!0})}case`Or`:{let e=t.operands.map(r);return db(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw Lv(t,r,i);if(i)return!0}return!1})}case`Prime`:{let e=r(t.expression);return t=>e(ab(t))}case`Unchanged`:return ob(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 Iv(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. ${Fv(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${Q(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(Zv(n,$y(t.definitions,n)))}case`Forall`:case`Exists`:return Cb(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?Pv(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${Q(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Bb(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 Mb(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 Ub(t.fields,n);case`RecordSet`:{let e=Vb(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 Nb(t,n);case`ExceptAt`:return n=>{let r=Kv(n.scope,`@`);if(r?.kind!==`Value`)throw new e.x(`@ appears outside an EXCEPT at ${Mv(t)}`);return r.value};case`FunctionApplication`:{Eb(t.function);let e=r(t.function),i=n=>Yv(e(Xv(n)),t),a=t.args.map(r),o=zv(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=Rv(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=ob(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${Q(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>Sv(e,t)}case`Label`:return r(t.body);case`Selection`:return r(t.expression);case`Subexpression`:return()=>{throw new e.x(`The subexpression reference at ${Mv(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Pv(Nv[t.kind],t)}}},Gb=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Kb=(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]=Gb(n)||1,t[1]=Gb(r)},qb=()=>{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)}}},Jb=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),Yb=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Hi(t,Zi(e[n]));return t&1073741823},Xb=(e,t)=>{for(let n=0;n<t.length;n++)if(!Un(e[n],t[n]))return!1;return!0},Zb=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,Qb=(e,t,n)=>{let r=e.slots.length-1;for(let i=Zb(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&Xb(e.states[r-1],n))return r-1}},$b=(e,t,n)=>{let r=e.slots.length-1,i=Zb(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},ex=(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&&$b(e,t[n],t[n+1])}$b(e,t,n+1)},tx=(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}},nx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),rx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return tx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},ix=e=>Atomics.load(e.used,0)*2>=e.slots.length,ax=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&tx(t,n);return{slots:t,used:e.used}},ox={kind:`Boolean`,value:!0},sx={kind:`Boolean`,value:!1},cx=e=>e?ox:sx,lx=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,ux=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,dx=(e,t)=>({kind:e,body:t}),fx=(e,t,n)=>({kind:e,operands:[t,n]}),px=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?px(e,t.operands).operands:[t])}),mx=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return mx(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,mx(t)),0)}},hx=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 hx(e.body);case`And`:case`Or`:return e.operands.some(hx)}},gx=/* @__PURE__ */ new WeakMap;let _x=0;const vx=e=>{let t=gx.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${_x++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(vx).join(`,`)})`;default:return`${e.kind}(${vx(e.body)})`}})();return gx.set(e,n),n},yx=(e,t)=>e===t||vx(e)===vx(t),bx=(e,t)=>{let n=vx(t);return e.some(e=>e===t||vx(e)===n)},xx=e=>e===`And`?`Or`:`And`,Sx=(e,t)=>{switch(e.kind){case`Boolean`:return t?cx(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?dx(`Not`,e):e;case`Not`:return Sx(e.body,!t);case`And`:case`Or`:return px(t?xx(e.kind):e.kind,e.operands.map(e=>Sx(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return dx(n,Sx(e.body,t))}}},Cx=e=>{switch(e.kind){case`Boolean`:return cx(!e.value);case`Not`:return e.body;case`And`:case`Or`:return px(xx(e.kind),e.operands.map(Cx));case`Always`:return dx(`Eventually`,Cx(e.body));case`Eventually`:return dx(`Always`,Cx(e.body));default:return dx(`Not`,e)}},wx=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=wx(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return cx(t)}return n.length===0?cx(!t):n.length===1?n[0]:px(e.kind,n)}case`Not`:{let t=wx(e.body);return t.kind===`Boolean`?cx(!t.value):dx(`Not`,t)}case`Always`:case`Eventually`:{let t=wx(e.body);return dx(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Tx=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Ex=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=Ex(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=>px(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=Ex(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=Tx(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:px(`Or`,e);n.push(dx(`Always`,dx(`Eventually`,t)))}return px(`Or`,n)}case`Not`:return lx(t.body)?t:Ex(Cx(t.body));default:return t}},Dx=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Dx(e.operands[0]):px(e.kind,e.operands.map(Dx));case`Not`:return e.body.kind===`Not`?Dx(e.body.body):dx(`Not`,Dx(e.body));case`Always`:case`Eventually`:case`Next`:return dx(e.kind,Dx(e.body));default:return e}},Ox=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Ox(e.operands[0]);let t=Math.floor(e.operands.length/2);return fx(e.kind,Ox(px(e.kind,e.operands.slice(0,t))),Ox(px(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return dx(e.kind,Ox(e.body));default:return e}},kx=(e,t)=>{e.kind===`Eventually`&&!bx(t,e)&&t.push(e),`body`in e&&kx(e.body,t),`operands`in e&&e.operands.forEach(e=>kx(e,t))},Ax=e=>{let t=e.filter(ux),n=e.flatMap(e=>e.kind===`Not`&&ux(e.body)?[e.body]:[]);return!t.some(e=>bx(n,e))},jx=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,dx(`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},Mx=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:dx(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Nx=(e,t,n)=>e.flatMap(e=>{let r=Mx(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Px=e=>[...new Set(e.map(vx))].sort().join(`|`),Fx=(e,t)=>{let n=new Set(t.map(Px));return[...e.filter(e=>!n.has(Px(e))),...t]},Ix=e=>{let t=jx(e),n=Nx(t,`Always`,`And`),r=Nx(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Mx(t,`Eventually`,`Or`);if(n&&!(bx(e,n.first)||bx(e,n.second)))return Fx(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(bx(e,t.first)||bx(e,t.second))&&!bx(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Ax(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Mx(t[e],`Always`,`And`);n&&(bx(t,n.first)||t.push(n.first),bx(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)bx(t,e.first)&&bx(t,e.second)&&!bx(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!Ax(t)?[]:i(t)};return a(e)},Lx=e=>({particle:e,successors:[],statePredicates:e.filter(e=>mx(e)<=1)}),Rx=e=>{let t=Ix([e]).map(Lx),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Px(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 Ix(n)){let n=Px(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Lx(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},zx=(e,t)=>!bx(e,t)||bx(e,t.body),Bx=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&mx(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=Tx(t);if(r){let e=mx(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(hx(t))throw new e.x(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},Vx=(e,t)=>{let n=e.findIndex(e=>yx(e,t));return n===-1?(e.push(t),e.length-1):n},Hx=e=>{let t=Ex(wx(Sx(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Dx(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Bx(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:px(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:yx(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Ox(e.formula),n=[];t&&kx(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Vx(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Vx(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Vx(i,e))}));return{tableau:t&&Rx(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Ux=()=>e.ot(new e.x(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.rt.livenessEvaluationFailure),Wx=/* @__PURE__ */ new Set([`~>`,`-+->`]),Gx=/* @__PURE__ */ new WeakSet,Kx=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),qx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Jx=(t,n)=>new e.x(`TLC cannot handle the temporal formula ${Q(t)}${n===void 0?``:`:\n${n}`}`),Yx=(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=Yx(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Kv(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=ry(e,n);if(t)return em(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 Qd(e,(e,o)=>(a=Math.max(a,Yx(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(Wx.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:Iy(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Yy(o,e.args,qx(n,t)))}default:return l(e)}},Xx=(t,n)=>{try{return py(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)}},Zx=(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)=>Zx(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,Q(e)));if(t.kind===`Label`)return o(t.body,n);if(t.kind===`Selection`)return o(t.expression,n);if(t.kind===`Let`)return o(t.body,Qx(t,n,r));if(t.kind===`Identifier`){let i=A(t)?Kv(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return o(i.expression,i.scope,Gx.has(i)?t.name:a.name);let s=r.constants.has(t.name)?void 0:ry(t.name,r);if(!i&&s?.kind===`Operator`&&s.params.length===0&&(em(s,r)>0||jy(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=qx(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||Yx(t,n,r)===3)){let e=Ly(t,s),n=A(t)?void 0:ry(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,Yy(e,t.args,s),a.isSubstituted&&n?n.name:t.operator,a.expanding,n)}let c=i&&t.kind===`Forall`&&t.bounds.every(e=>Yx(e.set,n,r)===0),l=c?Xx(t.bounds,s):void 0;if(c&&l){let e=[];if(my(t.bounds,l,n,n=>(e.push(...o(t.body,n,Q(t.body))),!1)),e.length===0)throw Ux();return e}return[{expression:t,scope:n,name:a.name,path:a.path}]},Qx=(e,t,n)=>{let r=$y(e.definitions,qx(n,t),tb(e.definitions,n));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Gx.add(e.binding);return r},$x=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?Yx(t,n,r):a;if(o===0){let i=$(t,qx(r,n));if(typeof i!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${Fv(t)}`);return cx(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=mx(c),u=l===0&&Yx(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=qx(r,t),o=A(e)||ry(n,r)===void 0?Kv(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&Gx.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:A(e)?Ry(n,a):Iy(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?Kx.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,px(f,n))}if(c?.kind!==`Closure`)throw Jx(e);let m=!A(e)&&ry(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>$(e,a)),s(c.body,Yy(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:Jx(t)}},u=(t,n)=>{let i=Yx(t,n,r),o=[],s=t.kind===`Forall`;try{hy(t.bounds,qx(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 Jx(t,s&&!ot(r)?r.message:void 0)}return o.length===0?cx(s):d(t,n,px(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=mx(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,px(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,px(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let n=Yx(e,t,r);switch(e.kind){case`Label`:return p(e.body,t);case`Selection`:return p(e.expression,t);case`Let`:return p(e.body,Qx(e,t,r));case`Apply`:{let n=e.args;if(e.operator===`~`&&!A(e))return d(e,t,dx(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,fx(`Or`,dx(`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&&Yx(e.condition,t,r)===0){let n=$(e.condition,qx(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,fx(`Or`,fx(`And`,n,p(e.consequent,t)),fx(`And`,dx(`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===`~>`?dx(`Always`,fx(`Or`,dx(`Not`,p(e.args[0],t)),dx(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return dx(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=dx(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?dx(`Always`,dx(`Eventually`,fx(`Or`,i,a))):fx(`Or`,dx(`Eventually`,dx(`Always`,i)),dx(`Always`,dx(`Eventually`,a)))}default:throw Jx(e)}};return p(t,n)},eS=t=>({holdsState:(n,r)=>{let i={environment:t,scope:n.scope,state:r,next:void 0},a=n.kind===`State`?$(n.expression,i):Sv(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($(o,{environment:t,scope:a,state:r,next:void 0}),$(o,{environment:t,scope:a,state:i,next:void 0})))return!1;let s=$(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}}),tS=(t,n,r,i,a)=>{let o=e=>tS(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 tS(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`)}},nS=(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)=>nS(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 tS(e,t[r],t[a(r)],eS(i),/* @__PURE__ */ new Map)}},rS=`UnnamedAction`,iS={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},aS=e=>{let t=e.range??iS;return Lr([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},oS=(e,t)=>{let n=[[`name`,e.name],[`location`,aS(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)},sS=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),cS=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),lS=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,uS=e=>e.kind===`Apply`?e.args:[],dS=(e,t,n)=>{let r=lS(e);if(r===void 0)return;if(A(e)){let e=Kv(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=Iy(r,n);return i?.kind===`Closure`?i:void 0},fS=(t,n)=>{try{return $(t,cS(n,void 0)),!0}catch(t){if(t instanceof e.b)return!1;throw t}},pS=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&Xp(e,t)&&fS(e.body,t),mS=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&pS(e,t),hS=(e,t)=>{let n=ry(e.name,t);return n?.body===e.body&&mS(n,t)},gS=(e,t)=>{if(e.kind!==`Identifier`||!A(e))return;let n=Kv(t,e.name);return n?.kind===`Thunk`?n:void 0},_S=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:Qx(e,t,n)};let r=gS(e,t);return r&&{expression:r.expression,scope:r.scope}},vS=(e,t,n,r)=>t.kind===`Apply`?Yy(e,t.args,cS(r,n)):e.scope,yS=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Kv(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),bS=(t,n)=>{try{return t()}catch(t){if(t instanceof e.b)return n();throw t}},xS=(e,t,n,r,i)=>{let a=uS(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=>Yx(e,n,i)!==0)?o():bS(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),$(e,cS(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},SS=(t,n,r,i,a)=>{let o=()=>({name:r?.name??rS,location:t.location,parameters:yS(r,n),expression:t,scope:n});if(d_.has(t.kind))throw e.ot(new e.x(`${e.K}The next state relation is not a boolean expression.\n${Fv(t)}`),e.rt.error);switch(t.kind){case`Let`:return SS(t.body,Qx(t,n,i),r,i,a);case`Label`:return SS(t.body,n,r,i,a);case`Selection`:return SS(t.expression,n,r,i,a);case`Or`:return t.operands.flatMap(e=>SS(e,n,r,i,a));case`Exists`:return bS(()=>{let e=[];return hy(t.bounds,cS(i,n),n=>(e.push(...SS(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=A(t)?void 0:a.get(lS(t)??``),c=dS(t,n,i);if(s)return xS(s,t,n,c,i);if(!c)return[o()];let l=uS(t),u=A(t)?c.name:i.instanceNames.get(lS(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return hS(c,i)||l.some(e=>Yx(e,n,i)!==0)?d():bS(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:$(t,cS(i,n))},parent:e}),c.scope);return SS(c.body,e,{...c,name:u},i,a)},d)},CS=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>CS(e,t,n,r,i,o),s=(e,t,n)=>sS(e,Gd(t,a),n),c=_S(e,t,n);if(c){o(c.expression,c.scope);return}let l=dS(e,t,n);if(l&&hS(l,n))return;let u=l?[...a,...Wd.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Yx(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,Yy(l,e.args,cS(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(rS,e,t));return}let d=Yx(e,t,n);d<=1?r.inits.push(s(rS,e,t)):d===3&&r.temporals.push(s(rS,e,t))},wS=(e,t,n,r,i)=>{let a=(t,n)=>wS(e,t,n,r,i),o=_S(t,n,r);if(o){a(o.expression,o.scope);return}let s=dS(t,n,r);if(s&&hS(s,r))return;if(s&&s.params.length===uS(t).length){a(s.body,vS(s,t,n,r));return}if(t.kind===`Forall`&&bS(()=>(hy(t.bounds,cS(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(sS(e,a)):Yx(a,n,r)<2?i.invariants.push(sS(e,a)):i.impliedTemporals.push(sS(e,t));return}let c=Yx(t,n,r);c<=1?i.impliedInits.push(sS(e,t)):c===3&&i.impliedTemporals.push(sS(e,t))},TS=(e,t)=>{let n=ry(e,t);return n?.kind===`Operator`&&!mS(n,t)?n:void 0},ES=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:TS(e.specification,t);a&&(CS(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:rS,location:e.frames[0].location,parameters:[],expression:Gd(e.expression,e.frames),scope:e.scope}]:SS(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Iy(e.init,t);o?.kind===`Closure`&&r.inits.push(sS(e.init??``,o.body));let s=e.next===void 0?void 0:Iy(e.next,t);return s?.kind===`Closure`&&r.actions.push(...SS(s.body,s.scope,s,t,n)),r},DS=(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);if(e.kind===`Selection`)return i(e.expression,t);let a=_S(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&A(e)?Kv(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=dS(e,t,n);if(!s||s.params.length!==uS(e).length)return!0;let c=ry(s.name,n);return c?.body===s.body&&pS(c,n)?!0:i(s.body,vS(s,e,t,n))};return i(e,t)?r:void 0},OS=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,kS=(t,n,r=!1)=>`${t.name===rS?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:OS(t)} ${e.Z(t.location.range??iS)}`,AS=e=>`${e.name}${OS(e)}`,jS=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=TS(e,n);t&&i.invariants.push(sS(e,t.body))}),t.properties.forEach(e=>{let t=TS(e,n);t&&wS(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 oS(e,n&&Lr(n))})),s=e=>yr(e.flatMap(e=>{let t=TS(e,n);return t?[Lr([[`name`,t.name],[`location`,aS(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`,aS(r[t])],...a?[[`coverage`,Lr([[`distinct`,xo(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},MS=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return MS(e.body);case`And`:case`Or`:return e.operands.some(MS);default:return!1}},NS=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,PS=e=>e.promises.some(e=>MS(e.body))||e.models.some(e=>!NS(e)),FS=(e,t)=>e.every((e,n)=>Un(e,t[n])),IS=e=>e.filter((t,n)=>n===0||e[n-1]!==t),LS=e=>({data:e(1024),length:0,create:e}),RS=(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)},zS=(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}},BS=e=>new Int32Array(e).fill(-1),VS=(e,t)=>(e.edgeStarts[t]??-1)!==-1,HS=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},US=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,WS=(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),GS=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},KS=2**53-1,qS=(e,t,n)=>{let r=t.map(e=>$x(e.expression,e.scope,n)),i=e.map(e=>dx(`Not`,$x(e.expression,e.scope,n))),a=i.length===1?i[0]:px(`Or`,i);return{formula:r.length===0?a:px(`And`,[...r,a]),negations:i}},JS=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}]:[])}},YS=(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=>YS(e,t));return;default:YS(e.body,t)}},XS=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>YS(e,t));return[...t]},ZS=e=>XS(e).flatMap(e=>JS(e).map(e=>e.expression)),QS=(e,t,n)=>{if(e.length===0)return;let r=qS(e,t,n),i=/* @__PURE__ */ new Set;YS(r.formula,i);let a=[...i].flatMap(JS),o=a.every(e=>e.scope===void 0)?!Qp(a.map(e=>e.expression),n,`repeated`):!rb(n);return{solutions:Hx(r.formula),createChecker:(t,i)=>{let a={environment:n,atoms:eS(n)},s=eC(i,{atoms:{holdsState:(e,t)=>a.atoms.holdsState(e,t),holdsAction:(e,t,n)=>a.atoms.holdsAction(e,t,n)},isShared:o,isSame:FS,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=eS(e);try{return t()}finally{a.atoms=eS(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)=>!nS(r.negations[a].body,t,i,0,n)).map(e=>e.name))]}}}},$S=(e,t,n,r)=>{let i=QS(e,t,n);return i?.createChecker(r,i.solutions)},eC=(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=vx(e),n=a.get(t)??a.size;return a.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:LS(e=>new Int32Array(e)),edgeActions:LS(e=>new Uint8Array(e)),stateResults:LS(e=>new Uint8Array(e)),initial:[],firstNodes:LS(BS),lastNodes:LS(BS),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=zS(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),zS(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],zS(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?RS(e.firstNodes,t,[r]):e.nextSiblings[a]=r,RS(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,WS(e,t,n))),ie=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;RS(e.edgeTargets,o,n),i.forEach((t,n)=>RS(e.edgeActions,(o+n)*s,r,t*s,s)),RS(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(NS)){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 GS(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:le(e,e.errorNode)},ce=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)WS(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{VS(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),VS(e,i)||e.stateCount++,ie(e,i,a,n,o,r)},T=(t,n)=>{if(t.initial.includes(n))return[n];let r=/* @__PURE__ */ new Map,i=[];for(let e of t.initial)VS(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 HS(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}VS(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}`)},le=(e,t)=>IS(T(e,t).reverse().map(t=>e.nodeStates[t])),ue=(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=>VS(t,e)),l=[],u=e=>{let n=HS(t,e).indexOf(e);return n!==-1&&o(e,n)},d=(e,n)=>r.tableau!==void 0&&zx(r.tableau.nodes[t.nodeTableaux[e]].particle,n),f=e=>{let i=l.pop()??e;if(i===e&&!u(i)){s[i]=KS;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]=KS,n===e)break}let m=n.infinitelyOftenStates.every(e=>[...c].some(n=>US(t,n,e))),h=n.infinitelyOftenActions.every(e=>[...c].some(n=>HS(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=le(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]&&US(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(HS(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=HS(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:PS(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 HS(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++;HS(t,a).forEach((e,r)=>{VS(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?GS(r,t).some(e=>r.edgeCounts[e]>0):o.every(e=>VS(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=ue(e,t);if(n)return n}}}},tC=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(tC)})}},nC=t=>{try{return tC(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)}},rC=(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}},iC=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.`),aC=(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=nC(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(tC),tC(t.value)]),p.set(n,r)}),p.forEach(e=>c(e).forEach(t=>f(t,rC(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 iC(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 iC(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=yf(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}},oC=`tlc2/value/impl/`,sC={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},cC={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},lC=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)}},uC=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),dC=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],fC=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??uC.get(e[3])}${`[]`.repeat(e[1].length)}`),pC=(e,t)=>e[e[t].first].text,mC=(e,t)=>pC(e,t).replaceAll(`/`,`.`),hC=t=>{let n=lC(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===sC.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===sC.integer?i.value=n.readInt32():t===sC.float?n.readUint32():t===sC.long||t===sC.double?(n.readBytes(8),e++):t===sC.class||t===sC.string||t===sC.methodType||t===sC.module||t===sC.package?i.first=n.readUint16():t===sC.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=mC(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=fC(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:lC(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()},()=>mC(r,d.readUint16())):[],p=dC.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=fC(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}},gC=(e,t)=>{let n=e[t],r=e[n.second];return{className:pC(e,n.first),name:e[r.first].text}},_C=(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===sC.integer)return t.value;if(t.tag===sC.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>=cC.iconstM1&&t<=cC.iconst5)s.push(t-cC.iconst0),e+=1;else if(t===cC.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===cC.sipush)s.push(r()<<16>>16),e+=3;else if(t===cC.ldc)s.push(l(o[e+1])),e+=2;else if(t===cC.ldcW)s.push(l(r())),e+=3;else if(t===cC.dup){let t=c();s.push(t,t),e+=1}else if(t===cC.getstatic){let t=gC(n,r());if(t.className!==`${oC}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===cC.invokestatic){let t=gC(n,r()),o=c();if(t.className!==`${oC}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===cC.new)s.push({className:pC(n,r()),value:void 0}),e+=3;else if(t===cC.invokespecial){let t=gC(n,r()),o=c(),s=c();if(!(t.className===`${oC}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===cC.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()},vC=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=hC(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:_C(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)}))}},yC=/* @__PURE__ */ new WeakMap,bC=/* @__PURE__ */ new WeakMap,xC=(e,t)=>{let n=Zd(e,t),r=yC.get(e);return r!==void 0&&yC.set(n,r),n},SC=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&yC.set(n,e.arity)}),CC=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`:`}},wC=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),TC=(t,n)=>new e.I(`${t} at line ${n.line}, column ${n.column}`),EC=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return EC(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`&&e.kind!==`Selection`)for(let r of Be(e).slice(0,bC.get(e))){let e=EC(r,t,n);if(e)return e}},DC=e=>({line:e.line,column:e.column}),OC=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:DC(n)}),e),kC=(e,t)=>{let n=e.location;if(e.params.length===0)return t;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw TC(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:t,location:n}}if(e.args.length!==e.params.length)throw TC(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:$l,params:e.params,body:t,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:$l,args:e.args,location:n,resolution:Ql},location:DC(n)}},AC=(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:Ql})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ql}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ql};return kC({...t,params:[...t.params,...r]},OC(a,t.lets,n))},jC=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c=-1,l,u,d=!1,f=0,p=[],m=[],h,g=(t,n)=>{!h&&t&&(h={location:e.Z(t),message:n})},_=(t,n,i=!1)=>{let a=r.selectorRanges?.[s];t&&a&&p.push({node:t,error:{location:e.Z(a),message:n},isEmpty:i})},v=(t,n)=>{if(!t)throw TC(n,a);tu.set(r,{applications:m,nulls:p,error:{location:e.Z(t),message:n}}),bC.set(r,f),d=!0},y=e=>{let r=[],i=[];for(;s<t.length;){let o=t[s];if(o.kind!==`Name`&&!e)return;if(o.kind!==`Name`)throw TC(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Yd(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw TC(`Unknown operator ${r.join(`!`)}`,a)},b=e=>{let n=y(e);if(!n){d=!0;return}let u=n.definition,p=yC.get(u)??hu(u),h=s===t.length-1;if(n.args.length!==p){let e=r.argumentRanges?.[s]??a.range,t=`The operator ${Ms(n.name)} requires ${p-n.earlier} arguments.`;if(!i||n.args.length!==0)return f+=n.earlier,v(e,t);g(e,t)}if(f+=n.args.length,n.args.forEach((e,t)=>iu.set(e,{operator:n.name,index:t,range:r.selectorRanges?.[s]})),h)return{definition:u,args:n.args};let _=u.location.range,b=yC.has(u)&&_?.module===a.range?.module&&pu(a,u.location);if(m.push({operator:n.name,range:r.selectorRanges?.[s],args:n.args,params:b?Array(p).fill(0):gu(u)}),u.isRecursive&&_&&_.module===a.range?.module&&pu(a,_.end))return v(r.selectorRanges?.[s],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(u.kind!==`Operator`)throw TC(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),l=u.body,c=s,s++},ee=()=>{for(;s<t.length&&!d;){let e=t[s];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=l&&EC(l,e.name,[]);if(!a)return v(n,`Cannot find label \`${e.name}'.`);let c=a.label.params;if(e.args.length!==c.length){let t=`Label \`${e.name}' used with wrong number of arguments.`;if(!i)return v(n,t);g(n,t)}f+=e.args.length,o.lets.push(...a.lets),o.params.push(...c.map(e=>({name:e,arity:0}))),o.args.push(...e.args),m.push(wC(e.name,n,e.args)),l=a.label.body,s++}},te=e=>{if(!l)throw TC(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;let n=r.selectorRanges?.[s],i=`Choosing operand \`${CC(e)}' of subexpression with no operands.`;if(tu.has(l)){v(n,i);return}if(eu.has(l)&&l.kind!==`Lambda`&&l!==u&&(_(l,i,!0),u=l,l=l.kind===`Let`&&l.body.kind===`Apply`&&l.body.operator===`$subexpression`?l.body:l.kind===`Selection`?l:{kind:`Tuple`,elements:[l],location:l.location}),l.kind===`Label`){l=l.body,te(e);return}let c=`Nonexistent operand specified by \`${CC(e)}'.`;if(l.kind===`Let`){if(e.kind!==`Operand`||Vu(e.operand,1)!==0){v(n,`A LET/IN expression has only one operand.`);return}o.lets.push(l.definitions),l=l.body;return}let d=Gu(l);if(d&&(e.kind===`Bound`||e.kind===`At`)){if(e.kind===`Bound`&&e.args.length!==d.names.length){v(n,`Selector with ${e.args.length} argument(s) used for quantifier with ${d.names.length} bound identifier(s).`);return}o.params.push(...d.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&(f+=e.args.length,o.args.push(...e.args),m.push(wC(``,n,e.args))),l=eu.has(l)&&d.body.kind===`Selection`?d.body.expression:d.body;return}if(l.kind===`Case`){let i=[...l.arms,...l.other?[{condition:void 0,body:l.other}]:[]];if(s===t.length-1){v(n,`Subexpression of CASE must have form !i!j.`);return}let a=e.kind===`Operand`?i[Vu(e.operand,i.length)]:void 0;if(!a){v(n,c);return}s++;let o=t[s],u=o.kind===`Operand`?Vu(o.operand,2):-1,d=r.selectorRanges?.[s];if(u===-1){v(d,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=u===0?a.condition:a.body;if(!f){v(d,`Selecting OTHER in a CASE statement.`);return}l=f;return}if(l.kind===`Except`&&e.kind===`Operand`&&Vu(e.operand,l.updates.length+1)>0){v(n,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let p=d?d.sets:Ku(l);if(!p&&l.kind!==`Identifier`){v(n,`Selecting subexpression of expression that has none.`);return}if(e.kind!==`Operand`){v(n,c);return}let h=p?.[Vu(e.operand,p.length)];h?l=h:v(n,c)},x=b(void 0);if(d)return r;if(x)return AC(x.definition,{...o,args:x.args});for(ee();s<t.length&&!d;){let e=t[s];if(e.kind===`Name`){for(;l?.kind===`Label`;)l=l.body;if(l?.kind!==`Let`)return v(r.selectorRanges?.[s-1],`A name selector here must be from a LET clause.`),r;o.lets.push(l.definitions);let e=b(l.definitions);if(d)return r;if(e)return AC(e.definition,{...o,args:[...o.args,...e.args]});ee()}else{if(e.kind===`Colon`&&t[s-1].kind!==`Name`)return v(r.selectorRanges?.[s-1],`!: should not follow an operand selector.`),r;if(e.kind===`Colon`&&t[s+1]?.kind!==`Name`&&(c!==s-1||s!==t.length-1))return v(r.selectorRanges?.[s],`\`!:' can be used only after a name and either at the end after an
|
|
1790
|
-
operator name or before an operator name.`),r;e.kind!==`Colon`&&(_(l,`Subexpression selection failed, probably due to an error in the selected expression.`),_(l,`Choosing operand \`${CC(e)}' of subexpression with no operands.`,!0)),te(e),_(l,`An unexpected null node specified by '${CC(t[s])}'.\nThis is probably due to a previous error.`),s++}}if(d)return r;if(!l)throw TC(`Subexpression selection failed`,a);let S=o.params.length,ne=o.args.length;if(S!==ne){let e=`Expected ${S} arguments but found ${ne}.`;if(!i||ne>0)return v(a.range,e),r;g(a.range,e)}let re=OC(l,o.lets,a),C=e=>({kind:`Selection`,expression:e,location:o.params.length===0&&re.kind!==`Lambda`?a:DC(a)}),ie=kC(o,re.kind===`Lambda`?{...re,body:eu.has(re)?re.body:C(re.body),location:a}:C(re));return au.set(ie,p),h&&nu.set(ie,h),ie},MC=(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 Hu(e,t,n)},NC=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Be(e).some(NC),PC=(e,t,n,r=!1)=>{if(!NC(e))return e;if(e.kind===`Let`){e.recursive&&SC(e.recursive,e.definitions);let r=[],i=n=>r.find(e=>e.name===n)??e.definitions.find(e=>e.name===n)??t(n),a=t=>!e.definitions.some(e=>e.name===t)&&n(t);e.definitions.forEach(e=>r.push(xC(e,e=>PC(e,i,a))));let o={...e,definitions:r,body:PC(e.body,i,a)};return o.instances?{...o,instances:o.instances.map(e=>FC(e,i,a))}:o}let i=e.kind===`Apply`?t(e.operator):void 0,a=i?.kind===`Operator`?i.params:e.kind===`Apply`?Af.get(e.operator.slice(e.operator.lastIndexOf(`!`)+1))?.formals:void 0,o=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>PC(e,t,n,a!==void 0&&a[r]?.arity!==0))}:Qd(e,e=>PC(e,t,n)),s=Be(e),c=Be(o).every((e,t)=>e===s[t])?e:o,l=c.kind===`Subexpression`?c.selectors:c.kind===`Identifier`?MC(c.name,[],void 0,t):c.kind===`Apply`?MC(c.operator,c.args,c.argumentCounts,t):void 0,u=l?.[0],d=t=>{bC.set(e,t),bC.set(c,t)};if(!l)return c.kind===`Apply`&&c.operator.includes(`!`)&&!t(c.operator)&&d(0),c;let f=l.findIndex(e=>e.kind!==`Name`),p=l.slice(0,f===-1?l.length:f),m=p.some((e,n)=>n>0&&t(p.slice(0,n+1).map(CC).join(`!`)));if(u?.kind===`Name`&&n(u.name)&&!m)return c;if(u?.kind===`Name`&&l[1].kind!==`Name`&&!t(u.name))return d(0),c;let h=jC(l,t,c,r),g=bC.get(c);g!==void 0&&d(g);let _=Gl.get(e);return _&&h!==c&&Gl.set(h,_),h!==c&&eu.set(h,c),h},FC=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:PC(e.expression,t,n,!0)}))}),IC=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},LC=(e,t)=>FC(e,IC(t.definitions),()=>!1),RC=(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]);SC(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 pu(e.location,t)||e.isRecursive&&n!==void 0&&pu(n,t)},s=/* @__PURE__ */ new Map,c=(e,t)=>n=>{let r=e(n);if(!(!r||i.has(r)&&!o(r,t)))return s.get(r)??r},l=IC([...t,...e.definitions]),u=e=>n.has(e),d=IC([...t,...e.definitions,...r]),f=(e,t)=>PC(e,c(d,t),e=>u(e)&&r.every(t=>t.name!==e)),p=e=>{let t=t=>u(t)||!e(t),n=n=>PC(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return ru.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 FC(o,e,t);case`Define`:return{...o,definitions:o.definitions.map(r=>r.kind===`Instance`?FC(r,e,t):xC(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(t.body.kind===`Define`){let e=t.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=p(t=>e.find(e=>e.name===t)??r(t))}return t})}};return{lookup:e,resolveFacts:r,resolveStatement:a,resolveStep:o,resolveProof:s}},m=e.definitions.some(e=>NC(e.body))||e.assumptions.some(e=>NC(e.expression));m&&[...e.definitions,...r].toSorted((e,t)=>mu(e.location,t.location)).forEach(e=>s.set(e,xC(e,t=>f(t,e.location))));let h={...e,theorems:e.theorems.map(e=>{let t=p(c(l,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&p(c(l,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>({...e,facts:p(c(l,e.location)).resolveFacts(e.facts)}))};return m?{...h,definitions:e.definitions.map(e=>s.get(e)??e),assumptions:e.assumptions.map(e=>({...e,expression:f(e.expression,e.location)}))}:h},zC=(e,t)=>e.maxLevels[t]??3,BC=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=jp({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=>zf(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>zf(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Bf(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=If(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)&&zf(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(Mp(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(Pf(e.name,t));i!==void 0&&zC(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=If(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=zC(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()])}},VC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],HC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),UC=new Map(As.flatMap(e=>e.map(t=>[t,e[0]]))),WC=e=>UC.get(e)??e,GC=()=>{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}}},KC=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:He(e)&2147483647,kind:t,isLocal:n}),qC=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:WC(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:WC(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}},JC=(e,t)=>{let n=[];for(let r=t;;){let t=qC(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},YC=e=>({line:e.line,column:e.column}),XC=(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=JC(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},ZC=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,QC={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},$C=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&ZC(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&ZC(e[n+1],e[n+2])?n+=ZC(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=>QC[e])}"`:r.text)}return t},ew=e=>e[2]?.text,tw=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},nw=(e,t)=>e.find(e=>e.name===t)??e.map(e=>nw(e.modules,t)).find(Boolean),rw=e=>{let t=e===void 0?[]:re(e),n;return{tokens:t,ranges:tw(t),getModule:()=>n??=e===void 0?Jl(``):Yl(e,t)}},iw=(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=rw(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)??Qh.get(i)??Kl(e,i),c=a(s),l=c.tokens,u=c.ranges.get(ew(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:()=>nw(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()}},aw=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=JC(t,e+1);i.push({location:YC(t[e]),apply:e=>r.forEach(t=>e.put(KC(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:YC(n),apply:t=>t.put(KC(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`&&JC(t,u+1).every(e=>s.has(e))&&o(u,`definition`),HC.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(YC(n)),i.push({location:YC(n),apply:e=>e.put(KC(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(KC(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=WC(e.name);i.push({location:e.location,apply:n=>n.put(KC(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(KC(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(KC(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>pu(e.location,t.location)?-1:+!!pu(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=GC();n.set(i??``,o),ks.toReversed().forEach(e=>o.put(KC(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)}}},ow=(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=XC(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;$C(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??ew(t(void 0).tokens);throw e.q(i,n)}$C(s(i)).forEach(a)}}VC.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);$C(t).forEach(a),t.forEach(e=>{e.kind===`String`&&a(e.text)})}),Ps.forEach(a),[...i]},sw=(e,t)=>{let n=iw(e,t),r=n.getParsed,i,a=()=>i??=aw(r);return{getStringOrder:(e,t)=>ow(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)}}},cw=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),lw=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],uw=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.I))throw r;let i=il(t);throw i===void 0?r:e.J([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},dw=t=>new e.I(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),fw=(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)}.`},pw=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,mw=e=>e===`Theorem`?`ThmOrAssumpDefNode`:pw(e),hw=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:_f(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),gw=(e,t)=>{let n=Ve(e);return n!==void 0&&t.has(n)||Be(e).some(e=>gw(e,t))},_w=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ff(e),n.get(e)??n.size)),n},vw=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),yw=e=>e?.kind===`Steps`?e.steps.flatMap(e=>[...e.body.kind===`Instance`?[e.body]:[],...e.body.kind===`Define`?e.body.definitions.flatMap(e=>e.kind===`Instance`?[e]:[]):[],...yw(e.proof)]):[],bw=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Hv(e);if(e.kind===`Number`&&!Bt(e.value))throw Uv(e);bw(e.kind===`Let`?[...Be(e),...vw(e.instances??[])]:Be(e))}),xw=(t,n)=>{let r=n.order??sw(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(dg.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=Th(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=/* @__PURE__ */ new Set,b=(e,t)=>[y,..._].forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ee=0,te=e=>`${e}#${ee++}`,x=[],S=[],ne=BC(e=>{let t=m.get(e)??T(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)}}),re=/* @__PURE__ */ new Map,C=/* @__PURE__ */ new Map,ie=/* @__PURE__ */ new Map,ae=e=>{let t=d.get(e);if(t)return t;let r=Ng(e,n.print,f,n.files,u);if(!r)return;jg.get(e)?.forEach(ae);let i=/* @__PURE__ */ new Map;return Mg.get(e)?.forEach(e=>ae(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:Af.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Mf(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},w=e=>{let t=jg.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=ae(e);return r&&b(e,t),r&&t.includes(`Integers`)&&ae(`Integers`),r},oe=e=>(bw([...e.definitions.flatMap(ze),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...vw(e.instances)]),e.modules.forEach(oe),e);oe(i);let se=(t,i)=>{let a=n.loadModule?.(t)??eg(f.version).get(t)??Kl(n.source,t);if(a===void 0)throw e.q(t,i);let o=uw(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 oe(o)},ce=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=pe(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:S,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.J(a,!1,void 0,S);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&fw(c,l.module);if(u)throw e.J([u],!1,void 0,S);if(c)throw dw(c);return o.forEach(e=>e()),{linked:s,closure:r}},T=(t,r)=>{let i=p.get(t);if(i)return b(t,g.get(t)??[]),i;let o=ce(se(t,r)),s=/* @__PURE__ */ new Map;return Ag(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 $(i.body,{environment:r.environment,scope:Yy(Fy(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&&cw.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),b(t,o.closure),o.linked},le=(e,t,n,r,i)=>{let u=i?void 0:w(e.module);if(u)return ue(e,u);let d=i??T(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=lw(d),p=`#${ee++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Bd(LC(e,t),f,t,n);x.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=Tf({params:g,substitutions:new Map([...h].map(e=>[e[0],Kd(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=te(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&C.set(u,`${e.name}!${C.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:te,...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&&re.set(r,{name:n,location:e.location}),e.name!==void 0&&ie.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})),E=(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:vf(r,n),location:n}}},D=(e,t,n,r)=>{let i=e.location,s=r?void 0:w(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=fe(t[1].arity,t[1].params);return yf(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,i)});let c=r??T(e.module,n),l=`#${ee++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=lw(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};x.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=>gw(f(e),p),h=d.map(t=>{let n=E(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=[],_=Tf({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:vf(e.params,i),location:i,resolution:Ql}:_f(`${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}:hw(a,i)),i},createName:te}),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 yf(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,a,n===t[1].key?r:a,i)});return[...h,...g,...y]},O=e=>[...e].flatMap(e=>{let t=a.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),k=/* @__PURE__ */ new Map,pe=(t,r)=>{let s=vC(t,n.loadClass?.(t.name),t===i);k.set(t.name,s.overrides);let c=s.module,l=x.length,u=new Map([...dg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Fd,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);mw(r.kind)===mw(t.kind)?f.warnings.push({location:i,message:`Warning: the ${pw(r.kind)} of '${n}' conflicts with \nits ${pw(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${pw(t.kind)} of '${n}' conflicts with \nits ${pw(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,b=/* @__PURE__ */ new Map,ee=[],te=[...c.constants],re=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),C=re.map(e=>e.name),ae=re.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:w(e);if(n){g(n);return}let i=t??T(e,c.name);te.push(...i.constants.filter(e=>te.every(t=>t.name!==e.name)&&!C.includes(e.name))),i.variables.forEach((e,t)=>{C.includes(e)||te.some(t=>t.name===e)||(C.push(e),ae.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>v.add(e)),i.modules.forEach((e,t)=>b.set(t,e)),ee.push(i)});let oe=new Map(u),se=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],ce=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});se.forEach(e=>_.set(e.name,ce(e)));let fe=e=>({key:me(e),arity:hu(e),params:gu(e),kind:Id(c,e)?`Theorem`:`Definition`,range:e.location.range}),E=te.length===0&&C.length===0,me=e=>c===i?e.name:`${e.name}@${r.id}`,he=/* @__PURE__ */ new Map,ge=()=>new Map([...r.modules,...b]),_e=e=>{let t=c.modules.find(t=>t.name===e.module);return t?pu(t.location,e.location)?b.get(t.name):void 0:ge().get(e.module)},ve=e=>({imported:u,getInstance:e=>{let t=_e(e),n=t?void 0:w(e.module);if(n)return{declarations:[],symbols:ue(e,n),instancer:c.name};let r=t??T(e.module,c.name),i=lw(r);return{declarations:i,symbols:de(e,r.exported,i,e=>e),instancer:c.name}},bound:oe,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:me,isModuleKnown:(e,t)=>e===c.name||y.has(e)||r.modules.has(e)||c.modules.some(n=>n.name===e&&pu(n.location,t)),instanced:he,facts:v,reports:p,warnings:r.warnings}),ye=e=>[...se.filter(t=>pu(t.location,e)).map(e=>[e.name,ce(e)]),...c.definitions.filter(t=>pu(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&&fw(e,n.module);if(n&&!i)throw dw(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=pe(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||b.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=le(e,c,ve(c),E,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)=>pu(e.location,t.location)?-1:1).forEach(e=>e.link());let xe=RC(kf(c,(e,t)=>D(e,t,c.name,_e(e))),O(u));c.theorems.flatMap(e=>yw(e.proof)).filter(e=>!ge().has(e.module)).forEach(e=>w(e.module)??T(e.module,c.name)),r.errors.push(...Hd(xe,ve(xe))),xe.definitions.forEach(e=>{let t=me(e);a.set(t,e),o.set(t,!E);let n=fe(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!pu(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let Se={module:xe,constants:te,variables:C,variableLocations:ae,visible:u,exported:_,modules:b,extended:ee,facts:/* @__PURE__ */ new Set([...v,...[...xe.theorems,...xe.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Se);let Ce=x.splice(l).map(e=>({location:e.location,check:()=>ne(e)}));return r.levelChecks.push(()=>Np(xe,{constants:new Set(te.map(e=>e.name)),variables:new Set(C),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>ie.get(u.get(e)?.key??e)},Ce,S)),h.push(Se),Se},me=ce(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=T(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)),S.length>0&&!n.isSanyReported&&n.print(e.Q(S));let ve=n.runtimeInvariants??[];ve.forEach(e=>{if(e.module===void 0)return;p.set(i.name,me);let t=T(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 xe=me.constants.map(e=>e.name),Se=me.variables,Ce=aC(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=>T(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),we=Ce.constants,Te=Ce.substitutions;he!==void 0&&u.forEach((e,t)=>{let n=gg(e);n&&u.set(t,n)});let Ee=_w(Se,h.flatMap(e=>e.module.variables.map(e=>e.name))),De=Kp({definitions:a,substitutions:Te,constants:we,variableIndex:Ee,builtins:u,variables:Se}),Oe={runtime:f,definitions:a,builtins:u,constants:we,substitutions:Te,instanceNames:C,variables:Se,variableIndex:Ee,facts:De,startupValues:Array.from({length:De.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},ke=jp({constants:new Set(we.keys()),variables:/* @__PURE__ */ new Set([...Se,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>ry(e,Oe)}),Ae=t=>{try{$(t,{environment:Oe,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.x)return t;throw t}};Te.forEach((t,n)=>{let r=a.get(t),i=xe.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&ke.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ae(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 je=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),Me=r.createDefinitionOrder();return{environment:Oe,assumptions:ye,variableLocations:me.variableLocations,instanceActions:re,startupDefinitions:h.filter(e=>!je.has(e.module.name)||lw(e).length===0).flatMap(e=>Me(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=>k.get(e.module.name)??[]),moduleOperators:_e,runtimeInvariants:ve,rootName:i.name}},Sw=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),Cw=(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},ww=t=>e.ot(new e.x(`${e.K}${t}`),e.rt.error),Tw=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 ww(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Ew=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${Dw(t)}`:n},Dw=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(Dw).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${Ew(e.pattern,e.set)}:${Dw(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(Dw).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${Dw(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>Ew(e.pattern,e.set)).join(`,`)}|->${Dw(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(Dw);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Ow=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,kw=(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 ww(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>$(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!N(o)||!P(o))throw ww(`The symmetry operator must specify a set of functions.`);let s=F(o).elements;if(!s.every(It))throw ww(`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=Dw(Ow(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(Tw).forEach(e=>{e.size>0&&f.set(Sw(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=Cw(n,e),r=Sw(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(!Ow(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()]},Aw=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Mw(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(Mw(e[r],t));return a}},jw=(e,t)=>{let n=[],r=[];for(let i of e){let e=Mw(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},Mw=(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=jw(e.elements,t);return n?On(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=Aw(n.domain,t),i=Aw(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=Aw(r.elements,t);return i?yr(i):r},Nw=(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]=Mw(e[o],i),a===0&&(a=Cn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Pw={line:0,column:0},Fw=e=>({kind:`Identifier`,name:e,location:Pw}),Iw=e=>({name:e,expression:Fw(e),scope:void 0}),Lw=/* @__PURE__ */ new Set([`name`,`property`]),Rw=(t,n,r)=>{let i=ry(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(Lw.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},zw=e=>e.body.kind===`Number`||e.body.kind===`String`,Bw=(e,t,n)=>n.constants.has(e)?n.constants.get(e):zw(t)?void 0:jy(t,n),Vw=(t,n,r)=>{if(r.constants.has(n))throw new e.v(`The ${t} ${n} cannot be a constant.`);let i=Rw(t,n,r);if(Bw(n,i,r)!==void 0)throw new e.v(`The ${t} ${n} cannot be a constant.`);return i},Hw=(t,n,r)=>{let i=r.constants.has(n)?void 0:Rw(t,n,r),a=i?Bw(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},Uw=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Ww=(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})),My(e.startupDefinitions,r),t.invariants.forEach(e=>{Hw(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Gw=(t,n)=>{let r=jp({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=Hw(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1790
|
+
`]]),A_=(e=`master`)=>e===`1.7.4`?k_:O_,j_=(e,t)=>e.every(e=>bi(e,t)),M_=xr([!1,!0]);gr(M_);const N_=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Er(N_(e,t,r),N_(e,r,n))},P_=[`\\cup`,`\\cap`,`\\`],F_=e=>typeof e==`object`&&e.kind===`MixedSet`,I_=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,L_=(e,t,n)=>{t.kind===`Interval`&&ui(t);let r=t.kind===`Interval`?t:hr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return Ft(r,e=>{bi(e,n)===i&&Nt(a,e)}),I_(t)?jn(a):Sr(a)}if(si(t))return n;if(!It(n))return zn({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return Ft(r,e=>Nt(i,e)),Ft(n.kind===`Interval`?n:F(n).elements,e=>{bi(e,t)||Nt(i,e)}),Sr(i)},R_=(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},z_=(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`?R_(e,t):void 0;if(n!==void 0)return n;for(let n=e.low;n<=e.high;n++)if(!bi(n,t))return!1;return!0},B_=(e,t)=>{let n=(t,n)=>Qo([bs(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},V_=[es(`TRUE`,!0),es(`FALSE`,!1),es(`BOOLEAN`,M_),es(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),rs(`=`,vr),rs(`#`,(e,t)=>!vr(e,t)),z(`~`,1,e=>!Qo(e,0,`~`)),z(`<=>`,2,e=>Qo(e,0,`<=>`)===Qo(e,1,`<=>`)),B_(`/\\`,(e,t)=>e&&t()),B_(`\\/`,(e,t)=>e||t()),B_(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>bi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!bi(R(e,0,`\\notin`),R(e,1,`\\notin`))),rs(`\\subseteq`,(t,n)=>{if(typeof t==`object`&&t.kind===`Interval`)return z_(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)?j_(F(t.base).elements,n.base):!ti(t,e=>!bi(e,n))}),...P_.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(It(r)&&It(i)&&!F_(r)&&!F_(i)&&!a&&!Pt(r)&&!Pt(i)){if(t===`\\cup`&&si(r))return i;let n=t===`\\cup`?Er:t===`\\cap`?Tr:wr;return vi((r,i)=>{let a=F(r),o=F(i),s=n(a,o);if(t===`\\cup`){let t=hr(a),n=wr(o,a).elements,r=t===a.elements&&(n.length===0||Tn(t[t.length-1],n[0])<0);if(t.length+n.length>jt())throw new e.P(Mt());if(r&&!a.isNormalized)return s;let i=s===a?An(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=I_(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>bi(e,s)))),s},(e,n)=>L_(t,e,n),r,i)}return It(r)?L_(t,r,i):t!==`\\`&&It(i)?L_(t,i,r):zn({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=zt(t)?hr(t):[],r=n.filter(zt);if(!zt(t)||r.length!==n.length)return zn({kind:`Union`,base:t});let i=r.flatMap(hr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{bi(t,e)||Nt(e.elements,t)}),Sr(e.elements)};return F_(t)||r.some(F_)?a():r.length===0?Cr:vi(e=>mi(N_(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!Lt(n))throw new e.x(`DOMAIN expects a function but received ${L(n)}`);return Vi(n)})],H_=hs(`Integers`,`Neg`,`IntValue`,1),U_=t=>{let n=hs(t,`DotDot`,`IntervalValue`,2);return[gs(t,`+`,`Plus`,(e,t)=>e+t),gs(t,`-`,`Minus`,(e,t)=>e-t),gs(t,`*`,`Times`,(e,t)=>e*t),gs(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}),gs(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(is(r))throw as(`${t} \\div ${n}`);return r}),gs(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}),rs(`..`,(e,t)=>{let r=ms(t,n);return{kind:`Interval`,low:ms(e,n),high:r}})]},W_=U_(`Naturals`),G_=U_(`Integers`),K_=e=>{let t=W_.indexOf(e);return t===-1?void 0:G_[t]},q_=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[ps(vs(`<`,(e,t)=>e<t),t(`LT`)),ps(vs(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),ps(vs(`<=`,(e,t)=>e<=t),t(`LE`)),ps(vs(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},J_=[es(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...W_,...q_(`Naturals`)],Y_=[es(`Int`,{kind:`InfiniteSet`,name:`Int`}),...G_,...q_(`Integers`),z(`-.`,1,e=>{let t=ms(R(e,0,`-`),H_);if(is(-t))throw as(`-${t}`);return-t})],X_=(t,n,r)=>{let i=R(t,n,r),a=hi(i);if(!a)throw new e.A(`${r}\n${j(L(i))}`);return a},Z_=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:X_(e,t,n)},Q_=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw Yo(n,`SubSeq`,`natural number`,r);return r},$_=(e,t,n)=>typeof e==`string`?hn(e.slice(t,n)):Rr(e.slice(t,n)),ev=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,tv=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,nv=(e,t)=>{let n=ks.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?ps(e,t):e}):t},rv=t=>nv(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Z_(e,0,ev(``,`Len`)).length),z(`\\o`,2,t=>{let n=Z_(t,0,tv(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=X_(t,1,tv(`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&&Fn(r)===`tuple`?r:Rr([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.A(`${tv(`t \\o s`,`string`)}\n${j(L(r))}`);return hn(n+r)}),z(`Append`,2,e=>Rr([...X_(e,0,tv(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=X_(t,0,ev(``,`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=Z_(t,0,ev(``,`Tail`));if(n.length===0)throw new e.A(`Attempted to apply Tail to the empty sequence.`);return $_(n,1)}),z(`SubSeq`,3,t=>{let n=Z_(t,0,ev(`first `,`SubSeq`)),r=Q_(t,1,`second`),i=Q_(t,2,`third`);if(r>i)return $_(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 $_(n,r-1,i)}),ts(`SelectSeq`,2,t=>{let n=$o(t,1,`SelectSeq`);return Rr(X_(t,0,ev(`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}))})]),iv=t=>nv(`FiniteSets`,[z(`IsFiniteSet`,1,e=>fi(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 ui(r,t)})]),av=[ps(z(`Warshall`,1,t=>{let n=R(t,0,`Warshall`);if(!N(n)||vn(n))throw new e.A(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${j(L(n))}`);ui(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=oa(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=hi(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 Sr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Rr([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],ov=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return av;if(e===`AnySet`)return[es(`ANY`,Sn)];if(e===`IOUtils`)return Tg(r,a);if(e===`_TLCTrace`)return Og(r);if(!A_(n.version).has(e))return;let o=lv(e,t,n,r,i);return e===`Randomization`&&o?[...o,$g(n)]:o},sv=/* @__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`]]]),cv=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),lv=(e,t,n,r,i)=>{switch(e){case`Naturals`:return J_;case`Integers`:return Y_;case`Sequences`:return rv(n.version);case`FiniteSets`:return iv(n.version);case`TLC`:return nv(`TLC`,E_(t,n));case`Randomization`:return e_(n);case`_Possible`:return h_(t,n);case`Json`:return wg(r);case`Bags`:return nv(`Bags`,Yh(i));case`TLCExt`:return nv(`TLCExt`,m_(t,n));default:return}},uv=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Vf.get(t)||[];r.expressions.push(...i,t);let a=_i.sets,o=a??[],s=o.length;_i.sets=o;try{return n()}catch(e){throw Bx(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,_i.sets=a}},dv=(e,t,n)=>e.coverage?vo(e.coverage,t,n):-1,fv=(e,t,n)=>e.coverage?bo(e.coverage,t,n):n(),pv=(e,t,n,r)=>fv(e,t,()=>$(n,r)),mv=(e,t,n,r)=>{let i=pv(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},hv=(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},gv=e=>!e.includes(void 0),_v=e=>e.variables.map(()=>void 0),vv=(e,t,n)=>{let r=[...e];return r[t]=n,r},yv=(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}},bv=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,xv=e=>e.kind===`Identifier`?e.name:void 0,Sv=(e,t,n)=>{if(t.kind===`Label`)return Sv(e,t.body,n);let r=xv(t);if(r===void 0)return;let i=Sb(n,r);if(i?.kind===`Thunk`)return Sv(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=mx(r,e);return o?.kind===`Closure`&&o.params.length===0?Sv(e,o.body,o.scope):void 0},Cv=(e,t,n)=>{if(t.kind===`Prime`)return Sv(e,t.expression,n);if(t.kind===`Label`)return Cv(e,t.body,n);let r=xv(t);if(r===void 0)return;let i=Sb(n,r);if(i?.kind===`Thunk`)return Cv(e,i.expression,i.scope);if(i)return;let a=mx(r,e);return a?.kind===`Closure`&&a.params.length===0?Cv(e,a.body,a.scope):void 0},wv=t=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean expression.`);return t},Tv=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Ev=(e,t,n,r)=>{let i=Ov(e,t,n,r);return i&&e.coverage&&!e.isInit&&yo(e.coverage,r),i},Dv=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(yo(r,n),yo(r,r.roots[n])),e.onState(t),!0},Ov=(e,t,n,r)=>t===void 0?gv(n)?Dv(e,n,r):e.onIncomplete?.(n)??!1:gv(n)&&Tv(e)?Av(e,t,n,r):t.kind===`Predicate`?jv(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?Kv(e,t.expression,t.rest,t.scope,n,t.node):kv(e,t,n)&&Ev(e,t.rest,n,t.node),kv=(e,t,n)=>{let r=e.environment,i=pv(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return pv(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?xb(t,r.runtime.version):t}})();try{return!vr(i,a)}catch(t){throw e.callStack&&Bx(e.callStack,[i],t),t}},Av=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return Kv(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?kv(e,i,n):wv(pv(e,i.node,i.expression,hv(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Dv(e,n,r)},jv=(e,t,n,r,i,a)=>Mv(e,t,n,r,i,dv(e,a,t)),Mv=(t,n,r,i,a,o)=>uv(t,n,()=>{switch(n.kind){case`Let`:{let e=hv(t,i,a),s=n.definitions,c=t.coverage&&!t.isEnabled?jx(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):jx(s,e);return jv(t,n.body,r,c,a,o)}case`Label`:return jv(t,n.body,r,i,a,o);case`Selection`:return jv(t,n.expression,r,i,a,o);default:if(Bv.has(n.kind))throw new e.x(`The state relation is not a boolean expression.`);return uv(t,n,()=>Wv(t,n,r,i,a,o))}}),Nv=(e,t,n,r,i)=>wv(t)&&Ev(e,n,r,i),Pv=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),Fv=(e,t,n,r,i,a)=>{let o=hv(e,r,i);if(t.kind===`Identifier`){let s=Sb(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return jv(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return jv(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:mx(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&rh(c,e.environment))?jv(e,l.body,n,l.scope,i,a):Nv(e,mv(e,a,t,o),n,i,a)}let s=hx(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=fv(e,a,()=>Dx(s,t.args,o));return jv(e,s.body,n,r,i,a)}let c=Pv.has(t.operator)?pv(e,a,t,o):mv(e,a,t,o);return Nv(e,c,n,i,a)},Iv=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Ev(e,t,vv(n,r,i),a):vr(o,i)&&Ev(e,t,n,a)},Lv=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Rv=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?Sv(t.environment,s,i):Cv(t.environment,s,i),u=hv(t,i,a);if(l===void 0)return pv(t,o,n,u)===!0&&Ev(t,r,a,o);let d=pv(t,o,c,u),f=a[l];if(n.operator===`=`)return Iv(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 pv(t,o,n,u)===!0&&Ev(t,r,a,o);if(!Vr(p))throw new e.x(`The right side of \\IN is not enumerable.`);let m=ni(p),h=t.coverage&&Oo(t.coverage,p,m,!1),g=m.reduce((e,n)=>(h?.next(),Ev(t,r,vv(a,l,n),o)||e),!1);return h?.next(),g},zv=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Bv=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Vv={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Hv=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Vv[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${Q(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${Q(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${Q(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${Q(e)}`},Uv=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=fv(e,r,()=>Hb(t.bounds,e=>{let t=$(e,n);return{value:t,elements:zb(t,e,a)}})),s=o.map(e=>e.elements);Wb(t.bounds,s,n.scope,e=>(i.push(e),!1));let c=e.coverage;return{bindings:i,charge:c&&Ao(c,o.map(e=>e.value),s)}},Wv=(t,n,r,i,a,o)=>{let s=hv(t,i,a);switch(n.kind){case`Identifier`:return Fv(t,n,r,i,a,o);case`Apply`:return zv.has(n.operator)&&n.args.length===2?Rv(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?wv(pv(t,o,n.args[0],s))?jv(t,n.args[1],r,i,a,o):Ev(t,r,a,o):Fv(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)=>Lv(`Predicate`,t,i,o,e),r);return jv(t,e[0],n,i,a,o)}let s=e[e.length-1];return Mv(t,yv(n,e.length-1),Lv(`Predicate`,s,i,o,r),i,a,bv(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>jv(t,n,r,i,a,o)||e,!1);let s=Mv(t,yv(n,e.length-1),r,i,a,bv(t,o)),c=jv(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:{let e=Uv(t,n,s,o);return e.bindings.reduce((i,s)=>(e.charge?.(),jv(t,n.body,r,s,a,o)||i),!1)}case`Forall`:{let e=Uv(t,n,s,o),i=e.bindings;if(i.forEach(()=>e.charge?.()),i.length===0)return Ev(t,r,a,o);let c=i.slice(1).reduce((e,t)=>Lv(`Predicate`,n.body,t,o,e),r);return jv(t,n.body,c,i[0],a,o)}case`If`:return jv(t,wv(pv(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>wv(pv(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 jv(t,c,r,i,a,o)}case`FunctionApplication`:{let e=Zb(pv(t,o,n.function,t.isInit?s:Eb(s)));if(e){let i=fv(t,o,()=>Qb(e,n,s));return jv(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return Kv(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=jv(t,n.action,r,i,a,o);return Kv(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return jv(t,n.action,Lv(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Hv(n):void 0;if(c!==void 0)throw new e.x(c);return Nv(t,pv(t,o,n,s),r,a,o)},Gv=(e,t,n)=>e.runtime.warn(Ze.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${Q(n)}`),Kv=(e,t,n,r,i,a)=>uv(e,t,()=>{let o=dv(e,a,t),s=Sv(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;e.isEnabled&&e.coverage&&yo(e.coverage,o);let a=i[s];return a!==void 0&&!vr(a,r)?(Gv(e.environment,s,t),!1):Iv(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Ev(e,n,i,o);let c=s.reduceRight((e,t)=>Lv(`Unchanged`,t,r,o,e),n);return Kv(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Sb(r,t.name);if(a?.kind===`Thunk`)return Kv(e,a.expression,n,a.scope,i,o);let s=a?void 0:mx(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return Kv(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=hv(e,r,i),s=hx(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return Kv(e,s.body,n,Dx(s,t.args,a),i,o)}let c=e.environment,l=pv(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=pv(e,o,t,{environment:c,scope:r,state:i,next:void 0});return vr(l,u)&&Ev(e,n,i,o)}),qv=(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}),Jv=/* @__PURE__ */ Error(`The replay found a successor`),Yv=(e,t,n,r)=>{let i=()=>{throw Jv},a=r.coverage?.current??-1,o=qv(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=Lv(`Changed`,e.subscript,t,a,void 0);jv(o,e.action,n,t,_v(r),a)}else jv(o,e,void 0,t,_v(r),a);return!1}catch(e){if(e!==Jv)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},Xv=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=qv(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>Lv(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);jv(o,i.expression,s,i.scope,_v(t),i.node??-1)},Zv=(e,t,n,r)=>{if(e.some(e=>Bv.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;Qv(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},Qv=(e,t,n,r,i,a)=>{let o=qv(r,`next`,n,i,a);jv(o,e.expression,void 0,e.scope,_v(r),t)},$v=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Sv(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=Sb(r,e.name)?void 0:mx(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,jx(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`Selection`:a(e.expression,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`){Cv(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Sb(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?hx(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:mx(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,Dx(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??[])},ey=/* @__PURE__ */ new WeakMap,ty=/* @__PURE__ */ new WeakMap,ny=(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},ry=(e,t,n)=>{let r=e.slice();return r[t]=n,r},iy=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,ay=(t,n)=>{let r=new e.x(n);return t.isInit?r:e.at(r,e.nt.error)},oy=(e,t,n,r)=>{let i=db(n);return r&&Bv.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 ${iy(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},sy=(e,t,n)=>{let r=ds(t),i=Q(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 ${iy(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1791
|
+
`:``}${i}`},cy=(e,t,n)=>dy(e,t,$(t,n)),ly=new Set(V_.map(e=>e.name)),uy=e=>e.kind===`Apply`?ly.has(e.operator):e.kind!==`Identifier`&&!Bv.has(e.kind),dy=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=oy(t,r,n,i);throw t.isInit&&i&&uy(n)?new e.B(a):ay(t,a)},fy=(e,t,n,r)=>r.environment.callStack?$(n,r):(e[t]??=qx(n,r.environment))(r),py=e=>e===`=`||e===`\\in`||e===`\\subseteq`,my=(e,t,n)=>{let r=n?ey:ty,i=r.get(e);if(i)return i;let a=Jy(e,t,n),o=n?void 0:qy(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},hy=(e,t)=>{if(t.constants.has(e))return;let n=Nb(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},gy=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return gy(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=hy(e.name,t);if(a&&!r.has(a))return r.add(a),gy(a.body,t,n,r)},_y=(e,t,n)=>gy(e,t,!n),vy=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return vy(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=jx(e.definitions,ny(r,t,n));return vy(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Sb(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return vy(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=hy(e.name,r.environment);if(s)return vy(s.body,void 0,n,r,i)},yy=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||A(e))||!t&&e.kind===`Prime`,by=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>by(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=hy(e.name,t);if(i)return n.add(e.name),by(i.body,t,n)},xy=/* @__PURE__ */ new Set([`Label`,`Selection`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Sy=(e,t,n)=>xy.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||py(e.operator)&&(yy(e.args[0],n)||_y(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,Cy=/* @__PURE__ */ new Set,wy=(e,t)=>{if(A(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return $f(e,(e,i)=>{let a=r?wy(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},Ty=(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:Nb(r,t);return i&&!n.has(i)&&(n.add(i),Ty(i.body,t,n))?!0:Ve(e).some(e=>Ty(e,t,n))},Ey=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=_y(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=by(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Sy(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:my(e,t,n)}},Dy=(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(dh(e,t)===void 0||Ty(e,t,/* @__PURE__ */ new Set))return!0;let n=wy(e,Cy);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)}},Oy=(e,t,n)=>{let r=e.map(e=>Ey(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Tv(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Xy(u)){d??=ny(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&&!vr(t,i[e.index])}):void 0;if(o){Gv(t.environment,o.index,o.expression);return}let s=n.expression,c=fy(a,e,s,d);if(!dy(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=ny(t,n,u);let r=fy(i,s,e.expression,d);if(!dy(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=ny(t,n,u);let r=fy(i,s,e.value,d),a=u[e.index];if(a===void 0)u=ry(u,e.index,r),d=void 0;else if(!vr(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(!vr(e,n[i.index])){Gv(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)},ky=e=>{let t=Hv(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw ay(n,t);cy(n,e,ny(n,r,i))&&s(i,a)}},Ay=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=ny(r,i,a);if(a[l]!==void 0){cy(r,e,u)&&c(a,o);return}let d=$(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Vr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${iy(r)}, the right side of \\IN is not enumerable.`;throw ay(r,`${t}\n${Q(e)}`)}let p=ni(f);if(r.generator){for(let e of Gg(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(ry(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(ry(a,l,p[e]),o)}},jy=/* @__PURE__ */ new WeakMap,My=e=>{let t=jy.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(My),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return jy.set(e,n),n},Ny=(e,t)=>{let n=e.args[0],r=ky(e),i=(e,r,i)=>vy(n,r,i,e,!t)??-1,a=Ay(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=$(e.args[1],ny(t,n,o));l(ry(o,u,d),s)}},Py=(e,t,n)=>{let r=Q(e);return(i,a,o,s,c,l)=>{let u=ny(i,a,o),d=$(e.function,n?u:Eb(u)),f=Zb(d);if(f!==void 0){my(f.body,t,n)(i,Qb(f,e,u),o,s,c,l);return}if(!Lt(d))throw ay(i,`In computing ${iy(i)}, a non-function (${ds(d)}) was applied as a function.\n${r}`);let p=$(e,u);if(typeof p!=`boolean`)throw ay(i,`In computing ${iy(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Fy=(e,t)=>{let n=My(e);return by(e,t)?Oy([n],t,!1):e.kind===`Tuple`?my(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Sb(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){my(My(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=ny(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=hx(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){my(My(n.body),t,!1)(r,Dx(n,e.args,u),a,o,s,c);return}}cy(r,n,u)&&c(a,o)}},Iy=(e,t,n)=>{let r=e.operator,i=ky(e),a=A(e)?void 0:mx(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Qx(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=my(a.body,t,n),o(e,i(ny(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=ny(a,o,s),f=hx(e,d);f?.kind===`Closure`?my(f.body,t,n)(a,Dx(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Ly=(e,t,n)=>{let r=ky(e),i=A(e)?void 0:hy(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Sb(s,e.name);f?.kind===`Thunk`&&!f.isReleased?my(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&lx(i,t)!==void 0?r(o,s,c,l,u,d):(a??=my(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Ry=(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=gy(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},zy=e=>e.kind===`And`?e.operands.flatMap(zy):[e],By=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Sy(e,t,!1),Vy=e=>{let t=[];return(n,r,i)=>{let a=ny(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!dy(n,i,fy(t,r,i,a)))return}}},Hy=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=zy(e),r=n.findIndex(e=>!By(e,t)||Ry(e,t)),i=r===-1?void 0:Ry(n[r],t);return i?{...i,before:r===0?void 0:Vy(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Hy(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=mx(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Hy(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&&Qx(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(ny(e,t,n)),n))}},Uy=(e,t,n)=>{let r=Sb(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},Wy=(e,t,n)=>{let r=e.map(e=>my(e,t,n)),i=n?[]:e.map(e=>Hy(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&&Uy(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)}}},Gy=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=Fg(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},Ky=(e,t)=>{let n=my(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=ny(r,i,a),u=t.runtime.version,d=Hb(e.bounds,e=>$(e,l)).map((n,r)=>Gg(Lb(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,wb(i,l,e)))};f(d.length-1,i)}},qy=(e,t)=>{if(e.kind===`Exists`)return Ky(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>my(e,t,!1));return e.isBulleted?Gy(n):n.reduce((e,t)=>Gy([e,t]))},Jy=(t,n,r)=>{let i=e=>my(e,n,r);switch(t.kind){case`And`:return Oy(t.operands,n,r);case`Or`:return Wy(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=Lb($(a.set,ny(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,Cb(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Dy(t,n);if(o){let e=Oy(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=ny(r,i,a),d=Hb(t.bounds,e=>Lb($(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=Cb(n,o.names[t],e);if(t===d.length-1){let e=ny(r,i,a);if(!o.guards.every(t=>cy(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{Gb(t.bounds,ny(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&dh(t,n)!==void 0&&!Ty(t.body,n,/* @__PURE__ */ new Set)?wy(t,Cy):void 0;return(n,r,i,o,s,c)=>{let l=[];Gb(t.bounds,ny(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Sb(r,e)?.kind===`Value`)){u.every(e=>cy(n,t.body,ny(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Xy(i)?u.slice(r).every(e=>cy(n,t.body,ny(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=$(t.condition,ny(r,i,a));if(typeof l!=`boolean`)throw ay(r,sy(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=ny(r,i,a),u=e.find(e=>{let t=$(e.condition,l);if(typeof t==`boolean`)return t;throw ay(r,`In computing ${iy(r)}, a non-boolean expression${r.isEnabled?``:` `}(${ds(t)}) was used as a guard condition of a CASE.\n${db(e.source)}`)})?.body??n;if(!u)throw ay(r,`In computing ${iy(r)}, TLC encountered a CASE with no conditions true.\n${Q(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=Nx(t.definitions,n),a={impure:/* @__PURE__ */ new Set,streamed:r.streamed};return(n,i,o,s,c,l)=>e(n,jx(t.definitions,ny(n,i,o),n.isEnabled?a:r),o,s,c,l)}case`Unchanged`:return r?()=>{throw new e.x(`UNCHANGED appears in an initial predicate at ${cb(t)}`)}:Fy(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 cy(e,r,ny(e,t,i))}catch(t){throw e.isEnabled?xb(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 Wy([t.action,My(t.subscript)],n,r);case`Label`:return i(t.body);case`Selection`:return i(t.expression);case`Identifier`:return Ly(t,n,r);case`FunctionApplication`:return Py(t,n,r);case`Apply`:{let e=t.args;if(py(t.operator)){let i=_y(e[0],n,r);if(i!==void 0)return t.operator===`=`?Oy([t],n,r):Ay(t,()=>i);if(yy(e[0],r))return Ny(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=$(e[0],ny(r,i,a));if(typeof l!=`boolean`){let e=ds(l),n=Q(t);throw ay(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 Iy(t,n,r)}default:return ky(t)}},Yy=e=>e.variables.map(()=>void 0),Xy=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Zy=(t,n)=>{let r=n.state;if(!r||!Xy(r))throw new e.x(`ENABLED needs a complete state at ${cb(t)}`);let i=n.environment;if(i.callStack||i.coverage&&i.coverage.current!==-1)return Yv(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return my(t,i,!1)(a,n.scope,Yy(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Qy=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};my(t,n,!0)(o,i,Yy(n),void 0,!1,t=>{if(!o.isStopped){if(!Xy(t)){if(a){o.isStopped=a([...t]);return}throw e.at(new e.C([...t]),e.nt.error)}o.isStopped=r(t)}})},$y=(e,t,n)=>{let r=[];return Qy(e,t,e=>(r.push(e),!1),n),r},eb=(t,n,r)=>{let i=r.variables.filter((e,n)=>t[n]===void 0);return new e.w(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)},tb=(e,t,n,r,i,a,o,s)=>{let c={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return my(e,n,!1)(c,i,Yy(n),void 0,!1,(e,t)=>{if(!c.isStopped){if(!Xy(e)){if(s){s(e,t);return}throw eb(e,t,n)}c.successors++,c.isStopped=r({state:e,action:t})}}),c.successors},nb=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return my(e,n,!1)(i,r,Yy(n),void 0,!1,e=>{Xy(e)||i.successors++}),i.successors>0},rb=(e,t,n,r)=>{let i=[];return tb(e,t,n,e=>(i.push(e),!1),r),i},ib=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),ab=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),ob=e=>ab.has(e.kind)||e.kind===`Apply`&&ib.has(e.operator),sb=(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&&It(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},cb=e=>`line ${e.location.line}, column ${e.location.column}`,Q=t=>{let n=t.location.range;return n?e.X(n):cb(t)},lb={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},ub=(t,n)=>new e.x(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${Q(n)}`),db=e=>e.kind===`Number`?e.text??String(e.value):Q(e),fb=(t,n)=>new e.x(`A non-boolean expression (${ds(n)}) was used as the condition of an IF.\n${Q(t)}`),pb=(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 (${ds(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${db(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${ds(r)}.\n${Q({...t,location:{...t.location,range:{...i,end:a}}})}`)},mb=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${j(L(e))}\n${Q(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(!Lt(a))throw new e.x(`Attempted to select field "${n}" from a non-record value ${j(L(a))}\n${Q(t)}`);let o=Fn(a);if(o===`tuple`)throw ji(n);return zi(a.kind===`LazyFunction`?I(a):a,n,o===`record`?r:i)}},hb=e=>e===`1.7.4`?(t,n)=>Oi(t,n,e):void 0,gb=t=>n=>{if(!Lt(n))throw new e.x(`Attempted to apply the operator DOMAIN to a non-function\n(${ds(n)})\n${Q(t)}`);return Vi(n)},_b=(t,n)=>(r,i)=>{if(!N(r)||vn(r))throw new e.x(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Q(t)}`);return n(r,i)},vb=t=>e.at(new e.x(`TLC can't handle real numbers.\n${t.text}`),e.nt.configParseError),yb=t=>e.at(new e.x(`TLC can't handle a number this big.\n${t.text??t.value}`),e.nt.error),bb=(t,n)=>new e.z(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Q(n)}`,t),xb=(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,Sb=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Cb=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),wb=(t,n,r)=>{if(n.kind===`Name`)return Cb(t,n.name,r);let i=hi(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.x(`Argument mismatch in operator application.${t?e.X(t):``}`)}return n.names.reduce((e,t,n)=>Cb(e,t,i[n]),t)},Tb=(t,n)=>{if(Lt(t))return t;throw new e.x(`A non-function (${ds(t)}) was applied as a function.\n${Q(n)}`)},Eb=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Db=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Ob=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Expected ${n} to be a boolean but found ${L(t)}`);return t},kb=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to evaluate an expression of form P => Q when ${r} was\n${ds(t)}.\n${Q(n)}`);return t},Ab=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`Attempted to apply the operator ~ to a non-boolean\n(${ds(t)})\n${Q(n)}`);return!t},jb=(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${Q(r)}`);return t===n},Mb=(t,n)=>{if(typeof t!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${db(n)}`);return t},Nb=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Pb=(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.`},Fb=(t,n,r)=>{if(!N(t)||vn(t)){let i=L(t),a=r===`1.7.4`?void 0:Pb(t,i);throw new e.x(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${db(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${db(n)}\n${a}`)}},Ib=(e,t,n)=>(Fb(e,t,n),typeof e==`object`&&e.kind===`Interval`?Pr(e):Jr(e)??ei(e)),Lb=(e,t,n)=>n===`1.7.4`?(Fb(e,t,n),Jr(e)??ni(e)):Ib(e,t,n),Rb=e=>{if(typeof e==`object`&&e.kind===`Interval`)return ui(e),e},zb=(e,t,n)=>Rb(e)??Lb(e,t,n),Bb=(e,t,n)=>Rb(e)??Ib(e,t,n),Vb=(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},Hb=(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),[]),Ub=(e,t)=>Hb(e,e=>zb($(e,t),e,t.environment.runtime.version)),Wb=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Vb(t[n],t=>i(n-1,wb(a,e[n].pattern,t)));return i(e.length-1,n)},Gb=(e,t,n)=>Wb(e,Ub(e,t),t.scope,n),Kb=(e,t,n,r)=>{let i=Hb(e,e=>{let n=$(e,t);return{value:n,elements:zb(n,e,t.environment.runtime.version)}}),a=i.map(e=>e.elements),o=Ao(n,i.map(e=>e.value),a);return Wb(e,a,t.scope,e=>(o(),r(e)))},qb=(e,t)=>{let n=Hb(e,e=>$(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Jb=(e,t,n)=>{if(e.length===1)return wb(t,e[0].pattern,n);let r=hi(n)??[];return e.reduce((e,t,n)=>wb(e,t.pattern,r[n]),t)},Yb=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Xb=e=>Object.assign(e.value,{lambda:e}),Zb=e=>Yb(e)?e.lambda:void 0,Qb=(t,n,r)=>{let i=t.value,a=n.args.map(e=>$(e,r)),o=a.length===1?a[0]:Rr(a),s=(e,t,r)=>`In applying the function\n${j(L(i))},\nthe ${e} is:\n${j(L(t))}${r}.\n${Q(n.function)}`,c=t.bounds;if(c.length===1){if(!bi(o,i.domain))throw new e.x(s(`first argument`,o,`which is not in its domain`));return Jb(c,t.scope,o)}let l=hi(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${Q(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(!bi(r,u[n]))throw new e.x(s(i,r,`${t.pattern.kind===`Name`?``:`
|
|
1792
|
+
`}which is not in its domain`));if(t.pattern.kind===`Tuple`&&hi(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 Jb(c,t.scope,o)},$b=(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:db(t)}},ex=(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}},tx=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},nx=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),rx=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),ix=(e,t)=>{let n=qb(e.bounds,t),r=tx(n,(n,r)=>$(e.body,Db(t,Jb(e.bounds,Cb(void 0,e.name,r),n))),ex($b(e.bounds,e.body),e.bounds,n),nx(e.bounds));Xb({value:r,bounds:e.bounds,body:e.body,scope:Cb(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=ix(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?In(i):i},ax=(t,n)=>{if(typeof n!=`object`||Fn(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!It(n.domain))return n;try{let e=I(n);return Mn(e.domain,e.range)}catch(t){if(t instanceof e.x)return n;throw t}},ox=(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=>ix(t,e):qx(rx(t),n):qx(t.body,n),sx={name:``,binding:{kind:`Value`,value:!1},parent:void 0},cx=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=ox(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=e.kind===`Operator`&&e.params.length===0&&ch(e.body,t)?e=>(i===void 0?void 0:a[i])??r(Db(e,eS(e.scope)?void 0:sx)):i===void 0?e=>r(Db(e,void 0)):e=>a[i]??r(Db(e,void 0));return t.definitionEvaluators.set(e,o),o},lx=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},ux=(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)||!ih(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(()=>ax(t,ox(t,n)(a)));gr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.x)&&!e.tt(t))throw t}}),dx=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&Un(t[n],e))}catch(t){if(t instanceof e.x)return!1;throw t}},fx=(e,t)=>{let n=e.cache;if(n!==void 0&&dx(t.state,e.state)&&dx(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?bo(r,i,()=>$(e.expression,Db(t,e.scope))):$(e.expression,Db(t,e.scope));return(!e.isStreamed||ii(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},px=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),mx=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return mx(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?px(r):t.builtins.get(e)},hx=(e,t)=>A(e)?gx(e.operator,t):mx(e.operator,t.environment)??gx(e.operator,t),gx=(e,t)=>{let n=Sb(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return mx(e,t.environment)},_x=e=>e.kind===`Closure`?e.params.length:e.arity,vx=(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:gx(r,n);if(!i)throw new e.x(`Expected an operator argument at ${cb(t)}`);return i},yx=(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)=>Cb(e,n.name,t[r]),e.scope);return $(e.body,Db(n,r))},bx=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:_x(e),call:n=>yx(e,n,t)},xx=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=gx(e.name,t);return n!==void 0&&_x(n)>0},Sx=(e,t)=>e.map(e=>xx(e,t)?bx(vx(e,t),t):$(e,t)),Cx=(t,n)=>new e.x(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),wx=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Tx=(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 Tx(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([])}},Ex=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Vt(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=wx(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=A(e)?void 0:Tx(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=Sb(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:wx(e,t)}}return t=>wx(e,t)},Dx=(e,t,n,r)=>{if(t.length!==e.params.length)throw Cx(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:vx(t[a],n)}:(r?.[a]??Ex(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Ox=(e,t,n,r)=>e.kind===`Closure`?$(e.body,Db(n,Dx(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>$(e,n))):e.isLazy?e.evaluate(Xx(t,n),n):e.evaluate(Sx(t,n),n),kx=/* @__PURE__ */ new WeakMap,Ax=e=>{let t=kx.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return kx.set(e,n),n},jx=(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),a=!1;for(let o=e.length-1;o>=0;o--){let s=e[o];a||=s.isRecursive;let c=s.kind===`Operator`&&s.params.length===0&&!a?r[o].parent:i;r[o].binding=s.kind===`Function`?{kind:`Thunk`,expression:Ax(s),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:s.params.length>0||n?.impure.has(s)?{kind:`Operator`,operator:{kind:`Closure`,name:s.name,params:s.params,body:s.body,scope:c}}:{kind:`Thunk`,expression:s.body,scope:c,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(s)??!1}}let o=t.environment.coverage;return o&&o.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&o.values.set(e.binding,o.current)}),i},Mx=(t,n,r)=>{let i=Sb(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return fx(i,r);if(i?.kind===`Operator`){if(_x(i.operator)===0)return yx(i.operator,[],r);throw new e.x(`Operator ${t} is used without arguments`)}let a=Tx(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw bb(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return cx(a.definition,r.environment)(r);let o=r.environment.builtins.get(r.environment.substitutions.get(t)??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${Q(n)}`)},Nx=(e,t)=>({impure:new Set(e.filter(e=>sh(e,t,`varying`))),streamed:new Set(e.filter(e=>sh(e,t,`streamed`)))}),Px=e=>[...e.facts.ids.keys()].some(t=>sh(t,e)),Fx=e=>[...e.facts.ids.keys()].some(t=>sh(t,e,`repeated`)),Ix=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,Lx=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),Rx=e=>t=>{let n=e(t);return Un(n,e(Lx(t)))},zx=(t,n,r,i)=>a=>{i.expressions.push(t);let o=_i.sets,s=_i.callStack,c=o??[],l=c.length;_i.sets=c,_i.callStack=i;try{let e=n(a),o=Ix(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&ob(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=sb(t,i.values),o=a&&!Ve(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!Lt(o)?void 0:o;throw Bx(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,_i.sets=o,_i.callStack=s}},Bx=(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},Vx=(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}},Hx=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}}),Ux=(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 pb(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},Wx=(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)}},Gx=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=vo(n,i,e);yo(n,a),n.current=a;try{let i=t(r),o=e.kind===`SetEnumeration`||(e.kind===`SetFilter`||e.kind===`SetMap`)&&It(i)||e.kind===`SetFilter`&&typeof i==`object`&&i.kind===`FilteredSet`||(e.kind===`FunctionSet`||e.kind===`RecordSet`)&&typeof i==`object`&&i.kind===e.kind||e.kind===`Apply`&&e.operator===`SUBSET`&&typeof i==`object`&&i.kind===`Subset`;return typeof i==`object`&&o&&n.values.set(i,a),i}finally{n.current=i}},Kx=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=wS(e,t),i=t.callStack,a=i&&Vf.get(e),o=i?zx(e,r,t,i):r,s=i&&a?Wx(e,a,o,i):o,c=t.coverage,l=c?Gx(e,s,c):s;return t.evaluators.set(e,l),l},qx=(e,t)=>{if(t.callStack||t.coverage)return Kx(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Nh(e,t)??Kx(e,t);return t.entryEvaluators.set(e,r),r},$=(e,t)=>qx(e,t.environment)(t),Jx=(e,t)=>{let n=e.name,r=A(e)?void 0:Tx(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw bb(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??=cx(e,t))(r)}return t=>Mx(n,e,t)},Yx=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||A(e))return!0;let n=mx(e.name,t);return n===void 0||_x(n)===0},Xx=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>$(e,t),expression:e})),Zx=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Xx(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Yx(t[0],n)){let e=Kx(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Yx(t[0],n)&&Yx(t[1],n);if(i&&a){let e=Kx(t[0],n),r=Kx(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Sx(t,n),n)},Qx=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Cx(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Ex(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:vx(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},$x=(e,t,n)=>{let r=Qx(e,t,n),i;return t=>(i??=qx(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},eS=e=>{for(let t=e;t!==void 0;t=t.parent){let e=t.binding;if(e.kind!==`Operator`||e.operator.kind!==`Closure`||e.operator.params.length===0)return!1;let n=e.operator.scope;for(;n!==void 0&&n!==t;)n=n.parent;if(n!==t)return!1}return!0},tS=/* @__PURE__ */ new Set([`\\cup`,`\\cap`,`\\`]),nS=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=Kx(r[0],n),i=Kx(r[1],n);return n=>!kb(e(n),t,`P`)||kb(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=Kx(r[0],n);return n=>Ab(e(n),t)}if(t.operator===`<=>`){let e=Kx(r[0],n),i=Kx(r[1],n);return n=>jb(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw ub(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=A(t)?void 0:mx(t.operator,n);if(i?.kind===`Closure`)return $x(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=Kx(r[0],n),i=gb(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Bf.has(t)&&!fh(r[0],n),a=n.tlcEvalValues;return n=>{if(!e||!eS(n.scope))return i.evaluate(Xx(r,n),n);let o=a.get(t);if(o!==void 0)return o;let s=i.evaluate(Xx(r,n),void 0);return a.set(t,s),s}}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2){let e=Kx(r[0],n),a=Kx(r[1],n),o=_b(t,i.evaluateBinary),s=n.coverage;return s?t=>{let n=e(t),r=a(t);if(typeof n!=`object`||n.kind!==`Set`||!s.values.has(n))return o(n,r);let i=n.elements.findIndex(e=>!bi(e,r));return xo(s,n,(i===-1?n.elements.length:i)+1),i===-1}:t=>o(e(t),a(t))}let a=n.coverage,o=i?.kind===`Builtin`?i.evaluateBinary:void 0;if(a&&o&&tS.has(t.operator)&&r.length===2){let e=Kx(r[0],n),i=Kx(r[1],n);return n=>{let r=e(n),s=i(n);return So(a,t.operator,r,s,o(r,s))}}if(i?.kind===`Builtin`)return Zx(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 s=r.map(e=>Ex(e,n));return i=>{let a=gx(t.operator,i);if(a)return Ox(a,r,i,s);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 ${cb(t)}`)}},rS=(e,t)=>{let n=e.kind===`Forall`,r=Kx(e.body,t),i=e.bounds[0],a=t.coverage;if(a)return t=>Kb(e.bounds,t,a,i=>Mb(r(Db(t,i)),e)!==n)?!n:n;if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=Kx(i.set,t);return s=>Vb(zb(o(s),i.set,t.runtime.version),t=>Mb(r(Db(s,Cb(s.scope,a,t))),e)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let i=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return a=>{let s=Hb(o,e=>zb(Kx(e,t)(a),e,t.runtime.version)),c=(t,o)=>t<0?Mb(r(Db(a,o)),e)!==n:Vb(s[t],e=>c(t-1,Cb(o,i[t],e)));return c(o.length-1,a.scope)?!n:n}}return t=>Gb(o,t,i=>Mb(r(Db(t,i)),e)!==n)?!n:n},iS=(e,t)=>{if(e.kind===`Tuple`)return Rr(e.names.map(e=>{let n=Sb(t,e);return n?.kind===`Value`&&n.value}));let n=Sb(t,e.name);return n?.kind===`Value`?n.value:void 0},aS=/* @__PURE__ */ new WeakSet,oS=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&aS.add(e)},sS=/* @__PURE__ */ new WeakMap,cS=e=>{if(sS.has(e))return sS.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=He(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),Ve(e).every(n)},r=n(e)?[...t]:void 0;return sS.set(e,r),r},lS=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Sb(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),uS=e=>aS.has(e),dS=(t,n)=>{let r=uS(t),i=Kx(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(Db(t,Cb(t.scope,n,e)));if(Pt(e))return ui(e),Ft(e,r),p(e,t);let a=Ir(e),s=Mn(a,a.map(r));return It(e)?s:(s.lambdaDomain=e,In(s))}let n=[],r=Hb(a,(n,r)=>Bb(a.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return Wb(a,r,t.scope,e=>{let r=a.length===1?iS(o.pattern,e)??!1:Rr(a.map(t=>iS(t.pattern,e)??!1));return n.push([r,i(Db(t,e))]),!1}),Dr(n)},l=$b(a,t.body),u=nx(a),d=cS(t.body),f=n.coverage,p=(e,r)=>{let o=lS(r.scope,d),s=Db(r,o),c=e=>i(Db(s,Jb(a,o,e))),p=f&&!n.callStack?f.current:-1,m=Xb({value:tx(e,f?e=>f.current===-1?c(e):bo(f,p,()=>c(e)):c,ex(l,a,e),u),bounds:a,body:t.body,scope:o});return a.length===1?In(m):m},m=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!P(n))return p(n,i);if(!(a.length===1?It(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(It))){if(m)return p(n,i);try{return c(n,i)}catch(t){if(!(t instanceof e.x))throw t;return p(n,i)}}if(!m)return c(n,i);try{return c(n,i)}catch(e){throw Vx(m,t,e),e}},createLazy:p}},fS=(e,t)=>{let n=dS(e,t).build,r=e.bounds,i=t.coverage;if(i)return t=>{let a=qb(r,t),o=n(a,t),s=r.length===1||typeof a!=`object`||a.kind!==`ProductSet`?[a]:a.factors;return(typeof o!=`object`||o.kind!==`LazyFunction`)&&s.every(It)&&i.current!==-1&&i.covered.has(e)&&jo(i,i.current,s),o};if(r.length===1&&r[0].pattern.kind===`Name`){let e=Kx(r[0].set,t);return t=>n(e(t),t)}return e=>n(qb(r,e),e)},pS=(e,t)=>{let n=aS.has(e);n&&oS(e.function);let r=Kx(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=>Kx(e,t))}),value:Kx(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Rr(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Db(i,Cb(i.scope,`@`,e))):Hi(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(Ze.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Q(e.function)}`)}return n}},mS=(t,n)=>{let r=Kx(t.predicate,n),i=t.bound.pattern,a=db(t.predicate),o=t.predicate.location.range&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:a},s=n.coverage,c=(n,r,l,u)=>{let d=(t,n)=>{if(i.kind===`Tuple`&&hi(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=l(Db(r,wb(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},f=e=>c(n,{...r,environment:e},Kx(t.predicate,e),-1);return!s||u===-1?{kind:`FilteredSet`,base:n,test:d,source:o,rebind:f}:{kind:`FilteredSet`,base:n,test:(e,t)=>bo(s,t?-1:u,()=>d(e,t)),startPass:e=>{let t=To(s,n);return r=>{t?.next(),Do(s,n,r),s.secondary[u]++;let i=bo(s,u,()=>d(r,!1));return e&&i&&s.secondary[u]++,i}},source:o,rebind:f}};return(e,t,n=-1)=>c(e,t,r,n)},hS=e=>A(e)||e.kind===`OperatorReference`||Ve(e).some(hS),gS=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!hS(e.predicate)&&!oh([e.predicate],t,`varying`),_S=(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 ${ds(t)}.\n${db(n.predicate)}`);return t},vS=(t,n,r,i)=>{if(!N(t)||vn(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${Q(n)}`);return _r(t),Bb(t,r,i)},yS=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${Q(t)}`),bS=(t,n)=>{if(t.kind===`SetFilter`){let e=Kx(t.predicate,n),r=Kx(t.bound.set,n),i=mS(t,n),a=t.bound.pattern,o=n.coverage,s=gS(t,n);return n=>{let c=r(n);if(!It(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(Db(n,wb(n.scope,a,i)));if(_S(o,t))Nt(l,i);else if(s)break}return o&&xo(o,c,d+1),jn(l)}}if(t.kind===`SetMap`){let e=Kx(t.expression,n),r=n.coverage;return n=>{let i=[],a=t=>(Nt(i,e(Db(n,t))),!1);return r?Kb(t.bounds,n,r,a):Gb(t.bounds,n,a),Sr(i)}}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${Q(t)}`)};let i=Kx(t.body,n),a=Kx(r,n),o=n.coverage;return n=>{let s=a(n),c=vS(s,t,r,n.environment.runtime.version),l=o&&Oo(o,s,c,!0),u,d=t.pattern;if(Vb(c,r=>{if(l?.next(),d.kind===`Tuple`&&hi(r)?.length!==d.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${Q(t)}`);let a=wb(n.scope,d,r);return Mb(i(Db(n,a)),t)?(u=iS(d,a),!0):!1}),u!==void 0)return u;throw l?.next(),yS(t)}},xS=e=>[...e].sort((e,t)=>Tn(e.name,t.name)),SS=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),CS=(e,t)=>{let n=xS(e),r=e.map(e=>Kx(e.value,t));if(SS(n))return t=>zr(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=>qt(i,t,r.map(t=>t(e)),a)}return e=>Br(i,r.map(t=>t(e)))},wS=(t,n)=>{let r=e=>Kx(e,n);switch(t.kind){case`Number`:{let e=t.value;return Vt(e)?()=>e:()=>{throw yb(t)}}case`Decimal`:return()=>{throw vb(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Jx(t,n);case`Apply`:return nS(t,n);case`Bracket`:return()=>{throw new e.x(`A bracket without a function or subscript is not an expression at ${cb(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.x(`An operator cannot be used as a value at ${cb(t)}`)};case`And`:{let e=t.operands.map(r);return Ux(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw pb(t,r,i);if(!i)return!1}return!0})}case`Or`:{let e=t.operands.map(r);return Ux(t,e,n.callStack)??(n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw pb(t,r,i);if(i)return!0}return!1})}case`Prime`:{let e=r(t.expression);return t=>e(Lx(t))}case`Unchanged`:return Rx(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 fb(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 (${ds(n)}) was used as a condition of a CASE. ${db(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${Q(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(Db(n,jx(t.definitions,n)))}case`Forall`:case`Exists`:return rS(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?ub(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${Q(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return bS(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>Sr(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>Rr(e.map(e=>e(t)))}case`FunctionConstruction`:return fS(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 CS(t.fields,n);case`RecordSet`:{let e=xS(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 pS(t,n);case`ExceptAt`:return n=>{let r=Sb(n.scope,`@`);if(r?.kind!==`Value`)throw new e.x(`@ appears outside an EXCEPT at ${cb(t)}`);return r.value};case`FunctionApplication`:{oS(t.function);let e=r(t.function),i=n=>Tb(e(Eb(n)),t),a=t.args.map(r),o=hb(n.runtime.version);if(a.length===1){let e=a[0];return t=>zi(i(t),e(t),o)}return e=>zi(i(e),Rr(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=mb(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=Rx(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${Q(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>Zy(e,t)}case`Label`:return r(t.body);case`Selection`:return r(t.expression);case`Subexpression`:return()=>{throw new e.x(`The subexpression reference at ${cb(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw ub(lb[t.kind],t)}}},TS=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},ES=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^$i(e[t]),16777619),r=Math.imul(r^aa(e[t]),1540483477);t[0]=TS(n)||1,t[1]=TS(r)},DS=()=>{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)}}},OS=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),kS=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Wi(t,$i(e[n]));return t&1073741823},AS=(e,t)=>{for(let n=0;n<t.length;n++)if(!Gn(e[n],t[n]))return!1;return!0},jS=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,MS=(e,t,n)=>{let r=e.slots.length-1;for(let i=jS(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&AS(e.states[r-1],n))return r-1}},NS=(e,t,n)=>{let r=e.slots.length-1,i=jS(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},PS=(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&&NS(e,t[n],t[n+1])}NS(e,t,n+1)},FS=(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}},IS=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),LS=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return FS(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},RS=e=>Atomics.load(e.used,0)*2>=e.slots.length,zS=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&FS(t,n);return{slots:t,used:e.used}},BS={kind:`Boolean`,value:!0},VS={kind:`Boolean`,value:!1},HS=e=>e?BS:VS,US=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,WS=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,GS=(e,t)=>({kind:e,body:t}),KS=(e,t,n)=>({kind:e,operands:[t,n]}),qS=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?qS(e,t.operands).operands:[t])}),JS=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return JS(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,JS(t)),0)}},YS=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 YS(e.body);case`And`:case`Or`:return e.operands.some(YS)}},XS=/* @__PURE__ */ new WeakMap;let ZS=0;const QS=e=>{let t=XS.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`#${ZS++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(QS).join(`,`)})`;default:return`${e.kind}(${QS(e.body)})`}})();return XS.set(e,n),n},$S=(e,t)=>e===t||QS(e)===QS(t),eC=(e,t)=>{let n=QS(t);return e.some(e=>e===t||QS(e)===n)},tC=e=>e===`And`?`Or`:`And`,nC=(e,t)=>{switch(e.kind){case`Boolean`:return t?HS(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?GS(`Not`,e):e;case`Not`:return nC(e.body,!t);case`And`:case`Or`:return qS(t?tC(e.kind):e.kind,e.operands.map(e=>nC(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return GS(n,nC(e.body,t))}}},rC=e=>{switch(e.kind){case`Boolean`:return HS(!e.value);case`Not`:return e.body;case`And`:case`Or`:return qS(tC(e.kind),e.operands.map(rC));case`Always`:return GS(`Eventually`,rC(e.body));case`Eventually`:return GS(`Always`,rC(e.body));default:return GS(`Not`,e)}},iC=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=iC(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return HS(t)}return n.length===0?HS(!t):n.length===1?n[0]:qS(e.kind,n)}case`Not`:{let t=iC(e.body);return t.kind===`Boolean`?HS(!t.value):GS(`Not`,t)}case`Always`:case`Eventually`:{let t=iC(e.body);return GS(e.kind,t.kind===e.kind?t.body:t)}default:return e}},aC=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,oC=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=oC(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=>qS(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=oC(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=aC(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:qS(`Or`,e);n.push(GS(`Always`,GS(`Eventually`,t)))}return qS(`Or`,n)}case`Not`:return US(t.body)?t:oC(rC(t.body));default:return t}},sC=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?sC(e.operands[0]):qS(e.kind,e.operands.map(sC));case`Not`:return e.body.kind===`Not`?sC(e.body.body):GS(`Not`,sC(e.body));case`Always`:case`Eventually`:case`Next`:return GS(e.kind,sC(e.body));default:return e}},cC=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return cC(e.operands[0]);let t=Math.floor(e.operands.length/2);return KS(e.kind,cC(qS(e.kind,e.operands.slice(0,t))),cC(qS(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return GS(e.kind,cC(e.body));default:return e}},lC=(e,t)=>{e.kind===`Eventually`&&!eC(t,e)&&t.push(e),`body`in e&&lC(e.body,t),`operands`in e&&e.operands.forEach(e=>lC(e,t))},uC=e=>{let t=e.filter(WS),n=e.flatMap(e=>e.kind===`Not`&&WS(e.body)?[e.body]:[]);return!t.some(e=>eC(n,e))},dC=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,GS(`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},fC=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:GS(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},pC=(e,t,n)=>e.flatMap(e=>{let r=fC(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),mC=e=>[...new Set(e.map(QS))].sort().join(`|`),hC=(e,t)=>{let n=new Set(t.map(mC));return[...e.filter(e=>!n.has(mC(e))),...t]},gC=e=>{let t=dC(e),n=pC(t,`Always`,`And`),r=pC(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=fC(t,`Eventually`,`Or`);if(n&&!(eC(e,n.first)||eC(e,n.second)))return hC(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(eC(e,t.first)||eC(e,t.second))&&!eC(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!uC(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=fC(t[e],`Always`,`And`);n&&(eC(t,n.first)||t.push(n.first),eC(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)eC(t,e.first)&&eC(t,e.second)&&!eC(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!uC(t)?[]:i(t)};return a(e)},_C=e=>({particle:e,successors:[],statePredicates:e.filter(e=>JS(e)<=1)}),vC=e=>{let t=gC([e]).map(_C),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=mC(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 gC(n)){let n=mC(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(_C(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},yC=(e,t)=>!eC(e,t)||eC(e,t.body),bC=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&JS(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=aC(t);if(r){let e=JS(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(YS(t))throw new e.x(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},xC=(e,t)=>{let n=e.findIndex(e=>$S(e,t));return n===-1?(e.push(t),e.length-1):n},SC=e=>{let t=oC(iC(nC(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=sC(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])bC(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:qS(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:$S(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&cC(e.formula),n=[];t&&lC(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>xC(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>xC(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>xC(i,e))}));return{tableau:t&&vC(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},CC=()=>e.at(new e.x(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.nt.livenessEvaluationFailure),wC=/* @__PURE__ */ new Set([`~>`,`-+->`]),TC=/* @__PURE__ */ new WeakSet,EC=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),DC=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),OC=(t,n)=>new e.x(`TLC cannot handle the temporal formula ${Q(t)}${n===void 0?``:`:\n${n}`}`),kC=(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=kC(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Sb(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=Nb(e,n);if(t)return lh(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 Yf(e,(e,o)=>(a=Math.max(a,kC(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(wC.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:mx(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Dx(o,e.args,DC(n,t)))}default:return l(e)}},AC=(t,n)=>{try{return Ub(t,n)}catch(t){if(!(t instanceof e.x))throw t;if(!st(t))return;throw e.at(new e.x(`${e.G}${t.message}`),e.nt.error)}},jC=(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)=>jC(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,Q(e)));if(t.kind===`Label`)return o(t.body,n);if(t.kind===`Selection`)return o(t.expression,n);if(t.kind===`Let`)return o(t.body,MC(t,n,r));if(t.kind===`Identifier`){let i=A(t)?Sb(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return o(i.expression,i.scope,TC.has(i)?t.name:a.name);let s=r.constants.has(t.name)?void 0:Nb(t.name,r);if(!i&&s?.kind===`Operator`&&s.params.length===0&&(lh(s,r)>0||lx(s,r)===void 0)){if(a.expanding.has(s))throw e.Y();return o(s.body,void 0,!a.isSubstituted&&r.instanceNames.get(t.name)||s.name,/* @__PURE__ */ new Set([...a.expanding,s]),s)}}let s=DC(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||kC(t,n,r)===3)){let e=hx(t,s),n=A(t)?void 0:Nb(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,Dx(e,t.args,s),a.isSubstituted&&n?n.name:t.operator,a.expanding,n)}let c=i&&t.kind===`Forall`&&t.bounds.every(e=>kC(e.set,n,r)===0),l=c?AC(t.bounds,s):void 0;if(c&&l){let e=[];if(Wb(t.bounds,l,n,n=>(e.push(...o(t.body,n,Q(t.body))),!1)),e.length===0)throw CC();return e}return[{expression:t,scope:n,name:a.name,path:a.path}]},MC=(e,t,n)=>{let r=jx(e.definitions,DC(n,t),Nx(e.definitions,n));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&TC.add(e.binding);return r},NC=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?kC(t,n,r):a;if(o===0){let i=$(t,DC(r,n));if(typeof i!=`boolean`)throw new e.x(`TLC expected a boolean value, but did not find one. ${db(t)}`);return HS(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.Y();o++;let c=p(t,n);o--;let l=JS(c),u=l===0&&kC(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=DC(r,t),o=A(e)||Nb(n,r)===void 0?Sb(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&TC.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:A(e)?gx(n,a):mx(n,r),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?EC.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,qS(f,n))}if(c?.kind!==`Closure`)throw OC(e);let m=!A(e)&&Nb(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>$(e,a)),s(c.body,Dx(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:OC(t)}},u=(t,n)=>{let i=kC(t,n,r),o=[],s=t.kind===`Forall`;try{Gb(t.bounds,DC(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 OC(t,s&&!st(r)?r.message:void 0)}return o.length===0?HS(s):d(t,n,qS(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=JS(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,qS(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,qS(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let n=kC(e,t,r);switch(e.kind){case`Label`:return p(e.body,t);case`Selection`:return p(e.expression,t);case`Let`:return p(e.body,MC(e,t,r));case`Apply`:{let n=e.args;if(e.operator===`~`&&!A(e))return d(e,t,GS(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,KS(`Or`,GS(`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&&kC(e.condition,t,r)===0){let n=$(e.condition,DC(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,KS(`Or`,KS(`And`,n,p(e.consequent,t)),KS(`And`,GS(`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===`~>`?GS(`Always`,KS(`Or`,GS(`Not`,p(e.args[0],t)),GS(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return GS(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=GS(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?GS(`Always`,GS(`Eventually`,KS(`Or`,i,a))):KS(`Or`,GS(`Eventually`,GS(`Always`,i)),GS(`Always`,GS(`Eventually`,a)))}default:throw OC(e)}};return p(t,n)},PC=t=>({holdsState:(n,r)=>{let i={environment:t,scope:n.scope,state:r,next:void 0},a=n.kind===`State`?$(n.expression,i):Zy(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&&vr($(o,{environment:t,scope:a,state:r,next:void 0}),$(o,{environment:t,scope:a,state:i,next:void 0})))return!1;let s=$(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}}),FC=(t,n,r,i,a)=>{let o=e=>FC(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 FC(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`)}},IC=(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)=>IC(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 FC(e,t[r],t[a(r)],PC(i),/* @__PURE__ */ new Map)}},LC=`UnnamedAction`,RC={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},zC=e=>{let t=e.range??RC;return zr([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},BC=(e,t)=>{let n=[[`name`,e.name],[`location`,zC(e.location)]];return e.parameters.length>0&&n.push([`context`,zr(e.parameters)],[`parameters`,Rr(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),zr(n)},VC=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),HC=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),UC=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,WC=e=>e.kind===`Apply`?e.args:[],GC=(e,t,n)=>{let r=UC(e);if(r===void 0)return;if(A(e)){let e=Sb(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=mx(r,n);return i?.kind===`Closure`?i:void 0},KC=(t,n)=>{try{return $(t,HC(n,void 0)),!0}catch(t){if(t instanceof e.b)return!1;throw t}},qC=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&ih(e,t)&&KC(e.body,t),JC=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&qC(e,t),YC=(e,t)=>{let n=Nb(e.name,t);return n?.body===e.body&&JC(n,t)},XC=(e,t)=>{if(e.kind!==`Identifier`||!A(e))return;let n=Sb(t,e.name);return n?.kind===`Thunk`?n:void 0},ZC=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:MC(e,t,n)};let r=XC(e,t);return r&&{expression:r.expression,scope:r.scope}},QC=(e,t,n,r)=>t.kind===`Apply`?Dx(e,t.args,HC(r,n)):e.scope,$C=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Sb(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),ew=(t,n)=>{try{return t()}catch(t){if(t instanceof e.b)return n();throw t}},tw=(e,t,n,r,i)=>{let a=WC(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=>kC(e,n,i)!==0)?o():ew(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),$(e,HC(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},nw=(t,n,r,i,a)=>{let o=()=>({name:r?.name??LC,location:t.location,parameters:$C(r,n),expression:t,scope:n});if(Bv.has(t.kind))throw e.at(new e.x(`${e.K}The next state relation is not a boolean expression.\n${db(t)}`),e.nt.error);switch(t.kind){case`Let`:return nw(t.body,MC(t,n,i),r,i,a);case`Label`:return nw(t.body,n,r,i,a);case`Selection`:return nw(t.expression,n,r,i,a);case`Or`:return t.operands.flatMap(e=>nw(e,n,r,i,a));case`Exists`:return ew(()=>{let e=[];return Gb(t.bounds,HC(i,n),n=>(e.push(...nw(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=A(t)?void 0:a.get(UC(t)??``),c=GC(t,n,i);if(s)return tw(s,t,n,c,i);if(!c)return[o()];let l=WC(t),u=A(t)?c.name:i.instanceNames.get(UC(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return YC(c,i)||l.some(e=>kC(e,n,i)!==0)?d():ew(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:$(t,HC(i,n))},parent:e}),c.scope);return nw(c.body,e,{...c,name:u},i,a)},d)},rw=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>rw(e,t,n,r,i,o),s=(e,t,n)=>VC(e,Hf(t,a),n),c=ZC(e,t,n);if(c){o(c.expression,c.scope);return}let l=GC(e,t,n);if(l&&YC(l,n))return;let u=l?[...a,...Vf.get(l.body)??[]]:a;if(l&&l.params.length===0){if(kC(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,Dx(l,e.args,HC(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(LC,e,t));return}let d=kC(e,t,n);d<=1?r.inits.push(s(LC,e,t)):d===3&&r.temporals.push(s(LC,e,t))},iw=(e,t,n,r,i)=>{let a=(t,n)=>iw(e,t,n,r,i),o=ZC(t,n,r);if(o){a(o.expression,o.scope);return}let s=GC(t,n,r);if(s&&YC(s,r))return;if(s&&s.params.length===WC(t).length){a(s.body,QC(s,t,n,r));return}if(t.kind===`Forall`&&ew(()=>(Gb(t.bounds,HC(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(VC(e,a)):kC(a,n,r)<2?i.invariants.push(VC(e,a)):i.impliedTemporals.push(VC(e,t));return}let c=kC(t,n,r);c<=1?i.impliedInits.push(VC(e,t)):c===3&&i.impliedTemporals.push(VC(e,t))},aw=(e,t)=>{let n=Nb(e,t);return n?.kind===`Operator`&&!JC(n,t)?n:void 0},ow=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:aw(e.specification,t);a&&(rw(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:LC,location:e.frames[0].location,parameters:[],expression:Hf(e.expression,e.frames),scope:e.scope}]:nw(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:mx(e.init,t);o?.kind===`Closure`&&r.inits.push(VC(e.init??``,o.body));let s=e.next===void 0?void 0:mx(e.next,t);return s?.kind===`Closure`&&r.actions.push(...nw(s.body,s.scope,s,t,n)),r},sw=(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);if(e.kind===`Selection`)return i(e.expression,t);let a=ZC(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&A(e)?Sb(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=GC(e,t,n);if(!s||s.params.length!==WC(e).length)return!0;let c=Nb(s.name,n);return c?.body===s.body&&qC(c,n)?!0:i(s.body,QC(s,e,t,n))};return i(e,t)?r:void 0},cw=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,lw=(t,n,r=!1)=>`${t.name===LC?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:cw(t)} ${e.X(t.location.range??RC)}`,uw=e=>`${e.name}${cw(e)}`,dw=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=aw(e,n);t&&i.invariants.push(VC(e,t.body))}),t.properties.forEach(e=>{let t=aw(e,n);t&&iw(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>xr(e.map(e=>{let n=a&&t&&Ko(a,t,e.expression);return BC(e,n&&zr(n))})),s=e=>xr(e.flatMap(e=>{let t=aw(e,n);return t?[zr([[`name`,t.name],[`location`,zC(t.location)]])]:[]}));return zr([[`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`,xr(n.variables.map((e,t)=>zr([[`name`,e],[`location`,zC(r[t])],...a?[[`coverage`,zr([[`distinct`,Po(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},fw=2**50,pw=2**51,mw=(e,t,n,r)=>({fingerprint:e,tableau:t,position:n,stateChecks:r,successors:[],actionChecks:[],stepPositions:[],number:0}),hw=(e,t,n,r)=>{e.successors.push(t),e.actionChecks.push(n),e.stepPositions.push(r)},gw=(e,t)=>e.stepPositions[e.successors.indexOf(t)],_w=e=>{let t=e[e.length-1];return--e.length,t},vw=(e,t,n,r)=>{let i={initial:[],isPartial:!1},a=t.tableau;if(!a){let t=/* @__PURE__ */ new Map,r=mw(e[0],-1,0,n.getStates(0));hw(r,r,n.getStutters(0),0),t.set(e[0],r),i.initial.push(r);for(let i=1;i<e.length;i++){let a=t.get(e[i]);if(a===void 0){let a=mw(e[i],-1,i,n.getStates(i));hw(a,a,n.getStutters(i),i),hw(r,a,n.getSteps(i),i),t.set(e[i],a),r=a}else r.successors.includes(a)||hw(r,a,n.getSteps(i),i),r=a}return i}let o=/* @__PURE__ */ new Map,s=e=>{let t=o.get(e)??[];return o.set(e,t),t},c=(t,o,s,c,l,u)=>{for(let d=0;d<t.length;d++){let f=t[d],p=a.nodes[f.tableau].successors;for(let t=0;t<p.length;t++){let a=p[t],d=s[a];if(d===void 0){if(!n.isConsistent(a,c))continue;let t=mw(e[c],a,c,l);hw(f,t,u,c),o.push(t),s[a]=t}else f.successors.includes(d)||hw(f,d,u,c),d.position!==c&&(i.isPartial=!0,r&&!o.includes(d)&&o.push(d))}}},l=s(e[0]),u=n.getStates(0),d=n.getStutters(0);for(let t=0;t<a.initialCount;t++){if(!n.isConsistent(t,0))continue;let r=mw(e[0],t,0,u);i.initial.push(r),l[t]=r}for(let e of i.initial)for(let t of a.nodes[e.tableau].successors){let n=l[t];n?hw(e,n,d,0):i.isPartial=!0}let f=[...i.initial];r&&c(f,f,l,0,u,d);for(let t=1;t<e.length;t++){let r=s(e[t]),i=n.getStates(t),a=[];c(f,a,r,t,i,n.getSteps(t)),c(a,a,r,t,i,n.getStutters(t)),f=a}return i},yw=(e,t,n)=>{let r=t.promises,i=t.tableau?.nodes??[],a=[],o=1,s=fw+1,c=pw+1,l=s,u=c,d=s,f=c,p=t.models[0],m,h=(e,t)=>{let n=e.actionChecks[t],r=p.eventuallyAlways;for(let e=0;e<r.length;e++)if(!n[r[e]])return!1;return!0},g=t=>{let n=[],a=c-1,o=p.infinitelyOftenStates,s=p.infinitelyOftenActions,l=o.map(()=>!1),u=s.map(()=>!1),d=r.map(()=>!1),f=o.length+s.length+r.length,m=t;for(;f>0;){m.number=c;let e=f;search:for(;;){for(let e=0;e<o.length;e++)!l[e]&&m.stateChecks[o[e]]&&(l[e]=!0,f--);for(let e=0;e<r.length;e++)!d[e]&&yC(i[m.tableau].particle,r[e])&&(d[e]=!0,f--);if(f<=0)break;let t,p,h=f;for(let e=0;e<m.successors.length;e++){let r=m.successors[e],i=r.number;if(a<=i&&i<=c){t=r;for(let t=0;t<s.length;t++)!u[t]&&m.actionChecks[e][s[t]]&&(u[t]=!0,f--)}if(f<h){n.push(m),m=r,c++;break search}a<=i&&i<c&&(p=r)}if(f<e&&t){n.push(m),m=t,c++;break}for(;p===void 0;){m=_w(n);for(let e=0;e<m.successors.length;e++){let t=m.successors[e];if(a<=t.number&&t.number<c){n.push(m),p=t;break}}}n.push(m),m=p,m.number=c}}c++,m.number=c;close:for(;m!==t;){let e=!1;for(let r=0;r<m.successors.length;r++){let i=m.successors[r];if(a<=i.number&&i.number<c){if(n.push(m),i===t)break close;e=!0,m=i,m.number=c;break}}e||(m=_w(n))}n.length===0&&n.push(m);let h=[];for(let n=0;n<=t.position;n++)(n===0||e[n]!==e[n-1])&&h.push(n);let g=h.length;for(let e=1;e<n.length;e++)n[e].fingerprint!==n[e-1].fingerprint&&h.push(gw(n[e-1],n[e]));let _=n[n.length-1];return{positions:h,cyclePosition:g,backPosition:_.fingerprint===t.fingerprint?void 0:gw(_,t)}},_=e=>{let t=p.infinitelyOftenStates,n=p.infinitelyOftenActions,a=t.map(()=>!1),o=n.map(()=>!1),s=r.map(()=>!1),l=[e];for(e.number++;l.length>0;){let e=_w(l);for(let n=0;n<t.length;n++)a[n]||(a[n]=e.stateChecks[t[n]]);for(let t=0;t<e.successors.length;t++){let r=e.successors[t],i=r.number;if(i>=c)for(let r=0;r<n.length;r++)o[r]||(o[r]=e.actionChecks[t][n[r]]);i===c&&(r.number++,l.push(r))}for(let t=0;t<r.length;t++)yC(i[e.tableau].particle,r[t])&&(s[t]=!0)}c+=2,m!==void 0||a.includes(!1)||o.includes(!1)||s.includes(!1)||(m=g(e))},v=e=>{let t=e.successors.indexOf(e);return t!==-1&&d<=e.number&&h(e,t)},ee=e=>{let t=_w(a);if(t===e&&!v(e))return e.number=c++,!1;for(t.number=c;t!==e;)t=_w(a),t.number=c;return!0},y=e=>{let t=s++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number;d<=i&&h(e,n)&&((i<l||f<=i&&i<u)&&(i=y(r)),i<t&&(t=i))}return t===e.number&&ee(e)&&_(e),t},b=e=>{let t=_w(a);if(t===e&&!e.successors.includes(e)){e.number=fw;return}let n=[];for(d=s++,f=c,t.number=d,n.push(t);t!==e;)t=_w(a),t.number=d,n.push(t);return n},x=e=>{let n=b(e);if(n)for(let e of t.models){p=e,l=s,u=c;for(let e=n.length-1;e>=0;e--)n[e].number<u&&y(n[e])}},te=e=>{let t=o++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number===0?te(r):r.number;i<t&&(t=i)}return t===e.number&&x(e),t};for(let e of n)if(e.number===0&&te(e),m)return m},bw=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=(t,n,i)=>(a.clear(),FC(t,e[n],i===void 0?void 0:e[i],r,a)),s=e.map((e,t)=>t),c=e.map((e,t)=>t);if(i){let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map;for(let i=0;i<e.length;i++){let a=n.get(t[i])??i;if(n.set(t[i],a),AS(e[a],e[i])&&(s[i]=a),i===0)continue;let o=s[i-1]*e.length+s[i];c[i]=r.get(o)??i,r.set(o,c[i])}}let l=n.map(e=>{let t=[],n=[],r=[],a=[],l=e.tableau?.nodes.map(e=>e.statePredicates)??[];return{getStates:n=>{let r=s[n];return t[r]??=e.stateChecks.map(e=>o(e,r,void 0))},getSteps:t=>{let r=c[t];return n[r]??=e.actionChecks.map(e=>o(e,r-1,r))},getStutters:t=>{let n=s[t];return r[n]??=e.actionChecks.map(e=>o(e,n,n))},isConsistent:(e,t)=>{let n=s[t],r=a[n]??=[],c=i?r[e]:void 0;return c===void 0?(r[e]=l[e].every(e=>o(e,n,void 0)),r[e]):c}}}),u=[];for(let e=0;e<n.length;e++){let r=vw(t,n[e],l[e],!1),i=yw(t,n[e],r.initial);if(i)return i;r.isPartial&&u.push(e)}for(let e of u){let r=vw(t,n[e],l[e],!0),i=yw(t,n[e],r.initial);if(i)return i}},xw=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return xw(e.body);case`And`:case`Or`:return e.operands.some(xw);default:return!1}},Sw=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Cw=e=>e.promises.some(e=>xw(e.body))||e.models.some(e=>!Sw(e)),ww=(e,t)=>e.every((e,n)=>Gn(e,t[n])),Tw=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Ew=e=>({data:e(1024),length:0,create:e}),Dw=(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)},Ow=(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}},kw=e=>new Int32Array(e).fill(-1),Aw=(e,t)=>(e.edgeStarts[t]??-1)!==-1,jw=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Mw=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Nw=(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),Pw=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Fw=2**53-1,Iw=(e,t,n)=>{let r=t.map(e=>NC(e.expression,e.scope,n)),i=e.map(e=>NC(e.expression,e.scope,n)),a=i.map(e=>GS(`Not`,e)),o=a.length===1?a[0]:qS(`Or`,a);return{formula:r.length===0?o:qS(`And`,[...r,o]),checks:i}},Lw=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}]:[])}},Rw=(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=>Rw(e,t));return;default:Rw(e.body,t)}},zw=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>Rw(e,t));return[...t]},Bw=e=>zw(e).flatMap(e=>Lw(e).map(e=>e.expression)),Vw=(e,t)=>{let n=/* @__PURE__ */ new Set;Rw(e,n);let r=[...n].flatMap(Lw);return r.every(e=>e.scope===void 0)?!oh(r.map(e=>e.expression),t,`repeated`):!Fx(t)},Hw=(t,n,r,i,a,o)=>[...new Set(t.filter((t,s)=>{try{return!IC(n[s],r,i,0,a)}catch(t){if(!o||!(t instanceof e.x))throw t;return o.push(t),!1}}).map(e=>e.name))],Uw=(e,t,n)=>{if(e.length===0)return;let r=Iw(e,t,n),i=SC(r.formula),a=PC(n),o=Vw(r.formula,n);return{solutions:i,findTraceViolation:(t,s)=>{let c=bw(t,s,i,a,o);if(!c)return;let l=[],u=Hw(e,r.checks,c.positions.map(e=>t[e]),c.cyclePosition-1,n,l);return{...c,properties:u,failures:l}}}},Ww=(e,t,n,r)=>{if(e.length===0)return;let i=Iw(e,t,n),a=Vw(i.formula,n),o=SC(i.formula),s={atoms:PC(n),replay:void 0},c=Gw(o,{atoms:{holdsState:(e,t)=>s.atoms.holdsState(e,t),holdsAction:(e,t,n)=>s.atoms.holdsAction(e,t,n)},isShared:a,isSame:ww,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},{getFingerprint:r.getFingerprint,forEachActionSuccessors:(e,t,n)=>r.forEachActionSuccessors(e,t,n,s.replay)},n.runtime.version!==`1.7.4`),l=(e,t)=>{if(e===void 0)return t();s.atoms=PC(e),s.replay=e;try{return t()}finally{s.atoms=PC(n),s.replay=void 0}};return{branches:c.branches,solutions:o,addInitialState:(e,t,n)=>l(n,()=>c.addInitialState(e,t)),addState:(e,t,n,r)=>l(r,()=>c.addState(e,t,n,r!==void 0)),storeState:c.storeState,getStateCounts:c.getStateCounts,findViolation:c.findViolation,getViolatedProperties:(t,r)=>Hw(e,i.checks,t,r,n)}},Gw=(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=QS(e),n=a.get(t)??a.size;return a.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Ew(e=>new Int32Array(e)),edgeActions:Ew(e=>new Uint8Array(e)),stateResults:Ew(e=>new Uint8Array(e)),initial:[],firstNodes:Ew(kw),lastNodes:Ew(kw),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),ee=(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}),y=(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]}}),b=(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},x=(e,t,n,r,i,a)=>l(n,()=>b(e,t,r,i,a)),te=(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=Ow(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),Ow(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],Ow(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?Dw(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Dw(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,ie=(e,t,n)=>(re(e,t)||e.stateCount++,ne(e,t,n,Nw(e,t,n))),ae=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Dw(e.edgeTargets,o,n),i.forEach((t,n)=>Dw(e.edgeActions,(o+n)*s,r,t*s,s)),Dw(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},C={slots:/* @__PURE__ */ new Int32Array},oe=(e,t,i)=>{let a=[...i,{index:e,state:t}],s=16*o;C.slots=C.slots.length===s?C.slots.fill(0):new Int32Array(s);let c=e=>{let t=C.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>=C.slots.length>>1){let e=C.slots;C.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}C.slots.length>s&&o++;let u=[];for(let e of C.slots)e!==0&&u.push(a[e-1]);return u},w=(e,t,n,i,o,s,c)=>{let l=ee(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&&y(e,i,n,s,c,n,h(1),0,g,0);for(let r of u.successors){if(!x(e,r,i,n,s,c))continue;if(te(t,r)&&e.errorNode===void 0&&e.solution.models.some(Sw)){e.errorNode=o;return}let a=S(e,i,r);if(a!==void 0&&p.includes(a))continue;let l=a??ie(e,i,r);p.push(l),f.push(0),a===void 0&&w(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);y(e,i,n,s,c,g.state,o,h*a.size,l,h*d);let ee=e.isDone[g.index]===!0;for(let n of u.successors){if(!x(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??ie(e,g.index,n);p.push(a),f.push(v+h),r===void 0&&ee&&w(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;ae(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++)b(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 Pw(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??ie(e,i.index,f);o.push(p),u.push(a),l===void 0&&d&&w(e,t,i.state,i.index,p,r,a*s)}}),ae(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;)Nw(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Aw(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),Aw(e,i)||e.stateCount++,ae(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)Aw(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 jw(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}Aw(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)=>Tw(le(e,t).reverse().map(t=>e.nodeStates[t])),T=(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=>Aw(t,e)),l=[],u=e=>{let n=jw(t,e).indexOf(e);return n!==-1&&o(e,n)},d=(e,n)=>r.tableau!==void 0&&yC(r.tableau.nodes[t.nodeTableaux[e]].particle,n),f=e=>{let i=l.pop()??e;if(i===e&&!u(i)){s[i]=Fw;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]=Fw,n===e)break}let m=n.infinitelyOftenStates.every(e=>[...c].some(n=>Mw(t,n,e))),h=n.infinitelyOftenActions.every(e=>[...c].some(n=>jw(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,ee=e=>{u.push(v),v=e};for(;_>0;){let i=_;for(;n.infinitelyOftenStates.forEach((e,n)=>{!p[n]&&Mw(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(jw(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?(ee(e),f.clear(),!0):(s.has(e)&&!f.has(e)&&(l=e),!1)}))break;if(_<i){ee(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=jw(t,n).find(e=>s.has(e)&&!f.has(e))??-1}ee(l),f.add(l)}}let y=m(i,v,c);for(let e=u.length-1;e>=0;e--){let n=t.nodeStates[u[e]];y[y.length-1]!==n&&y.push(n)}let b=l[l.length-1];return y[y.length-1]===b&&y.pop(),{prefix:l.slice(0,-1),cycle:[b,...y.reverse()],isCycleConstrained:Cw(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 jw(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++;jw(t,a).forEach((e,r)=>{Aw(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++)x(r,a,void 0,t,n,0)&&r.initial.push(S(r,e,a)??ie(r,e,a))}},addState:(t,n,r,i)=>{let o=oe(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)=>y(r,t,n,s,c,e.state,l,i*a.size,d,i*u));let f=ee(r,t,n,s,c),p=r.solution.tableau;if(i&&(p?Pw(r,t).some(e=>r.edgeCounts[e]>0):o.every(e=>Aw(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=T(e,t);if(n)return n}}}},Kw=t=>{switch(t.kind){case`Number`:if(!Vt(t.value))throw e.at(new e.A(`TLC can't handle a number this big.\n${t.value}`),e.nt.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return On(t.name);case`Set`:return F({kind:`MixedSet`,elements:t.elements.map(Kw)})}},qw=t=>{try{return Kw(t)}catch(t){throw!(t instanceof e.x)||t instanceof e.A||t instanceof e.S?t:e.at(new e.x(`${e.K}${t.message}`),e.nt.error)}},Jw=(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`)&&Un(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}},Yw=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.`),Xw=(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=qw(e.value);gr(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(Kw),Kw(t.value)]),p.set(n,r)}),p.forEach(e=>c(e).forEach(t=>f(t,Jw(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 Yw(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 Yw(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)),ee=(e,t)=>{if(v.has(e))return{key:e,prefix:t};let r=n.copySources.get(e);return r&&ee(r.source,t+r.prefix)};n.copySources.forEach((e,t)=>{let r=ee(e.source,e.prefix),i=n.definitions.get(t);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=vp(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 y=i.filter(e=>!u.has(e)&&!m.has(e)&&!d.has(e));if(y.length>0){let t=n.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new e.v(`The constant parameter ${t} is not assigned a value by the configuration file.`)}return{constants:u,substitutions:m}},Zw=`tlc2/value/impl/`,Qw={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},$w={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},eT=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)}},tT=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),nT=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],rT=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??tT.get(e[3])}${`[]`.repeat(e[1].length)}`),iT=(e,t)=>e[e[t].first].text,aT=(e,t)=>iT(e,t).replaceAll(`/`,`.`),oT=t=>{let n=eT(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===Qw.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Qw.integer?i.value=n.readInt32():t===Qw.float?n.readUint32():t===Qw.long||t===Qw.double?(n.readBytes(8),e++):t===Qw.class||t===Qw.string||t===Qw.methodType||t===Qw.module||t===Qw.package?i.first=n.readUint16():t===Qw.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=aT(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=rT(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:eT(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()},()=>aT(r,d.readUint16())):[],p=nT.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=rT(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}},sT=(e,t)=>{let n=e[t],r=e[n.second];return{className:iT(e,n.first),name:e[r.first].text}},cT=(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===Qw.integer)return t.value;if(t.tag===Qw.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>=$w.iconstM1&&t<=$w.iconst5)s.push(t-$w.iconst0),e+=1;else if(t===$w.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===$w.sipush)s.push(r()<<16>>16),e+=3;else if(t===$w.ldc)s.push(l(o[e+1])),e+=2;else if(t===$w.ldcW)s.push(l(r())),e+=3;else if(t===$w.dup){let t=c();s.push(t,t),e+=1}else if(t===$w.getstatic){let t=sT(n,r());if(t.className!==`${Zw}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===$w.invokestatic){let t=sT(n,r()),o=c();if(t.className!==`${Zw}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===$w.new)s.push({className:iT(n,r()),value:void 0}),e+=3;else if(t===$w.invokespecial){let t=sT(n,r()),o=c(),s=c();if(!(t.className===`${Zw}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===$w.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()},lT=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=oT(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:cT(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)}))}},uT=/* @__PURE__ */ new WeakMap,dT=(e,t)=>{let n=Jf(e,t),r=uT.get(e);return r!==void 0&&uT.set(n,r),n},fT=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&uT.set(n,e.arity)}),pT=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`:`}},mT=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),hT=(t,n)=>new e.I(`${t} at line ${n.line}, column ${n.column}`),gT=(e,t,n,r)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n,applications:r}:void 0;if(e.kind===`Let`)return gT(e.body,t,[...n,e.definitions],r);if(e.kind===`Lambda`||e.kind===`Selection`)return;let i=Yu.get(e),a=e.kind===`Apply`&&i===void 0||e.kind===`FunctionApplication`?[...r,e]:r;for(let o of Ve(e).slice(0,i)){let i=e.kind===`FunctionApplication`&&o===e.function,s=gT(o,t,n,i?r:a);if(s)return s}},_T=e=>({line:e.line,column:e.column}),vT=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:_T(n)}),e),yT=(e,t)=>{let n=e.location;if(e.params.length===0)return t;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw hT(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:t,location:n}}if(e.args.length!==e.params.length)throw hT(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Hu,params:e.params,body:t,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Hu,args:e.args,location:n,resolution:Vu},location:_T(n)}},bT=(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:Vu})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Vu}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Vu};return yT({...t,params:[...t.params,...r]},vT(a,t.lets,n))},xT=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c=-1,l,u,d=!1,f=0,p=[],m=[],h,g=(t,n)=>{!h&&t&&(h={location:e.X(t),message:n})},_=(t,n,i=!1)=>{let a=r.selectorRanges?.[s];t&&a&&p.push({node:t,error:{location:e.X(a),message:n},isEmpty:i,applications:[...m]})},v=(t,n)=>{if(!t)throw hT(n,a);Wu.set(r,{applications:m,nulls:p,error:{location:e.X(t),message:n}}),Yu.set(r,f),d=!0},ee=e=>{let i=r.selectorRanges?.[s],a=[],o=[];for(;s<t.length;){let r=t[s];if(r.kind!==`Name`&&!e)return;if(r.kind===`Name`){a.push(r.name),o.push(...r.args);let t=a.join(`!`),i=e?e.find(e=>Kf(e)===t):n(t);if(i)return{definition:i,name:t,args:o,earlier:o.length-r.args.length}}s++}let c=r.selectorRanges?.[t.findLastIndex(e=>e.kind===`Name`)];return v(i&&c&&{...i,end:c.end},`Unknown operator: \`${a.join(`!`)}'.`)},y=e=>{let n=ee(e);if(!n){d=!0;return}let u=n.definition,p=uT.get(u)??od(u),h=s===t.length-1;if(n.args.length!==p){let e=r.argumentRanges?.[s]??a.range,t=`The operator ${ws(n.name)} requires ${p-n.earlier} arguments.`;if(!i||n.args.length!==0)return f+=n.earlier,v(e,t);g(e,t)}if(f+=n.args.length,n.args.forEach((e,t)=>qu.set(e,{operator:n.name,index:t,range:r.selectorRanges?.[s]})),h)return{definition:u,args:n.args};let _=u.location.range,y=uT.has(u)&&_?.module===a.range?.module&&id(a,u.location);if(m.push({operator:n.name,range:r.selectorRanges?.[s],args:n.args,params:y?Array(p).fill(0):sd(u)}),u.isRecursive&&_&&_.module===a.range?.module&&id(a,_.end))return v(r.selectorRanges?.[s],`Subexpression of \`${n.name}' used inside the operator's definition.`);if(u.kind!==`Operator`)throw hT(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),l=u.body,c=s,s++},b=()=>{for(;s<t.length&&!d;){let e=t[s];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=l&&gT(l,e.name,[],[]),c=`Cannot find label \`${e.name}'.`;if(!a)return v(n,c);a.applications.forEach(e=>_(e,c,!0));let u=a.label.params;if(e.args.length!==u.length){let t=`Label \`${e.name}' used with wrong number of arguments.`;if(!i)return v(n,t);g(n,t)}f+=e.args.length,o.lets.push(...a.lets),o.params.push(...u.map(e=>({name:e,arity:0}))),o.args.push(...e.args),m.push(mT(e.name,n,e.args)),l=a.label.body,s++}},x=e=>{if(!l)throw hT(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;let n=r.selectorRanges?.[s],i=`Choosing operand \`${pT(e)}' of subexpression with no operands.`;if(Wu.has(l)){v(n,i);return}if(Uu.has(l)&&l.kind!==`Lambda`&&l!==u&&(_(l,i,!0),u=l,l=l.kind===`Let`&&l.body.kind===`Apply`&&l.body.operator===`$subexpression`?l.body:l.kind===`Selection`?l:{kind:`Tuple`,elements:[l],location:l.location}),l.kind===`Label`){l=l.body,x(e);return}let c=`Nonexistent operand specified by \`${pT(e)}'.`;if(l.kind===`Let`){if(e.kind!==`Operand`||Nd(e.operand,1)!==0){v(n,`A LET/IN expression has only one operand.`);return}o.lets.push(l.definitions),l=l.body;return}let d=Ld(l);if(d&&(e.kind===`Bound`||e.kind===`At`)){if(e.kind===`Bound`&&e.args.length!==d.names.length){v(n,`Selector with ${e.args.length} argument(s) used for quantifier with ${d.names.length} bound identifier(s).`);return}o.params.push(...d.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&(f+=e.args.length,o.args.push(...e.args),m.push(mT(``,n,e.args))),l=Uu.has(l)&&d.body.kind===`Selection`?d.body.expression:d.body;return}if(l.kind===`Case`){let i=[...l.arms,...l.other?[{condition:void 0,body:l.other}]:[]];if(s===t.length-1){v(n,`Subexpression of CASE must have form !i!j.`);return}let a=e.kind===`Operand`?i[Nd(e.operand,i.length)]:void 0;if(!a){v(n,c);return}s++;let o=t[s],u=o.kind===`Operand`?Nd(o.operand,2):-1,d=r.selectorRanges?.[s];if(u===-1){v(d,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=u===0?a.condition:a.body;if(!f){v(d,`Selecting OTHER in a CASE statement.`);return}l=f;return}if(l.kind===`Except`&&e.kind===`Operand`&&Nd(e.operand,l.updates.length+1)>0){v(n,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let p=d?d.sets:Rd(l);if(!p&&l.kind!==`Identifier`){v(n,`Selecting subexpression of expression that has none.`);return}if(e.kind!==`Operand`){v(n,c);return}let h=p?.[Nd(e.operand,p.length)];h?l=h:v(n,c)},te=y(void 0);if(d)return r;if(te)return bT(te.definition,{...o,args:te.args});for(b();s<t.length&&!d;){let e=t[s];if(e.kind===`Name`){for(;l?.kind===`Label`;)l=l.body;if(l?.kind!==`Let`)return v(r.selectorRanges?.[s-1],`A name selector here must be from a LET clause.`),r;o.lets.push(l.definitions);let e=y(l.definitions);if(d)return r;if(e)return bT(e.definition,{...o,args:[...o.args,...e.args]});b()}else{if(e.kind===`Colon`&&t[s-1].kind!==`Name`)return v(r.selectorRanges?.[s-1],`!: should not follow an operand selector.`),r;if(e.kind===`Colon`&&t[s+1]?.kind!==`Name`&&(c!==s-1||s!==t.length-1))return v(r.selectorRanges?.[s],`\`!:' can be used only after a name and either at the end after an
|
|
1793
|
+
operator name or before an operator name.`),r;e.kind!==`Colon`&&(_(l,`Subexpression selection failed, probably due to an error in the selected expression.`),_(l,`Choosing operand \`${pT(e)}' of subexpression with no operands.`,!0)),x(e),_(l,`An unexpected null node specified by '${pT(t[s])}'.\nThis is probably due to a previous error.`),s++}}if(d)return r;if(!l)throw hT(`Subexpression selection failed`,a);let S=o.params.length,ne=o.args.length;if(S!==ne){let e=`Expected ${S} arguments but found ${ne}.`;if(!i||ne>0)return v(a.range,e),r;g(a.range,e)}let re=vT(l,o.lets,a),ie=e=>({kind:`Selection`,expression:e,location:o.params.length===0&&re.kind!==`Lambda`?a:_T(a)}),ae=yT(o,re.kind===`Lambda`?{...re,body:Uu.has(re)?re.body:ie(re.body),location:a}:ie(re));return Ju.set(ae,p),h&&Gu.set(ae,h),ae},ST=(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 Pd(e,t,n)},CT=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ve(e).some(CT),wT=(e,t,n,r=!1)=>{if(!CT(e))return e;if(e.kind===`Let`){e.recursive&&fT(e.recursive,e.definitions);let r=[],i=n=>r.find(e=>e.name===n)??e.definitions.find(e=>e.name===n)??t(n),a=t=>!e.definitions.some(e=>e.name===t)&&n(t);e.definitions.forEach(e=>r.push(dT(e,e=>wT(e,i,a))));let o={...e,definitions:r,body:wT(e.body,i,a)};return o.instances?{...o,instances:o.instances.map(e=>TT(e,i,a))}:o}let i=e.kind===`Apply`?t(e.operator):void 0,a=i?.kind===`Operator`?i.params:e.kind===`Apply`?kp.get(e.operator.slice(e.operator.lastIndexOf(`!`)+1))?.formals:void 0,o=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>wT(e,t,n,a!==void 0&&a[r]?.arity!==0))}:Yf(e,e=>wT(e,t,n)),s=Ve(e),c=Ve(o).every((e,t)=>e===s[t])?e:o,l=c.kind===`Subexpression`?c.selectors:c.kind===`Identifier`?ST(c.name,[],void 0,t):c.kind===`Apply`?ST(c.operator,c.args,c.argumentCounts,t):void 0,u=l?.[0],d=t=>{Yu.set(e,t),Yu.set(c,t)};if(!l)return c.kind===`Apply`&&c.operator.includes(`!`)&&!t(c.operator)&&d(0),c;let f=l.findIndex(e=>e.kind!==`Name`),p=l.slice(0,f===-1?l.length:f),m=p.some((e,n)=>n>0&&t(p.slice(0,n+1).map(pT).join(`!`)));if(u?.kind===`Name`&&n(u.name)&&!m)return c;if(u?.kind===`Name`&&l[1].kind!==`Name`&&!t(u.name))return d(0),c;let h=xT(l,t,c,r),g=Yu.get(c);g!==void 0&&d(g);let _=pu.get(e);return _&&h!==c&&pu.set(h,_),h!==c&&Uu.set(h,c),h},TT=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:wT(e.expression,t,n,!0)}))}),ET=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},DT=(e,t)=>TT(e,ET(t.definitions),()=>!1),OT=(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]);fT(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 id(e.location,t)||e.isRecursive&&n!==void 0&&id(n,t)},s=/* @__PURE__ */ new Map,c=(e,t)=>n=>{let r=e(n);if(!(!r||i.has(r)&&!o(r,t)))return s.get(r)??r},l=ET([...t,...e.definitions]),u=e=>n.has(e),d=ET([...t,...e.definitions,...r]),f=(e,t)=>wT(e,c(d,t),e=>u(e)&&r.every(t=>t.name!==e)),p=e=>{let t=t=>u(t)||!e(t),n=n=>wT(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return Ku.set(t,e),t},i=n=>n.map(n=>n.kind===`ModuleFact`?n:wT(n,e,t,!0)),a=e=>e.map(e=>({...e,set:n(e.set)})),o=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:o(e)),conclusion:n(e.conclusion)}:n(e),s=s=>{switch(s.kind){case`Use`:case`Hide`:return{...s,facts:r(s.facts),defs:i(s.defs)};case`Instance`:return TT(s,e,t);case`Define`:return{...s,definitions:s.definitions.map(r=>r.kind===`Instance`?TT(r,e,t):dT(r,n))};case`Have`:case`Case`:return{...s,expression:n(s.expression)};case`Witness`:return{...s,expressions:s.expressions.map(n)};case`Take`:return{...s,bounds:a(s.bounds)};case`Pick`:return{...s,bounds:a(s.bounds),body:n(s.body)};case`Assert`:return{...s,statement:o(s.statement)};default:return s}},c=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts),defs:i(t.defs)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:s,resolveProof:c};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(t.body.kind===`Define`){let e=t.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=p(t=>e.find(e=>e.name===t)??r(t))}return t})}};return{lookup:e,resolveFacts:r,resolveDefs:i,resolveStatement:o,resolveStep:s,resolveProof:c}},m=e.definitions.some(e=>CT(e.body))||e.assumptions.some(e=>CT(e.expression));m&&[...e.definitions,...r].toSorted((e,t)=>ad(e.location,t.location)).forEach(e=>s.set(e,dT(e,t=>f(t,e.location))));let h={...e,theorems:e.theorems.map(e=>{let t=p(c(l,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&p(c(l,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>{let t=p(c(l,e.location));return{...e,facts:t.resolveFacts(e.facts),defs:t.resolveDefs(e.defs)}})};return m?{...h,definitions:e.definitions.map(e=>s.get(e)??e),assumptions:e.assumptions.map(e=>({...e,expression:f(e.expression,e.location)}))}:h},kT=(e,t)=>e.maxLevels[t]??3,AT=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Lm({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=>Rp(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Rp(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>zp(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Fp(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)&&Rp(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(Rm(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.X(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(Np(e.name,t));i!==void 0&&kT(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=Fp(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=kT(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()])}},jT=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],MT=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),NT=new Map(Ss.flatMap(e=>e.map(t=>[t,e[0]]))),PT=e=>NT.get(e)??e,FT=()=>{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}}},IT=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Ue(e)&2147483647,kind:t,isLocal:n}),LT=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:PT(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:PT(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}},RT=(e,t)=>{let n=[];for(let r=t;;){let t=LT(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},zT=e=>({line:e.line,column:e.column}),BT=(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=RT(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},VT=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,HT={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},UT=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&VT(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&VT(e[n+1],e[n+2])?n+=VT(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=>HT[e])}"`:r.text)}return t},WT=e=>e[2]?.text,GT=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},KT=(e,t)=>e.find(e=>e.name===t)??e.map(e=>KT(e.modules,t)).find(Boolean),qT=e=>{let t=e===void 0?[]:De(e),n;return{tokens:t,ranges:GT(t),getModule:()=>n??=e===void 0?vu(``):yu(e,t)}},JT=(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=qT(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)??Os.get(i)??O_.get(i)??gu(e,i),c=a(s),l=c.tokens,u=c.ranges.get(WT(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:()=>KT(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()}},YT=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=RT(t,e+1);i.push({location:zT(t[e]),apply:e=>r.forEach(t=>e.put(IT(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:zT(n),apply:t=>t.put(IT(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`&&RT(t,u+1).every(e=>s.has(e))&&o(u,`definition`),MT.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(zT(n)),i.push({location:zT(n),apply:e=>e.put(IT(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(IT(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=PT(e.name);i.push({location:e.location,apply:n=>n.put(IT(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(IT(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(IT(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>id(e.location,t.location)?-1:+!!id(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=FT();n.set(i??``,o),xs.toReversed().forEach(e=>o.put(IT(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)}}},XT=(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)}),Ts.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=BT(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]),ee=/* @__PURE__ */ new Map;UT(s(void 0)).forEach((e,t)=>{t===3&&Ds.forEach(a),a(e)});let y=u(void 0);for(;;){let n=g(y,/* @__PURE__ */ new Set)??_(y,/* @__PURE__ */ new Set);if(!n)break;let[r,i]=n;if(f.add(`${r.key}>${i}`),ee.set(r.unit,[...ee.get(r.unit)??[],i]),!v.has(i)){if(v.add(i),t(i).tokens.length===0){let n=r.unit??WT(t(void 0).tokens);throw e.q(i,n)}UT(s(i)).forEach(a)}}jT.forEach(a);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=ee.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),r.forEach(e=>{let t=s(e);UT(t).forEach(a),t.forEach(e=>{e.kind===`String`&&a(e.text)})}),Es.forEach(a),[...i]},ZT=(e,t)=>{let n=JT(e,t),r=n.getParsed,i,a=()=>i??=YT(r);return{getStringOrder:(e,t)=>XT(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)}}},QT=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),$T=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],eE=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.I))throw r;let i=Xc(t);throw i===void 0?r:e.J([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},tE=t=>new e.I(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),nE=(t,n)=>t.location.range&&n.location.range&&{location:e.X(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.X(n.location.range)}.`},rE=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,iE=e=>e===`Theorem`?`ThmOrAssumpDefNode`:rE(e),aE=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:gp(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),oE=(e,t)=>{let n=He(e);return n!==void 0&&t.has(n)||Ve(e).some(e=>oE(e,t))},sE=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(dp(e),n.get(e)??n.size)),n},cE=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),lE=e=>e?.kind===`Steps`?e.steps.flatMap(e=>[...e.body.kind===`Instance`?[e.body]:[],...e.body.kind===`Define`?e.body.definitions.flatMap(e=>e.kind===`Instance`?[e]:[]):[],...lE(e.proof)]):[],uE=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw vb(e);if(e.kind===`Number`&&!Vt(e.value))throw yb(e);uE(e.kind===`Let`?[...Ve(e),...cE(e.instances??[])]:Ve(e))}),dE=(t,n)=>{let r=n.order??ZT(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(V_.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=t_(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=[],ee=/* @__PURE__ */ new Set,y=(e,t)=>[ee,..._].forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,x=e=>`${e}#${b++}`,te=[],S=[],ne=AT(e=>{let t=m.get(e)??le(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)}}),re=/* @__PURE__ */ new Map,ie=/* @__PURE__ */ new Map,ae=/* @__PURE__ */ new Map,C=e=>{let t=d.get(e);if(t)return t;let r=lv(e,n.print,f,n.files,u);if(!r)return;sv.get(e)?.forEach(C);let i=/* @__PURE__ */ new Map;return cv.get(e)?.forEach(e=>C(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:kp.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:jp(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},oe=e=>{let t=sv.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=C(e);return r&&y(e,t),r&&t.includes(`Integers`)&&C(`Integers`),r},w=e=>(uE([...e.definitions.flatMap(Be),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...cE(e.instances)]),e.modules.forEach(w),e);w(i);let se=(t,i)=>{let a=n.loadModule?.(t)??A_(f.version).get(t)??gu(n.source,t);if(a===void 0)throw e.q(t,i);let o=eE(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)},ce=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=me(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:S,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.J(a,!1,void 0,S);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&nE(c,l.module);if(u)throw e.J([u],!1,void 0,S);if(c)throw tE(c);let d=[...Rf(o.flatMap(e=>e.sections),S),...o.flatMap(e=>e.check(e!==o.at(-1)))].filter((e,t,n)=>n.findIndex(t=>t.location===e.location&&t.message===e.message)===t);if(d.length>0)throw e.J(d,!1,void 0,S);return{linked:s,closure:r}},le=(t,r)=>{let i=p.get(t);if(i)return y(t,g.get(t)??[]),i;let o=ce(se(t,r)),s=/* @__PURE__ */ new Map;return ov(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 $(i.body,{environment:r.environment,scope:Dx(px(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&&QT.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},ue=(e,t,n,r,i)=>{let u=i?void 0:oe(e.module);if(u)return T(e,u);let d=i??le(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=$T(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Lf(DT(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=wp({params:g,substitutions:new Map([...h].map(e=>[e[0],Uf(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=x(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&ie.set(u,`${e.name}!${ie.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:x,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return E(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&re.set(r,{name:n,location:e.location}),e.name!==void 0&&ae.set(r,n),r})},T=(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}])),E=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(t=>!i.has(t[0])&&(e.name!==void 0||t[1].kind!==`Instance`)).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,functionArity:o.get(t[1].key)===!0?void 0:t[1].functionArity}];let i=`${e.name}!${t[0]}`;return[i,{key:t[1].kind===`Instance`?i:r(t[1].key,i),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind,functionArity:n.length>0?void 0:t[1].functionArity}]}))},D=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),de=(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=D(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:_p(r,n),location:n}}},O=(e,t,n,r)=>{let i=e.location,s=r?void 0:oe(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=D(t[1].arity,t[1].params);return vp(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,i)});let c=r??le(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=$T(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=>oE(f(e),p),h=d.map(t=>{let n=de(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=[],_=wp({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:_p(e.params,i),location:i,resolution:Vu}:gp(`${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}:aE(a,i)),i},createName:x}),v=new Set(d.map(e=>e.name)),ee=[...c.exported].filter(e=>!v.has(e[0])&&e[1].kind!==`Instance`).map(t=>{let n=_.getKey(t[1].key),r=D(t[1].arity,t[1].params),a=[...e.params,...r];return vp(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,a,n===t[1].key?r:a,i)});return[...h,...g,...ee]},fe=e=>[...e].flatMap(e=>{let t=a.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),pe=/* @__PURE__ */ new Map,me=(t,r)=>{let s=lT(t,n.loadClass?.(t.name),t===i);pe.set(t.name,s.overrides);let c=s.module,l=te.length,u=new Map([...V_.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Mf,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.X(r.range)===e.X(t.range))return;let i=e.X(t.range),a=e.X(r.range);iE(r.kind)===iE(t.kind)?f.warnings.push({location:i,message:`Warning: the ${rE(r.kind)} of '${n}' conflicts with \nits ${rE(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${rE(t.kind)} of '${n}' conflicts with \nits ${rE(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,b=[],x=[...c.constants],re=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),ie=re.map(e=>e.name),C=re.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:oe(e);if(n){g(n);return}let i=t??le(e,c.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name)&&!ie.includes(e.name))),i.variables.forEach((e,t)=>{ie.includes(e)||x.some(t=>t.name===e)||(ie.push(e),C.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),se=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],ce=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});se.forEach(e=>_.set(e.name,ce(e)));let D=e=>({key:he(e),arity:od(e),params:sd(e),kind:Nf(c,e)?`Theorem`:`Definition`,range:e.location.range,functionArity:ld(e)}),de=x.length===0&&ie.length===0,he=e=>c===i?e.name:`${e.name}@${r.id}`,ge=/* @__PURE__ */ new Map,_e=()=>new Map([...r.modules,...y]),ve=e=>{let t=c.modules.find(t=>t.name===e.module);return t?id(t.location,e.location)?y.get(t.name):void 0:_e().get(e.module)},k=e=>({imported:u,getInstance:e=>{let t=ve(e),n=t?void 0:oe(e.module);if(n)return{declarations:[],symbols:T(e,n),instancer:c.name};let r=t??le(e.module,c.name),i=$T(r);return{declarations:i,symbols:E(e,r.exported,i,e=>e),instancer:c.name}},bound:w,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:he,isModuleKnown:(e,t)=>e===c.name||ee.has(e)||r.modules.has(e)||c.modules.some(n=>n.name===e&&id(n.location,t)),instanced:ge,facts:v,reports:p,warnings:r.warnings}),ye=e=>[...se.filter(t=>id(t.location,e)).map(e=>[e.name,ce(e)]),...c.definitions.filter(t=>id(t.location,e)).map(e=>[e.name,D(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(u)),be=e=>{let t=_e(),n=t.get(e.name),i=n&&nE(e,n.module);if(n&&!i)throw tE(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=me(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=ue(e,c,k(c),de,_e().get(e.module));ge.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))}),e.name!==void 0&&!e.isLocal&&_.set(e.name,{key:`${e.name}@${r.id}`,arity:e.params.length,kind:`Instance`,range:e.location.range})}})),...c.modules.map(e=>({location:e.location,link:()=>be(e)}))].sort((e,t)=>id(e.location,t.location)?-1:1).forEach(e=>e.link());let xe=OT(Op(c,(e,t)=>O(e,t,c.name,ve(e))),fe(u));c.theorems.flatMap(e=>lE(e.proof)).filter(e=>!_e().has(e.module)).forEach(e=>oe(e.module)??le(e.module,c.name)),r.errors.push(...zf(xe,k(xe))),xe.definitions.forEach(e=>{let t=he(e);a.set(t,e),o.set(t,!de);let n=D(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!id(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let Se={module:xe,constants:x,variables:ie,variableLocations:C,visible:u,exported:_,modules:y,extended:b,facts:/* @__PURE__ */ new Set([...v,...[...xe.theorems,...xe.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Se);let Ce=te.splice(l).map(e=>({location:e.location,check:()=>ne(e)}));return r.levelChecks.push(zm(xe,{constants:new Set(x.map(e=>e.name)),variables:new Set(ie),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>ae.get(u.get(e)?.key??e)},Ce,S)),h.push(Se),Se},he=ce(i).linked,ge=n.traceFile,_e=ge===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:ge}}],ve=[...n.moduleOperators??[],..._e].map(e=>{let t=le(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(he),1)),S.length>0&&!n.isSanyReported&&n.print(e.Z(S));let k=n.runtimeInvariants??[];k.forEach(e=>{if(e.module===void 0)return;p.set(i.name,he);let t=le(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)}),he.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),ve.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(he,/* @__PURE__ */ new Set);let xe=he.constants.map(e=>e.name),Se=he.variables,Ce=Xw(t,{root:he,moduleSymbols:new Map([...d,...[...p].map(e=>[e[0],e[1].visible]),[i.name,he.visible]]),definitions:a,builtins:u,copySources:s,operatorConstants:new Map(ve.flatMap(e=>le(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),we=Ce.constants,Te=Ce.substitutions;ge!==void 0&&u.forEach((e,t)=>{let n=K_(e);n&&u.set(t,n)});let Ee=sE(Se,h.flatMap(e=>e.module.variables.map(e=>e.name))),De=eh({definitions:a,substitutions:Te,constants:we,variableIndex:Ee,builtins:u,variables:Se}),Oe={runtime:f,definitions:a,builtins:u,constants:we,substitutions:Te,instanceNames:ie,variables:Se,variableIndex:Ee,facts:De,startupValues:Array.from({length:De.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},ke=Lm({constants:new Set(we.keys()),variables:/* @__PURE__ */ new Set([...Se,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Nb(e,Oe)}),Ae=t=>{try{$(t,{environment:Oe,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.x)return t;throw t}};Te.forEach((t,n)=>{let r=a.get(t),i=xe.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&ke.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ae(r.body):void 0;if(i){let r=st(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 je=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),Me=r.createDefinitionOrder();return{environment:Oe,assumptions:ye,variableLocations:he.variableLocations,instanceActions:re,startupDefinitions:h.filter(e=>!je.has(e.module.name)||$T(e).length===0).flatMap(e=>Me(e===he?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>pe.get(e.module.name)??[]),moduleOperators:ve,runtimeInvariants:k,rootName:i.name}},fE=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),pE=(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},mE=t=>e.at(new e.x(`${e.K}${t}`),e.nt.error),hE=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Rt(e)||!Rt(i))throw mE(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},gE=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${_E(t)}`:n},_E=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(_E).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${gE(e.pattern,e.set)}:${_E(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(_E).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${_E(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>gE(e.pattern,e.set)).join(`,`)}|->${_E(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(_E);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},vE=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,yE=(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 mE(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>$(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!N(o)||!P(o))throw mE(`The symmetry operator must specify a set of functions.`);let s=F(o).elements;if(!s.every(Lt))throw mE(`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=_E(vE(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Ze.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(hE).forEach(e=>{e.size>0&&f.set(fE(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=pE(n,e),r=fE(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(!vE(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=>Rt(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},bE=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=SE(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(SE(e[r],t));return a}},xE=(e,t)=>{let n=[],r=[];for(let i of e){let e=SE(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Tn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Tn(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},SE=(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=xE(e.elements,t);return n?An(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=bE(n.domain,t),i=bE(n.range,t)??n.range;if(r){let e=Dr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Mn(n.domain,e.range):e}return i===n.range?n:Mn(n.domain,i)}if(n===`Interval`||!N(e)||!P(e))return e;let r=F(e),i=bE(r.elements,t);return i?xr(i):r},CE=(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]=SE(e[o],i),a===0&&(a=Tn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},wE={line:0,column:0},TE=e=>({kind:`Identifier`,name:e,location:wE}),EE=e=>({name:e,expression:TE(e),scope:void 0}),DE=/* @__PURE__ */ new Set([`name`,`property`]),OE=(t,n,r)=>{let i=Nb(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(DE.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},kE=e=>e.body.kind===`Number`||e.body.kind===`String`,AE=(e,t,n)=>n.constants.has(e)?n.constants.get(e):kE(t)?void 0:lx(t,n),jE=(t,n,r)=>{if(r.constants.has(n))throw new e.v(`The ${t} ${n} cannot be a constant.`);let i=OE(t,n,r);if(AE(n,i,r)!==void 0)throw new e.v(`The ${t} ${n} cannot be a constant.`);return i},ME=(t,n,r)=>{let i=r.constants.has(n)?void 0:OE(t,n,r),a=i?AE(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},NE=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},PE=(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})),ux(e.startupDefinitions,r),t.invariants.forEach(e=>{ME(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},FE=(t,n)=>{let r=Lm({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=ME(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1791
1794
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1792
1795
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1793
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.
|
|
1794
|
-
all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:
|
|
1795
|
-
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`&&Yx(l.expression,t.scope,n)<2)throw e.ot(new e.x(`TLC cannot handle the temporal formula ${Q(l.expression)}`),e.rt.error);let m=Yx(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${Q(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:Pw},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},Yw=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=Hw(`property`,t,n);if(!a)return;Yx(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;Zx(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(qw(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`&&Yx(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!A(e)?ry(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=Yx(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=Q(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},Xw=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=>Hw(e,t,n)?[Iw(t)]:[]),Qw=(e,t)=>{let n=ry(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},$w=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.v(`_POSSIBLE lists ${r} more than once`);Vw(`possible`,r,n);let a=Iw(r);if(Yx(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}),eT=(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},tT=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=ry(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},nT=(e,t)=>e.flatMap(e=>{let n=tT(e.expression,t);return(e.scope===void 0&&nm(n,t)===void 0?[n]:Kw(e.expression,t)).map(r=>{let i=e.scope===void 0?nm(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:eT(r,i,t),predicate:n}})}),rT=(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},iT=/[\u0100-\uffff]/,aT=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),oT=e=>e.kind===`String`?iT.test(e.value):e.kind===`Set`&&e.elements.some(oT),sT=(e,t)=>{if(e.kind===`Selection`){if(t.has(e.expression))return!1;t.add(e.expression)}return e.kind===`String`&&iT.test(e.value)||e.kind===`Apply`&&aT.has(e.operator)||Be(e).some(e=>sT(e,t))},cT=(e,t)=>{let n=/* @__PURE__ */ new Set;return e.constants.some(e=>oT(e.value)||(e.args??[]).some(oT))||[...t.definitions.values()].some(e=>sT(e.body,n)||e.kind===`Function`&&e.bounds.some(e=>sT(e.set,n)))},lT=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]]))},uT=(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`},dT=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),fT=(e,t,n)=>Qv($(e,t),n),pT=(t,n,r=hT)=>{let i=$(t,n);if(typeof i!=`boolean`)throw new e.x(r(t,n.environment));return i},mT=(t,n,r)=>{let i=n.kind===`Identifier`?ry(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):Fv(a)}`},hT=(e,t)=>mT(`boolean`,e,t),gT=(e,t)=>pT(e.expression,t,(n,r)=>(e.predicate!==e.expression&&pT(e.predicate,t),hT(n,r))),_T=()=>{},vT=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=fT(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),yT=(t,n)=>{try{return t(dT(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.x)return{message:t.message};throw t}},bT=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=yT(e=>ny($(n.expression,e),n.expression),t);if(e)return{name:Fv(n.expression),trace:[],message:e.message}}},xT=(e,t,n,r=!1)=>{let i=sw(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:xw(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})}},ST=e=>{let t=typeof e.config==`string`?Re(e.config,e.version):e.config,n=xT(t,e,e.onPrint??console.log),r=n.specification;Ww(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=ES(t,i,r.instanceActions);return i.runtime.getSpecification=()=>jS(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:TT(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants),getDescription:o}},CT=(t,n,r)=>{let i=bT(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},wT=t=>e.ot(new e.x(`${e.K}Could not find operator: ${t.operator} in module: ${t.module}`),e.rt.error),TT=(t,n,r,i,a,o=[],s=[])=>{let c=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw wT(e);return{name:e.operator,key:e.key}}),l=Gw(t.invariants,n),u=Jw(t,n,r,i,a),d=Yw(t,n,a),f=t.properties[0],p=f&&ry(f,n)?.location.range,m=t.specification,h=m&&ry(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=nT([...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=nT(s.map(e=>{let t=ry(e.name,n);return{name:e.name,expression:t?.kind===`Operator`?t.body:Fw(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=nT(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?tT(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)=>[tT(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),T=(e,t,r,i)=>{try{return _o(e,t.node,()=>$(t.expression,dT(n,r,i,t.scope)))}catch{return}},le=(e,t,n)=>S&&e?_o(S,e.node,()=>pT(e.expression,n)):pT(t,n),ue=(e,t,n)=>{if(S){for(let r of e){let e=T(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&&Rw(`rlreward`,t.rlReward,n),t.periodic!==void 0&&Rw(`periodic`,t.periodic,n);let de=$w(t.possible,n);if(n.variables.length===0)return;let fe=t.symmetry===void 0?void 0:kw(t.symmetry,n,t.substitutions),E=t.view===void 0?void 0:Vw(`view function`,t.view,n),D=t.view??c(`view`)[0]?.name,O=D===void 0?void 0:Iw(D),k=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Pw};return{...e,unchanged:t}}),pe=e=>Yx(e.expression,void 0,n)>=2,me=de.filter(e=>!pe(e)),he=de.filter(pe),ge=n.runtime,_e,ve=()=>{if(_e)return _e;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return _e=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),_e},ye=(e,t)=>$(e,dT(n,t,void 0)),be=e=>(O!==void 0&&e.forEach(mr),fe===void 0?e:Nw(e,fe,ve())),xe=e=>{let t=be(e);return Ja(O===void 0?ve().map(e=>t[e]):[ye(O.expression,t)])},Se=e=>d.initialPredicates.find((t,r)=>{let i=S&&T(S,se[r],e,void 0);return typeof i==`boolean`?!i:!pT(t.expression,dT(n,e,void 0,t.scope))}),Ce=/* @__PURE__ */ new WeakSet,we=(t,r,i)=>{let a=i&&!Ce.has(i)?i:void 0;if(rT(t,r,a))return!1;try{let e=dT(n,r,void 0,t.scope),i=t.membership;return a&&i?!Ti(r[i.variable],a[i.variable],$(i.set,e)):!gT(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?T(S,r,t,void 0):void 0;return typeof i==`boolean`?!i:y.some(r=>r.predicate===e.predicate&&we(r,t,n))},Ee=cT(t,n);ge.getFingerprint=xe;let De=()=>{let t=de.find(e=>!ge.possibleCounts.get(e.name));if(!t)return;let r=Qw(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(Eh(ge),!0))}},Oe=E?.body.kind===`Tuple`?E.body.elements:[],ke=Oe.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),Ae=E?.body.kind===`Tuple`&&ke.length===Oe.length&&new Set(ke).size===ke.length,je=(e,t)=>Ae?ve().filter(e=>ke.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${j(L(t[e]))}\n`).join(``):j(L(ye(e,t))),Me=(t,r,i)=>pT(t.expression,dT(n,r,i),t=>`${e.K}${hT(t,n)}`),Ne=e=>{let t=Object.fromEntries(ve().map(t=>[n.variables[t],e[t]]));return O===void 0?t:un(t,()=>je(O.expression,e))};return ge.toRecord=Ne,{properties:d,spec:u,toRecord:Ne,evaluateAlias:(t,r,i,a)=>{let o=()=>Ne(r.map(e=>e??En(`null`)));try{Vw(`alias`,t,n);let e=$(Fw(t),dT(n,r,i)),a=lT(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:fe!==void 0,isConstrained:te.length>0||x.length>0,getTypedChecks:e=>{if(S!==void 0||de.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||O!==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=Xw(u.scope),c=e=>jy(e,n)===void 0&&$p(e,n,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&Yp(e,n)&&c(e))||Qp([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...O?[O.expression]:[],...s,...ZS(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:fe,view:O?.expression,variableOrder:ve(),liveness:e}},getTlcOrder:ve,getStoredFingerprints:(e,t)=>O!==void 0||Ee?BigInt64Array.from(e,xe):Xa(t,ve()),getFingerprintState:e=>{if(Ee)return[String(xe(e))];let t=be(e);return O===void 0?t:[ye(O.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)=>le(n,r,dT(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=>le(w.get(e.predicate),e.predicate,dT(n,t,void 0,e.scope)))&&x.every((r,i)=>le(ie[i],r.expression,dT(n,e,t,r.scope))))||r())||b.every(e=>le(C.get(e.predicate),e.predicate,dT(n,t,void 0,e.scope))))&&k.every((r,i)=>le(ce[i],r.box,dT(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>ue(ae,e)??te.every(r=>rT(r,e,t)||gT(r,dT(n,e,void 0))),findFailedInitialPredicate:Se,findViolatedActionProperty:(e,t)=>k.find((r,i)=>{let a=S&&T(S,ce[i],e,t);if(typeof a==`boolean`)return!a;try{return!pT(r.action,dT(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Q(r.box)}`)&&!fT(r.unchanged,dT(n,e,t,r.scope),`a subscript`)}catch(e){throw mt(ET(e),Xe.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ue(ie,e,t)??x.every(n=>Me(n,e,t)),getExcludingConstraints:(t,r)=>[...te.filter(e=>!gT(e,dT(n,r,void 0))),...x.filter(e=>!Me(e,t,r))].map(t=>{let r=Qw(t.name,n);return r?e.Z(r):t.name}),trackStatePossible:me.length===0?_T:e=>vT(me,ge,dT(n,e,void 0)),trackActionPossible:he.length===0?_T:(e,t)=>vT(he,ge,dT(n,e,t)),findUnwitnessedPossible:De,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=Fw(t.rlReward),s=$(o,dT(n,r,i));if(typeof s!=`number`)throw new e.x(mT(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=c(`postcondition`),a=t.postconditions.map(e=>{let t=ry(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}`:!zw(t)&&jy(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=yT(e=>pT(Fw(r),e),n);if(!i)return;let a=ry(r,n)?.body,o=Qw(r,n),s=o?` at ${a?.kind===`Number`?Fv(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}}}},ET=t=>t instanceof e.A?e.ot(t,t.exitCode):t,DT=(e,t)=>e*((t-e)/2**64),OT=e=>e.includes(`.`)?e:`${e}.0`,kT=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return OT(String(e));let[n,r]=e.toExponential().split(`e`);return`${OT(n)}E${r.replace(`+`,``)}`},AT=e=>e!==void 0&&e>=`0`&&e<=`9`,jT=e=>{if(e===0)return`0.0`;let t=kT(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;AT(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;AT(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;AT(t[n])&&r<2;)i+=t[n++],r++;for(AT(t[n])&&Number(t[n])>=5&&(i=MT(i));AT(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},MT=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${MT(r)}.`:n===`9`?`${MT(r)}0`:`${r}${Number(n)+1}`},NT=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}`)},PT=(e,t,n)=>{if(DT(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},FT=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}).`},IT=[void 0,`lambda`,`tuple`,`record`],LT=()=>{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(IT.indexOf(Nn(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(IT.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})}},RT=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=IT[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 X_}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return an}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return qb}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Kb}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return yr}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return XS}}),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 jS}}),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 ES}}),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 ax}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return gi}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return ry}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return ya}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Q}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return Rr}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return rx}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return Kn}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Ib}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return Xi}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return jy}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return Xb}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return Tr}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return Jb}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Ja}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Qb}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return oS}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Ha}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Yb}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return Cn}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Dv}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return ei}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return ix}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return En}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return QS}}),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 AS}}),Object.defineProperty(exports,"Tn",{enumerable:!0,get:function(){return _e}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return $a}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return On}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return ub}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return An}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return qy}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return Ir}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Tv}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Cv}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return At}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return wv}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return kt}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Ww}}),Object.defineProperty(exports,"_n",{enumerable:!0,get:function(){return ht}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Jl}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return PT}}),Object.defineProperty(exports,"an",{enumerable:!0,get:function(){return Vn}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return $h}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return eC}}),Object.defineProperty(exports,"bn",{enumerable:!0,get:function(){return We}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return il}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return xT}}),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 bT}}),Object.defineProperty(exports,"dn",{enumerable:!0,get:function(){return ft}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return th}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return P}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return Ev}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return dT}}),Object.defineProperty(exports,"fn",{enumerable:!0,get:function(){return dt}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return ah}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Uw}}),Object.defineProperty(exports,"gn",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return Kl}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return CT}}),Object.defineProperty(exports,"hn",{enumerable:!0,get:function(){return bt}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return pu}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return NT}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return C_}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return nx}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return za}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Ux}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Wa}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return wT}}),Object.defineProperty(exports,"ln",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Mh}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return ST}}),Object.defineProperty(exports,"mn",{enumerable:!0,get:function(){return wt}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Qp}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return LT}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return Bn}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return x_}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return DT}}),Object.defineProperty(exports,"on",{enumerable:!0,get:function(){return Xe}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Qh}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return uT}}),Object.defineProperty(exports,"pn",{enumerable:!0,get:function(){return M}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Yp}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return nb}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return Yi}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return jT}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return mr}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return S_}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return FT}}),Object.defineProperty(exports,"sn",{enumerable:!0,get:function(){return Ze}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return eg}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return RT}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return Un}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return w_}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return TT}}),Object.defineProperty(exports,"un",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Ah}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return ET}}),Object.defineProperty(exports,"vn",{enumerable:!0,get:function(){return xt}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Zl}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return kS}}),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 $S}}),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 Mw}}),Object.defineProperty(exports,"yn",{enumerable:!0,get:function(){return ut}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Xl}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return ex}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Lr}});
|
|
1796
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.at(new e.v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.nt.safetyEvaluationFailure)}return[EE(t)]})},IE=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>IE(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Nb(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&lx(n,t)===void 0)return IE(n.body,t)}return[e]},LE=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||kC(i,t.scope,n)>0)return!1;let a=$(i,tD(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},RE=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return jE(t,e,n),TE(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):AE(t.specification,OE(`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=OE(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;jC(u.body,void 0,n,!1).forEach(t=>{let l=t.expression,u=t.path.some(e=>{let t=Nb(e,n);return t?.kind===`Operator`&&kC(t.body,void 0,n)===1});if(!u&&LE(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.X(t):l.name},\ncannot be used as a spec`)}if(l.kind===`UnboundedQuantifier`&&l.isTemporal)throw e.at(new e.v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.nt.error);if(l.kind===`Always`&&l.expression.kind===`BoxAction`){let r=sw(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:Ze.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1797
|
+
all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:Ze.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,
|
|
1798
|
+
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`&&kC(l.expression,t.scope,n)<2)throw e.at(new e.x(`TLC cannot handle the temporal formula ${Q(l.expression)}`),e.nt.error);let m=kC(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${Q(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:wE},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},zE=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=ME(`property`,t,n);if(!a)return;kC(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;jC(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(LE(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`&&kC(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!A(e)?Nb(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=kC(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=Q(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},BE=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},VE=(e,t,n)=>t.flatMap(t=>ME(e,t,n)?[EE(t)]:[]),HE=(e,t)=>{let n=Nb(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},UE=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.v(`_POSSIBLE lists ${r} more than once`);jE(`possible`,r,n);let a=EE(r);if(kC(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}),WE=(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},GE=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Nb(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},KE=(e,t)=>e.flatMap(e=>{let n=GE(e.expression,t);return(e.scope===void 0&&dh(n,t)===void 0?[n]:IE(e.expression,t)).map(r=>{let i=e.scope===void 0?dh(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:WE(r,i,t),predicate:n}})}),qE=(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},JE=/[\u0100-\uffff]/,YE=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),XE=e=>e.kind===`String`?JE.test(e.value):e.kind===`Set`&&e.elements.some(XE),ZE=(e,t)=>{if(e.kind===`Selection`){if(t.has(e.expression))return!1;t.add(e.expression)}return e.kind===`String`&&JE.test(e.value)||e.kind===`Apply`&&YE.has(e.operator)||Ve(e).some(e=>ZE(e,t))},QE=(e,t)=>{let n=/* @__PURE__ */ new Set;return e.constants.some(e=>XE(e.value)||(e.args??[]).some(XE))||[...t.definitions.values()].some(e=>ZE(e.body,n)||e.kind===`Function`&&e.bounds.some(e=>ZE(e.set,n)))},$E=e=>{if(!Lt(e))return;let t=Gt(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},eD=(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`},tD=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),nD=(e,t,n)=>Ob($(e,t),n),rD=(t,n,r=aD)=>{let i=$(t,n);if(typeof i!=`boolean`)throw new e.x(r(t,n.environment));return i},iD=(t,n,r)=>{let i=n.kind===`Identifier`?Nb(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.X(o):db(a)}`},aD=(e,t)=>iD(`boolean`,e,t),oD=(e,t)=>rD(e.expression,t,(n,r)=>(e.predicate!==e.expression&&rD(e.predicate,t),aD(n,r))),sD=()=>{},cD=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=nD(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),lD=(t,n)=>{try{return t(tD(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.x)return{message:t.message};throw t}},uD=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=lD(e=>Mb($(n.expression,e),n.expression),t);if(e)return{name:db(n.expression),trace:[],message:e.message}}},dD=(e,t,n,r=!1)=>{let i=ZT(t.source,t.loadModule);return an(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),un(t),Ra(t.fingerprintPolynomial??0),r&&on(),{order:i,specification:dE(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})}},fD=e=>{let t=typeof e.config==`string`?ze(e.config,e.version):e.config,n=dD(t,e,e.onPrint??console.log),r=n.specification;PE(r,t,e.onProgress);let i=e.coverage===void 0?void 0:to(r.environment.variables.length),a=i?no(r.environment,i):r.environment,o,s=()=>o??=ow(t,a,r.instanceActions);a.runtime.getSpecification=()=>dw(s(),t,a,r.variableLocations);let c=vD(t,a,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants);return{config:t,specification:r,environment:a,search:c,getDescription:s,coverage:i,getCoverage:()=>i&&Go(i,a,r.variableLocations,c?.getTlcOrder()??[])}},pD=/* @__PURE__ */ Error(`The walk stopped`),mD=(e,t,n)=>{let r=(n,r)=>r.map(r=>({...r,node:ao(e,n,so(r.name,r.expression,t),r.expression,r.scope)})),i=r(`init`,n.inits),a=r(`next`,n.actions);return go(e,t,$v(a,t)),{inits:i,actions:a}},hD=(e,t,n,r,i,a=(e,t)=>{throw eb(e,t,r)})=>Qv(t,t.node,n,r,n=>{e.primary[t.node]++,i(n)},n=>(e.primary[t.node]++,a(n,t.name),!0)),gD=(t,n,r)=>{let i=uD(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(Ze.assumptionFalse,t,t),e.nt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(Ze.assumptionEvaluationError,a,lt(Ze.assumptionEvaluationError,a,!0)),e.nt.assumptionViolation},_D=t=>e.at(new e.x(`${e.K}Could not find operator: ${t.operator} in module: ${t.module}`),e.nt.error),vD=(t,n,r,i,a,o=[],s=[])=>{let c=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw _D(e);return{name:e.operator,key:e.key}}),l=FE(t.invariants,n),u=RE(t,n,r,i,a),d=zE(t,n,a),f=t.properties[0],p=f&&Nb(f,n)?.location.range,m=t.specification,h=m&&Nb(m,n)?.location.range;u.isPropertyFairness&&p&&h&&a?.({kind:`warning`,code:Ze.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${e.X(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${e.X(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let g=KE([...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`?nt:`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=KE(s.map(e=>{let t=Nb(e.name,n);return{name:e.name,expression:t?.kind===`Operator`?t.body:TE(e.name),scope:void 0}}),n),ee=[...g,...v],y=[...new Map(ee.map(e=>[e.predicate,e])).values()],b=VE(`constraint`,[...t.constraints,...c(`constraint`).map(e=>e.name)],n),x=KE(b,n),te=VE(`action constraint`,t.actionConstraints,n),S=n.coverage,ne=(e,t,r=!0)=>t.flatMap(t=>{if(!S)return[];let i=r?GE(t.expression,n):t.expression,a=so(r?t.name:void 0,i,n),o=ao(S,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),re=[...ne(`invariant`,l),...ne(`invariant`,d.invariants,!1)],ie=new Map([...l,...d.invariants].map((e,t)=>[GE(e.expression,n),re[t]])),ae=ne(`constraint`,te),C=ne(`constraint`,b),oe=new Map(C.map(e=>[e.expression,e])),w=[...new Map(x.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 bo(e,t.node,()=>$(t.expression,tD(n,r,i,t.scope)))}catch{return}},ue=(e,t,n)=>S&&e?bo(S,e.node,()=>rD(e.expression,n)):rD(t,n),T=(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&&OE(`rlreward`,t.rlReward,n),t.periodic!==void 0&&OE(`periodic`,t.periodic,n);let E=UE(t.possible,n);if(n.variables.length===0)return;let D=t.symmetry===void 0?void 0:yE(t.symmetry,n,t.substitutions),de=t.view===void 0?void 0:jE(`view function`,t.view,n),O=t.view??c(`view`)[0]?.name,fe=O===void 0?void 0:EE(O),pe=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:wE};return{...e,unchanged:t}}),me=e=>kC(e.expression,void 0,n)>=2,he=E.filter(e=>!me(e)),ge=E.filter(me),_e=n.runtime,ve,k=()=>{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},ye=(e,t)=>$(e,tD(n,t,void 0)),be=e=>(fe!==void 0&&e.forEach(gr),D===void 0?e:CE(e,D,k())),xe=e=>{let t=be(e);return Xa(fe===void 0?k().map(e=>t[e]):[ye(fe.expression,t)])},Se=e=>d.initialPredicates.find((t,r)=>{let i=S&&le(S,se[r],e,void 0);return typeof i==`boolean`?!i:!rD(t.expression,tD(n,e,void 0,t.scope))}),Ce=/* @__PURE__ */ new WeakSet,we=(t,r,i)=>{let a=i&&!Ce.has(i)?i:void 0;if(qE(t,r,a))return!1;try{let e=tD(n,r,void 0,t.scope),i=t.membership;return a&&i?!Di(r[i.variable],a[i.variable],$(i.set,e)):!oD(t,e)}catch(n){throw i?ht(e.at(n,e.nt.safetyEvaluationFailure),Ze.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},Te=(e,t,n)=>{let r=ie.get(e.predicate),i=S&&r?le(S,r,t,void 0):void 0;return typeof i==`boolean`?!i:ee.some(r=>r.predicate===e.predicate&&we(r,t,n))},Ee=QE(t,n);_e.getFingerprint=xe;let De=()=>{let t=E.find(e=>!_e.possibleCounts.get(e.name));if(!t)return;let r=HE(t.name,n),i=r?` at ${e.X(r)}`:``;return{name:t.name,code:Ze.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(n_(_e),!0))}},Oe=de?.body.kind===`Tuple`?de.body.elements:[],ke=Oe.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),Ae=de?.body.kind===`Tuple`&&ke.length===Oe.length&&new Set(ke).size===ke.length,je=(e,t)=>Ae?k().filter(e=>ke.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${j(L(t[e]))}\n`).join(``):j(L(ye(e,t))),Me=(t,r,i)=>rD(t.expression,tD(n,r,i),t=>`${e.K}${aD(t,n)}`),Ne=e=>{let t=Object.fromEntries(k().map(t=>[n.variables[t],e[t]]));return fe===void 0?t:fn(t,()=>je(fe.expression,e))};return _e.toRecord=Ne,{properties:d,spec:u,toRecord:Ne,evaluateAlias:(t,r,i,a)=>{let o=()=>Ne(r.map(e=>e??On(`null`)));try{jE(`alias`,t,n);let e=$(TE(t),tD(n,r,i)),a=$E(e);return a===void 0?o():mn(a,t)}catch(t){if(!(t instanceof e.v||t instanceof e.x))throw t;return{...o(),_ALIASEvalError:ut(t.message,a)}}},isSymmetric:D!==void 0,isConstrained:x.length>0||te.length>0,getTypedChecks:e=>{if(S!==void 0||E.length>0||t.periodic!==void 0||[...ee,...x].some(e=>e.scope!==void 0)||te.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(e===void 0||fe!==void 0)||u.init===void 0||u.next===void 0)return;let r=y.map(e=>e.predicate),i=[...new Set(x.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...n.facts.ids.keys()],s=BE(u.scope),c=e=>lx(e,n)===void 0&&sh(e,n,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&rh(e,n)&&c(e))||oh([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...fe?[fe.expression]:[],...s,...Bw(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:D,view:fe?.expression,variableOrder:k(),liveness:e}},getTlcOrder:k,getStoredFingerprints:(e,t)=>fe!==void 0||Ee?BigInt64Array.from(e,xe):Qa(t,k()),getFingerprintState:e=>{if(Ee)return[String(xe(e))];let t=be(e);return fe===void 0?t:[ye(fe.expression,t)]},findViolatedInvariant:(e,t)=>{let n=S===void 0?ee.find(n=>we(n,e,t)):y.find(n=>Te(n,e,t));return n&&Ce.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of y)Te(n,e,void 0)&&(Ce.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r,i)=>ue(n,r,tD(t,e,void 0,i));w.every(e=>i(oe.get(e.predicate),e.predicate,e.scope))&&n();for(let e of y)i(ie.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)=>(!(!(w.every(e=>ue(oe.get(e.predicate),e.predicate,tD(n,t,void 0,e.scope)))&&te.every((r,i)=>ue(ae[i],r.expression,tD(n,e,t,r.scope))))||r())||y.every(e=>ue(ie.get(e.predicate),e.predicate,tD(n,t,void 0,e.scope))))&&pe.every((r,i)=>ue(ce[i],r.box,tD(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>T(C,e)??x.every(r=>qE(r,e,t)||oD(r,tD(n,e,void 0))),findFailedInitialPredicate:Se,findViolatedActionProperty:(e,t)=>pe.find((r,i)=>{let a=S&&le(S,ce[i],e,t);if(typeof a==`boolean`)return!a;try{return!rD(r.action,tD(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Q(r.box)}`)&&!nD(r.unchanged,tD(n,e,t,r.scope),`a subscript`)}catch(e){throw ht(yD(e),Ze.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>T(ae,e,t)??te.every(n=>Me(n,e,t)),getExcludingConstraints:(t,r)=>[...x.filter(e=>!oD(e,tD(n,r,void 0))),...te.filter(e=>!Me(e,t,r))].map(t=>{let r=HE(t.name,n);return r?e.X(r):t.name}),trackStatePossible:he.length===0?sD:e=>cD(he,_e,tD(n,e,void 0)),trackActionPossible:ge.length===0?sD:(e,t)=>cD(ge,_e,tD(n,e,t)),findUnwitnessedPossible:De,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=TE(t.rlReward),s=$(o,tD(n,r,i));if(typeof s!=`number`)throw new e.x(iD(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=c(`postcondition`),a=t.postconditions.map(e=>{let t=Nb(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}`:!kE(t)&&lx(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.at(new e.x(a),e.nt.configParseError)}let o=(t,r)=>{let i=lD(e=>rD(TE(r),e),n);if(!i)return;let a=Nb(r,n)?.body,o=HE(r,n),s=o?` at ${a?.kind===`Number`?db(a):e.X(o)}`:``;return i.message===void 0?{name:t,code:Ze.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:Ze.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}}}},yD=t=>t instanceof e.A?e.at(t,t.exitCode):t,bD=(e,t)=>e*((t-e)/2**64),xD=e=>e.includes(`.`)?e:`${e}.0`,SD=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return xD(String(e));let[n,r]=e.toExponential().split(`e`);return`${xD(n)}E${r.replace(`+`,``)}`},CD=e=>e!==void 0&&e>=`0`&&e<=`9`,wD=e=>{if(e===0)return`0.0`;let t=SD(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;CD(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;CD(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;CD(t[n])&&r<2;)i+=t[n++],r++;for(CD(t[n])&&Number(t[n])>=5&&(i=TD(i));CD(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},TD=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${TD(r)}.`:n===`9`?`${TD(r)}0`:`${r}${Number(n)+1}`},ED=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}`)},DD=(e,t,n)=>{if(bD(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},OD=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}).`},kD=[void 0,`lambda`,`tuple`,`record`],AD=()=>{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=Bi(e.domain);return t?(a(7),a(kD.indexOf(Fn(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(kD.indexOf(Fn(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})}},jD=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 On(t.strings[n[r++]]);if(e===5)return An(i(n[r++]));let a=kD[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Ir({kind:`Interval`,low:e,high:e+t-1});return Pn(Mn(o,i(t)),a)}let o=n[r++],s=i(o);return Pn(Mn(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Qy}}),Object.defineProperty(exports,"$n",{enumerable:!0,get:function(){return Ue}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return el}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return dw}}),Object.defineProperty(exports,"An",{enumerable:!0,get:function(){return ni}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return wu}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return AS}}),Object.defineProperty(exports,"Bn",{enumerable:!0,get:function(){return tt}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return _l}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Gw}}),Object.defineProperty(exports,"Cn",{enumerable:!0,get:function(){return xa}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return Lu}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return lw}}),Object.defineProperty(exports,"Dn",{enumerable:!0,get:function(){return jt}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Ru}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return zw}}),Object.defineProperty(exports,"En",{enumerable:!0,get:function(){return Qi}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return Au}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return OS}}),Object.defineProperty(exports,"Fn",{enumerable:!0,get:function(){return gr}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return xu}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Q}}),Object.defineProperty(exports,"Gn",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return hl}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return PS}}),Object.defineProperty(exports,"Hn",{enumerable:!0,get:function(){return ut}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return ol}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return MS}}),Object.defineProperty(exports,"In",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return bu}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Nb}}),Object.defineProperty(exports,"Jn",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return nl}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Kn",{enumerable:!0,get:function(){return Tt}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return al}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return kS}}),Object.defineProperty(exports,"Ln",{enumerable:!0,get:function(){return Un}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return xl}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return CC}}),Object.defineProperty(exports,"Mn",{enumerable:!0,get:function(){return P}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return gu}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return DS}}),Object.defineProperty(exports,"Nn",{enumerable:!0,get:function(){return Gn}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return hu}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return uw}}),Object.defineProperty(exports,"On",{enumerable:!0,get:function(){return kn}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return Fu}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return IS}}),Object.defineProperty(exports,"Pn",{enumerable:!0,get:function(){return Hn}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return vu}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return eb}}),Object.defineProperty(exports,"Qn",{enumerable:!0,get:function(){return Ge}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return pl}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return zS}}),Object.defineProperty(exports,"Rn",{enumerable:!0,get:function(){return Ze}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return $c}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return SE}}),Object.defineProperty(exports,"Sn",{enumerable:!0,get:function(){return Rr}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Cu}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Uw}}),Object.defineProperty(exports,"Tn",{enumerable:!0,get:function(){return Zi}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return zu}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return ES}}),Object.defineProperty(exports,"Un",{enumerable:!0,get:function(){return pt}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return il}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return RS}}),Object.defineProperty(exports,"Vn",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return cl}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Hx}}),Object.defineProperty(exports,"Wn",{enumerable:!0,get:function(){return ft}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return sl}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Px}}),Object.defineProperty(exports,"Xn",{enumerable:!0,get:function(){return St}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return fl}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return lx}}),Object.defineProperty(exports,"Yn",{enumerable:!0,get:function(){return gt}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return ul}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return gS}}),Object.defineProperty(exports,"Zn",{enumerable:!0,get:function(){return dt}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return ml}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return gD}}),Object.defineProperty(exports,"_n",{enumerable:!0,get:function(){return zr}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return oh}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return DD}}),Object.defineProperty(exports,"an",{enumerable:!0,get:function(){return Go}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Xv}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return hD}}),Object.defineProperty(exports,"bn",{enumerable:!0,get:function(){return Br}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return Pu}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return pD}}),Object.defineProperty(exports,"cn",{enumerable:!0,get:function(){return Ga}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return k_}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return _D}}),Object.defineProperty(exports,"dn",{enumerable:!0,get:function(){return Dt}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return i_}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return Xc}}),Object.defineProperty(exports,"er",{enumerable:!0,get:function(){return Ve}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return tb}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return vD}}),Object.defineProperty(exports,"fn",{enumerable:!0,get:function(){return Tn}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return c_}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return fD}}),Object.defineProperty(exports,"gn",{enumerable:!0,get:function(){return On}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return rh}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return eD}}),Object.defineProperty(exports,"hn",{enumerable:!0,get:function(){return Dr}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Fg}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return ED}}),Object.defineProperty(exports,"in",{enumerable:!0,get:function(){return no}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return nb}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return BC}}),Object.defineProperty(exports,"jn",{enumerable:!0,get:function(){return sn}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return mu}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return ow}}),Object.defineProperty(exports,"kn",{enumerable:!0,get:function(){return At}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return Bu}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return mD}}),Object.defineProperty(exports,"ln",{enumerable:!0,get:function(){return Va}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return O_}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return tD}}),Object.defineProperty(exports,"mn",{enumerable:!0,get:function(){return Jn}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return jg}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return AD}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return No}}),Object.defineProperty(exports,"nr",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return rb}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return bD}}),Object.defineProperty(exports,"on",{enumerable:!0,get:function(){return Wa}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Zv}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return uD}}),Object.defineProperty(exports,"pn",{enumerable:!0,get:function(){return vi}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return o_}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return Tx}}),Object.defineProperty(exports,"qn",{enumerable:!0,get:function(){return xt}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return ll}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return wD}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return to}}),Object.defineProperty(exports,"rr",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Ty}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return OD}}),Object.defineProperty(exports,"sn",{enumerable:!0,get:function(){return Ka}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Qv}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return jD}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return ws}}),Object.defineProperty(exports,"tr",{enumerable:!0,get:function(){return ze}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return $y}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return dD}}),Object.defineProperty(exports,"un",{enumerable:!0,get:function(){return Xa}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return A_}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return NE}}),Object.defineProperty(exports,"vn",{enumerable:!0,get:function(){return xr}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return id}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Ww}}),Object.defineProperty(exports,"wn",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return Iu}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return yD}}),Object.defineProperty(exports,"xn",{enumerable:!0,get:function(){return An}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Mu}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return PE}}),Object.defineProperty(exports,"yn",{enumerable:!0,get:function(){return Mn}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Su}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return LS}}),Object.defineProperty(exports,"zn",{enumerable:!0,get:function(){return Qe}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return gl}});
|