tla-ts 0.0.8-dev.aa7b562 → 0.0.8-dev.d9bffda

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/dist/transfer.cjs CHANGED
@@ -6,15 +6,15 @@
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"),t=/* @__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(`.`)),n=/* @__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`]]),r=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),i=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),a=/* @__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`]]),o=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),s=e=>e.startsWith(`\\`)?parseInt(e.slice(2),o.get(e[1].toLowerCase())):Number(e),c=/-{4,}[ \t]*MODULE\b/,l=/* @__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)l[n.charCodeAt(0)]|=e});const u=(e,t)=>e<128&&(l[e]&t)!==0,d=(e,t,n)=>{let r=t;for(;u(e.charCodeAt(r),n);)r++;return r},f=/* @__PURE__ */ new Map;i.forEach(e=>{let t=e.charCodeAt(0),n=f.get(t)??[];n.push(e),f.set(t,n)});const p=(e,t)=>{let n=f.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]}},m=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(a.has(n))return n;let r=e[t];return a.has(r)?r:void 0},h=(e,t)=>{let i=e.charCodeAt(t);if(i===92&&u(e.charCodeAt(t+1),2)){let r=e.slice(t+1,d(e,t+1,2)),i={value:r.length};for(;i.value>0&&!n.has(r.slice(0,i.value));)i.value--;let a=n.get(r.slice(0,i.value));return{text:a??`\\`,length:a===void 0?1:i.value+1}}let o=m(e,t);if(o!==void 0)return{text:a.get(o)??``,length:o.length};let s=p(e,t);return s?{text:r.get(s)??s,length:s.length}:i===92?{text:`\\`,length:1}:void 0},ee=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),te=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>a.has(e)||ee.has(e));return n===void 0?void 0:{text:n,length:n.length}},g=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},_=(e,t)=>{let n=e[t+1]===`+`||e[t+1]===`*`?t+2:d(e,t+1,1);if(n===t+1||e[n]!==`>`)return 0;let r=d(e,n+1,7),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return g(e,i?r+1:r,e=>e===`.`)-t},ne=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,re={n:`
10
- `,t:` `,r:`\r`,f:`\f`},v=(e,t)=>t===9?e+8-e%8:e+1,ie=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),ae=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=ie.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=d(e,t+2,n);return r===t+2?0:r-t},oe=n=>{let r=c.exec(n);if(!r)throw new e.O(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,o=n.slice(0,r.index).split(`
11
- `),s={index:r.index,line:o.length,lineStart:r.index-o[o.length-1].length,moduleDepth:0},l={lineStart:-1,position:0,width:0},f=()=>{for((l.lineStart!==s.lineStart||l.position>s.index)&&(l.lineStart=s.lineStart,l.position=s.lineStart,l.width=0);l.position<s.index;l.position++)l.width=v(l.width,n.charCodeAt(l.position));return v(l.width,n.charCodeAt(s.index))},p=(e,t,n,r)=>{let a=f();i.push({kind:e,text:t,spelling:r,line:s.line,column:a,endColumn:a+n-1}),s.index+=n},m=e=>{for(let t=0;t<e;t++)n.charCodeAt(s.index)===10&&(s.line++,s.lineStart=s.index+1),s.index++},te=t=>new e.O(`${t} at line ${s.line}, column ${f()}`,void 0,{reason:t,line:s.line,column:f(),isEnd:s.index>=n.length});for(;s.index<n.length;){let e=n.charCodeAt(s.index);if(e===10||e===32||e===9||e===13){m(1);continue}if(e===92&&n.charCodeAt(s.index+1)===42){let e=n.indexOf(`
12
- `,s.index);m((e===-1?n.length:e)-s.index);continue}if(e===40&&n.charCodeAt(s.index+1)===42){let e={value:0};do{if(s.index>=n.length)throw te(`Unterminated comment`);n.startsWith(`(*`,s.index)?(e.value++,m(2)):n.startsWith(`*)`,s.index)?(e.value--,m(2)):m(1)}while(e.value>0);continue}if(e===45&&n.startsWith(`----`,s.index)){let e=g(n,s.index,e=>e===`-`)-s.index;n.slice(s.index+e).trimStart().startsWith(`MODULE`)&&s.moduleDepth++,p(`Separator`,`----`,e);continue}if(e===61&&n.startsWith(`====`,s.index)){if(p(`ModuleEnd`,`====`,g(n,s.index,e=>e===`=`)-s.index),s.moduleDepth--,s.moduleDepth<=0)break;continue}if(e===34){let e=s.line,t=f(),r=[];for(m(1);n.charCodeAt(s.index)!==34;){let e=n.charCodeAt(s.index);if(s.index>=n.length||e===10||e===13)throw te(`Unterminated string`);if(e===92){let e=n[s.index+1];if(e===void 0||!`ntrf\\"`.includes(e))throw te(`Invalid escape in string`);r.push(re[e]??e),m(2)}else r.push(n[s.index]),m(1)}m(1),i.push({kind:`String`,text:r.join(``),line:e,column:t,endColumn:f()-1});continue}let r=ae(n,s.index);if(r>0){p(`Number`,n.slice(s.index,s.index+r),r);continue}if(u(e,7)){let r=d(n,s.index,7),i=n.slice(s.index,r),o=d(n,s.index,1);if(o===r){let e=n.charCodeAt(r)===46?d(n,r+1,1):r,t=e>r+1,a=t?n.slice(s.index,e):i;p(t?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let t=e===95?`_`:n.slice(s.index,o);p(t===`_`?`Operator`:`Number`,t,t.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){p(`Keyword`,i.slice(0,3),3);continue}let c=a.get(i)??i;a.set(c,c),p(t.has(i)?`Keyword`:`Identifier`,c,i.length);continue}let o=n[s.index];if(e>=128&&ee.has(o)){p(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(e===60){let e=_(n,s.index);if(e>0){p(`Step`,n.slice(s.index,s.index+e),e);continue}}let c=h(n,s.index);if(c){let e=n.slice(s.index,s.index+c.length);p(`Operator`,c.text,c.length,e===c.text?void 0:e)}else throw te(`Unexpected character ${JSON.stringify(o)}`)}let ne=f();return i.push({kind:`End`,text:``,line:s.line,column:ne,endColumn:ne}),i},se=[[`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`]],ce=se.map(e=>e[0]),le=new Map(ce.map((e,t)=>[e,t]).reverse()),y=t=>{let n=le.get(t);if(n===void 0)throw new e.g(`Unknown SANY token kind ${t}`);return n},ue=new Map(se.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),de=Math.max(...[...ue.keys()].map(e=>e.length)),fe=Array.from({length:de},(e,t)=>de-t),pe=/----+ *MODULE/y,b=[/_\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],x=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`)),S=x(String.raw`\.\/\\`),C=x(String.raw`\.\\\/`),me=String.raw`<(?:[0-9]+|\+|\*)>`,he=[[`_BM0`,[pe]],[`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`,S],[`BOR`,C],[`IDENTIFIER`,b],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${me}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(me,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${me}(?:\*\.*|-\.*|\.+)`,`y`)]]],ge=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[pe]]],_e=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[pe]],[`BAND`,S],[`BOR`,C],[`IDENTIFIER`,b]],ve=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),ye=(e,t,n)=>e.map(([e,r])=>({kind:y(e),length:Math.max(...r.map(e=>ve(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),be=(e,t)=>{let n=fe.find(n=>ue.has(e.slice(t,t+n))),r=ye(he,e,t);if(n===void 0)return r;let i={kind:ue.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},w=e=>e+8-e%8,xe=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
9
+ const e=require("./worker.cjs"),t=/* @__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(`.`)),n=/* @__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`]]),r=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),i=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),a=/* @__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`]]),o=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),s=e=>e.startsWith(`\\`)?parseInt(e.slice(2),o.get(e[1].toLowerCase())):Number(e),c=/-{4,}[ \t]*MODULE\b/,l=/* @__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)l[n.charCodeAt(0)]|=e});const u=(e,t)=>e<128&&(l[e]&t)!==0,d=(e,t,n)=>{let r=t;for(;u(e.charCodeAt(r),n);)r++;return r},f=/* @__PURE__ */ new Map;i.forEach(e=>{let t=e.charCodeAt(0),n=f.get(t)??[];n.push(e),f.set(t,n)});const p=(e,t)=>{let n=f.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]}},m=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(a.has(n))return n;let r=e[t];return a.has(r)?r:void 0},ee=(e,t)=>{let i=e.charCodeAt(t);if(i===92&&u(e.charCodeAt(t+1),2)){let r=e.slice(t+1,d(e,t+1,2)),i={value:r.length};for(;i.value>0&&!n.has(r.slice(0,i.value));)i.value--;let a=n.get(r.slice(0,i.value));return{text:a??`\\`,length:a===void 0?1:i.value+1}}let o=m(e,t);if(o!==void 0)return{text:a.get(o)??``,length:o.length};let s=p(e,t);return s?{text:r.get(s)??s,length:s.length}:i===92?{text:`\\`,length:1}:void 0},te=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ne=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>a.has(e)||te.has(e));return n===void 0?void 0:{text:n,length:n.length}},h=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},g=(e,t)=>{let n=e[t+1]===`+`||e[t+1]===`*`?t+2:d(e,t+1,1);if(n===t+1||e[n]!==`>`)return 0;let r=d(e,n+1,7),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return h(e,i?r+1:r,e=>e===`.`)-t},re=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,ie={n:`
10
+ `,t:` `,r:`\r`,f:`\f`},_=(e,t)=>t===9?e+8-e%8:e+1,ae=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),oe=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=ae.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=d(e,t+2,n);return r===t+2?0:r-t},se=n=>{let r=c.exec(n);if(!r)throw new e.O(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,o=n.slice(0,r.index).split(`
11
+ `),s={index:r.index,line:o.length,lineStart:r.index-o[o.length-1].length,moduleDepth:0},l={lineStart:-1,position:0,width:0},f=()=>{for((l.lineStart!==s.lineStart||l.position>s.index)&&(l.lineStart=s.lineStart,l.position=s.lineStart,l.width=0);l.position<s.index;l.position++)l.width=_(l.width,n.charCodeAt(l.position));return _(l.width,n.charCodeAt(s.index))},p=(e,t,n,r)=>{let a=f();i.push({kind:e,text:t,spelling:r,line:s.line,column:a,endColumn:a+n-1}),s.index+=n},m=e=>{for(let t=0;t<e;t++)n.charCodeAt(s.index)===10&&(s.line++,s.lineStart=s.index+1),s.index++},ne=t=>new e.O(`${t} at line ${s.line}, column ${f()}`,void 0,{reason:t,line:s.line,column:f(),isEnd:s.index>=n.length});for(;s.index<n.length;){let e=n.charCodeAt(s.index);if(e===10||e===32||e===9||e===13){m(1);continue}if(e===92&&n.charCodeAt(s.index+1)===42){let e=n.indexOf(`
12
+ `,s.index);m((e===-1?n.length:e)-s.index);continue}if(e===40&&n.charCodeAt(s.index+1)===42){let e={value:0};do{if(s.index>=n.length)throw ne(`Unterminated comment`);n.startsWith(`(*`,s.index)?(e.value++,m(2)):n.startsWith(`*)`,s.index)?(e.value--,m(2)):m(1)}while(e.value>0);continue}if(e===45&&n.startsWith(`----`,s.index)){let e=h(n,s.index,e=>e===`-`)-s.index;n.slice(s.index+e).trimStart().startsWith(`MODULE`)&&s.moduleDepth++,p(`Separator`,`----`,e);continue}if(e===61&&n.startsWith(`====`,s.index)){if(p(`ModuleEnd`,`====`,h(n,s.index,e=>e===`=`)-s.index),s.moduleDepth--,s.moduleDepth<=0)break;continue}if(e===34){let e=s.line,t=f(),r=[];for(m(1);n.charCodeAt(s.index)!==34;){let e=n.charCodeAt(s.index);if(s.index>=n.length||e===10||e===13)throw ne(`Unterminated string`);if(e===92){let e=n[s.index+1];if(e===void 0||!`ntrf\\"`.includes(e))throw ne(`Invalid escape in string`);r.push(ie[e]??e),m(2)}else r.push(n[s.index]),m(1)}m(1),i.push({kind:`String`,text:r.join(``),line:e,column:t,endColumn:f()-1});continue}let r=oe(n,s.index);if(r>0){p(`Number`,n.slice(s.index,s.index+r),r);continue}if(u(e,7)){let r=d(n,s.index,7),i=n.slice(s.index,r),o=d(n,s.index,1);if(o===r){let e=n.charCodeAt(r)===46?d(n,r+1,1):r,t=e>r+1,a=t?n.slice(s.index,e):i;p(t?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let t=e===95?`_`:n.slice(s.index,o);p(t===`_`?`Operator`:`Number`,t,t.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){p(`Keyword`,i.slice(0,3),3);continue}let c=a.get(i)??i;a.set(c,c),p(t.has(i)?`Keyword`:`Identifier`,c,i.length);continue}let o=n[s.index];if(e>=128&&te.has(o)){p(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(e===60){let e=g(n,s.index);if(e>0){p(`Step`,n.slice(s.index,s.index+e),e);continue}}let c=ee(n,s.index);if(c){let e=n.slice(s.index,s.index+c.length);p(`Operator`,c.text,c.length,e===c.text?void 0:e)}else throw ne(`Unexpected character ${JSON.stringify(o)}`)}let re=f();return i.push({kind:`End`,text:``,line:s.line,column:re,endColumn:re}),i},ce=[[`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`]],le=ce.map(e=>e[0]),ue=new Map(le.map((e,t)=>[e,t]).reverse()),v=t=>{let n=ue.get(t);if(n===void 0)throw new e.g(`Unknown SANY token kind ${t}`);return n},y=new Map(ce.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),de=Math.max(...[...y.keys()].map(e=>e.length)),fe=Array.from({length:de},(e,t)=>de-t),pe=/----+ *MODULE/y,b=[/_\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],x=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`)),S=x(String.raw`\.\/\\`),C=x(String.raw`\.\\\/`),me=String.raw`<(?:[0-9]+|\+|\*)>`,he=[[`_BM0`,[pe]],[`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`,S],[`BOR`,C],[`IDENTIFIER`,b],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${me}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(me,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${me}(?:\*\.*|-\.*|\.+)`,`y`)]]],ge=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[pe]]],_e=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[pe]],[`BAND`,S],[`BOR`,C],[`IDENTIFIER`,b]],ve=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),ye=(e,t,n)=>e.map(([e,r])=>({kind:v(e),length:Math.max(...r.map(e=>ve(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),w=(e,t)=>{let n=fe.find(n=>y.has(e.slice(t,t+n))),r=ye(he,e,t);if(n===void 0)return r;let i={kind:y.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},T=e=>e+8-e%8,be=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
13
13
  `?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
14
- `?r.isAfterLf=!0:i===` `&&(r.column=w(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Se=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ce=new Set([...ue.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),we=(e,t)=>{let n=0;for(;Ce.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,ve(Se,e,t)))},Te=e=>{let t=xe(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(y(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Oe(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
- `||e[a]===`\r`?Oe(o+1,0,void 0,i):Oe(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=ye(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,ce[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),ce[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(ge);if(n.mode===`PRAGMA`)return s(_e);for(;n.offset<e.length;){let t=n.offset;if(`
16
- \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=be(e,t);if(i.length===0){let n=we(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},Ee=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),De=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ee.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Oe=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${De(n)}" (${n.charCodeAt(0)}), `}after : "${De(r)}"`,ke=e=>{let t=Te(e);for(let e=t();typeof e!=`string`&&e.kind!==y(`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===` `?w(e):e+1,e.beginColumn);return Oe(e.beginLine,n,e.image[t],e.image.slice(0,t))}},T=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(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),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:[])}},E=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ae=`-------------------------------- MODULE Reals -------------------------------
14
+ `?r.isAfterLf=!0:i===` `&&(r.column=T(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},xe=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Se=new Set([...y.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Ce=(e,t)=>{let n=0;for(;Se.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,ve(xe,e,t)))},we=e=>{let t=be(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(v(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?De(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
+ `||e[a]===`\r`?De(o+1,0,void 0,i):De(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=ye(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,le[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),le[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(ge);if(n.mode===`PRAGMA`)return s(_e);for(;n.offset<e.length;){let t=n.offset;if(`
16
+ \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=w(e,t);if(i.length===0){let n=Ce(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},Te=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ee=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Te.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),De=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ee(n)}" (${n.charCodeAt(0)}), `}after : "${Ee(r)}"`,Oe=e=>{let t=we(e);for(let e=t();typeof e!=`string`&&e.kind!==v(`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===` `?T(e):e+1,e.beginColumn);return De(e.beginLine,n,e.image[t],e.image.slice(0,t))}},ke=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(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),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:[])}},E=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ae=`-------------------------------- MODULE Reals -------------------------------
18
18
  (***************************************************************************)
19
19
  (* This module provides dummy definitions of the operators that are *)
20
20
  (* defined by the real Reals module. It is expected that any tool that *)
@@ -83,11 +83,11 @@ _TEPosition ==
83
83
  THEN _TETraceLength
84
84
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
85
85
 
86
- =============================================================================`,Ne=/* @__PURE__ */ new Map([[`Reals`,Ae],[`RealTime`,je],[`Toolbox`,Me]]),Pe={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Fe=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Ie=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Le=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Re=e=>{let t=t=>{let n=g(e,t,Fe);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=g(e,t,Ie);if(e.startsWith(`..`,n)&&Ie(e[n+2]))return{kind:`Constant`,first:t,last:g(e,n+2,Ie)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Ie(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:g(e,t+1,Ie)-1,children:[]};if(Le(n))return{kind:`Constant`,first:t,last:g(e,t,Le)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},D=e=>{let t=e.length===0?void 0:Re(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Pe[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),ee=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||ee===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${ee}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},O=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,k=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),A=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),j=e=>typeof e==`object`&&e.kind===`ModelValue`,ze=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Be=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:O(e)?`set`:`function`,Ve=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,He={isUsed:!1},Ue=(e,t)=>(He.isUsed=!0,e.writtenKeys=t,e),We=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Zn(e.domain,t)]]),Ge=(e,t,n)=>Ue(On(e,t),n),Ke=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(Ke);e.writtenKeys=void 0,e.range.forEach(Ke)}},qe=e=>e.every(e=>typeof e==`string`),Je=(e,t)=>e.length>0&&t.length>0&&qe(e)!==qe(t),Ye=(e,t)=>{He.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Je(n,r)?Yt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=ft(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:ft(t,n);if(r!==0)return r}return 0},Xe=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=ft(n[e],r[e]);if(t!==0)return t}return 0},Ze=e=>j(e)?e.type:void 0,Qe=(t,n,r)=>{let i=Ze(t),a=Ze(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(j(t)&&j(n)){if(i===void 0||a===void 0||i===a)return;throw new e._(`Attempted to ${o} the differently-typed model values ${I(t)} and ${I(n)}`)}throw i===void 0?new e._(`Attempted to ${o} the typed model value ${I(n)} and the non-model value\n${I(t)}`):new e._(`Attempted to ${o}${r?``:` the`} typed model value ${I(t)} and non-model value\n${I(n)}`)},$e={ranks:Object.create(null),size:0},et=e=>{$e.ranks=Object.create(null),$e.size=0,pt.clear();for(let t of e)rt(t)},tt={is174:!1},nt=e=>{tt.is174=e===`1.7.4`},rt=e=>($e.ranks[e]===void 0&&($e.ranks[e]=$e.size++),e),it=()=>$e.size,at=e=>$e.ranks[rt(e)],ot=(e,t)=>{if(e===t)return 0;let n=$e.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},st=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),ct=(e,t)=>(st(e)||st(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),lt=(t,n,r)=>{if(!st(t))throw new e._(`Attempted to ${r} the set ${I(M(t)?N(t):t,!0)} with the value:\n${I(n,!0)}`);if(!st(n))throw new e._(`Attempted to compare overridden value ${I(t,!0)} with non-overridden value:\n${I(n,!0)}`);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e._(`Attempted to compare ${I(t,!0)} with the value\n${I(n,!0)}`)},ut={kind:`InfiniteSet`,name:`Any`},dt=t=>{throw new e._(`Attempted to compare ANY with the value\n${I(t)}`)},ft=(t,n)=>{if(t===n)return He.isUsed&&Ke(t),t===ut?dt(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return Ye(t,n);if(r===`Set`&&i===`Set`)return Xe(t,n);if(r===`Interval`&&i===`Interval`){let e=Math.max(0,t.high-t.low+1),r=Math.max(0,n.high-n.low+1);return e!==r||e===0?e-r:t.low-n.low}if(r===`ModelValue`&&i===`ModelValue`)return t.type!==void 0&&n.type!==void 0&&Qe(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return Qe(t,n,!1),r===`ModelValue`?-1:1;if(t===ut||n===ut)return dt(t===ut?n:t);if(O(t)&&O(n)&&ct(t,n))return lt(t,n,`compare`);let a=O(t);if(a!==O(n))throw new e._(`Attempted to compare ${Be(t)} ${I(t)} with ${Be(n)} ${I(n)}`);return a?Xe(N(t),N(n)):Ye(F(t),F(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return ot(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(Qe(t,n,!1),j(t))return-1;if(j(n))return 1;throw new e._(`Attempted to compare ${Be(t)} ${I(t)} with ${Be(n)} ${I(n)}`)},pt=/* @__PURE__ */ new Map,mt=e=>{let t=pt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:at(e)};return pt.set(e,n),n},ht=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),gt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),_t={isPresent:!1},vt=(e,t)=>(t===`lambda`&&(_t.isPresent=!0),t!==void 0&&(e.functionClass=t),e),yt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,bt=e=>vt(e,`lambda`),xt=/* @__PURE__ */ new WeakSet,St=/* @__PURE__ */ new WeakSet,Ct={isPresent:!1},wt=e=>(Ct.isPresent=!0,e),Tt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Et=e=>{Ct.isPresent&&typeof e==`object`&&Tt.has(e.kind)&&St.add(e)},Dt=e=>{if((_t.isPresent||Ct.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(xt.has(e))return;xt.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Dt),e.range.forEach(Dt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Dt):O(e)&&M(e)&&(Et(e),N(e).elements.forEach(Dt))}},Ot=(e,t)=>{if(Et(e),e===t)return He.isUsed&&Ke(e),e!==ut||dt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Qe(e,t,!0),ft(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return Ye(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Xe(e,t)===0;if(j(e)||j(t))return Qe(e,t,!0),j(e)&&j(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Ot(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=P(e.domain),r=P(t.domain);if(n||r)return n===r;let i=P(e.range),a=P(t.range);return i||a?i===a:Ot(e.domain,t.domain)&&Ot(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(P(e))return P(t);if(P(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Ot(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return P(e)?P(t):!P(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Ot(e,t.factors[n]));let n=O(e)&&O(t)&&!(M(e)&&M(t));if(n&&ct(e,t))return lt(e,t,`check equality of`)===0;if(n){if(!st(e)){let n=N(e);if(!st(t))return Xe(n,N(t))===0}return Lr(e)===Lr(t)}return ft(e,t)===0},kt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):Lr(n)===Lr(r);return n},At=kt(!1),jt=kt(!0),Mt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Nt=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Or(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||jt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||jt(i[e],n))return i[e]}return n.kind===`Set`?Mt(n.elements,t):(Mt(n.domain,t),Mt(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}},Pt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Ft=e=>{if(!A(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:Pt(t.domain)}},It=e=>{if(!A(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Lt=(e,t)=>(Qe(t,e,!1),1),Rt=(e,t)=>(Qe(t,e,!0),!1),zt=(e,t)=>(e.type!==void 0&&Qe(e,t,!1),j(t)?e.rank-t.rank:-1),Bt=(e,t)=>(e.type!==void 0&&Qe(e,t,!0),j(t)&&e.name===t.name),Vt={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`}},Ht=(e,t,n)=>{let r=Vt[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${I(e)} with ${r.other}:\n${I(t)}`},Ut=(t,n,r)=>{let i=Ft(r);if(!i){if(j(r))return Lt(r,n);throw new e._(`Attempted to compare the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Wt(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Wt(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e._(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${I(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Wt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Yt(e[n],t[n]);if(r!==0)return r}return 0},Gt=(t,n)=>{let r=F(t);if(t.kind===`Function`&&Qn(r)!==void 0){let e=A(n)?Qn(n):void 0;return e?r.range.length-e.length||Wt(r.range,e):Ut({...r,low:1},t,n)}if(yt(t)===`record`){let i=It(n);if(!i){if(j(n))return Lt(n,t);throw new e._(`Attempted to compare record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length-i.domain.length||Wt(r.domain,i.domain)||Wt(r.range,i.range)}return Ut({...r,low:Pt(r.domain)},t,n)},Kt=(e,t)=>st(e)||st(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),qt=(e,t)=>{let n=ze(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},Jt=(t,n)=>{if(Kt(t,n))return ft(t,n);if(!ze(t))return Jt(N(t),n);if(!O(n)){if(j(n))return Lt(n,t);throw new e._(`Attempted to compare the set ${I(t)} with the value:\n${I(n)}`)}let r=qt(t,n);return r.elements.length-r.otherElements.length||Wt(r.elements,r.otherElements)},Yt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return ft(t,n);if(j(n))return Lt(n,t);throw new e._(Ht(t,n,!1))}return t.kind===`ModelValue`?zt(t,n):A(t)?Gt(t,n):Jt(t,n)},Xt=(e,t)=>e.every((e,n)=>en(e,t[n])),Zt=(t,n,r)=>{let i=Ft(r);if(!i){if(j(r))return Rt(r,n);throw new e._(`Attempted to check equality of the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&Xt(t.range,i.range);let a=t.low??i.low;return a===void 0?Xt(t.domain,i.domain)&&Xt(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e._(`Attempted to compare an integer with non-integer:\n${I(t)}.`);return t===a+n})&&Xt(t.range,i.range)},Qt=(t,n)=>{let r=F(t);if(t.kind===`Function`&&Qn(r)!==void 0){let e=A(n)?Qn(n):void 0;return e?r.range.length===e.length&&Xt(r.range,e):Zt({...r,low:1},t,n)}if(yt(t)===`record`){let i=It(n);if(!i){if(j(n))return Rt(n,t);throw new e._(`Attempted to check equality of record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length===i.domain.length&&Xt(r.domain,i.domain)&&Xt(r.range,i.range)}return Zt({...r,low:Pt(r.domain)},t,n)},$t=(t,n)=>{if(Kt(t,n))return Ot(t,n);if(!ze(t))return $t(N(t),n);if(!O(n)){if(j(n))return Rt(n,t);throw new e._(`Attempted to check equality of the set ${I(t)} with the value:\n${I(n)}`)}let r=qt(t,n);return r.elements.length===r.otherElements.length&&Xt(r.elements,r.otherElements)},en=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(j(n))return Rt(n,t);throw new e._(Ht(t,n,!0))}return t.kind===`ModelValue`?Bt(t,n):A(t)?Qt(t,n):$t(t,n)},tn=e=>{let t=[];for(let n of e){let e=rn(n,t);e.isFound||t.splice(e.index,0,n)}return t},nn=(e,t)=>{let n=er.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},rn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=nn(e,()=>Yt(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},an=(e,t)=>t.some(t=>nn(t,()=>en(t,e))),on=/* @__PURE__ */ new WeakSet,sn=e=>{typeof e==`object`&&(e.kind===`Set`&&(on.add(e),e.elements.forEach(sn)),e.kind===`Function`&&(e.domain.forEach(sn),e.range.forEach(sn)))},cn=(e,t)=>tr(Ot,en,e,t),ln=e=>{for(let t=1;t<e.length;t++)if(ft(e[t-1],e[t])>=0)return!1;return!0},un=e=>{for(let t=1;t<e.length;t++)Et(e[t]);if(e.length<2||ln(e))return ht(e);let t=[...e].sort(ft),n=[t[0]];for(let e=1;e<t.length;e++)ft(n[n.length-1],t[e])!==0&&n.push(t[e]);return ht(n)},dn=e=>tr(un,e=>({kind:`MixedSet`,elements:e}),e,void 0),fn=ht([]),pn=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&ft(r[a],t)<0;)a++;a<r.length&&ft(r[a],t)===0||i.push(t)}return i.length===n.length?e:ht(i)},mn=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&ft(r[a],t)<0;)a++;a<r.length&&ft(r[a],t)===0&&i.push(t)}return i.length===n.length?e:ht(i)},hn=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=ft(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=ht(i);if(e.hash!==0&&e.hash!==Cr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Or(a[n]);if(e===Cr)break;t=t+xr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Mr(a[e])|0;c.fingerprint=t}return c},gn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>ft(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&ft(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return gt(n,r)},_n=e=>{let t=gn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Ue(t,e.map(e=>e[0]))},vn=[],yn=[],bn=/* @__PURE__ */ new WeakMap,xn=e=>{let t=vn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return vn[e]=n,n},Sn=e=>{if(Jn(e),e.low===1&&e.high>=1)return xn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Cn=e=>e.length>0&&(e===vn[e.length]||bn.has(e)),wn=e=>{let t=N(e).elements;return Cn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Tn=e=>{let t=yn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return yn[e]=n,n},En=e=>vt(gt(xn(e.length),e),`tuple`),Dn=e=>vt(gn(e),`record`),On=(e,t)=>vt(gt(e,t),`record`),kn=e=>O(e)&&!st(e),An=(e,t=!1)=>`UNION(${I(e.base,t)})`,jn=(t,n=e=>N(e).elements)=>{if(!kn(t.base))throw new e._(`Attempted to enumerate the nonenumerable set:\n${An(t)}`);return n(t.base)},Mn=(t,n,r)=>{if(kn(t))return t;throw new e._(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${I(t)}\nwhen enumerating:\n${An(r)}`)},M=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return M(e.base);case`FunctionSet`:return M(e.domain)&&M(e.range)||Nn(e.domain)===!0||Nn(e)===!0;case`RecordSet`:return e.sets.every(M)||Nn(e)===!0;case`ProductSet`:return e.factors.every(M)||Nn(e)===!0;case`Union`:return M(e.base)&&Vn(e.base).every(M);case`SetOperation`:return e.operator===`\\cup`?M(e.left)&&M(e.right):e.operator===`\\cap`?M(e.left)||M(e.right):M(e.left);default:return!1}},Nn=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=Nn(e.domain);return t===void 0?void 0:!t&&Nn(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Nn(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return M(e)?N(e).elements.length===0:void 0;default:return}},Pn=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},Fn=(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},In=e=>{if(typeof e!=`object`||e.kind!==`Subset`||st(e.base))return;let t=N(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Fn(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return ht(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},Ln=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(ht(r.map(t=>e[t])));while(Fn(r,e.length))}return t},Rn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(st(o))throw new e._(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},zn=(t,n=e=>N(e).elements)=>{if(typeof t!=`object`)throw new e._(`Expected a set but found ${I(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return tn(t.elements);case`Interval`:{let e=Sn(t);return e!==vn[e.length]&&bn.set(e,t),e}case`Subset`:{if(Jn(t.base)===0)return Ln([]);if(!O(t.base))throw new e._(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${D(I(t.base))}`);let n=N(t.base).elements;if(n.length>30)throw new e._(qn(t));return Ln(n)}case`FunctionSet`:{if(!tt.is174&&P(t))return[];if(st(t.domain))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(t.domain)}\ncannot be enumerated.`);let r=wn(t.domain);if((r.length>0||tt.is174)&&st(t.range))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${I(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Pn(r.map(()=>i)).map(e=>gt(r,e))}case`RecordSet`:{if(!tt.is174&&P(t))return[];let e=Rn(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${I(e)}`);return Pn(e).map(e=>Dn(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!tt.is174&&P(t))return[];let e=Rn(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${I(e)}`);return Pn(e).map(En)}case`FilteredSet`:if(!O(t.base)||st(t.base))throw new e._(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(t.base)}\nis not enumerable`);return N(t.base).elements.filter(t.test);case`Union`:{let e=jn(t).flatMap((e,n)=>N(Mn(e,n,t)).elements);return N(dn(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!kn(t.left)||!kn(t.right)))throw new e._(`Attempted to enumerate S \\cup T when S:\n${I(t.left)}\nand T:\n${I(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!kn(t.left)&&!kn(t.right))throw new e._(`Attempted to enumerate S \\cap T when neither S:\n${I(t.left)}\nnor T:\n${I(t.right)}\nis enumerable`);if(t.operator===`\\`&&!kn(t.left))throw new e._(`Attempted to enumerate S \\ T when S:\n${I(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return hn(N(t.left),N(t.right)).elements;let n=t.operator===`\\`||kn(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return N(r).elements.filter(e=>nr(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to enumerate the non-enumerable set ${I(t)}`);default:throw new e._(`Expected a set but found ${I(t)}`)}},Bn=/* @__PURE__ */ new WeakMap,N=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return ht(zn(e));let t=typeof e==`object`?Bn.get(e):void 0;if(t)return t;let n=er.sets;n?.push(e);let r=zn(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`)?ht(r):un(r);return typeof e==`object`&&Bn.set(e,i),i},Vn=e=>{if(typeof e!=`object`||St.has(e))return N(e).elements;let t=er.sets;t?.push(e);let n=Gn(e);return t?.pop(),n},Hn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Un=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Un);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Un)&&e.range.every(Un);case`SetOperation`:return e.operator!==`\\cup`&&Un(e.left)&&Un(e.right);case`FilteredSet`:return Un(e.base);case`ProductSet`:return e.factors.every(Un);default:return!1}},Wn=e=>typeof e!=`object`||St.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Wn(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Wn(e.left)||Wn(e.right):Hn(e)?.some(Wn)??!1,Gn=e=>{if(e.kind===`Union`)return jn(e,Vn).flatMap((t,n)=>Vn(Mn(t,n,e)));if(e.kind===`FilteredSet`&&!st(e.base))return Vn(e.base).filter(e.test);if(Hn(e)?.some(Wn))return zn(e,Vn);if(e.kind!==`SetOperation`)return N(e).elements;if(e.operator===`\\cup`)return!kn(e.left)||!kn(e.right)?N(e).elements:[...Vn(e.left),...Vn(e.right)];let t=e.operator===`\\`||kn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return kn(n)?Vn(n).filter(t=>nr(t,r)===(e.operator===`\\cap`)):N(e).elements},P=t=>{if(typeof t!=`object`||!O(t))throw new e._(`Shouldn't call isEmpty() on value ${I(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e._(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(P);case`RecordSet`:return t.sets.some(P);case`FunctionSet`:return!P(t.domain)&&P(t.range);case`Union`:return jn(t).every((e,n)=>P(Mn(e,n,t)));default:return N(t).elements.length===0}},Kn=(t,n,r)=>t.reduce((t,i)=>{let a=t*Jn(i,n);if(a>2147483647)throw new e._(r());return a},1),qn=e=>`Overflow when computing the number of elements in:\n${I(e)}`,Jn=(t,n)=>{if(typeof t!=`object`)throw new e._(`Attempted to compute the number of elements in the ${Be(t)} ${I(t)}.`);switch(t.kind){case`ModelValue`:throw new e._(`Attempted to compute the number of elements in the model value ${I(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Jn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e._(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to compute the number of elements in the overridden value ${I(t)}.`);case`Subset`:{let r=Jn(t.base,n);if(r>=31)throw new e._(qn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(P(t.domain))return 1;if(P(t.range))return 0;if(Jn(t.range,n)===1)return 1}let r=Jn(t.domain,n),i=Jn(t.range,n);if(i<=1)return r===0?1:i;let a={value:1};for(let n=0;n<r;n++)if(a.value*=i,a.value>2147483647)throw new e._(qn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&P(t)?0:Kn(t.sets,n,()=>qn(t));case`ProductSet`:return n!==`1.7.4`&&P(t)?0:Kn(t.factors,n,()=>`Overflow when computing the number of elements in ${I(t)}`);default:return Et(t),N(t).elements.length}},Yn=e=>`Attempted to check if the set ${I(e)}is finite.`,Xn=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e._(`Attempted to check if the ${Be(t)} ${I(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e._(`Attempted to check if the function:\n${I(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Xn(t.base)&&P(t.base);case`Subset`:return Xn(t.base);case`FunctionSet`:{let e=Xn(t.domain);if(e&&P(t.domain))return!0;let n=Xn(t.range);return n&&P(t.range)?!0:n&&(e||Jn(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n={isAllFinite:!0};for(let t of e)if(!Xn(t))n.isAllFinite=!1;else if(P(t))return!0;return n.isAllFinite}case`Union`:if(!kn(t.base))throw new e._(`Attempted to check if the nonenumerable set:\n${An(t)}\nis a finite set.`);return N(t.base).elements.every(Xn);case`SetOperation`:if(t.operator===`\\cup`)return Xn(t.left)&&Xn(t.right);if(t.operator===`\\cap`){if(!Xn(t.left)&&!Xn(t.right))throw new e._(Yn(t));return!0}if(Xn(t.left))return!0;if(!Xn(t.right))throw new e._(Yn(t));return!1;case`FilteredSet`:if(!Xn(t.base))throw new e._(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(t.base)}\nis finite.`);return!0}},Zn=(e,t,n=ft)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Qn=e=>{if(typeof e!=`object`||!A(e))return;let t=F(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},$n=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!A(t))return`${n} ${Be(t)} ${I(t)}`;let r=yt(t);return r===`record`?`Attempted to check if element:\n${I(e)}\nis in the record:\n${I(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${I(t)}`},er={sets:void 0},tr=(t,n,r,i)=>{let a=er.sets,o=er.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e._))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},nr=(e,t)=>{let n=er.sets;if(n===void 0)return ar(e,t);n.push(t);let r=ar(e,t);return n.pop(),r},rr=(e,t)=>Zn(t.elements,e)!==-1,ir=(e,t)=>on.has(t)?rn(e,t.elements).isFound:an(e,t.elements),ar=(t,n)=>{if(!O(n))throw new e._($n(t,n));switch(n.kind){case`Set`:return Et(t),tr(rr,ir,t,n);case`MixedSet`:return an(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&!j(t))throw new e._(`Attempted to check if the value:\n${I(t)}\nis in the integer interval ${I(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(j(t))return!1;if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e._(`Attempted to check if the value:\n${I(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!O(t)||st(t))throw new e._(`Attempted to check if the non-enumerable value\n${D(I(t))}\nis element of\n${D(I(n))}`);return N(t).elements.every(e=>nr(e,n.base));case`FunctionSet`:{if(!A(t)){if(j(t))return!1;throw new e._(`Attempted to check if \n${I(t)}\nwhich is not a TLC function value, is in the set of functions:\n${D(I(n))}`)}let r=F(t),i=Pt(r.domain);return(i===void 0?cn(n.domain,ht(r.domain)):cn({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>nr(e,n.range))}case`RecordSet`:{let r=A(t)?F(t):void 0;if(!r||!qe(r.domain)){if(j(t))return!1;throw new e._(`Attempted to check if non-record\n${I(t)}\nis in the set of records:\n${I(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=Zn(r.domain,e);return i!==-1&&nr(r.range[i],n.sets[t])})}case`ProductSet`:{let r=A(t)?Qn(t):void 0;if(r===void 0){if(A(t)&&F(t).domain.every(e=>typeof e==`number`)||j(t))return!1;throw new e._(`Attempted to check if non-tuple\n${I(t)}\nis in the set of tuples:\n${I(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>nr(e,n.factors[t]))}case`FilteredSet`:return nr(t,n.base)&&n.test(t);case`Union`:if(!kn(n.base))throw new e._(`Attempted to check if:\n ${I(t)}\nis an element of the non-enumerable set:\n ${An(n)}`);return N(n.base).elements.some(e=>nr(t,e));case`SetOperation`:return n.operator===`\\cup`?nr(t,n.left)||nr(t,n.right):nr(t,n.left)&&nr(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Qn(t);if(r===void 0){if(j(t))return!1;throw new e._(`Attempted to check if the value:\n${D(I(t))}\nis an element of ${D(I(n))}.`)}return r.every(e=>nr(e,n.base))}default:throw new e._($n(t,n))}},or=(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?nr(e,n):e.range.every((e,r)=>or(e,t.range[r],n.range)),F=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){M(t.domain)||Jn(t.domain);let e=wn(t.domain);return vt(gt(e,e.map(e=>t.apply(e))),yt(t))}throw new e._(`Expected a function but found ${I(t)}`)},sr=(e,t,n)=>{let r=D(I(e)),i=D(I(t)),a=n===`1.7.4`;switch(yt(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.`}},cr=(e,t)=>{if(!tt.is174)return sr(e,t);let n=D(I(t));return yt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},lr=(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},ur=t=>new e._(`Attempted to apply function with integer domain to the non-integer argument ${D(I(t))}`),dr=(e,t,n)=>{throw tt.is174||e.length<32?e.forEach(e=>en(e,t)):Zn(e,t,Yt),n},fr=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=yt(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e._(r(t,n));if(o===void 0&&!tt.is174&&Cn(i))throw ur(n)}let a=lr(i,n);return a===-1?tr(Zn,dr,i,n):a},pr=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!nr(n,t.domain))throw new e._(yt(t)===`lambda`?sr(t,n):`Attempted to apply a function to ${I(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e._(`Attempted to apply ${I(t)}, which is not a function`);let i=r??sr,a=fr(t,n,i);if(a===-1)throw new e._(i(t,n));return t.range[a]},mr=e=>Cn(e)?bn.get(e)??Tn(e.length):void 0,hr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e).domain;return mr(t)??ht(t)},gr=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!M(t.domain))){if(!nr(n,t.domain))return t;let e=r(t.apply(n));return vt({kind:`LazyFunction`,domain:t.domain,apply:r=>cn(n,r)?e:t.apply(r),source:t.source},yt(t))}if(!A(t))throw new e._(`Attempted to apply EXCEPT construct to the value ${D(I(t))}.`);let a=F(t),o=fr(a,n,cr);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=vt(gt(a.domain,s),yt(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==Cr){let e=Or(l);if(e!==Cr){let t=Or(a.domain[o]);u.hash=c===l?a.hash:a.hash-Sr(t,Or(c))+Sr(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Nr(e,c)+Nr(e,l)|0}return u},_r=/* @__PURE__ */ new WeakMap,vr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},yr=(e,t)=>Math.imul(e^t,16777619),br=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return vr(t)},xr=e=>vr(e+2654435769|0),Sr=(e,t)=>vr(Math.imul(e,668265261)+t|0),Cr=795548749,wr=e=>{if(e.kind===`ModelValue`)return vr(yr(br(e.name),109));if(O(e)){if(!M(e))return Cr;let t=N(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Or(t[e]);if(r===Cr)return Cr;n=n+xr(r)|0}return n}if(e.kind===`LazyFunction`&&!M(e.domain))return Cr;let t=F(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Or(t.domain[e]),i=Or(t.range[e]);if(r===Cr||i===Cr)return Cr;n=n+Sr(r,i)|0}return n},Tr=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e._(`TLC has found a state in which the value of a variable contains ${I(t)}`);if(O(t)){N(t).elements.forEach(Tr);return}let n=F(t);n.domain.forEach(Tr),n.range.forEach(Tr)},Er=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Or(t)===Cr&&Tr(t);return}catch(t){if(!(t instanceof e._))throw t;return t}},Dr=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[]}},Or=e=>{if(typeof e==`number`)return vr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return br(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=wr(e)),e.hash;let t=_r.get(e);if(t!==void 0)return t;let n=wr(e);return _r.set(e,n),n},kr=/* @__PURE__ */ new WeakMap,Ar=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},jr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ar(t)},Mr=e=>Ar(Fr(e)+2135587861|0),Nr=(e,t)=>Ar(Math.imul(Fr(e),374761393)+Fr(t)|0),Pr=e=>{if(e.kind===`ModelValue`)return Ar(jr(e.name)^60);if(O(e)){if(!M(e))return jr(Lr(e));let t=N(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Mr(t[e])|0;return n}let t=F(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Nr(t.domain[e],t.range[e])|0;return n},Fr=e=>{if(typeof e==`number`)return Ar(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return jr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Pr(e)),e.fingerprint;let t=kr.get(e);if(t!==void 0)return t;let n=Pr(e);return kr.set(e,n),n},Ir=/* @__PURE__ */ new WeakMap,Lr=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=Ir.get(e);if(t!==void 0)return t;let n=Rr(e);return Ir.set(e,n),n},Rr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Lr(t.base)}>`;if(t.kind===`FilteredSet`&&!M(t))throw new e._(`Attempted to compare the non-enumerable set ${I(t)} with another value`);if(O(t))return M(t)?`{${N(t).elements.map(Lr).join(`,`)}}`:`<${t.kind} ${I(t)}>`;let n=F(t);return`(${n.domain.map((e,t)=>`${Lr(e)}:${Lr(n.range[t])}`).join(`,`)})`},zr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Br=e=>e.reduce((e,t)=>e===0?0:e*Jn(t),1),Vr=e=>{if(e.kind===`Subset`)return Jn(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`&&M(e.domain)&&Jn(e.domain)===0)return ht([gt([],[])]);let t=e.kind===`FunctionSet`?Jn(e.range)**Jn(e.domain):Br(e.kind===`RecordSet`?e.sets:e.factors);return t===0?fn:t<=1999?N(e):void 0},Hr=(t,n)=>{if(n)return Vr(t);if(M(t))try{return Vr(t)}catch(t){if(t instanceof e._)return;throw t}},Ur=(e,t)=>{let n=e=>I(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return An(e,t)}},Wr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Gr=t=>{if(M(t.domain))try{return F(t)}catch(t){if(t instanceof e._)return;throw t}},I=(e,t=!1,n=!1)=>{let r=e=>I(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return zr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(N(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Hr(e,t);return n?r(n):Ur(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Gr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${I(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&tt.is174&&yt(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&yt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:yt(e)===`record`||i.domain.every(e=>typeof e==`string`&&Wr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):We(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Kr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${D(I(n))}\n`).join(``)},qr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Jr=(t,n)=>qr.has(t)?new e._(n):new e.C(n),Yr=(t,n,r,i)=>new e.C(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${I(i)}`),Xr=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||Xr(r))throw Jr(n,`${n} expects a value as argument ${t+1}`);return r},Zr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`number`)throw Jr(n,`${n} expects an integer but received ${I(r)}`);return r},Qr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw Jr(n,`${n} expects a boolean but received ${I(r)}`);return r},$r=(e,t,n)=>{let r=L(e,t,n);if(!O(r))throw Jr(n,`${n} expects a set but received ${I(r)}`);return r},ei=(e,t,n)=>{let r=$r(e,t,n);if(!M(r))throw Jr(n,`${n} cannot enumerate the non-enumerable set ${I(r)}`);return r},ti=(e,t,n)=>N(ei(e,t,n)).elements,ni=(e,t,n)=>{let r=L(e,t,n),i=Qn(r);if(!i)throw Jr(n,`${n} expects a sequence but received ${I(r)}`);return i},ri=(e,t,n)=>{let r=L(e,t,n);if(!A(r))throw Jr(n,`${n} expects a function but received ${I(r)}`);return F(r)},ii=(e,t,n)=>{let r=e[t];if(r===void 0||!Xr(r))throw Jr(n,`${n} expects an operator as argument ${t+1}`);return r},ai=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),R=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),si=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ci=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),li=e=>e>2147483647||e<-2147483648,ui=t=>new e.C(`Overflow when computing ${t}`),di={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},fi={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},pi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},mi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},hi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return fi[e.operator];if(e.kind!==`Function`)return di[e.kind];let t=yt(e);return t===void 0?`FcnRcdValue`:mi[t]},gi=e=>pi[hi(e)],_i=(t,n)=>new e._(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),vi=(t,n)=>{let r=r=>(...i)=>{let a=er.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e._&&(t.isLazy===!0||!(r instanceof e.C))?(er.sets&&(er.sets.length=a),_i(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},yi=(e,t)=>{if(typeof e!=`number`)throw _i(t,`Cannot cast tlc2.value.impl.${hi(e)} to tlc2.value.impl.IntValue`);return e},bi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,xi=(e,t,n,r)=>{let i=bi(e,n,`IntValue`,2);return ci(t,(e,n)=>{let a=yi(e,i),o=yi(n,i),s=r(a,o);if(li(s))throw ui(`${a}${t}${o}`);return s})},Si=(t,n,r)=>{if(typeof t!=`number`)throw new e.C(`The ${n} argument of ${r} should be an integer, but instead it is:\n${I(t)}`);return t},Ci=(e,t,n=e)=>ci(e,(e,r)=>t(Si(e,`first`,n),Si(r,`second`,n))),wi=(e,t,n)=>({...si(e,t,n),isLazy:!0}),Ti=(e,t,n)=>{let r=ii(e,t,n);return()=>r.call([])},Ei=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Di=()=>({bool:hl,condition:(e,t)=>{if(typeof e!=`boolean`)throw Qc(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw $c(t,n,e);return e},apply:pr,expectFunction:fl,tuple:En,set:dn,record:On,writtenRecord:Ge,equal:Ot,enumerate:El,unassigned:(e,t)=>{throw ol(e,t)},primeOutsideAction:e=>{throw cl(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:pl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>ul(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Oi={value:void 0},ki={isAllowed:void 0},Ai=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},ji=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Mi=e=>`local${e.counter++}`,Ni=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),T(e).forEach(e=>Ni(e,t)),t),Pi=(e,t,n)=>{let r=ji(e,B(t,e.environment)),i=Ni(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=ji(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Fi=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>Mi(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${zi(e,t.set,s)}, ${ji(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Mi(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${zi(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Mi(e),a=Mi(e),o=Mi(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Ii=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${zi(e,r[0],n)}, "the left side of =>") ? bool(${zi(e,r[1],n)}, "the right side of =>") : true)`;if(E(t))return Pi(e,t,n);let i=Ql(t.operator,e.environment);if(i?.kind!==`Builtin`)return Pi(e,t,n);if(i.name===`DOMAIN`)return`${ji(e,nl(t))}(${zi(e,r[0],n)})`;if(i.name===`TLCEval`)return Pi(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ji(e,rl(t,i))}(${zi(e,r[0],n)}, ${zi(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Yu(r[0],a))return`${ji(e,i.evaluateUnary)}(${zi(e,r[0],n)})`;let o=r.length===2&&Yu(r[0],a)&&Yu(r[1],a);return i.evaluateBinary&&o?`${ji(e,i.evaluateBinary)}(${zi(e,r[0],n)}, ${zi(e,r[1],n)})`:Pi(e,t,n)},Li=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(E(e))return!1;let r=uu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Li(e.expression,t,n);case`FieldAccess`:return Li(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Li(e,t,n));default:return!1}},Ri=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Ri(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Ri);default:return!1}},zi=(e,t,n)=>{let r=(t,r=n)=>zi(e,t,r);if(Fu(t)&&Au(t,e.environment))return Pi(e,t,n);switch(t.kind){case`Number`:return Ve(t.value)?String(t.value):Pi(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(E(t))return Pi(e,t,n);let i=uu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ji(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ji(e,i.value):Pi(e,t,n)}case`Apply`:return Ii(e,t,n);case`And`:case`Or`:{let n=ji(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${ji(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{vd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Li(t.function,n,e.environment)?r(t.function):Ri(t.function)?r(t.function,i):Pi(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${ji(e,t)}))`,o=tl(e.environment.runtime.version),s=o?`, ${ji(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${ji(e,el(t))}(${r(t.record)})`;case`Record`:{let i=Sd(t.fields);if(Cd(i))return Pi(e,t,n);let a=ji(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${ji(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=ji(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Fi(e,t,n):Pi(e,t,n);default:return Pi(e,t,n)}},Bi=(e,t)=>{if(!Ei.has(e.kind)||(ki.isAllowed??=Ai(),!ki.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=zi(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
87
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Oi.value??=Di();let o=Oi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Vi={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},Hi={none:0,error:1,warning:3,state:4},Ui={0:``,1:`Error: `,3:`Warning: `,4:`State `},Wi=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===Hi.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
88
- (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${Ui[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},Gi=`The configuration file did not specify the initial state predicate.
86
+ =============================================================================`,Ne=/* @__PURE__ */ new Map([[`Reals`,Ae],[`RealTime`,je],[`Toolbox`,Me]]),Pe={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Fe=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Ie=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Le=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Re=e=>{let t=t=>{let n=h(e,t,Fe);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=h(e,t,Ie);if(e.startsWith(`..`,n)&&Ie(e[n+2]))return{kind:`Constant`,first:t,last:h(e,n+2,Ie)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Ie(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:h(e,t+1,Ie)-1,children:[]};if(Le(n))return{kind:`Constant`,first:t,last:h(e,t,Le)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},D=e=>{let t=e.length===0?void 0:Re(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Pe[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let ee=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),te=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return ee===void 0||te===void 0?void 0:`${ee}${s.divider}\n${o}${s.dividerPad}${te}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},ze=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,O=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Be=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),k=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),A=e=>typeof e==`object`&&e.kind===`ModelValue`,Ve=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),He=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:O(e)?`set`:`function`,Ue=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,We={isUsed:!1},Ge=(e,t)=>(We.isUsed=!0,e.writtenKeys=t,e),Ke=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Xn(e.domain,t)]]),qe=(e,t,n)=>Ge(On(e,t),n),Je=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Je);e.writtenKeys=void 0,e.range.forEach(Je)}},Ye=e=>e.every(e=>typeof e==`string`),Xe=(e,t)=>e.length>0&&t.length>0&&Ye(e)!==Ye(t),Ze=(e,t)=>{We.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Xe(n,r)?Xt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=mt(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:mt(t,n);if(r!==0)return r}return 0},Qe=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=mt(n[e],r[e]);if(t!==0)return t}return 0},$e=e=>A(e)?e.type:void 0,et=(t,n,r)=>{let i=$e(t),a=$e(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(A(t)&&A(n)){if(i===void 0||a===void 0||i===a)return;throw new e._(`Attempted to ${o} the differently-typed model values ${I(t)} and ${I(n)}`)}throw i===void 0?new e._(`Attempted to ${o} the typed model value ${I(n)} and the non-model value\n${I(t)}`):new e._(`Attempted to ${o}${r?``:` the`} typed model value ${I(t)} and non-model value\n${I(n)}`)},tt={ranks:Object.create(null),size:0},nt=e=>{tt.ranks=Object.create(null),tt.size=0,ht.clear();for(let t of e)at(t)},rt={is174:!1},it=e=>{rt.is174=e===`1.7.4`},at=e=>(tt.ranks[e]===void 0&&(tt.ranks[e]=tt.size++),e),ot=()=>tt.size,st=e=>tt.ranks[at(e)],ct=(e,t)=>{if(e===t)return 0;let n=tt.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},lt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),ut=(e,t)=>(lt(e)||lt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),dt=(t,n,r)=>{if(!lt(t))throw new e._(`Attempted to ${r} the set ${I(M(t)?N(t):t,!0)} with the value:\n${I(n,!0)}`);if(!lt(n))throw new e._(`Attempted to compare overridden value ${I(t,!0)} with non-overridden value:\n${I(n,!0)}`);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e._(`Attempted to compare ${I(t,!0)} with the value\n${I(n,!0)}`)},ft={kind:`InfiniteSet`,name:`Any`},pt=t=>{throw new e._(`Attempted to compare ANY with the value\n${I(t)}`)},mt=(t,n)=>{if(t===n)return We.isUsed&&Je(t),t===ft?pt(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return Ze(t,n);if(r===`Set`&&i===`Set`)return Qe(t,n);if(r===`Interval`&&i===`Interval`){let e=Math.max(0,t.high-t.low+1),r=Math.max(0,n.high-n.low+1);return e!==r||e===0?e-r:t.low-n.low}if(r===`ModelValue`&&i===`ModelValue`)return t.type!==void 0&&n.type!==void 0&&et(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return et(t,n,!1),r===`ModelValue`?-1:1;if(t===ft||n===ft)return pt(t===ft?n:t);if(O(t)&&O(n)&&ut(t,n))return dt(t,n,`compare`);let a=O(t);if(a!==O(n))throw new e._(`Attempted to compare ${He(t)} ${I(t)} with ${He(n)} ${I(n)}`);return a?Qe(N(t),N(n)):Ze(F(t),F(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return ct(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(et(t,n,!1),A(t))return-1;if(A(n))return 1;throw new e._(`Attempted to compare ${He(t)} ${I(t)} with ${He(n)} ${I(n)}`)},ht=/* @__PURE__ */ new Map,gt=e=>{let t=ht.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:st(e),hash:gr(_r(vr(e),109)),fingerprint:Dr(Or(e)^60)};return ht.set(e,n),n},_t=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),vt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),yt={isPresent:!1},bt=(e,t)=>(t===`lambda`&&(yt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),xt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,St=e=>bt(e,`lambda`),Ct=e=>ze(e)&&e.isCached===!0,wt={isPresent:!1},Tt=e=>(wt.isPresent=!0,e),Et=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Dt=e=>{wt.isPresent&&typeof e==`object`&&ze(e)&&Et.has(e.kind)&&(e.isCached=!0)},Ot=e=>{(yt.isPresent||wt.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Ot),e.range.forEach(Ot)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Ot):O(e)&&M(e)&&(Dt(e),N(e).elements.forEach(Ot))))},kt=(e,t)=>{if(Dt(e),e===t)return We.isUsed&&Je(e),e!==ft||pt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&et(e,t,!0),mt(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return Ze(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Qe(e,t)===0;if(A(e)||A(t))return et(e,t,!0),A(e)&&A(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return kt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=P(e.domain),r=P(t.domain);if(n||r)return n===r;let i=P(e.range),a=P(t.range);return i||a?i===a:kt(e.domain,t.domain)&&kt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(P(e))return P(t);if(P(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&kt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return P(e)?P(t):!P(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>kt(e,t.factors[n]));let n=O(e)&&O(t)&&!(M(e)&&M(t));if(n&&ut(e,t))return dt(e,t,`check equality of`)===0;if(n){if(!lt(e)){let n=N(e);if(!lt(t))return Qe(n,N(t))===0}return Nr(e)===Nr(t)}return mt(e,t)===0},At=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):Nr(n)===Nr(r);return n},jt=At(!1),Mt=At(!0),Nt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Pt=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Er(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Mt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Mt(i[e],n))return i[e]}return n.kind===`Set`?Nt(n.elements,t):(Nt(n.domain,t),Nt(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}},Ft=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},It=e=>{if(!k(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:Ft(t.domain)}},Lt=e=>{if(!k(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},Rt=(e,t)=>(et(t,e,!1),1),zt=(e,t)=>(et(t,e,!0),!1),Bt=(e,t)=>(e.type!==void 0&&et(e,t,!1),A(t)?e.rank-t.rank:-1),Vt=(e,t)=>(e.type!==void 0&&et(e,t,!0),A(t)&&e.name===t.name),Ht={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`}},Ut=(e,t,n)=>{let r=Ht[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${I(e)} with ${r.other}:\n${I(t)}`},Wt=(t,n,r)=>{let i=It(r);if(!i){if(A(r))return Rt(r,n);throw new e._(`Attempted to compare the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Gt(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Gt(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e._(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${I(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Gt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Xt(e[n],t[n]);if(r!==0)return r}return 0},Kt=(t,n)=>{let r=F(t);if(t.kind===`Function`&&Zn(r)!==void 0){let e=k(n)?Zn(n):void 0;return e?r.range.length-e.length||Gt(r.range,e):Wt({...r,low:1},t,n)}if(xt(t)===`record`){let i=Lt(n);if(!i){if(A(n))return Rt(n,t);throw new e._(`Attempted to compare record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length-i.domain.length||Gt(r.domain,i.domain)||Gt(r.range,i.range)}return Wt({...r,low:Ft(r.domain)},t,n)},qt=(e,t)=>lt(e)||lt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Jt=(e,t)=>{let n=Ve(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},Yt=(t,n)=>{if(qt(t,n))return mt(t,n);if(!Ve(t))return Yt(N(t),n);if(!O(n)){if(A(n))return Rt(n,t);throw new e._(`Attempted to compare the set ${I(t)} with the value:\n${I(n)}`)}let r=Jt(t,n);return r.elements.length-r.otherElements.length||Gt(r.elements,r.otherElements)},Xt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return mt(t,n);if(A(n))return Rt(n,t);throw new e._(Ut(t,n,!1))}return t.kind===`ModelValue`?Bt(t,n):k(t)?Kt(t,n):Yt(t,n)},Zt=(e,t)=>e.every((e,n)=>tn(e,t[n])),Qt=(t,n,r)=>{let i=It(r);if(!i){if(A(r))return zt(r,n);throw new e._(`Attempted to check equality of the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&Zt(t.range,i.range);let a=t.low??i.low;return a===void 0?Zt(t.domain,i.domain)&&Zt(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e._(`Attempted to compare an integer with non-integer:\n${I(t)}.`);return t===a+n})&&Zt(t.range,i.range)},$t=(t,n)=>{let r=F(t);if(t.kind===`Function`&&Zn(r)!==void 0){let e=k(n)?Zn(n):void 0;return e?r.range.length===e.length&&Zt(r.range,e):Qt({...r,low:1},t,n)}if(xt(t)===`record`){let i=Lt(n);if(!i){if(A(n))return zt(n,t);throw new e._(`Attempted to check equality of record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length===i.domain.length&&Zt(r.domain,i.domain)&&Zt(r.range,i.range)}return Qt({...r,low:Ft(r.domain)},t,n)},en=(t,n)=>{if(qt(t,n))return kt(t,n);if(!Ve(t))return en(N(t),n);if(!O(n)){if(A(n))return zt(n,t);throw new e._(`Attempted to check equality of the set ${I(t)} with the value:\n${I(n)}`)}let r=Jt(t,n);return r.elements.length===r.otherElements.length&&Zt(r.elements,r.otherElements)},tn=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(A(n))return zt(n,t);throw new e._(Ut(t,n,!0))}return t.kind===`ModelValue`?Vt(t,n):k(t)?$t(t,n):en(t,n)},nn=e=>{let t=[];for(let n of e){let e=an(n,t);e.isFound||t.splice(e.index,0,n)}return t},rn=(e,t)=>{let n=$n.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},an=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=rn(e,()=>Xt(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},on=(e,t)=>t.some(t=>rn(t,()=>tn(t,e))),sn=/* @__PURE__ */ new WeakSet,cn=e=>{typeof e==`object`&&(e.kind===`Set`&&(sn.add(e),e.elements.forEach(cn)),e.kind===`Function`&&(e.domain.forEach(cn),e.range.forEach(cn)))},ln=(e,t)=>er(kt,tn,e,t),un=e=>{for(let t=1;t<e.length;t++)if(mt(e[t-1],e[t])>=0)return!1;return!0},dn=e=>{for(let t=1;t<e.length;t++)Dt(e[t]);if(e.length<2||un(e))return _t(e);let t=[...e].sort(mt),n=[t[0]];for(let e=1;e<t.length;e++)mt(n[n.length-1],t[e])!==0&&n.push(t[e]);return _t(n)},fn=e=>er(dn,e=>({kind:`MixedSet`,elements:e}),e,void 0),pn=_t([]),mn=(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&&mt(r[a],t)<0;)a++;a<r.length&&mt(r[a],t)===0||i.push(t)}return i.length===n.length?e:_t(i)},hn=(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&&mt(r[a],t)<0;)a++;a<r.length&&mt(r[a],t)===0&&i.push(t)}return i.length===n.length?e:_t(i)},gn=(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=mt(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=_t(i);if(e.hash!==0&&e.hash!==xr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Er(a[n]);if(e===xr)break;t=t+yr(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+kr(a[e])|0;c.fingerprint=t}return c},_n=e=>{let t=e.length<2?e:[...e].sort((e,t)=>mt(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&mt(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return vt(n,r)},vn=e=>{let t=_n(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Ge(t,e.map(e=>e[0]))},yn=[],bn=[],xn=/* @__PURE__ */ new WeakMap,Sn=e=>{let t=yn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return yn[e]=n,n},Cn=e=>{if(qn(e),e.low===1&&e.high>=1)return Sn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},wn=e=>e.length>0&&(e===yn[e.length]||xn.has(e)),Tn=e=>{let t=N(e).elements;return wn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},En=e=>{let t=bn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return bn[e]=n,n},j=e=>bt(vt(Sn(e.length),e),`tuple`),Dn=e=>bt(_n(e),`record`),On=(e,t)=>bt(vt(e,t),`record`),kn=e=>O(e)&&!lt(e),An=(e,t=!1)=>`UNION(${I(e.base,t)})`,jn=(t,n=e=>N(e).elements)=>{if(!kn(t.base))throw new e._(`Attempted to enumerate the nonenumerable set:\n${An(t)}`);return n(t.base)},Mn=(t,n,r)=>{if(kn(t))return t;throw new e._(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${I(t)}\nwhen enumerating:\n${An(r)}`)},M=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return M(e.base);case`FunctionSet`:return M(e.domain)&&M(e.range)||Nn(e.domain)===!0||Nn(e)===!0;case`RecordSet`:return e.sets.every(M)||Nn(e)===!0;case`ProductSet`:return e.factors.every(M)||Nn(e)===!0;case`Union`:return M(e.base)&&Bn(e.base).every(M);case`SetOperation`:return e.operator===`\\cup`?M(e.left)&&M(e.right):e.operator===`\\cap`?M(e.left)||M(e.right):M(e.left);default:return!1}},Nn=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=Nn(e.domain);return t===void 0?void 0:!t&&Nn(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Nn(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return M(e)?N(e).elements.length===0:void 0;default:return}},Pn=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},Fn=(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},In=e=>{if(typeof e!=`object`||e.kind!==`Subset`||lt(e.base))return;let t=N(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:Fn(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return _t(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},Ln=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(_t(r.map(t=>e[t])));while(Fn(r,e.length))}return t},Rn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(lt(o))throw new e._(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},zn=(t,n=e=>N(e).elements)=>{if(typeof t!=`object`)throw new e._(`Expected a set but found ${I(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return nn(t.elements);case`Interval`:{let e=Cn(t);return e!==yn[e.length]&&xn.set(e,t),e}case`Subset`:{if(qn(t.base)===0)return Ln([]);if(!O(t.base))throw new e._(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${D(I(t.base))}`);let n=N(t.base).elements;if(n.length>30)throw new e._(Kn(t));return Ln(n)}case`FunctionSet`:{if(!rt.is174&&P(t))return[];if(lt(t.domain))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(t.domain)}\ncannot be enumerated.`);let r=Tn(t.domain);if((r.length>0||rt.is174)&&lt(t.range))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${I(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Pn(r.map(()=>i)).map(e=>vt(r,e))}case`RecordSet`:{if(!rt.is174&&P(t))return[];let e=Rn(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${I(e)}`);return Pn(e).map(e=>Dn(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!rt.is174&&P(t))return[];let e=Rn(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${I(e)}`);return Pn(e).map(j)}case`FilteredSet`:if(!O(t.base)||lt(t.base))throw new e._(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(t.base)}\nis not enumerable`);return N(t.base).elements.filter(t.test);case`Union`:{let e=jn(t).flatMap((e,n)=>N(Mn(e,n,t)).elements);return N(fn(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!kn(t.left)||!kn(t.right)))throw new e._(`Attempted to enumerate S \\cup T when S:\n${I(t.left)}\nand T:\n${I(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!kn(t.left)&&!kn(t.right))throw new e._(`Attempted to enumerate S \\cap T when neither S:\n${I(t.left)}\nnor T:\n${I(t.right)}\nis enumerable`);if(t.operator===`\\`&&!kn(t.left))throw new e._(`Attempted to enumerate S \\ T when S:\n${I(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return gn(N(t.left),N(t.right)).elements;let n=t.operator===`\\`||kn(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return N(r).elements.filter(e=>tr(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to enumerate the non-enumerable set ${I(t)}`);default:throw new e._(`Expected a set but found ${I(t)}`)}},N=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return _t(zn(e));let t=typeof e==`object`&&ze(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=$n.sets;n?.push(e);let r=zn(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`)?_t(r):dn(r);return t&&(t.enumerated=i),i},Bn=e=>{if(typeof e!=`object`||Ct(e))return N(e).elements;let t=$n.sets;t?.push(e);let n=Wn(e);return t?.pop(),n},Vn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Hn=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Hn);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Hn)&&e.range.every(Hn);case`SetOperation`:return e.operator!==`\\cup`&&Hn(e.left)&&Hn(e.right);case`FilteredSet`:return Hn(e.base);case`ProductSet`:return e.factors.every(Hn);default:return!1}},Un=e=>typeof e!=`object`||Ct(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Un(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Un(e.left)||Un(e.right):Vn(e)?.some(Un)??!1,Wn=e=>{if(e.kind===`Union`)return jn(e,Bn).flatMap((t,n)=>Bn(Mn(t,n,e)));if(e.kind===`FilteredSet`&&!lt(e.base))return Bn(e.base).filter(e.test);if(Vn(e)?.some(Un))return zn(e,Bn);if(e.kind!==`SetOperation`)return N(e).elements;if(e.operator===`\\cup`)return!kn(e.left)||!kn(e.right)?N(e).elements:[...Bn(e.left),...Bn(e.right)];let t=e.operator===`\\`||kn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return kn(n)?Bn(n).filter(t=>tr(t,r)===(e.operator===`\\cap`)):N(e).elements},P=t=>{if(typeof t!=`object`||!O(t))throw new e._(`Shouldn't call isEmpty() on value ${I(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e._(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(P);case`RecordSet`:return t.sets.some(P);case`FunctionSet`:return!P(t.domain)&&P(t.range);case`Union`:return jn(t).every((e,n)=>P(Mn(e,n,t)));default:return N(t).elements.length===0}},Gn=(t,n,r)=>t.reduce((t,i)=>{let a=t*qn(i,n);if(a>2147483647)throw new e._(r());return a},1),Kn=e=>`Overflow when computing the number of elements in:\n${I(e)}`,qn=(t,n)=>{if(typeof t!=`object`)throw new e._(`Attempted to compute the number of elements in the ${He(t)} ${I(t)}.`);switch(t.kind){case`ModelValue`:throw new e._(`Attempted to compute the number of elements in the model value ${I(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return qn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e._(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to compute the number of elements in the overridden value ${I(t)}.`);case`Subset`:{let r=qn(t.base,n);if(r>=31)throw new e._(Kn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(P(t.domain))return 1;if(P(t.range))return 0;if(qn(t.range,n)===1)return 1}let r=qn(t.domain,n),i=qn(t.range,n);if(i<=1)return r===0?1:i;let a={value:1};for(let n=0;n<r;n++)if(a.value*=i,a.value>2147483647)throw new e._(Kn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&P(t)?0:Gn(t.sets,n,()=>Kn(t));case`ProductSet`:return n!==`1.7.4`&&P(t)?0:Gn(t.factors,n,()=>`Overflow when computing the number of elements in ${I(t)}`);default:return Dt(t),N(t).elements.length}},Jn=e=>`Attempted to check if the set ${I(e)}is finite.`,Yn=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e._(`Attempted to check if the ${He(t)} ${I(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e._(`Attempted to check if the function:\n${I(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Yn(t.base)&&P(t.base);case`Subset`:return Yn(t.base);case`FunctionSet`:{let e=Yn(t.domain);if(e&&P(t.domain))return!0;let n=Yn(t.range);return n&&P(t.range)?!0:n&&(e||qn(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n={isAllFinite:!0};for(let t of e)if(!Yn(t))n.isAllFinite=!1;else if(P(t))return!0;return n.isAllFinite}case`Union`:if(!kn(t.base))throw new e._(`Attempted to check if the nonenumerable set:\n${An(t)}\nis a finite set.`);return N(t.base).elements.every(Yn);case`SetOperation`:if(t.operator===`\\cup`)return Yn(t.left)&&Yn(t.right);if(t.operator===`\\cap`){if(!Yn(t.left)&&!Yn(t.right))throw new e._(Jn(t));return!0}if(Yn(t.left))return!0;if(!Yn(t.right))throw new e._(Jn(t));return!1;case`FilteredSet`:if(!Yn(t.base))throw new e._(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(t.base)}\nis finite.`);return!0}},Xn=(e,t,n=mt)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Zn=e=>{if(typeof e!=`object`||!k(e))return;let t=F(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Qn=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!k(t))return`${n} ${He(t)} ${I(t)}`;let r=xt(t);return r===`record`?`Attempted to check if element:\n${I(e)}\nis in the record:\n${I(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${I(t)}`},$n={sets:void 0},er=(t,n,r,i)=>{let a=$n.sets,o=$n.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e._))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},tr=(e,t)=>{let n=$n.sets;if(n===void 0)return ir(e,t);n.push(t);let r=ir(e,t);return n.pop(),r},nr=(e,t)=>Xn(t.elements,e)!==-1,rr=(e,t)=>sn.has(t)?an(e,t.elements).isFound:on(e,t.elements),ir=(t,n)=>{if(!O(n))throw new e._(Qn(t,n));switch(n.kind){case`Set`:return Dt(t),er(nr,rr,t,n);case`MixedSet`:return on(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&!A(t))throw new e._(`Attempted to check if the value:\n${I(t)}\nis in the integer interval ${I(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(A(t))return!1;if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e._(`Attempted to check if the value:\n${I(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!O(t)||lt(t))throw new e._(`Attempted to check if the non-enumerable value\n${D(I(t))}\nis element of\n${D(I(n))}`);return N(t).elements.every(e=>tr(e,n.base));case`FunctionSet`:{if(!k(t)){if(A(t))return!1;throw new e._(`Attempted to check if \n${I(t)}\nwhich is not a TLC function value, is in the set of functions:\n${D(I(n))}`)}let r=F(t),i=Ft(r.domain);return(i===void 0?ln(n.domain,_t(r.domain)):ln({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>tr(e,n.range))}case`RecordSet`:{let r=k(t)?F(t):void 0;if(!r||!Ye(r.domain)){if(A(t))return!1;throw new e._(`Attempted to check if non-record\n${I(t)}\nis in the set of records:\n${I(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=Xn(r.domain,e);return i!==-1&&tr(r.range[i],n.sets[t])})}case`ProductSet`:{let r=k(t)?Zn(t):void 0;if(r===void 0){if(k(t)&&F(t).domain.every(e=>typeof e==`number`)||A(t))return!1;throw new e._(`Attempted to check if non-tuple\n${I(t)}\nis in the set of tuples:\n${I(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>tr(e,n.factors[t]))}case`FilteredSet`:return tr(t,n.base)&&n.test(t);case`Union`:if(!kn(n.base))throw new e._(`Attempted to check if:\n ${I(t)}\nis an element of the non-enumerable set:\n ${An(n)}`);return N(n.base).elements.some(e=>tr(t,e));case`SetOperation`:return n.operator===`\\cup`?tr(t,n.left)||tr(t,n.right):tr(t,n.left)&&tr(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Zn(t);if(r===void 0){if(A(t))return!1;throw new e._(`Attempted to check if the value:\n${D(I(t))}\nis an element of ${D(I(n))}.`)}return r.every(e=>tr(e,n.base))}default:throw new e._(Qn(t,n))}},ar=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?tr(e,n):e.range.every((e,r)=>ar(e,t.range[r],n.range)),F=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;M(t.domain)||qn(t.domain);let e=Tn(t.domain);return t.enumerated=bt(vt(e,e.map(e=>t.apply(e))),xt(t)),t.enumerated}throw new e._(`Expected a function but found ${I(t)}`)},or=(e,t,n)=>{let r=D(I(e)),i=D(I(t)),a=n===`1.7.4`;switch(xt(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.`}},sr=(e,t)=>{if(!rt.is174)return or(e,t);let n=D(I(t));return xt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},cr=(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},lr=t=>new e._(`Attempted to apply function with integer domain to the non-integer argument ${D(I(t))}`),ur=(e,t,n)=>{throw rt.is174||e.length<32?e.forEach(e=>tn(e,t)):Xn(e,t,Xt),n},dr=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=xt(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e._(r(t,n));if(o===void 0&&!rt.is174&&wn(i))throw lr(n)}let a=cr(i,n);return a===-1?er(Xn,ur,i,n):a},fr=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!tr(n,t.domain))throw new e._(xt(t)===`lambda`?or(t,n):`Attempted to apply a function to ${I(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e._(`Attempted to apply ${I(t)}, which is not a function`);let i=r??or,a=dr(t,n,i);if(a===-1)throw new e._(i(t,n));return t.range[a]},pr=e=>wn(e)?xn.get(e)??En(e.length):void 0,mr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e).domain;return pr(t)??_t(t)},hr=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!M(t.domain))){if(!tr(n,t.domain))return t;let e=r(t.apply(n));return bt({kind:`LazyFunction`,domain:t.domain,apply:r=>ln(n,r)?e:t.apply(r),source:t.source},xt(t))}if(!k(t))throw new e._(`Attempted to apply EXCEPT construct to the value ${D(I(t))}.`);let a=F(t),o=dr(a,n,sr);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=bt(vt(a.domain,s),xt(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==xr){let e=Er(l);if(e!==xr){let t=Er(a.domain[o]);u.hash=c===l?a.hash:a.hash-br(t,Er(c))+br(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Ar(e,c)+Ar(e,l)|0}return u},gr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},_r=(e,t)=>Math.imul(e^t,16777619),vr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return gr(t)},yr=e=>gr(e+2654435769|0),br=(e,t)=>gr(Math.imul(e,668265261)+t|0),xr=795548749,Sr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Er(t[e]);if(r===xr)return xr;n=n+yr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Er(e.domain[n]),i=Er(e.range[n]);if(r===xr||i===xr)return xr;t=t+br(r,i)|0}return t},Cr=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e._(`TLC has found a state in which the value of a variable contains ${I(t)}`);if(O(t)){N(t).elements.forEach(Cr);return}let n=F(t);n.domain.forEach(Cr),n.range.forEach(Cr)},wr=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{Er(t)===xr&&Cr(t);return}catch(t){if(!(t instanceof e._))throw t;return t}},Tr=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[]}},Er=e=>typeof e==`number`?gr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?vr(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Sr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?M(e.domain)?Er(F(e)):xr:M(e)?Er(N(e)):xr,Dr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Or=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Dr(t)},kr=e=>Dr(Mr(e)+2135587861|0),Ar=(e,t)=>Dr(Math.imul(Mr(e),374761393)+Mr(t)|0),jr=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+kr(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Ar(e.domain[n],e.range[n])|0;return t},Mr=e=>typeof e==`number`?Dr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Or(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=jr(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Mr(F(e)):M(e)?Mr(N(e)):Or(Nr(e)),Nr=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Pr(e),Pr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Nr(t.base)}>`;if(t.kind===`FilteredSet`&&!M(t))throw new e._(`Attempted to compare the non-enumerable set ${I(t)} with another value`);if(O(t))return M(t)?`{${N(t).elements.map(Nr).join(`,`)}}`:`<${t.kind} ${I(t)}>`;let n=F(t);return`(${n.domain.map((e,t)=>`${Nr(e)}:${Nr(n.range[t])}`).join(`,`)})`},Fr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Ir=e=>e.reduce((e,t)=>e===0?0:e*qn(t),1),Lr=e=>{if(e.kind===`Subset`)return qn(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`&&M(e.domain)&&qn(e.domain)===0)return _t([vt([],[])]);let t=e.kind===`FunctionSet`?qn(e.range)**qn(e.domain):Ir(e.kind===`RecordSet`?e.sets:e.factors);return t===0?pn:t<=1999?N(e):void 0},Rr=(t,n)=>{if(n)return Lr(t);if(M(t))try{return Lr(t)}catch(t){if(t instanceof e._)return;throw t}},zr=(e,t)=>{let n=e=>I(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return An(e,t)}},Br=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Vr=t=>{if(M(t.domain))try{return F(t)}catch(t){if(t instanceof e._)return;throw t}},I=(e,t=!1,n=!1)=>{let r=e=>I(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Fr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(N(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Rr(e,t);return n?r(n):zr(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Vr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${I(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&rt.is174&&xt(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&xt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:xt(e)===`record`||i.domain.every(e=>typeof e==`string`&&Br(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Ke(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Hr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${D(I(n))}\n`).join(``)},Ur=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Wr=(t,n)=>Ur.has(t)?new e._(n):new e.C(n),Gr=(t,n,r,i)=>new e.C(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${I(i)}`),Kr=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||Kr(r))throw Wr(n,`${n} expects a value as argument ${t+1}`);return r},qr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`number`)throw Wr(n,`${n} expects an integer but received ${I(r)}`);return r},Jr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw Wr(n,`${n} expects a boolean but received ${I(r)}`);return r},Yr=(e,t,n)=>{let r=L(e,t,n);if(!O(r))throw Wr(n,`${n} expects a set but received ${I(r)}`);return r},Xr=(e,t,n)=>{let r=Yr(e,t,n);if(!M(r))throw Wr(n,`${n} cannot enumerate the non-enumerable set ${I(r)}`);return r},Zr=(e,t,n)=>N(Xr(e,t,n)).elements,Qr=(e,t,n)=>{let r=L(e,t,n),i=Zn(r);if(!i)throw Wr(n,`${n} expects a sequence but received ${I(r)}`);return i},$r=(e,t,n)=>{let r=L(e,t,n);if(!k(r))throw Wr(n,`${n} expects a function but received ${I(r)}`);return F(r)},ei=(e,t,n)=>{let r=e[t];if(r===void 0||!Kr(r))throw Wr(n,`${n} expects an operator as argument ${t+1}`);return r},ti=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),R=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ni=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ri=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ii=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ai=e=>e>2147483647||e<-2147483648,oi=t=>new e.C(`Overflow when computing ${t}`),si={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`},ci={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},li={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`},ui={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},di=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ci[e.operator];if(e.kind!==`Function`)return si[e.kind];let t=xt(e);return t===void 0?`FcnRcdValue`:ui[t]},fi=e=>li[di(e)],pi=(t,n)=>new e._(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),mi=(t,n)=>{let r=r=>(...i)=>{let a=$n.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e._&&(t.isLazy===!0||!(r instanceof e.C))?($n.sets&&($n.sets.length=a),pi(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},hi=(e,t)=>{if(typeof e!=`number`)throw pi(t,`Cannot cast tlc2.value.impl.${di(e)} to tlc2.value.impl.IntValue`);return e},gi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,_i=(e,t,n,r)=>{let i=gi(e,n,`IntValue`,2);return ii(t,(e,n)=>{let a=hi(e,i),o=hi(n,i),s=r(a,o);if(ai(s))throw oi(`${a}${t}${o}`);return s})},vi=(t,n,r)=>{if(typeof t!=`number`)throw new e.C(`The ${n} argument of ${r} should be an integer, but instead it is:\n${I(t)}`);return t},yi=(e,t,n=e)=>ii(e,(e,r)=>t(vi(e,`first`,n),vi(r,`second`,n))),bi=(e,t,n)=>({...ri(e,t,n),isLazy:!0}),xi=(e,t,n)=>{let r=ei(e,t,n);return()=>r.call([])},Si=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ci=()=>({bool:lu,condition:(e,t)=>{if(typeof e!=`boolean`)throw Kl(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw ql(t,n,e);return e},apply:fr,expectFunction:ou,tuple:j,set:fn,record:On,writtenRecord:qe,equal:kt,enumerate:gu,unassigned:(e,t)=>{throw eu(e,t)},primeOutsideAction:e=>{throw nu(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:su,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>iu(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),wi={value:void 0},Ti={isAllowed:void 0},Ei=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Di=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Oi=e=>`local${e.counter++}`,ki=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),ke(e).forEach(e=>ki(e,t)),t),Ai=(e,t,n)=>{let r=Di(e,V(t,e.environment)),i=ki(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Di(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},ji=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>Oi(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Fi(e,t.set,s)}, ${Di(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Oi(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Fi(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Oi(e),a=Oi(e),o=Oi(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Mi=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Fi(e,r[0],n)}, "the left side of =>") ? bool(${Fi(e,r[1],n)}, "the right side of =>") : true)`;if(E(t))return Ai(e,t,n);let i=Bu(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ai(e,t,n);if(i.name===`DOMAIN`)return`${Di(e,Xl(t))}(${Fi(e,r[0],n)})`;if(i.name===`TLCEval`)return Ai(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Di(e,Zl(t,i))}(${Fi(e,r[0],n)}, ${Fi(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&pd(r[0],a))return`${Di(e,i.evaluateUnary)}(${Fi(e,r[0],n)})`;let o=r.length===2&&pd(r[0],a)&&pd(r[1],a);return i.evaluateBinary&&o?`${Di(e,i.evaluateBinary)}(${Fi(e,r[0],n)}, ${Fi(e,r[1],n)})`:Ai(e,t,n)},Ni=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(E(e))return!1;let r=Zu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Ni(e.expression,t,n);case`FieldAccess`:return Ni(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Ni(e,t,n));default:return!1}},Pi=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Pi(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Pi);default:return!1}},Fi=(e,t,n)=>{let r=(t,r=n)=>Fi(e,t,r);switch(t.kind){case`Number`:return Ue(t.value)?String(t.value):Ai(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(E(t))return Ai(e,t,n);let i=Zu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Di(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Di(e,i.value):Ai(e,t,n)}case`Apply`:return Mi(e,t,n);case`And`:case`Or`:{let n=Di(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)}, ${Di(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Sd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Ni(t.function,n,e.environment)?r(t.function):Pi(t.function)?r(t.function,i):Ai(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Di(e,t)}))`,o=Yl(e.environment.runtime.version),s=o?`, ${Di(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`${Di(e,Jl(t))}(${r(t.record)})`;case`Record`:{let i=Ed(t.fields);if(Dd(i))return Ai(e,t,n);let a=Di(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Di(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Di(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?ji(e,t,n):Ai(e,t,n);default:return Ai(e,t,n)}},Ii=(e,t)=>{if(!Si.has(e.kind)||(Ti.isAllowed??=Ei(),!Ti.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=Fi(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
87
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;wi.value??=Ci();let o=wi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Li={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},Ri={none:0,error:1,warning:3,state:4},zi={0:``,1:`Error: `,3:`Warning: `,4:`State `},Bi=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===Ri.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
88
+ (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${zi[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},Vi=`The configuration file did not specify the initial state predicate.
89
89
  Can also be caused by trying to run TLC on a specification from
90
- a module imported with a parameterized INSTANCE statement.`,Ki=[[1005,e.u,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
90
+ a module imported with a parameterized INSTANCE statement.`,Hi=[[1005,e.u,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
91
91
  %1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
92
92
  %1%,
93
93
  but it produced the following error:
@@ -110,7 +110,7 @@ element is not a bag:
110
110
  %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
111
111
  on the right-hand side of a <- after already appearing on the
112
112
  left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
113
- is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Gi,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
113
+ is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Vi,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
114
114
  %1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
115
115
  %1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
116
116
  but instead found %3%.
@@ -128,15 +128,15 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
128
128
  Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
129
129
  It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
130
130
  %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
131
- `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],qi={value:void 0},Ji=()=>qi.value??=Ki.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),Yi=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,Xi=e=>Yi.test(e)?void 0:Ji().find(t=>t.pattern.test(e))?.message,Zi=t=>t instanceof e.C||Xi(t.message)?.isEvalException===!0,Qi=/* @__PURE__ */ new Map([[1e3,`
131
+ `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],Ui={value:void 0},Wi=()=>Ui.value??=Hi.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),Gi=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,Ki=e=>Gi.test(e)?void 0:Wi().find(t=>t.pattern.test(e))?.message,qi=t=>t instanceof e.C||Ki(t.message)?.isEvalException===!0,Ji=/* @__PURE__ */ new Map([[1e3,`
132
132
  : `],[2105,`failed.
133
133
  `],[2154,`but it produced the following error:
134
134
  `],[2213,`:
135
- `],[2281,` - specifically: `]]),$i=(e,t,n)=>{let r=n?Qi.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${ea(t.slice(a),n)}`},ea=(e,t)=>{let n=t?Xi(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Hi.none} @!@!@\n${$i(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ta=e=>String(e).padStart(2,`0`),na=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${ta(r%24)}h`:e>36e5?`${ta(r%24)}h ${ta(n)}min`:e>6e4?`${ta(n)}min ${ta(t)}s`:`${ta(t)}s`},ra=e=>`${e.getFullYear()}-${ta(e.getMonth()+1)}-${ta(e.getDate())} ${ta(e.getHours())}:${ta(e.getMinutes())}:${ta(e.getSeconds())}`,ia=/* @__PURE__ */ new WeakMap,aa=(t,n,r)=>{if(!(t instanceof e._))return t;let i=e.K(new e._(`${r}\n${t.message}`,t),e.V(t));return ia.set(i,{code:n,headline:r,inner:t}),i},oa=e=>ia.has(e),sa=e.P.slice(0,e.P.indexOf(`
136
- `)),ca=`${e.P}tlc2.tool.EvalException: `,la=`${e.P}util.Assert$TLCRuntimeException: `,ua=e=>Zi(e)?ca:la,da=t=>{try{return t()}catch(t){throw t instanceof e._?Zi(t)?new e._(`${e.N}${t.message}`):Xi(t.message)?t:new e._(`${e.P}${t.message}`):t}},fa=[ca,la,e.P,e.N],pa=(e,t)=>{let n=ia.get(e);if(n)return`${n.headline}\n${pa(n.inner,t)}`;let r=e.message,i=fa.find(e=>r.startsWith(e))??``;return`${i}${ea(r.slice(i.length),t)}`},ma=(t,n)=>{let r=ia.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:pa(t,!0)};if(n&&Zi(t))return{code:Xi(i)?.code??Vi.general,message:i,toolMessage:i};let a=n&&!i.startsWith(sa)?e.P:``;return{code:Vi.general,message:`${a}${i}`,toolMessage:`${a}${pa(t,!0)}`}},ha=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),ga=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},_a=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(ha.has(e.kind))return!1;let a=ga(e);if(a!==void 0&&!E(e)&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&yu(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return T(e).every(i)};return i(e)?[...n]:void 0},va={kind:`Local`},ya=/* @__PURE__ */ new WeakSet,ba=/* @__PURE__ */ new WeakMap,xa=/* @__PURE__ */ new WeakMap,Sa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ca=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),wa=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ta=e=>e.kind===`Operator`?e.params.length:0,Ea=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Da=e=>e.name.includes(`!`),Oa=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ka=(e,t,n)=>{let r=t.bindings.get(e);return r&&wa(r.position,t.location)&&(!n||wa(r.position,n.start))?r:void 0},Aa=(t,n)=>t!==void 0&&n!==void 0&&e.z(t)===e.z(n),ja=(t,n,r,i)=>{if(n===void 0)return!0;if(Aa(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.z(a),s=n.range&&e.z(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},Ma=(e,t,n,r)=>ja(t,Oa(e,t)??ka(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Na=(e,t,n)=>{ja(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Pa=(e,t,n,r)=>t.reduce((e,t,i)=>Ma(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Fa=(e,t,n)=>t.reduce((e,t)=>Ma(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ia=e=>e.kind===`Name`?[e.name]:e.names,La=e=>e.flatMap(e=>Ia(e.pattern)),Ra=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||wa(n.location,t.location))?n:void 0},za=(e,t)=>{let n=Ra(e,t);return n?{key:t.getKey(n),arity:Ta(n),params:Ea(n),kind:`Definition`}:t.imported.get(e)},Ba=(e,t,n)=>Oa(t,e)??za(e,n),Va=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ha=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Va(e.location,e.spelling??t)},Ua=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return wa(e.location,e.args[0].location)?`prefix`:`postfix`}},Wa=e=>!/^[\p{L}\d_]/u.test(e),Ga=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Ka=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,qa=(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])}})},Ja=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?qa(e.name,[],void 0):qa(e.operator,e.args,e.argumentCounts),Ya=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Xa=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:La(e.bounds),body:e.body,sets:Ya(e.bounds)};case`SetMap`:return{names:La(e.bounds),body:e.expression,sets:Ya(e.bounds)};case`SetFilter`:return{names:Ia(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ia(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}},Za=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Qa=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,$a=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),eo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?eo(e.body,t):T(e).reduce((e,n)=>e??eo(n,t),void 0)},to=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??to(i,t,n||$a(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&eo(e.set,t):eo(e,t)},no=e=>e.kind===`Label`?no(e.body):e,ro=e=>typeof e==`number`?`argument selector ${e}`:e,io=`within the scope of a declaration
137
- from outside that declaration's scope.`,ao=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.z(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&no(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:to(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?eo(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&$a(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${io}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=ro(t.operand);if(u.isSufficesOpen){if(Ka(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=no(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Ba(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=Xa(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Za(e);if(!l)return;let f=Ka(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Ka(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if($a(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${io}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},oo=(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)},so=(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=Oa(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)},co=(e,t,n,r)=>{if(!Qa(e))return!1;let i=Ja(e),a=i[0],o=i.length>1&&a.kind===`Name`?Oa(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&ao(e,i,o,t,n,r),o!==void 0},lo=(t,n,r,i)=>{let a=t.location;if(bo(t,r,i))return;let o=xa.get(t);if(o!==void 0)return o;if(Sa(n))return t.kind===`Apply`?t.args.length:0;let s=Oa(r,n);if(s?.isNonFact){i.errors.push({location:e.z(Ha(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(co(t,r,i,!1)||Ga(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=va),s)return s.arity;let c=za(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,xa.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Oa(r,l)!==void 0||za(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.z(t.kind===`Apply`&&u===`-.`?Va(a,`-`):Ha(t,n));if(!Wa(n)||Ga(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Ua(t);f&&a.range&&i.errors.push({location:e.z(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},uo=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>Pa(e,Ia(t.pattern),t.pattern.ranges,n),t)),fo=(e,t)=>e.kind===`Identifier`&&e.name===t&&E(e)||T(e).some(e=>fo(e,t)),po=(e,t)=>{e.kind===`FunctionConstruction`&&fo(e.body,t)&&(e.isRecursive=!0),T(e).forEach(e=>po(e,t))},mo=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?La(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`?uo(t.bounds,n,a):Fa(n,t.params,a),u=Oa(l,o)??ka(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(z(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),po(t.body,o),t.isSelfReferential=fo(t.body,o)):z(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:ja(o,Oa(n,o)??ka(o,a,s),{kind:`Definition`,arity:Ta(t),range:s},a)},ho=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Oa(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ta(t),params:Ea(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Eo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Sa(t.name)?e:s(e,e=>!wa(t.location,e.location)),o={name:t.name,arity:Ta(t),kind:`Definition`,range:t.location.range,parent:a};if(Da(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Sa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return mo(t,a,u,i)?{...o,params:Ea(t)}:a},a),()=>!0)},go=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Oa(t,r)??ka(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},_o=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=go(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.z(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},vo=(t,n,r)=>{if(_o(t,n,r))return;let i=t.operator,a=Ba(i,n,r),o=lo(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.z(t.argumentsRange??Ha(t,i)),message:`The operator ${i} requires ${o-(go(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>yo(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.z(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=lo(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else z(e,n,r);return!0}if(e.kind===`Lambda`){z(e,n,r);let s=e.params.length===o;return!s&&ya.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Ha(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return z(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Ba(u,n,r)?.params??[],f=lo(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Ha(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},yo=(e,t,n)=>{e.kind===`Identifier`?lo(e,e.name,t,n):z(e,t,n)},bo=(e,t,n)=>{let r=ba.get(e);return r?(r.args.forEach(e=>yo(e,t,n)),n.errors.push(r.error),!0):!1},z=(t,n,r)=>{if(ya.has(t)&&!r.isGenerated){z(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>z(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(_o(t,n,r))return;let i=t.name,a=lo(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.z(Ha(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:lo(t,t.operator,n,r);return;case`Apply`:vo(t,n,r);return;case`Lambda`:z(t.body,Pa(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:z(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&z(t.other,n,r);return;case`Let`:z(t.body,ho(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(t.body,uo(t.bounds,n,r),a(La(t.bounds)));return;case`UnboundedQuantifier`:z(t.body,Pa(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&z(t.set,n,r),z(t.body,Pa(n,Ia(t.pattern),t.pattern.ranges,r),a(Ia(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:z(t.predicate,uo([t.bound],n,r),a(Ia(t.bound.pattern)));return;case`SetMap`:z(t.expression,uo(t.bounds,n,r),a(La(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??Va(i.location,i.name)),message:`Non-unique fields in constructor.`}),z(i.value,n,r)});return;case`Except`:z(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),z(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:z(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(oo(t,r))return;z(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),so(t,n,r);return;case`Subexpression`:if(bo(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>yo(e,n,r)),co(t,n,r,!1)}},xo=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||_o(t,n,r)||co(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Oa(n,i)?.isNonFact?r.errors.push({location:e.z(Ha(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||z(t,n,r)}),So=(e,t,n)=>(e.set&&z(e.set,t,n),Ma(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Co=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:So(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Co(t,e.scope,e.unit,!0):z(t,e.scope,e.unit),e),{scope:t,unit:n});return z(e.conclusion,i.scope,i.unit),i.scope},wo=(e,t,n)=>e.kind===`AssumeProve`?Co(e,t,n):(z(e,t,n),t),To=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&xo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Do(t,e,r),t)},Eo=(e,t,n)=>{let r=No(e,t,n);return e.name===void 0?r:Ma(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Do=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=wo(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return To(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return To(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 xo(r.facts,t,n),o(t);case`Instance`:return o(Eo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Eo(t,e,i):ho([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),To(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(Pa(uo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Pa(uo(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...La(r.bounds),...r.names]}),To(e.proof,a(t),n),a(o)}default:return To(e.proof,a(t),n),a(t)}},Oo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:wo(e.statement,void 0,t);e.name!==void 0&&Na(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),To(e.proof,n,t),r&&(r.isInProof=!1)},ko={line:0,column:0},Ao=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),jo=(e,t)=>{let n=new Map([...Ca,...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},Mo=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){z(r,o,a);return}let i=lo(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.O(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.z(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.z(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Oa(o,e.name)&&!za(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.z(i),message:`Substitution missing for symbol ${n.name} declared at ${e.z(o)} \nand instantiated in module ${r}.`})}),c},No=(e,t,n)=>{let r=n.getInstance(e);return Mo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ma(e,t,r,n),t)},Po=(e,t,n,r)=>{let i=jo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Mo(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:ko}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Fo=(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)=>wa(e.location,t.location)?-1:+!!wa(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.O)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Io=(t,n)=>{let r=jo(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...Ca,...n.bound].map(([e,t])=>[e,{...t,position:ko}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Na(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Fo([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=ja(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);Ao(t,e)?z(e.body,void 0,i):mo(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:Ta(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);Fa(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>Na(t,e,i)),e.name!==void 0&&Na(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);z(e.expression,void 0,r),e.name!==void 0&&Na(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>Oo(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>xo(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.z(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Lo=/* @__PURE__ */ new WeakSet,Ro=/* @__PURE__ */ new WeakSet,zo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Go(e,(e,r)=>zo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&E(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&E(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Bo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Vo=/* @__PURE__ */ new WeakMap,Ho=e=>Vo.get(e)??e.name,Uo=(e,t)=>(Ho(t)!==e.name&&Vo.set(e,Ho(t)),e),Wo=(e,t)=>Uo(e.kind===`Function`?{...e,bounds:Bo(e.bounds,e=>t(e,[])),body:t(e.body,La(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Go=(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=>Wo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Bo(e.bounds,n),body:t(e.body,La(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,Ia(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,Ia(e.bound.pattern))};case`SetMap`:return{...e,bounds:Bo(e.bounds,n),expression:t(e.expression,La(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Ko=`LAMBDA`,qo=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Go(e,(e,n)=>(r.push(...qo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Jo=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}},Yo=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Xo=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Zo=(e,t)=>e.map(e=>({pattern:Xo(e.pattern,t),set:e.set})),Qo=(e,t)=>e.kind===`Function`?{...e,bounds:Zo(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},$o=(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=>Uo({...Qo(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Zo(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Xo(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Xo(e.bound.pattern,n),set:e.bound.set}};default:return e}},es=e=>`${e}@ENABLED`,ts=(e,t)=>e.modes.get(t)??e,ns=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!E(e)&&t.instantiation.variables.has(e.name),rs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>rs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(ns(e,t,n))return[e.name];let r=E(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?rs(r.body,t,/* @__PURE__ */ new Map):void 0},is=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ns(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:es(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ls(e.expression,ts(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ls(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ls(e.subscript,ts(t,`Primed`),n),location:r},ls(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=rs(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:es(r),location:e.location},location:e.location},ls({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},as=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:va}),os=(e,t)=>e.map(e=>as(e.name,t)),ss=(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:[...os(t,r),...i.map(e=>as(e,r))],location:r},location:r}},cs=(e,t)=>e.instantiation.isParameterized(t)?ds(e,t):void 0,ls=(t,n,r)=>{let i=e=>ls(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!E(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:ls(t.expression,ts(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:ls(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},ts(n,`Enabled`),r)};let c=is(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name);if(e)return Lo.add(e),e;let r=cs(n,t.name);if(r===void 0)return t;if(o.length===0)return{...t,name:r};let i=a.getDefinition(t.name);return i&&Ta(i)>0?ss(r,o,Ta(i),t.location):{kind:`Apply`,operator:r,args:os(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||Ro.has(t),l=e=>(c&&Ro.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:Ko,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Ko,args:r,resolution:va},location:t.location};if(s)throw new e.O(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=cs(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...os(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=cs(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?ss(e,o,Ta(r),t.location):{...t,operator:e}}let l=Jo(n),u=Go(t,(e,t)=>t.length===0?i(e):ls(e,n,Yo(r,t,l)));return $o(u,r,l)},us=(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:as(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ds=(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=Jo(e),o=Qo(Wo(i,(t,n)=>ls(t,e,Yo(/* @__PURE__ */ new Map,n,a))),a);return us(o,r.params,i.location)}):t},fs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>qo(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>cs(i,e)??e,getQualifiedKey:t=>{let n=cs(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>us(r,e.params,r.location)):t}}},ps=e=>e.kind===`Let`&&e.instances!==void 0||T(e).some(ps),ms=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Go(e,e=>ms(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>wa(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}},hs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,gs=(e,t)=>e.definitions.some(e=>ps(e.body))||e.assumptions.some(e=>ps(e.expression))||e.theorems.some(e=>{let t=hs(e);return t!==void 0&&ps(t)})?{...e,definitions:e.definitions.map(e=>Wo(e,e=>ms(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:ms(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=hs(e);return n===void 0?e:{...e,statement:ms(n,t,[])}})}:e,_s=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=er.sets,a=i??[],o=a.length;er.sets=a;try{return n()}catch(e){throw Vu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,er.sets=i}},vs=(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},ys=e=>!e.includes(void 0),bs=e=>e.variables.map(()=>void 0),xs=(e,t,n)=>{let r=[...e];return r[t]=n,r},Ss=(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}},Cs=e=>e.kind===`Identifier`?e.name:void 0,ws=(e,t,n)=>{if(t.kind===`Label`)return ws(e,t.body,n);let r=Cs(t);if(r===void 0)return;let i=ll(n,r);if(i?.kind===`Thunk`)return ws(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Ql(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?ws(e,o.body,o.scope):void 0},Ts=(e,t,n)=>{if(t.kind===`Prime`)return ws(e,t.expression,n);if(t.kind===`Label`)return Ts(e,t.body,n);let r=Cs(t);if(r===void 0)return;let i=ll(n,r);if(i?.kind===`Thunk`)return Ts(e,i.expression,i.scope);if(i)return;let a=Ql(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Ts(e,a.body,a.scope):void 0},Es=t=>{if(typeof t!=`boolean`)throw new e._(`TLC expected a boolean expression.`);return t},Ds=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Os=(e,t,n)=>{t===void 0?ys(n)&&e.onState(n):ys(n)&&Ds(e)?As(e,t,n):t.kind===`Predicate`?js(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Bs(e,t.expression,t.rest,t.scope,n):ks(e,t,n)&&Os(e,t.rest,n)},ks=(e,t,n)=>{let r=e.environment,i=V(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return V(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?sl(t,r.runtime.version):t}})();return!Ot(i,a)},As=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Bs(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!ks(e,r,n):!Es(V(r.expression,vs(e,r.scope,n))))return}e.onState(n)},js=(t,n,r,i,a)=>_s(t,n,()=>{switch(n.kind){case`Let`:js(t,n.body,r,gu(n.definitions,vs(t,i,a)),a);return;case`Label`:js(t,n.body,r,i,a);return;default:if(Rs.has(n.kind))throw new e._(`The state relation is not a boolean expression.`);_s(t,n,()=>zs(t,n,r,i,a))}}),Ms=(e,t,n,r)=>{Es(t)&&Os(e,n,r)},Ns=(e,t,n,r,i)=>{let a=vs(e,r,i);if(t.kind===`Identifier`){let o=ll(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){js(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){js(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Ql(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&bl(s,e.environment))){js(e,c.body,n,c.scope,i);return}Ms(e,V(t,a),n,i);return}let o=eu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?js(e,o.body,n,mu(o,t.args,a),i):Ms(e,V(t,a),n,i)},Ps=(e,t,n,r,i)=>{let a=n[r];a===void 0?Os(e,t,xs(n,r,i)):Ot(a,i)&&Os(e,t,n)},Fs=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Is=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?ws(t,o,i):Ts(t,o,i),l=vs(t,i,a);if(c===void 0){V(n,l)===!0&&Os(t,r,a);return}let u=V(s,l),d=a[c];if(n.operator===`=`){Ps(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)V(n,l)===!0&&Os(t,r,a);else{if(!kn(f))throw new e._(`The right side of \\IN is not enumerable.`);for(let e of Vn(f))Os(t,r,xs(a,c,e))}},Ls=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Rs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),zs=(t,n,r,i,a)=>{let o=vs(t,i,a);switch(n.kind){case`Identifier`:Ns(t,n,r,i,a);return;case`Apply`:if(Ls.has(n.operator)&&n.args.length===2){Is(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(Es(V(n.args[0],o))){js(t,n.args[1],r,i,a);return}Os(t,r,a);return}Ns(t,n,r,i,a);return;case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Fs(`Predicate`,t,i,e),r);js(t,e[0],n,i,a);return}let o=e[e.length-1];js(t,Ss(n,e.length-1),Fs(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>js(t,e,r,i,a));return}js(t,Ss(n,e.length-1),r,i,a),js(t,e[e.length-1],r,i,a);return}case`Exists`:jl(n.bounds,o,e=>(js(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(jl(n.bounds,o,t=>(e.push(t),!1)),e.length===0){Os(t,r,a);return}let i=e.slice(1).reduce((e,t)=>Fs(`Predicate`,n.body,t,e),r);js(t,n.body,i,e[0],a);return}case`If`:js(t,Es(V(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>Es(V(e.condition,o)))?.body??n.other;if(s===void 0)throw new e._(`TLC encountered a CASE with no conditions true.`);js(t,s,r,i,a);return}case`FunctionApplication`:{let e=Il(V(n.function,t.isInit?o:pl(o)));if(e){js(t,e.body,r,Ll(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){Bs(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){js(t,n.action,r,i,a),Bs(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){js(t,n.action,Fs(`Changed`,n.subscript,i,r),i,a);return}}Ms(t,V(n,o),r,a)},Bs=(e,t,n,r,i)=>_s(e,t,()=>{let a=ws(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Ps(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Os(e,n,i);return}let s=o.reduceRight((e,t)=>Fs(`Unchanged`,t,r,e),n);Bs(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ll(r,t.name);if(a?.kind===`Thunk`){Bs(e,a.expression,n,a.scope,i);return}let o=a?void 0:Ql(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Bs(e,o.body,n,o.scope,i);return}}let o=e.environment,s=V(t,{environment:o,scope:r,state:e.current,next:void 0}),c=V(t,{environment:o,scope:r,state:i,next:void 0});Ot(s,c)&&Os(e,n,i)}),Vs=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Hs=/* @__PURE__ */ Error(`The replay found a successor`),Us=(e,t,n,r)=>{let i=Vs(r,!1,n,()=>{throw Hs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Fs(`Changed`,e.subscript,t,void 0);js(i,e.action,n,t,bs(r))}else js(i,e,void 0,t,bs(r));return!1}catch(e){if(e!==Hs)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Ws=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Vs(t,!0,void 0,n),o=i.reduceRight((e,t)=>Fs(`Predicate`,t.expression,t.scope,e),void 0);js(a,r.expression,o,r.scope,bs(t))},Gs=(e,t,n,r)=>{e.some(e=>Rs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Vs(n,!1,t,e=>i.push(e));js(a,e.expression,void 0,e.scope,bs(n)),i.forEach(t=>r(t,e))})},Ks=/* @__PURE__ */ new WeakMap,qs=/* @__PURE__ */ new WeakMap,Js=(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},Ys=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Xs=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Zs=(t,n)=>{let r=new e._(n);return t.isInit?r:e.K(r,e.W.error)},Qs=(e,t,n,r)=>{let i=Zc(n);return r&&Rs.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 ${Xs(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},$s=(e,t,n)=>{let r=gi(t),i=Xc(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 ${Xs(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
138
- `:``}${i}`},ec=(e,t,n)=>tc(e,t,V(t,n)),tc=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw Zs(e,Qs(e,n,t,r))},nc=(e,t,n,r)=>r.environment.callStack?V(n,r):(e[t]??=Gu(n,r.environment))(r),rc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,ic=(e,t,n)=>{let r=n?Ks:qs,i=r.get(e);if(i)return i;let a=Fc(e,t,n);return r.set(e,a),a},ac=(e,t)=>{if(t.constants.has(e))return;let n=gl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},oc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return oc(e.expression,t,!1,r);if(e.kind!==`Identifier`||E(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=ac(e.name,t);if(a&&!r.has(a))return r.add(a),oc(a.body,t,n,r)},sc=(e,t,n)=>oc(e,t,!n),cc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return cc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=gu(e.definitions,Js(r,t,n));return cc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ll(t,e.name);if(a?.kind===`Thunk`)return cc(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=ac(e.name,r.environment);if(s)return cc(s.body,void 0,n,r,i)},lc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||E(e))||!t&&e.kind===`Prime`,uc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>uc(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=ac(e.name,t);if(i)return n.add(e.name),uc(i.body,t,n)},dc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),fc=(e,t,n)=>dc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||rc(e.operator)&&(lc(e.args[0],n)||sc(e.args[0],t,n)!==void 0)||E(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,pc=/* @__PURE__ */ new Set,mc=(e,t)=>{if(E(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Go(e,(e,i)=>{let a=r.isReadOnly?mc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},hc=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||E(e)?void 0:gl(r,t);return i&&!n.has(i)&&(n.add(i),hc(i.body,t,n))?!0:T(e).some(e=>hc(e,t,n))},gc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=sc(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=uc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return fc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ic(e,t,n)}},_c=(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(_a(e,t)===void 0||hc(e,t,/* @__PURE__ */ new Set))return!0;let n=mc(e,pc);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)}},vc=(e,t,n)=>{let r=e.map(e=>gc(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Ds(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Rc(u)){d??=Js(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=nc(a,e,n,d);if(!tc(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Js(t,n,u);let r=nc(i,s,e.expression,d);if(!tc(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Js(t,n,u);let r=nc(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Ys(u,e.index,r),d=void 0;else if(!Ot(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let t of e.indices){let e=(r??u)[t];if(e===void 0)r??=u.slice(),r[t]=n[t];else if(!Ot(e,n[t]))return}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},yc=e=>(t,n,r,i,a,o)=>{ec(t,e,Js(t,n,r))&&o(r,i)},bc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Js(r,i,a);if(a[l]!==void 0){ec(r,e,u)&&c(a,o);return}let d=V(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!kn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Xs(r)}, the right side of \\IN is not enumerable.`;throw Zs(r,`${t}\n${Xc(e)}`)}let p=Vn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Ys(a,l,p[e]),o)}},xc=/* @__PURE__ */ new WeakMap,Sc=e=>{let t=xc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Sc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return xc.set(e,n),n},Cc=(e,t)=>{let n=e.args[0],r=yc(e),i=(e,r,i)=>cc(n,r,i,e,!t)??-1,a=bc(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=V(e.args[1],Js(t,n,o));l(Ys(o,u,d),s)}},wc=(e,t,n)=>{let r=Xc(e);return(i,a,o,s,c,l)=>{let u=Js(i,a,o),d=V(e.function,n?u:pl(u)),f=Il(d);if(f!==void 0){ic(f.body,t,n)(i,Ll(f,e,u),o,s,c,l);return}if(!A(d))throw Zs(i,`In computing ${Xs(i)}, a non-function (${gi(d)}) was applied as a function.\n${r}`);let p=V(e,u);if(typeof p!=`boolean`)throw Zs(i,`In computing ${Xs(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Tc=(e,t)=>{if(uc(e,t))return vc([Sc(e)],t,!1);if(e.kind===`Tuple`)return ic(Sc(e),t,!1);let n=Sc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ll(i,e.name):void 0;l?.kind===`Thunk`?ic(Sc(l.expression),t,!1)(r,l.scope,a,o,s,c):ec(r,n,Js(r,i,a))&&c(a,o)}},Ec=(e,t,n)=>{let r=e.operator,i=yc(e),a=E(e)?void 0:Ql(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Qu(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=ic(a.body,t,n),o.body(e,i(Js(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Js(a,o,s),f=eu(e,d);f?.kind===`Closure`?ic(f.body,t,n)(a,mu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Dc=(e,t,n)=>{let r=yc(e),i=E(e)?void 0:ac(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ll(s,e.name);f?.kind===`Thunk`?ic(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=ic(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Oc=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||E(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!E(i))return;let a=oc(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},kc=e=>e.kind===`And`?e.operands.flatMap(kc):[e],Ac=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&fc(e,t,!1),jc=e=>{let t=[];return(n,r,i)=>{let a=Js(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!tc(n,i,nc(t,r,i,a)))return}}},Mc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=kc(e),r=n.findIndex(e=>!Ac(e,t)||Oc(e,t)),i=r===-1?void 0:Oc(n[r],t);return i?{...i,before:r===0?void 0:jc(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Mc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||E(e))return;let r=Ql(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Mc(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!E(o))return;let s=i.before,c=s&&Qu(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Js(e,t,n)),n))}},Nc=(e,t,n)=>{let r=ll(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},Pc=(e,t,n)=>{let r=e.map(e=>ic(e,t,n)),i=n?[]:e.map(e=>Mc(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&&Nc(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)}}},Fc=(t,n,r)=>{let i=e=>ic(e,n,r);switch(t.kind){case`And`:return vc(t.operands,n,r);case`Or`:return Pc(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=wl(V(a.set,Js(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,ul(i,t,u[n]),o,s,c,l)}}let o=r?void 0:_c(t,n);if(o){let e=vc(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=Js(r,i,a),d=t.bounds.map(e=>wl(V(e.set,u),e.set,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=ul(n,o.names[t],e);if(t===d.length-1){let e=Js(r,i,a);if(!o.guards.every(t=>ec(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{jl(t.bounds,Js(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&_a(t,n)!==void 0&&!hc(t.body,n,/* @__PURE__ */ new Set)?mc(t,pc):void 0;return(n,r,i,o,s,c)=>{let l=[];jl(t.bounds,Js(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ll(r,e)?.kind===`Value`)){u.every(e=>ec(n,t.body,Js(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Rc(i)?u.slice(r).every(e=>ec(n,t.body,Js(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=V(t.condition,Js(r,i,a));if(typeof l!=`boolean`)throw Zs(r,$s(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=Js(r,i,a),u=e.find(e=>{let t=V(e.condition,l);if(typeof t==`boolean`)return t;throw Zs(r,`In computing ${Xs(r)}, a non-boolean expression${r.isEnabled?``:` `}(${gi(t)}) was used as a guard condition of a CASE.\n${Zc(e.source)}`)})?.body??n;if(!u)throw Zs(r,`In computing ${Xs(r)}, TLC encountered a CASE with no conditions true.\n${Xc(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=Eu(t.definitions,n);return(n,i,a,o,s,c)=>e(n,gu(t.definitions,Js(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e._(`UNCHANGED appears in an initial predicate at ${Jc(t)}`)}:Tc(t.expression,n);case`AngleAction`:{let e=i(t.action),r=Sc(t.subscript),a=(e,t,i)=>{try{return ec(e,r,Js(e,t,i))}catch(t){throw e.isEnabled?sl(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return i({kind:`Or`,operands:[t.action,Sc(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return Dc(t,n,r);case`FunctionApplication`:return wc(t,n,r);case`Apply`:{let e=t.args;if(rc(t.operator)){let i=sc(e[0],n,r);if(i!==void 0)return t.operator===`=`?vc([t],n,r):bc(t,()=>i);if(lc(e[0],r))return Cc(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=V(e[0],Js(n,r,i));(typeof c==`boolean`?c:hl(c,`the left side of => at ${Jc(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return Ec(t,n,r)}default:return yc(t)}},Ic=/* @__PURE__ */ new WeakMap,Lc=e=>{let t=Ic.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Ic.set(e,n),n},Rc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},zc=(t,n)=>{let r=n.state;if(!r||!Rc(r))throw new e._(`ENABLED needs a complete state at ${Jc(t)}`);let i=n.environment;if(i.callStack)return Us(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return ic(t,i,!1)(a,n.scope,Lc(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Bc=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};ic(t,n,!0)(a,i,Lc(n),void 0,!1,t=>{if(!a.isStopped){if(!Rc(t))throw e.K(new e.v([...t]),e.W.error);a.isStopped=r(t)}})},Vc=(e,t,n)=>{let r=[];return Bc(e,t,e=>(r.push(e),!1),n),r},Hc=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return ic(t,r,!1)(o,a,Lc(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!Rc(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.y(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}s.successors++,o.isStopped=i({state:t,action:n})}}),s.successors},Uc=(e,t,n,r)=>{let i=[];return Hc(e,t,n,e=>(i.push(e),!1),r),i},Wc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Gc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Kc=e=>Gc.has(e.kind)||e.kind===`Apply`&&Wc.has(e.operator),qc=(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&&k(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Jc=e=>`line ${e.location.line}, column ${e.location.column}`,Yc=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Xc=e=>{let t=e.location.range;return t?Yc(t):Jc(e)},Zc=e=>e.kind===`Number`?e.text??String(e.value):Xc(e),Qc=(t,n)=>new e._(`A non-boolean expression (${gi(n)}) was used as the condition of an IF.\n${Xc(t)}`),$c=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e._(`A non-boolean expression (${gi(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Zc(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e._(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${gi(r)}.\n${Xc({...t,location:{...t.location,range:{...i,end:a}}})}`)},el=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${I(e)}\n${Xc(t)}`,i=e=>`Attempted to apply function:\n${D(I(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!A(a))throw new e._(`Attempted to select field "${n}" from a non-record value ${D(I(a))}\n${Xc(t)}`);let o=yt(a);if(o===`tuple`)throw ur(n);return pr(a,n,o===`record`?r:i)}},tl=e=>e===`1.7.4`?(t,n)=>sr(t,n,e):void 0,nl=t=>n=>{if(!A(n))throw new e._(`Attempted to apply the operator DOMAIN to a non-function\n(${gi(n)})\n${Xc(t)}`);return hr(n)},rl=(t,n)=>(r,i)=>{if(!O(r)||st(r))throw new e._(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Xc(t)}`);return n.evaluate([r,i])},il=t=>e.K(new e._(`TLC can't handle real numbers: ${t.text} at ${Jc(t)}`),e.W.configParseError),al=t=>e.K(new e._(`TLC can't handle a number this big: ${t.text??t.value} at ${Jc(t)}`),e.W.error),ol=(t,n)=>new e.k(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Xc(n)}`,t),sl=(t,n)=>t instanceof e.k&&n!==`1.7.4`?new e._(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,cl=t=>new e._(`A primed expression appears outside an action at ${Jc(t)}`),ll=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},ul=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),dl=(t,n,r)=>{if(n.kind===`Name`)return ul(t,n.name,r);let i=Qn(r);if(!i||i.length!==n.names.length)throw new e._(`Cannot bind <<${n.names.join(`, `)}>> to ${I(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>ul(e,t,i[n]),t)},fl=(t,n)=>{if(A(t))return t;throw new e._(`A non-function (${gi(t)}) was applied as a function.\n${Xc(n)}`)},pl=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},ml=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),hl=(t,n)=>{if(typeof t!=`boolean`)throw new e._(`Expected ${n} to be a boolean but found ${I(t)}`);return t},gl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),_l=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),vl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),yl=(e,t)=>{if(_l.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&vl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=gl(n,t);if(e&&!t.constants.has(n)&&!bl(e,t))return!0}return T(e).some(e=>yl(e,t))},bl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!yl(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>yl(e.set,t)));return t.constantLevels.set(e,r),r},xl=(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.`},Sl=(t,n,r)=>{if(!O(t)||st(t)){let i=I(t),a=r===`1.7.4`?void 0:xl(t,i);throw new e._(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Zc(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Zc(n)}\n${a}`)}},Cl=(e,t,n)=>(Sl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Sn(e):In(e)??N(e).elements),wl=(e,t,n)=>n===`1.7.4`?(Sl(e,t,n),In(e)??Vn(e)):Cl(e,t,n),Tl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Jn(e),e},El=(e,t,n)=>Tl(e)??wl(e,t,n),Dl=(e,t,n)=>Tl(e)??Cl(e,t,n),Ol=(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},kl=(e,t)=>e.map(e=>El(V(e.set,t),e.set,t.environment.runtime.version)),Al=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Ol(t[n],t=>i(n-1,dl(a,e[n].pattern,t)));return i(e.length-1,n)},jl=(e,t,n)=>Al(e,kl(e,t),t.scope,n),Ml=(e,t)=>{let n=e.map(e=>V(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Nl=(e,t,n)=>{if(e.length===1)return dl(t,e[0].pattern,n);let r=Qn(n)??[];return e.reduce((e,t,n)=>dl(e,t.pattern,r[n]),t)},Pl=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Fl=e=>Object.assign(e.value,{lambda:e}),Il=e=>Pl(e)?e.lambda:void 0,Ll=(t,n,r)=>{let i=t.value,a=n.args.map(e=>V(e,r)),o=a.length===1?a[0]:En(a),s=(e,t,r)=>`In applying the function\n${D(I(i))},\nthe ${e} is:\n${D(I(t))}${r}.\n${Xc(n.function)}`,c=t.bounds;if(c.length===1){if(!nr(o,i.domain))throw new e._(s(`first argument`,o,`which is not in its domain`));return Nl(c,t.scope,o)}let l=Qn(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e._(`Attempted to apply a function to an argument not in its domain.\n${Xc(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!nr(r,u[n]))throw new e._(s(i,r,`${t.pattern.kind===`Name`?``:`
139
- `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&Qn(r)?.length!==t.pattern.names.length)throw new e._(s(i,r,`which does not match its formal parameter`))}),Nl(c,t.scope,En(l.slice(0,c.length)))},Rl=/* @__PURE__ */ new WeakMap,zl=(e,t)=>{let n=Rl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Yc(r)};return Rl.set(t,i),i},Bl=(e,t,n)=>{let r=zl(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Vl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Or(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(At(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Hl=/* @__PURE__ */ new WeakMap,Ul=e=>{let t=Hl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Hl.set(e,n),n},Wl=(e,t)=>{let n=Ml(e.bounds,t),r=Vl(n,(n,r)=>V(e.body,ml(t,Nl(e.bounds,ul(void 0,e.name,r),n))),Bl(e.bounds,e.body,n));return Fl({value:r,bounds:e.bounds,body:e.body,scope:ul(void 0,e.name,r)}),e.bounds.length===1?bt(r):r},Gl=(t,n)=>{if(typeof n!=`object`||yt(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!k(n.domain))return n;try{let e=F(n);return gt(e.domain,e.range)}catch(t){if(t instanceof e._)return n;throw t}},Kl=(e,t)=>e.kind===`Function`?e.isSelfReferential?Wl(e,t):V(Ul(e),t):V(e.body,t),ql=(t,n)=>{let r=bl(t,n.environment),i=r?n.environment.definitionValues.get(t):void 0;if(i!==void 0)return i;if(t.kind===`Operator`&&t.params.length>0)throw new e._(`Operator ${t.name} requires ${t.params.length} arguments`);let a=ml(n,void 0);if(!r)return Kl(t,a);let o=n.environment.runtime.evaluateAtStartup(()=>Gl(t,Kl(t,a)));return n.environment.definitionValues.set(t,o),o},Jl=(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))&&bl(t,n))try{sn(ql(t,{environment:n,scope:void 0,state:void 0,next:void 0}))}catch(t){if(!(t instanceof e._)&&!e.U(t))throw t}}),Yl=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=V(e.expression,ml(t,e.scope));return n&&(!e.isStreamed||Un(r))&&(e.cache=r),r},Xl=/* @__PURE__ */ new WeakMap,Zl=e=>{let t=Xl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Xl.set(e,n),n},Ql=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Ql(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Zl(r):t.builtins.get(e)},$l=/* @__PURE__ */ new WeakMap,eu=(e,t)=>{if(E(e))return tu(e.operator,t);let n=$l.get(e),r=n===void 0?Ql(e.operator,t.environment)??null:n;return n===void 0&&$l.set(e,r),r??tu(e.operator,t)},tu=(e,t)=>{let n=ll(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Ql(e,t.environment)},nu=e=>e.kind===`Closure`?e.params.length:e.arity,ru=(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:tu(r,n);if(!i)throw new e._(`Expected an operator argument at ${Jc(t)}`);return i},iu=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>ul(e,n.name,t[r]),e.scope);return V(e.body,ml(n,r))},au=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:nu(e),call:n=>iu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},ou=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=tu(e.name,t);return n!==void 0&&nu(n)>0},su=(e,t)=>e.map(e=>ou(e,t)?au(ru(e,t),t):V(e,t)),cu=(t,n)=>new e._(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),lu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),uu=(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 uu(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([])}},du=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ve(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=E(e)?void 0:uu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ll(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:lu(e,t)}}return t=>lu(e,t)},fu=/* @__PURE__ */ new WeakMap,pu=(e,t)=>{let n=fu.get(e);if(n)return n;let r=du(e,t);return fu.set(e,r),r},mu=(e,t,n,r)=>{if(t.length!==e.params.length)throw cu(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:ru(t[a],n)}:(r?.[a]??pu(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},hu=(e,t,n,r,i)=>{if(e.kind===`Closure`){let a=ml(n,mu(e,t,n,i));return n.environment.callStack?V(e.body,a):(r.entry?.body===e.body?r.entry:r.entry={body:e.body,evaluator:Gu(e.body,n.environment)}).evaluator(a)}return e.kind===`Operator`?e.call(t.map(e=>V(e,n))):e.isLazy?e.evaluate(Xu(t,n),n):e.evaluate(su(t,n),n)},gu=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),_u=(t,n,r)=>{let i=ll(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Yl(i,r);if(i?.kind===`Operator`){if(nu(i.operator)===0)return iu(i.operator,[],r);throw new e._(`Operator ${t} is used without arguments`)}let a=uu(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw ol(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return ql(a.definition,r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e._(`Unknown identifier ${t} at ${Jc(n)}`)},vu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),yu=(e,t)=>vu.has(e)||t.builtins.get(e)?.isStateLevel===!0,bu={builtins:vu,definitions:/* @__PURE__ */ new WeakMap},xu={builtins:new Set([...vu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Su=(e,t)=>e.kind===`Operator`&&e.params.length===0&&bl(e,t),Cu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!E(e)){let e=gl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Su(e,t)&&wu(e,t,n))return!0}return T(e).some(e=>Cu(e,t,n))},wu=(e,t,n=bu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Cu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Cu(e.set,t,n));return n.definitions.set(e,i),i},Tu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Eu=(e,t)=>({impure:new Set(e.filter(e=>wu(e,t))),streamed:new Set(e.filter(e=>wu(e,t,Tu)))}),Du=e=>[...e.definitions.values()].some(t=>wu(t,e)),Ou=e=>[...e.definitions.values()].some(t=>wu(t,e,xu)),ku=/* @__PURE__ */ new WeakMap,Au=(e,t)=>{let n=ku.get(e);if(n!==void 0)return n;let r=Pu(e,t,Mu);return ku.set(e,r),r},ju=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Mu=/* @__PURE__ */ new Set,Nu=(e,t,n)=>n.size===0?Au(e,t):Pu(e,t,n),Pu=(e,t,n)=>{if(!ju.has(e.kind))return!1;if(e.kind===`Identifier`&&E(e))return n.has(e.name);if(E(e))return!1;if(e.kind===`Identifier`){let n=uu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Su(n.definition,t)}if(e.kind===`Apply`){if(yu(e.operator,t)||Tu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=Ql(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=gl(e.operator,t);if(!n||!bl(n,t)||wu(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Nu(e,t,n))}let r={value:!0};return Go(e,(e,i)=>(r.value&&=Nu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Fu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Iu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Lu=(e,t)=>{if(e.kind===`Identifier`&&E(e))return!t.has(e.name);if(E(e))return!0;let n={value:!1};return Go(e,(e,r)=>(n.value||=Lu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Ru=(e,t)=>Lo.has(e)&&Fu(e)&&_a(e,t)!==void 0&&!Lu(e,Mu),zu=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Bu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=er.sets,o=er.callStack,s=a??[],c=s.length;er.sets=s,er.callStack=r;try{let a=t(i),o=zu(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Kc(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=qc(e,r.values),a=i&&!T(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!A(a)?void 0:a;throw Vu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,er.sets=a,er.callStack=o}},Vu=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e._){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},Hu=(t,n,r)=>{if(!(r instanceof e._))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},Uu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),B=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Td(e,t),i=t.callStack,a=i?Bu(e,r,t,i):Fu(e)&&Au(e,t)?Iu(r):Ru(e,t)?Ju(r):r;return t.evaluators.set(e,a),a},Wu=/* @__PURE__ */ new WeakMap,Gu=(e,t)=>{if(t.callStack)return B(e,t);let n=Wu.get(e);if(n)return n;let r=(Fu(e)&&Au(e,t)?void 0:Bi(e,t))??B(e,t);return Wu.set(e,r),r},V=(e,t)=>Gu(e,t.environment)(t),Ku=(e,t)=>{let n=e.name,r=E(e)?void 0:uu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw ol(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&bl(e,t))return t=>ql(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Gu(e.body,t),n.body(ml(r,void 0)));return qu(e,t)?Ju(r):r}return t=>ql(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>ql(e,t);return bl(e,t)||!qu(e,t)?n:Ju(n)}return t=>_u(n,e,t)},qu=(e,t)=>_a(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>_a(e.set,t)!==void 0)),Ju=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Yu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||E(e))return!0;let n=Ql(e.name,t);return n===void 0||nu(n)===0},Xu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>V(e,t),expression:e})),Zu=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Xu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Yu(t[0],n)){let e=B(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Yu(t[0],n)&&Yu(t[1],n);if(i&&a){let e=B(t[0],n),r=B(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(su(t,n),n)},Qu=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw cu(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:pu(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:ru(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},$u=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),ed=/* @__PURE__ */ new WeakMap,td=e=>{let t=ed.get(e);if(t)return t;let n={constant:$u(),state:$u()};return ed.set(e,n),n},nd=e=>e.kind===`ExceptAt`||T(e).some(nd),rd=/* @__PURE__ */ new WeakMap,id=(e,t)=>{let n=rd.get(e);if(n!==void 0)return n;let r=_a(e,t)!==void 0&&mc(e,Mu),i=r&&[...new Set(nd(e)?[...r,`@`]:r)];return rd.set(e,i??!1),i??!1},ad=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,H={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},od=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:Or(e),sd=e=>ad(e)?(H.sources[H.sourceCount++]=void 0,H.args[H.argCount++]=e,H.hash=yr(H.hash,od(e)),!0):!1,cd=(e,t,n)=>{if(!t)return!1;H.sources[H.sourceCount++]=e,H.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=ll(n,t[e]);if(r?.kind!==`Value`||!ad(r.value))return!1;H.args[H.argCount++]=r.value,H.hash=yr(H.hash,od(r.value))}return!0},ld=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ve(e.value))return()=>sd(e.value);if(e.kind===`Identifier`){let n=E(e)?void 0:uu(e.name,t);if(n?.kind===`Value`)return()=>sd(n.value);if(n===void 0)return n=>{let r=ll(n.scope,e.name);return r?.kind===`Value`?sd(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:cd(r.expression,id(r.expression,t),r.scope)}}let n=id(e,t);return t=>cd(e,n,t.scope)},ud=e=>{if(e.args.length!==H.argCount||e.sources.length!==H.sourceCount)return!1;for(let t=0;t<H.sourceCount;t++)if(e.sources[t]!==H.sources[t])return!1;for(let t=0;t<H.argCount;t++)if(!At(e.args[t],H.args[t]))return!1;return!0},dd=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(ud(e[t]))return e[t]}},fd=(e,t)=>{let n=gl(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!wu(n,t))return bl(n,t)?`constant`:qu(n,t)?`state`:void 0},pd=(e,t,n,r)=>{let i=Qu(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Gu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=td(e),c=t.map(e=>ld(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);H.sourceCount=0,H.argCount=0,H.hash=t.length,H.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||H.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=H.hash&1073741823,d=a.calls.get(u),f=dd(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=H.sources.slice(0,H.sourceCount),m=H.args.slice(0,H.argCount),h=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:h};d?d.push(e):a.calls.set(u,[e])}return h}},md=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=B(r[0],n),t=B(r[1],n);return n=>!hl(e(n),`the left side of =>`)||hl(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e._(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=E(t)?void 0:Ql(t.operator,n);if(i?.kind===`Closure`){let e=n.callStack?void 0:fd(t,n);return pd(i,r,n,e)}if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=B(r[0],n),i=nl(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=B(r[0],n);return Ro.has(t)||yl(r[0],n)?e:t=>t.scope===void 0?i.evaluate([e(t)]):e(t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=B(r[0],n),a=B(r[1],n),o=rl(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Zu(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e._(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a={entry:void 0},o=r.map(e=>pu(e,n));return i=>{let s=tu(t.operator,i);if(s)return hu(s,r,i,a,o);throw n.definitions.get(t.operator)?.kind===`Function`?new e._(`${t.operator} is a function; apply it with brackets`):new e._(`Unknown operator ${t.operator} at ${Jc(t)}`)}},hd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=B(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=B(a.set,t);return s=>Ol(El(o(s),a.set,t.runtime.version),t=>hl(i(ml(s,ul(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>B(e.set,t));return s=>{let c=a.map((e,n)=>El(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?hl(i(ml(s,a)),r)!==n:Ol(c[t],n=>l(t-1,ul(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>jl(o,e,t=>hl(i(ml(e,t)),r)!==n)?!n:n},gd=(e,t)=>{if(e.kind===`Tuple`)return En(e.names.map(e=>{let n=ll(t,e);return n?.kind===`Value`&&n.value}));let n=ll(t,e.name);return n?.kind===`Value`?n.value:void 0},_d=/* @__PURE__ */ new WeakSet,vd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&_d.add(e)},yd=(t,n)=>{let r=_d.has(t),i=B(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=B(o.set,n),l=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=wn(e),a=gt(r,r.map(e=>i(ml(t,ul(t.scope,n,e)))));return k(e)?a:bt(a)}let n=[],r=a.map(e=>Dl(V(e.set,t),e.set,t.environment.runtime.version));return Al(a,r,t.scope,e=>{let r=a.length===1?gd(o.pattern,e)??!1:En(a.map(t=>gd(t.pattern,e)??!1));return n.push([r,i(ml(t,e))]),!1}),gn(n)},u=(e,n)=>{let r=Fl({value:Vl(e,e=>i(ml(n,Nl(a,n.scope,e))),Bl(a,t.body,e)),bounds:a,body:t.body,scope:n.scope});return a.length===1?bt(r):r},d=n.callStack;return n=>{let i=s?c(n):Ml(a,n);if(t.isRecursive||r||n.isKeepLazy||!M(i))return u(i,n);if(!k(i)){if(d)return u(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e._))throw t;return u(i,n)}}if(!d)return l(i,n);try{return l(i,n)}catch(e){throw Hu(d,t,e),e}}},bd=(e,t)=>{let n=_d.has(e);n&&vd(e.function);let r=B(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=>B(e,t))}),value:B(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):En(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(ml(i,ul(i.scope,`@`,e))):gr(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(Vi.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Xc(e.function)}`)}return n}},xd=(t,n)=>{if(t.kind===`SetFilter`){let e=B(t.predicate,n),r=B(t.bound.set,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:Yc(a)},s=(e,t)=>n=>hl(e(ml(t,dl(t.scope,i,n))),`a set filter predicate`),c=(e,n,r)=>({kind:`FilteredSet`,base:e,test:s(r,n),source:o,rebind:r=>c(e,{...n,environment:r},B(t.predicate,r))});return t=>{let n=r(t);return k(n)?ht(N(n).elements.filter(s(e,t))):c(n,t,e)}}if(t.kind===`SetMap`){let e=B(t.expression,n);return n=>{let r=[];return jl(t.bounds,n,t=>(r.push(e(ml(n,t))),!1)),dn(r)}}let r=t.set;if(!r)return()=>{throw new e._(`TLC cannot evaluate an unbounded CHOOSE at ${Jc(t)}`)};let i=B(t.body,n),a=B(r,n);return n=>{let o=a(n);if(!O(o)||st(o))throw new e._(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Xc(t)}`);let s={value:void 0},c=Dl(o,r,n.environment.runtime.version);if(Ol(c,e=>{let r=dl(n.scope,t.pattern,e);return hl(i(ml(n,r)),`the body of CHOOSE`)?(s.value=gd(t.pattern,r),!0):!1}),s.value===void 0)throw new e._(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Xc(t)}`);return s.value}},Sd=e=>[...e].sort((e,t)=>ft(e.name,t.name)),Cd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),wd=(e,t)=>{let n=Sd(e),r=Cd(n),i=n.map(e=>B(e.value,t));if(r)return e=>Dn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>Ge(a,i.map(t=>t(e)),o):e=>On(a,i.map(t=>t(e)))},Td=(t,n)=>{let r=e=>B(e,n);switch(t.kind){case`Number`:{let e=t.value;return Ve(e)?()=>e:()=>{throw al(t)}}case`Decimal`:return()=>{throw il(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Ku(t,n);case`Apply`:return md(t,n);case`Bracket`:return()=>{throw new e._(`A bracket without a function or subscript is not an expression at ${Jc(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e._(`An operator cannot be used as a value at ${Jc(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw $c(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw $c(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw cl(t);return e({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let e=r({kind:`Prime`,expression:t.expression,location:t.location}),n=r(t.expression);return t=>Ot(e(t),n(t))}case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw Qc(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e._(`A non-boolean expression (${gi(n)}) was used as a condition of a CASE. ${Zc(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e._(`Attempted to evaluate a CASE with no conditions true.\n${Xc(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(ml(n,gu(t.definitions,n)))}case`Forall`:case`Exists`:return hd(t,n);case`UnboundedQuantifier`:return()=>{throw new e._(`TLC cannot evaluate an unbounded quantifier at ${Jc(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return xd(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>dn(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>En(e.map(e=>e(t)))}case`FunctionConstruction`:return yd(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 wd(t.fields,n);case`RecordSet`:{let e=Sd(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return bd(t,n);case`ExceptAt`:return n=>{let r=ll(n.scope,`@`);if(r?.kind!==`Value`)throw new e._(`@ appears outside an EXCEPT at ${Jc(t)}`);return r.value};case`FunctionApplication`:{vd(t.function);let e=r(t.function),i=n=>fl(e(pl(n)),t),a=t.args.map(r),o=tl(n.runtime.version);if(a.length===1){let e=a[0];return t=>pr(i(t),e(t),o)}return e=>pr(i(e),En(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=el(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let e=r(t.action),n=r({kind:`Unchanged`,expression:t.subscript,location:t.location}),i=t.kind===`BoxAction`;return t=>i?hl(e(t),`an action`)||n(t):hl(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>zc(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e._(`The subexpression reference at ${Jc(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e._(`TLC cannot evaluate a temporal formula in a state at ${Jc(t)}`)}}},Ed=`tlc2/value/impl/`,Dd={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Od={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},kd=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},Ad=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),jd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Md=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Ad.get(e[3])}${`[]`.repeat(e[1].length)}`),Nd=(e,t)=>e[e[t].first].text,Pd=(e,t)=>Nd(e,t).replaceAll(`/`,`.`),Fd=t=>{let n=kd(t);if(n.readUint32()!==3405691582)throw new e.O(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===Dd.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Dd.integer?i.value=n.readInt32():t===Dd.float?n.readUint32():t===Dd.long||t===Dd.double?(n.readBytes(8),e++):t===Dd.class||t===Dd.string||t===Dd.methodType||t===Dd.module||t===Dd.package?i.first=n.readUint16():t===Dd.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Pd(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=Md(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:kd(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()},()=>Pd(r,d.readUint16())):[],p=jd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Md(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}},Id=(e,t)=>{let n=e[t],r=e[n.second];return{className:Nd(e,n.first),name:e[r.first].text}},Ld=(t,n,r,i)=>{let a=()=>new e.A(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===Dd.integer)return t.value;if(t.tag===Dd.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>=Od.iconstM1&&t<=Od.iconst5)s.push(t-Od.iconst0),e+=1;else if(t===Od.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===Od.sipush)s.push(r()<<16>>16),e+=3;else if(t===Od.ldc)s.push(l(o[e+1])),e+=2;else if(t===Od.ldcW)s.push(l(r())),e+=3;else if(t===Od.dup){let t=c();s.push(t,t),e+=1}else if(t===Od.getstatic){let t=Id(n,r());if(t.className!==`${Ed}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===Od.invokestatic){let t=Id(n,r()),o=c();if(t.className!==`${Ed}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===Od.new)s.push({className:Nd(n,r()),value:void 0}),e+=3;else if(t===Od.invokespecial){let t=Id(n,r()),o=c(),s=c();if(!(t.className===`${Ed}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===Od.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()},Rd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Fd(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:Ld(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)}))}},zd=/* @__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(`,`),Bd=[[`\\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`,`≀`],[`^+`,`⁺`]],Vd=/* @__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(`,`),Hd=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),Ud=/* @__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(`.`),Wd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Gd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
135
+ `],[2281,` - specifically: `]]),Yi=(e,t,n)=>{let r=n?Ji.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)}${Xi(t.slice(a),n)}`},Xi=(e,t)=>{let n=t?Ki(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ri.none} @!@!@\n${Yi(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Zi=e=>String(e).padStart(2,`0`),Qi=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${Zi(r%24)}h`:e>36e5?`${Zi(r%24)}h ${Zi(n)}min`:e>6e4?`${Zi(n)}min ${Zi(t)}s`:`${Zi(t)}s`},$i=e=>`${e.getFullYear()}-${Zi(e.getMonth()+1)}-${Zi(e.getDate())} ${Zi(e.getHours())}:${Zi(e.getMinutes())}:${Zi(e.getSeconds())}`,ea=/* @__PURE__ */ new WeakMap,ta=(t,n,r)=>{if(!(t instanceof e._))return t;let i=e.K(new e._(`${r}\n${t.message}`,t),e.V(t));return ea.set(i,{code:n,headline:r,inner:t}),i},na=e=>ea.has(e),ra=e.P.slice(0,e.P.indexOf(`
136
+ `)),ia=`${e.P}tlc2.tool.EvalException: `,aa=`${e.P}util.Assert$TLCRuntimeException: `,oa=e=>qi(e)?ia:aa,sa=t=>{try{return t()}catch(t){throw t instanceof e._?qi(t)?new e._(`${e.N}${t.message}`):Ki(t.message)?t:new e._(`${e.P}${t.message}`):t}},ca=[ia,aa,e.P,e.N],la=(e,t)=>{let n=ea.get(e);if(n)return`${n.headline}\n${la(n.inner,t)}`;let r=e.message,i=ca.find(e=>r.startsWith(e))??``;return`${i}${Xi(r.slice(i.length),t)}`},ua=(t,n)=>{let r=ea.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:la(t,!0)};if(n&&qi(t))return{code:Ki(i)?.code??Li.general,message:i,toolMessage:i};let a=n&&!i.startsWith(ra)?e.P:``;return{code:Li.general,message:`${a}${i}`,toolMessage:`${a}${la(t,!0)}`}},da={kind:`Local`},fa=/* @__PURE__ */ new WeakSet,pa=/* @__PURE__ */ new WeakMap,ma=/* @__PURE__ */ new WeakMap,ha=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ga=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),_a=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,va=e=>e.kind===`Operator`?e.params.length:0,ya=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ba=e=>e.name.includes(`!`),xa=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Sa=(e,t,n)=>{let r=t.bindings.get(e);return r&&_a(r.position,t.location)&&(!n||_a(r.position,n.start))?r:void 0},Ca=(t,n)=>t!==void 0&&n!==void 0&&e.z(t)===e.z(n),wa=(t,n,r,i)=>{if(n===void 0)return!0;if(Ca(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.z(a),s=n.range&&e.z(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},Ta=(e,t,n,r)=>wa(t,xa(e,t)??Sa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ea=(e,t,n)=>{wa(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Da=(e,t,n,r)=>t.reduce((e,t,i)=>Ta(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Oa=(e,t,n)=>t.reduce((e,t)=>Ta(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),ka=e=>e.kind===`Name`?[e.name]:e.names,Aa=e=>e.flatMap(e=>ka(e.pattern)),ja=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||_a(n.location,t.location))?n:void 0},Ma=(e,t)=>{let n=ja(e,t);return n?{key:t.getKey(n),arity:va(n),params:ya(n),kind:`Definition`}:t.imported.get(e)},Na=(e,t,n)=>xa(t,e)??Ma(e,n),Pa=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Fa=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Pa(e.location,e.spelling??t)},Ia=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return _a(e.location,e.args[0].location)?`prefix`:`postfix`}},La=e=>!/^[\p{L}\d_]/u.test(e),Ra=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),za=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Ba=(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])}})},Va=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Ba(e.name,[],void 0):Ba(e.operator,e.args,e.argumentCounts),Ha=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ua=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Aa(e.bounds),body:e.body,sets:Ha(e.bounds)};case`SetMap`:return{names:Aa(e.bounds),body:e.expression,sets:Ha(e.bounds)};case`SetFilter`:return{names:ka(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:ka(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}},Wa=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Ga=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Ka=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),qa=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?qa(e.body,t):ke(e).reduce((e,n)=>e??qa(n,t),void 0)},Ja=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Ja(i,t,n||Ka(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&qa(e.set,t):qa(e,t)},Ya=e=>e.kind===`Label`?Ya(e.body):e,Xa=e=>typeof e==`number`?`argument selector ${e}`:e,Za=`within the scope of a declaration
137
+ from outside that declaration's scope.`,Qa=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.z(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&Ya(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:Ja(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?qa(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Ka(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${Za}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=Xa(t.operand);if(u.isSufficesOpen){if(za(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=Ya(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Na(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=Ua(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Wa(e);if(!l)return;let f=za(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=za(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Ka(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${Za}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},$a=(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)},eo=(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=xa(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)},to=(e,t,n,r)=>{if(!Ga(e))return!1;let i=Va(e),a=i[0],o=i.length>1&&a.kind===`Name`?xa(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Qa(e,i,o,t,n,r),o!==void 0},no=(t,n,r,i)=>{let a=t.location;if(po(t,r,i))return;let o=ma.get(t);if(o!==void 0)return o;if(ha(n))return t.kind===`Apply`?t.args.length:0;let s=xa(r,n);if(s?.isNonFact){i.errors.push({location:e.z(Fa(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(to(t,r,i,!1)||Ra(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=da),s)return s.arity;let c=Ma(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,ma.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(xa(r,l)!==void 0||Ma(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.z(t.kind===`Apply`&&u===`-.`?Pa(a,`-`):Fa(t,n));if(!La(n)||Ra(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Ia(t);f&&a.range&&i.errors.push({location:e.z(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},ro=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>Da(e,ka(t.pattern),t.pattern.ranges,n),t)),io=(e,t)=>e.kind===`Identifier`&&e.name===t&&E(e)||ke(e).some(e=>io(e,t)),ao=(e,t)=>{e.kind===`FunctionConstruction`&&io(e.body,t)&&(e.isRecursive=!0),ke(e).forEach(e=>ao(e,t))},oo=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Aa(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`?ro(t.bounds,n,a):Oa(n,t.params,a),u=xa(l,o)??Sa(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(z(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),ao(t.body,o),t.isSelfReferential=io(t.body,o)):z(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:wa(o,xa(n,o)??Sa(o,a,s),{kind:`Definition`,arity:va(t),range:s},a)},so=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(xa(e,t.name)?.isPending)return e;let n={name:t.name,arity:va(t),params:ya(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>yo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ha(t.name)?e:s(e,e=>!_a(t.location,e.location)),o={name:t.name,arity:va(t),kind:`Definition`,range:t.location.range,parent:a};if(ba(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ha(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return oo(t,a,u,i)?{...o,params:ya(t)}:a},a),()=>!0)},co=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:xa(t,r)??Sa(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},lo=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=co(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.z(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},uo=(t,n,r)=>{if(lo(t,n,r))return;let i=t.operator,a=Na(i,n,r),o=no(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.z(t.argumentsRange??Fa(t,i)),message:`The operator ${i} requires ${o-(co(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>fo(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.z(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=no(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else z(e,n,r);return!0}if(e.kind===`Lambda`){z(e,n,r);let s=e.params.length===o;return!s&&fa.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Fa(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return z(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=Na(u,n,r)?.params??[],f=no(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Fa(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},fo=(e,t,n)=>{e.kind===`Identifier`?no(e,e.name,t,n):z(e,t,n)},po=(e,t,n)=>{let r=pa.get(e);return r?(r.args.forEach(e=>fo(e,t,n)),n.errors.push(r.error),!0):!1},z=(t,n,r)=>{if(fa.has(t)&&!r.isGenerated){z(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>z(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(lo(t,n,r))return;let i=t.name,a=no(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.z(Fa(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:no(t,t.operator,n,r);return;case`Apply`:uo(t,n,r);return;case`Lambda`:z(t.body,Da(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:z(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&z(t.other,n,r);return;case`Let`:z(t.body,so(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(t.body,ro(t.bounds,n,r),a(Aa(t.bounds)));return;case`UnboundedQuantifier`:z(t.body,Da(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&z(t.set,n,r),z(t.body,Da(n,ka(t.pattern),t.pattern.ranges,r),a(ka(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:z(t.predicate,ro([t.bound],n,r),a(ka(t.bound.pattern)));return;case`SetMap`:z(t.expression,ro(t.bounds,n,r),a(Aa(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??Pa(i.location,i.name)),message:`Non-unique fields in constructor.`}),z(i.value,n,r)});return;case`Except`:z(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),z(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:z(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if($a(t,r))return;z(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),eo(t,n,r);return;case`Subexpression`:if(po(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>fo(e,n,r)),to(t,n,r,!1)}},mo=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||lo(t,n,r)||to(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&xa(n,i)?.isNonFact?r.errors.push({location:e.z(Fa(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||z(t,n,r)}),ho=(e,t,n)=>(e.set&&z(e.set,t,n),Ta(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),go=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:ho(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?go(t,e.scope,e.unit,!0):z(t,e.scope,e.unit),e),{scope:t,unit:n});return z(e.conclusion,i.scope,i.unit),i.scope},_o=(e,t,n)=>e.kind===`AssumeProve`?go(e,t,n):(z(e,t,n),t),vo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&mo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>bo(t,e,r),t)},yo=(e,t,n)=>{let r=Eo(e,t,n);return e.name===void 0?r:Ta(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},bo=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=_o(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return vo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return vo(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 mo(r.facts,t,n),o(t);case`Instance`:return o(yo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?yo(t,e,i):so([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),vo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(Da(ro(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Da(ro(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...Aa(r.bounds),...r.names]}),vo(e.proof,a(t),n),a(o)}default:return vo(e.proof,a(t),n),a(t)}},xo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:_o(e.statement,void 0,t);e.name!==void 0&&Ea(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),vo(e.proof,n,t),r&&(r.isInProof=!1)},So={line:0,column:0},Co=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),wo=(e,t)=>{let n=new Map([...ga,...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},To=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){z(r,o,a);return}let i=no(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.O(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.z(t.nameRange),message:`Identifier '${r}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.z(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!xa(o,e.name)&&!Ma(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.z(i),message:`Substitution missing for symbol ${n.name} declared at ${e.z(o)} \nand instantiated in module ${r}.`})}),c},Eo=(e,t,n)=>{let r=n.getInstance(e);return To(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ta(e,t,r,n),t)},Do=(e,t,n,r)=>{let i=wo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),To(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:So}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Oo=(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)=>_a(e.location,t.location)?-1:+!!_a(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.O)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},ko=(t,n)=>{let r=wo(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...ga,...n.bound].map(([e,t])=>[e,{...t,position:So}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Ea(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Oo([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=wa(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);Co(t,e)?z(e.body,void 0,i):oo(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:va(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);Oa(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>Ea(t,e,i)),e.name!==void 0&&Ea(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);z(e.expression,void 0,r),e.name!==void 0&&Ea(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>xo(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>mo(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.z(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Ao=/* @__PURE__ */ new WeakSet,jo=/* @__PURE__ */ new WeakSet,Mo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Ro(e,(e,r)=>Mo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&E(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&E(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},No=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Po=/* @__PURE__ */ new WeakMap,Fo=e=>Po.get(e)??e.name,Io=(e,t)=>(Fo(t)!==e.name&&Po.set(e,Fo(t)),e),Lo=(e,t)=>Io(e.kind===`Function`?{...e,bounds:No(e.bounds,e=>t(e,[])),body:t(e.body,Aa(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Ro=(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=>Lo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:No(e.bounds,n),body:t(e.body,Aa(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,ka(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,ka(e.bound.pattern))};case`SetMap`:return{...e,bounds:No(e.bounds,n),expression:t(e.expression,Aa(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},zo=`LAMBDA`,Bo=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return Ro(e,(e,n)=>(r.push(...Bo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Vo=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}},Ho=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Uo=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Wo=(e,t)=>e.map(e=>({pattern:Uo(e.pattern,t),set:e.set})),Go=(e,t)=>e.kind===`Function`?{...e,bounds:Wo(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Ko=(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=>Io({...Go(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Wo(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Uo(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Uo(e.bound.pattern,n),set:e.bound.set}};default:return e}},qo=e=>`${e}@ENABLED`,Jo=(e,t)=>e.modes.get(t)??e,Yo=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!E(e)&&t.instantiation.variables.has(e.name),Xo=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Xo(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Yo(e,t,n))return[e.name];let r=E(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Xo(r.body,t,/* @__PURE__ */ new Map):void 0},Zo=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Yo(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:qo(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ns(e.expression,Jo(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ns(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ns(e.subscript,Jo(t,`Primed`),n),location:r},ns(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Xo(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:qo(r),location:e.location},location:e.location},ns({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Qo=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:da}),$o=(e,t)=>e.map(e=>Qo(e.name,t)),es=(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:[...$o(t,r),...i.map(e=>Qo(e,r))],location:r},location:r}},ts=(e,t)=>e.instantiation.isParameterized(t)?is(e,t):void 0,ns=(t,n,r)=>{let i=e=>ns(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!E(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:ns(t.expression,Jo(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:ns(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},Jo(n,`Enabled`),r)};let c=Zo(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name);if(e)return Ao.add(e),e;let r=ts(n,t.name);if(r===void 0)return t;if(o.length===0)return{...t,name:r};let i=a.getDefinition(t.name);return i&&va(i)>0?es(r,o,va(i),t.location):{kind:`Apply`,operator:r,args:$o(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||jo.has(t),l=e=>(c&&jo.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:zo,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:zo,args:r,resolution:da},location:t.location};if(s)throw new e.O(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=ts(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...$o(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=ts(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?es(e,o,va(r),t.location):{...t,operator:e}}let l=Vo(n),u=Ro(t,(e,t)=>t.length===0?i(e):ns(e,n,Ho(r,t,l)));return Ko(u,r,l)},rs=(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:Qo(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},is=(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=Vo(e),o=Go(Lo(i,(t,n)=>ns(t,e,Ho(/* @__PURE__ */ new Map,n,a))),a);return rs(o,r.params,i.location)}):t},as=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Bo(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>ts(i,e)??e,getQualifiedKey:t=>{let n=ts(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>rs(r,e.params,r.location)):t}}},os=e=>e.kind===`Let`&&e.instances!==void 0||ke(e).some(os),ss=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Ro(e,e=>ss(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>_a(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}},cs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ls=(e,t)=>e.definitions.some(e=>os(e.body))||e.assumptions.some(e=>os(e.expression))||e.theorems.some(e=>{let t=cs(e);return t!==void 0&&os(t)})?{...e,definitions:e.definitions.map(e=>Lo(e,e=>ss(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:ss(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=cs(e);return n===void 0?e:{...e,statement:ss(n,t,[])}})}:e,us=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),ds={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]}},fs=(e,t)=>{let n=ds[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},ps=(e,t)=>`${e}${t}`,ms=(e,t,n)=>`${e}${t}${n}`,hs=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},gs=(e,t,n)=>`${e},${t},${n}`,_s=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),vs=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),ys=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),bs=(e,t,n,r)=>({..._s(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),xs=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ss=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Cs=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...bs(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),ws=bs(`$Set`,0,[2],[1]),Ts=bs(`$Junction`,0,[3],[1]),Es=bs(`$Choose`,0,[2],[1]),Ds=bs(`$Function`,0,[3],[1]),Os=bs(`$FcnApply`,0,[2,2],[1,1]),ks=bs(`$RcdSelect`,0,[2,0],[1,1]),As=bs(`'`,2,[1],[0]),js=bs(`ENABLED`,1,[2],[0]),Ms=bs(`[]`,3,[3],[0]),Ns=bs(`$SquareAct`,2,[2,1],[0,0]),Ps=bs(`$WF`,3,[1,2],[0,0]),Fs=bs(`$TemporalExists`,3,[3],[0]),Is=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Ls=e=>e.map(e=>({name:e,arity:0})),Rs=(t,n)=>n.location.range?e.L(`${t}.`,n.location.range):new e.O(`${t} at line ${n.location.line}, column ${n.location.column}`),zs=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Bs=e=>e.kind!==`Let`&&e.kind!==`Label`,Vs=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:h(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=h(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Cs.get(e)??us.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=_s(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(ms(e,n,t))}),t.data.constraints.forEach((e,t)=>vs(r.constraints,t,e)),ys(r.argConstraints,ps(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>ys(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>xs(t,r))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(gs(e,n,r)),c=_s(Math.max(t.level,...n.filter((e,n)=>Ss(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)=>{Ss(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)=>vs(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||vs(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>vs(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||vs(c.constraints,e,xs(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>vs(c.constraints,e,xs(r,a)))}))}),t.argParams.forEach(e=>{let t=hs(e),n=o(t.operator)?.operator;n&&vs(c.constraints,t.param,xs(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>ys(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>ys(c.argConstraints,ps(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&ys(c.argConstraints,ps(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=hs(e),n=o(t.operator);n&&ys(c.argConstraints,ps(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(hs(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=hs(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(ms(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(ms(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(ms(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=ne(`LAMBDA`,Ls(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=_s();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Is(n,Ls(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Rs(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Rs(`Action used where only temporal formula or state predicate allowed`,e);zs.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Bs(n)&&n.kind!==r)throw Rs(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=h(e,n);t.constraints.forEach((e,t)=>vs(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>ys(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return ee(t,n)}catch(n){throw!(n instanceof e.O)||n.sany?n:Rs(n.message,t)}},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return _s();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Ts,n)}case`Prime`:case`Unchanged`:return c(As,[e.expression],t);case`Enabled`:return c(js,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Ms,[n])}case`If`:return c(Ts,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Ts,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(Ts,[e.body],t,e.bounds.map(e=>e.set),Aa(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Rs(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Fs:Ts,[e.body],t,[],e.names);case`Choose`:return c(Es,[e.body],t,e.set?[e.set]:[],ka(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(ws,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(ws,[e.predicate],t,[e.bound.set],ka(e.bound.pattern));case`SetMap`:return c(ws,[e.expression],t,e.bounds.map(e=>e.set),Aa(e.bounds));case`FunctionConstruction`:return c(Ds,[e.body],t,e.bounds.map(e=>e.set),Aa(e.bounds));case`Record`:return c(Ds,e.fields.map(e=>e.value),t);case`RecordSet`:return c(ws,e.fields.map(e=>e.value),t);case`Except`:return c(ws,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Os,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(ws,e.args,t)}]);case`Bracket`:return _s();case`FieldAccess`:return a(ks,[o(e.record,t),{data:_s()}]);case`BoxAction`:case`AngleAction`:return c(Ns,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Ps,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return _s()}},te=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>te(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return ke(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Is(t,Ls(e.names))),i;default:return Ro(e,(e,r)=>(a(e,n,Is(t,Ls(r))),e)),i}},ne=(e,t,n,r)=>{let i=Is(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=te(n,i),c={..._s(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(ps(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(ms(e.name,n,t.name))).map(e=>gs(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(hs(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=hs(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},h=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{..._s(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=ne(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:h,toOperand:o}},Hs=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Hs(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=_s(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>vs(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>ys(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Us=(t,n,r,i)=>{let a=Vs(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`?Hs(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.z(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.z(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Oo([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?Hs(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.I(r)}})),...r],i);if(u.length>0)throw e.I(u,!1,void 0,i)},Ws=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Gs=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Ks=/* @__PURE__ */ new Set([...Ws,...Gs,`Enabled`]),qs=/* @__PURE__ */ new Set([`~>`,`-+->`]),Js=/* @__PURE__ */ new Set([...qs,`\\cdot`]),Ys=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Xs=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Zs=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Qs=(e,t)=>Ys.has(e)||t.builtins.get(e)?.isStateLevel===!0,$s=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Ws.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Gs.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&qs.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Ks.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Js.has(e.operator))&&(r[0]|=1),Ks.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Zs(e);if(u!==void 0&&!E(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel)&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{Qs(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Xs.has(u)&&(r[0]|=8),!a&&Qs(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=32)}}ke(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},ec=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],tc=(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},nc=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),rc=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=$s(ec(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=tc(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=tc(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!nc(t[e],l[e*r])))),p=tc(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},ic=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?ac(ec(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},ac=(e,t)=>{let n=t.facts.words,r=$s(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=ic(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}nc(e.callee,r[0])||(i[0]|=r[0]&14)}),i},oc=(e,t)=>!(ic(e,t)[0]&1),sc={any:2,repeated:4,streamed:8},cc=(e,t,n=`any`)=>(ic(e,t)[0]&sc[n])!==0,lc=(e,t)=>{let n=ic(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},uc=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},dc=(e,t)=>{let n=ac([e],t);return n[0]&16?void 0:uc(n)},fc=(e,t)=>!!(ac([e],t)[0]&1),pc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=$n.sets,a=i??[],o=a.length;$n.sets=a;try{return n()}catch(e){throw cd(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,$n.sets=i}},mc=(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},hc=e=>!e.includes(void 0),gc=e=>e.variables.map(()=>void 0),_c=(e,t,n)=>{let r=[...e];return r[t]=n,r},vc=(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}},yc=e=>e.kind===`Identifier`?e.name:void 0,bc=(e,t,n)=>{if(t.kind===`Label`)return bc(e,t.body,n);let r=yc(t);if(r===void 0)return;let i=ru(n,r);if(i?.kind===`Thunk`)return bc(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Bu(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?bc(e,o.body,o.scope):void 0},xc=(e,t,n)=>{if(t.kind===`Prime`)return bc(e,t.expression,n);if(t.kind===`Label`)return xc(e,t.body,n);let r=yc(t);if(r===void 0)return;let i=ru(n,r);if(i?.kind===`Thunk`)return xc(e,i.expression,i.scope);if(i)return;let a=Bu(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?xc(e,a.body,a.scope):void 0},Sc=t=>{if(typeof t!=`boolean`)throw new e._(`TLC expected a boolean expression.`);return t},Cc=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),wc=(e,t,n)=>{t===void 0?hc(n)&&e.onState(n):hc(n)&&Cc(e)?Ec(e,t,n):t.kind===`Predicate`?Dc(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Ic(e,t.expression,t.rest,t.scope,n):Tc(e,t,n)&&wc(e,t.rest,n)},Tc=(e,t,n)=>{let r=e.environment,i=H(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return H(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?tu(t,r.runtime.version):t}})();return!kt(i,a)},Ec=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Ic(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Tc(e,r,n):!Sc(H(r.expression,mc(e,r.scope,n))))return}e.onState(n)},Dc=(t,n,r,i,a)=>pc(t,n,()=>{switch(n.kind){case`Let`:Dc(t,n.body,r,td(n.definitions,mc(t,i,a)),a);return;case`Label`:Dc(t,n.body,r,i,a);return;default:if(Pc.has(n.kind))throw new e._(`The state relation is not a boolean expression.`);pc(t,n,()=>Fc(t,n,r,i,a))}}),Oc=(e,t,n,r)=>{Sc(t)&&wc(e,n,r)},kc=(e,t,n,r,i)=>{let a=mc(e,r,i);if(t.kind===`Identifier`){let o=ru(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Dc(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Dc(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Bu(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&oc(s,e.environment))){Dc(e,c.body,n,c.scope,i);return}Oc(e,H(t,a),n,i);return}let o=Vu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Dc(e,o.body,n,$u(o,t.args,a),i):Oc(e,H(t,a),n,i)},Ac=(e,t,n,r,i)=>{let a=n[r];a===void 0?wc(e,t,_c(n,r,i)):kt(a,i)&&wc(e,t,n)},jc=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Mc=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?bc(t,o,i):xc(t,o,i),l=mc(t,i,a);if(c===void 0){H(n,l)===!0&&wc(t,r,a);return}let u=H(s,l),d=a[c];if(n.operator===`=`){Ac(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)H(n,l)===!0&&wc(t,r,a);else{if(!kn(f))throw new e._(`The right side of \\IN is not enumerable.`);for(let e of Bn(f))wc(t,r,_c(a,c,e))}},Nc=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Pc=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Fc=(t,n,r,i,a)=>{let o=mc(t,i,a);switch(n.kind){case`Identifier`:kc(t,n,r,i,a);return;case`Apply`:if(Nc.has(n.operator)&&n.args.length===2){Mc(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(Sc(H(n.args[0],o))){Dc(t,n.args[1],r,i,a);return}wc(t,r,a);return}kc(t,n,r,i,a);return;case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>jc(`Predicate`,t,i,e),r);Dc(t,e[0],n,i,a);return}let o=e[e.length-1];Dc(t,vc(n,e.length-1),jc(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>Dc(t,e,r,i,a));return}Dc(t,vc(n,e.length-1),r,i,a),Dc(t,e[e.length-1],r,i,a);return}case`Exists`:xu(n.bounds,o,e=>(Dc(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(xu(n.bounds,o,t=>(e.push(t),!1)),e.length===0){wc(t,r,a);return}let i=e.slice(1).reduce((e,t)=>jc(`Predicate`,n.body,t,e),r);Dc(t,n.body,i,e[0],a);return}case`If`:Dc(t,Sc(H(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>Sc(H(e.condition,o)))?.body??n.other;if(s===void 0)throw new e._(`TLC encountered a CASE with no conditions true.`);Dc(t,s,r,i,a);return}case`FunctionApplication`:{let e=Eu(H(n.function,t.isInit?o:su(o)));if(e){Dc(t,e.body,r,Du(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){Ic(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){Dc(t,n.action,r,i,a),Ic(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){Dc(t,n.action,jc(`Changed`,n.subscript,i,r),i,a);return}}Oc(t,H(n,o),r,a)},Ic=(e,t,n,r,i)=>pc(e,t,()=>{let a=bc(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Ac(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){wc(e,n,i);return}let s=o.reduceRight((e,t)=>jc(`Unchanged`,t,r,e),n);Ic(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ru(r,t.name);if(a?.kind===`Thunk`){Ic(e,a.expression,n,a.scope,i);return}let o=a?void 0:Bu(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Ic(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});kt(s,c)&&wc(e,n,i)}),Lc=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},Rc=/* @__PURE__ */ Error(`The replay found a successor`),zc=(e,t,n,r)=>{let i=Lc(r,!1,n,()=>{throw Rc},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=jc(`Changed`,e.subscript,t,void 0);Dc(i,e.action,n,t,gc(r))}else Dc(i,e,void 0,t,gc(r));return!1}catch(e){if(e!==Rc)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Bc=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Lc(t,!0,void 0,n),o=i.reduceRight((e,t)=>jc(`Predicate`,t.expression,t.scope,e),void 0);Dc(a,r.expression,o,r.scope,gc(t))},Vc=(e,t,n,r)=>{e.some(e=>Pc.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Lc(n,!1,t,e=>i.push(e));Dc(a,e.expression,void 0,e.scope,gc(n)),i.forEach(t=>r(t,e))})},Hc=/* @__PURE__ */ new WeakMap,Uc=/* @__PURE__ */ new WeakMap,Wc=(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},Gc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Kc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,qc=(t,n)=>{let r=new e._(n);return t.isInit?r:e.K(r,e.W.error)},Jc=(e,t,n,r)=>{let i=Gl(n);return r&&Pc.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 ${Kc(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},Yc=(e,t,n)=>{let r=fi(t),i=B(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Kc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
138
+ `:``}${i}`},Xc=(e,t,n)=>Zc(e,t,H(t,n)),Zc=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw qc(e,Jc(e,n,t,r))},Qc=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=dd(n,r.environment))(r),$c=e=>e===`=`||e===`\\in`||e===`\\subseteq`,el=(e,t,n)=>{let r=n?Hc:Uc,i=r.get(e);if(i)return i;let a=jl(e,t,n);return r.set(e,a),a},tl=(e,t)=>{if(t.constants.has(e))return;let n=uu(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},nl=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return nl(e.expression,t,!1,r);if(e.kind!==`Identifier`||E(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=tl(e.name,t);if(a&&!r.has(a))return r.add(a),nl(a.body,t,n,r)},rl=(e,t,n)=>nl(e,t,!n),il=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return il(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=td(e.definitions,Wc(r,t,n));return il(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ru(t,e.name);if(a?.kind===`Thunk`)return il(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=tl(e.name,r.environment);if(s)return il(s.body,void 0,n,r,i)},al=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||E(e))||!t&&e.kind===`Prime`,ol=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ol(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=tl(e.name,t);if(i)return n.add(e.name),ol(i.body,t,n)},sl=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),cl=(e,t,n)=>sl.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||$c(e.operator)&&(al(e.args[0],n)||rl(e.args[0],t,n)!==void 0)||E(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ll=/* @__PURE__ */ new Set,ul=(e,t)=>{if(E(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Ro(e,(e,i)=>{let a=r.isReadOnly?ul(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},dl=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||E(e)?void 0:uu(r,t);return i&&!n.has(i)&&(n.add(i),dl(i.body,t,n))?!0:ke(e).some(e=>dl(e,t,n))},fl=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=rl(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=ol(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return cl(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:el(e,t,n)}},pl=(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(dc(e,t)===void 0||dl(e,t,/* @__PURE__ */ new Set))return!0;let n=ul(e,ll);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)}},ml=(e,t,n)=>{let r=e.map(e=>fl(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Cc(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Nl(u)){d??=Wc(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=Qc(a,e,n,d);if(!Zc(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Wc(t,n,u);let r=Qc(i,s,e.expression,d);if(!Zc(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Wc(t,n,u);let r=Qc(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Gc(u,e.index,r),d=void 0;else if(!kt(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let t of e.indices){let e=(r??u)[t];if(e===void 0)r??=u.slice(),r[t]=n[t];else if(!kt(e,n[t]))return}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},hl=e=>(t,n,r,i,a,o)=>{Xc(t,e,Wc(t,n,r))&&o(r,i)},gl=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Wc(r,i,a);if(a[l]!==void 0){Xc(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!kn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Kc(r)}, the right side of \\IN is not enumerable.`;throw qc(r,`${t}\n${B(e)}`)}let p=Bn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Gc(a,l,p[e]),o)}},_l=/* @__PURE__ */ new WeakMap,vl=e=>{let t=_l.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(vl),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return _l.set(e,n),n},yl=(e,t)=>{let n=e.args[0],r=hl(e),i=(e,r,i)=>il(n,r,i,e,!t)??-1,a=gl(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=H(e.args[1],Wc(t,n,o));l(Gc(o,u,d),s)}},bl=(e,t,n)=>{let r=B(e);return(i,a,o,s,c,l)=>{let u=Wc(i,a,o),d=H(e.function,n?u:su(u)),f=Eu(d);if(f!==void 0){el(f.body,t,n)(i,Du(f,e,u),o,s,c,l);return}if(!k(d))throw qc(i,`In computing ${Kc(i)}, a non-function (${fi(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw qc(i,`In computing ${Kc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},xl=(e,t)=>{if(ol(e,t))return ml([vl(e)],t,!1);if(e.kind===`Tuple`)return el(vl(e),t,!1);let n=vl(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ru(i,e.name):void 0;l?.kind===`Thunk`?el(vl(l.expression),t,!1)(r,l.scope,a,o,s,c):Xc(r,n,Wc(r,i,a))&&c(a,o)}},Sl=(e,t,n)=>{let r=e.operator,i=hl(e),a=E(e)?void 0:Bu(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=gd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=el(a.body,t,n),o.body(e,i(Wc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Wc(a,o,s),f=Vu(e,d);f?.kind===`Closure`?el(f.body,t,n)(a,$u(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Cl=(e,t,n)=>{let r=hl(e),i=E(e)?void 0:tl(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ru(s,e.name);f?.kind===`Thunk`?el(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=el(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},wl=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||E(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!E(i))return;let a=nl(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Tl=e=>e.kind===`And`?e.operands.flatMap(Tl):[e],El=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&cl(e,t,!1),Dl=e=>{let t=[];return(n,r,i)=>{let a=Wc(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Zc(n,i,Qc(t,r,i,a)))return}}},Ol=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Tl(e),r=n.findIndex(e=>!El(e,t)||wl(e,t)),i=r===-1?void 0:wl(n[r],t);return i?{...i,before:r===0?void 0:Dl(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Ol(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||E(e))return;let r=Bu(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Ol(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!E(o))return;let s=i.before,c=s&&gd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Wc(e,t,n)),n))}},kl=(e,t,n)=>{let r=ru(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},Al=(e,t,n)=>{let r=e.map(e=>el(e,t,n)),i=n?[]:e.map(e=>Ol(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&&kl(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)}}},jl=(t,n,r)=>{let i=e=>el(e,n,r);switch(t.kind){case`And`:return ml(t.operands,n,r);case`Or`:return Al(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=mu(H(a.set,Wc(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,iu(i,t,u[n]),o,s,c,l)}}let o=r?void 0:pl(t,n);if(o){let e=ml(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=Wc(r,i,a),d=t.bounds.map(e=>mu(H(e.set,u),e.set,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=iu(n,o.names[t],e);if(t===d.length-1){let e=Wc(r,i,a);if(!o.guards.every(t=>Xc(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{xu(t.bounds,Wc(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&dc(t,n)!==void 0&&!dl(t.body,n,/* @__PURE__ */ new Set)?ul(t,ll):void 0;return(n,r,i,o,s,c)=>{let l=[];xu(t.bounds,Wc(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ru(r,e)?.kind===`Value`)){u.every(e=>Xc(n,t.body,Wc(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Nl(i)?u.slice(r).every(e=>Xc(n,t.body,Wc(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=H(t.condition,Wc(r,i,a));if(typeof l!=`boolean`)throw qc(r,Yc(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=Wc(r,i,a),u=e.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw qc(r,`In computing ${Kc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${fi(t)}) was used as a guard condition of a CASE.\n${Gl(e.source)}`)})?.body??n;if(!u)throw qc(r,`In computing ${Kc(r)}, TLC encountered a CASE with no conditions true.\n${B(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=rd(t.definitions,n);return(n,i,a,o,s,c)=>e(n,td(t.definitions,Wc(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e._(`UNCHANGED appears in an initial predicate at ${Ul(t)}`)}:xl(t.expression,n);case`AngleAction`:{let e=i(t.action),r=vl(t.subscript),a=(e,t,i)=>{try{return Xc(e,r,Wc(e,t,i))}catch(t){throw e.isEnabled?tu(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return i({kind:`Or`,operands:[t.action,vl(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return Cl(t,n,r);case`FunctionApplication`:return bl(t,n,r);case`Apply`:{let e=t.args;if($c(t.operator)){let i=rl(e[0],n,r);if(i!==void 0)return t.operator===`=`?ml([t],n,r):gl(t,()=>i);if(al(e[0],r))return yl(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=H(e[0],Wc(n,r,i));(typeof c==`boolean`?c:lu(c,`the left side of => at ${Ul(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return Sl(t,n,r)}default:return hl(t)}},Ml=e=>e.variables.map(()=>void 0),Nl=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Pl=(t,n)=>{let r=n.state;if(!r||!Nl(r))throw new e._(`ENABLED needs a complete state at ${Ul(t)}`);let i=n.environment;if(i.callStack)return zc(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return el(t,i,!1)(a,n.scope,Ml(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Fl=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};el(t,n,!0)(a,i,Ml(n),void 0,!1,t=>{if(!a.isStopped){if(!Nl(t))throw e.K(new e.v([...t]),e.W.error);a.isStopped=r(t)}})},Il=(e,t,n)=>{let r=[];return Fl(e,t,e=>(r.push(e),!1),n),r},Ll=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return el(t,r,!1)(o,a,Ml(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!Nl(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.y(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}s.successors++,o.isStopped=i({state:t,action:n})}}),s.successors},Rl=(e,t,n,r)=>{let i=[];return Ll(e,t,n,e=>(i.push(e),!1),r),i},zl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Bl=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Vl=e=>Bl.has(e.kind)||e.kind===`Apply`&&zl.has(e.operator),Hl=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&Be(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Ul=e=>`line ${e.location.line}, column ${e.location.column}`,Wl=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,B=e=>{let t=e.location.range;return t?Wl(t):Ul(e)},Gl=e=>e.kind===`Number`?e.text??String(e.value):B(e),Kl=(t,n)=>new e._(`A non-boolean expression (${fi(n)}) was used as the condition of an IF.\n${B(t)}`),ql=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e._(`A non-boolean expression (${fi(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Gl(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e._(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${fi(r)}.\n${B({...t,location:{...t.location,range:{...i,end:a}}})}`)},Jl=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${I(e)}\n${B(t)}`,i=e=>`Attempted to apply function:\n${D(I(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!k(a))throw new e._(`Attempted to select field "${n}" from a non-record value ${D(I(a))}\n${B(t)}`);let o=xt(a);if(o===`tuple`)throw lr(n);return fr(a,n,o===`record`?r:i)}},Yl=e=>e===`1.7.4`?(t,n)=>or(t,n,e):void 0,Xl=t=>n=>{if(!k(n))throw new e._(`Attempted to apply the operator DOMAIN to a non-function\n(${fi(n)})\n${B(t)}`);return mr(n)},Zl=(t,n)=>(r,i)=>{if(!O(r)||lt(r))throw new e._(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${B(t)}`);return n.evaluate([r,i])},Ql=t=>e.K(new e._(`TLC can't handle real numbers: ${t.text} at ${Ul(t)}`),e.W.configParseError),$l=t=>e.K(new e._(`TLC can't handle a number this big: ${t.text??t.value} at ${Ul(t)}`),e.W.error),eu=(t,n)=>new e.k(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${B(n)}`,t),tu=(t,n)=>t instanceof e.k&&n!==`1.7.4`?new e._(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,nu=t=>new e._(`A primed expression appears outside an action at ${Ul(t)}`),ru=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},iu=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),au=(t,n,r)=>{if(n.kind===`Name`)return iu(t,n.name,r);let i=Zn(r);if(!i||i.length!==n.names.length)throw new e._(`Cannot bind <<${n.names.join(`, `)}>> to ${I(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>iu(e,t,i[n]),t)},ou=(t,n)=>{if(k(t))return t;throw new e._(`A non-function (${fi(t)}) was applied as a function.\n${B(n)}`)},su=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},cu=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),lu=(t,n)=>{if(typeof t!=`boolean`)throw new e._(`Expected ${n} to be a boolean but found ${I(t)}`);return t},uu=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),du=(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.`},fu=(t,n,r)=>{if(!O(t)||lt(t)){let i=I(t),a=r===`1.7.4`?void 0:du(t,i);throw new e._(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Gl(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Gl(n)}\n${a}`)}},pu=(e,t,n)=>(fu(e,t,n),typeof e==`object`&&e.kind===`Interval`?Cn(e):In(e)??N(e).elements),mu=(e,t,n)=>n===`1.7.4`?(fu(e,t,n),In(e)??Bn(e)):pu(e,t,n),hu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return qn(e),e},gu=(e,t,n)=>hu(e)??mu(e,t,n),_u=(e,t,n)=>hu(e)??pu(e,t,n),vu=(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},yu=(e,t)=>e.map(e=>gu(H(e.set,t),e.set,t.environment.runtime.version)),bu=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):vu(t[n],t=>i(n-1,au(a,e[n].pattern,t)));return i(e.length-1,n)},xu=(e,t,n)=>bu(e,yu(e,t),t.scope,n),Su=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Cu=(e,t,n)=>{if(e.length===1)return au(t,e[0].pattern,n);let r=Zn(n)??[];return e.reduce((e,t,n)=>au(e,t.pattern,r[n]),t)},wu=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Tu=e=>Object.assign(e.value,{lambda:e}),Eu=e=>wu(e)?e.lambda:void 0,Du=(t,n,r)=>{let i=t.value,a=n.args.map(e=>H(e,r)),o=a.length===1?a[0]:j(a),s=(e,t,r)=>`In applying the function\n${D(I(i))},\nthe ${e} is:\n${D(I(t))}${r}.\n${B(n.function)}`,c=t.bounds;if(c.length===1){if(!tr(o,i.domain))throw new e._(s(`first argument`,o,`which is not in its domain`));return Cu(c,t.scope,o)}let l=Zn(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e._(`Attempted to apply a function to an argument not in its domain.\n${B(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!tr(r,u[n]))throw new e._(s(i,r,`${t.pattern.kind===`Name`?``:`
139
+ `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&Zn(r)?.length!==t.pattern.names.length)throw new e._(s(i,r,`which does not match its formal parameter`))}),Cu(c,t.scope,j(l.slice(0,c.length)))},Ou=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Wl(n)}},ku=(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}},Au=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},ju=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Mu=(e,t)=>{let n=Su(e.bounds,t),r=Au(n,(n,r)=>H(e.body,cu(t,Cu(e.bounds,iu(void 0,e.name,r),n))),ku(Ou(e.bounds,e.body),e.bounds,n));return Tu({value:r,bounds:e.bounds,body:e.body,scope:iu(void 0,e.name,r)}),e.bounds.length===1?St(r):r},Nu=(t,n)=>{if(typeof n!=`object`||xt(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Be(n.domain))return n;try{let e=F(n);return vt(e.domain,e.range)}catch(t){if(t instanceof e._)return n;throw t}},Pu=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e._(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>Mu(t,e):dd(ju(t),n):dd(t.body,n),Fu=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Pu(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(cu(e,void 0)):e=>a[i]??r(cu(e,void 0));return t.definitionEvaluators.set(e,o),o},Iu=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Lu=(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)||!oc(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(()=>Nu(t,Pu(t,n)(a)));cn(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e._)&&!e.U(t))throw t}}),Ru=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=H(e.expression,cu(t,e.scope));return n&&(!e.isStreamed||Hn(r))&&(e.cache=r),r},zu=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Bu=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Bu(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?zu(r):t.builtins.get(e)},Vu=(e,t)=>E(e)?Hu(e.operator,t):Bu(e.operator,t.environment)??Hu(e.operator,t),Hu=(e,t)=>{let n=ru(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Bu(e,t.environment)},Uu=e=>e.kind===`Closure`?e.params.length:e.arity,Wu=(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:Hu(r,n);if(!i)throw new e._(`Expected an operator argument at ${Ul(t)}`);return i},Gu=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>iu(e,n.name,t[r]),e.scope);return H(e.body,cu(n,r))},Ku=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Uu(e),call:n=>Gu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},qu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Hu(e.name,t);return n!==void 0&&Uu(n)>0},Ju=(e,t)=>e.map(e=>qu(e,t)?Ku(Wu(e,t),t):H(e,t)),Yu=(t,n)=>new e._(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),Xu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Zu=(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 Zu(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([])}},Qu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ue(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=E(e)?void 0:Zu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ru(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Xu(e,t)}}return t=>Xu(e,t)},$u=(e,t,n,r)=>{if(t.length!==e.params.length)throw Yu(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:Wu(t[a],n)}:(r?.[a]??Qu(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},ed=(e,t,n,r)=>e.kind===`Closure`?H(e.body,cu(n,$u(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(md(t,n),n):e.evaluate(Ju(t,n),n),td=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),nd=(t,n,r)=>{let i=ru(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Ru(i,r);if(i?.kind===`Operator`){if(Uu(i.operator)===0)return Gu(i.operator,[],r);throw new e._(`Operator ${t} is used without arguments`)}let a=Zu(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw eu(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Fu(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e._(`Unknown identifier ${t} at ${Ul(n)}`)},rd=(e,t)=>({impure:new Set(e.filter(e=>cc(e,t))),streamed:new Set(e.filter(e=>cc(e,t,`streamed`)))}),id=e=>[...e.facts.ids.keys()].some(t=>cc(t,e)),ad=e=>[...e.facts.ids.keys()].some(t=>cc(t,e,`repeated`)),od=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,sd=(e,t,n,r)=>i=>{r.expressions.push(e);let a=$n.sets,o=$n.callStack,s=a??[],c=s.length;$n.sets=s,$n.callStack=r;try{let a=t(i),o=od(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Vl(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Hl(e,r.values),a=i&&!ke(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!k(a)?void 0:a;throw cd(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,$n.sets=a,$n.callStack=o}},cd=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e._){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},ld=(t,n,r)=>{if(!(r instanceof e._))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},ud=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=kd(e,t),i=t.callStack,a=i?sd(e,r,t,i):r;return t.evaluators.set(e,a),a},dd=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Ii(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>dd(e,t.environment)(t),fd=(e,t)=>{let n=e.name,r=E(e)?void 0:Zu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw eu(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n={reference:void 0};return r=>(n.reference??=Fu(e,t))(r)}return t=>nd(n,e,t)},pd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||E(e))return!0;let n=Bu(e.name,t);return n===void 0||Uu(n)===0},md=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),hd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(md(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&pd(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&pd(t[0],n)&&pd(t[1],n);if(i&&a){let e=V(t[0],n),r=V(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Ju(t,n),n)},gd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Yu(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Qu(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:Wu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},_d=(e,t,n)=>{let r=gd(e,t,n),i={body:void 0};return t=>(i.body??=dd(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},vd=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=V(r[0],n),t=V(r[1],n);return n=>!lu(e(n),`the left side of =>`)||lu(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e._(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=E(t)?void 0:Bu(t.operator,n);if(i?.kind===`Closure`)return _d(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=V(r[0],n),i=Xl(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=V(r[0],n);return jo.has(t)||fc(r[0],n)?e:t=>t.scope===void 0?i.evaluate([e(t)]):e(t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=V(r[0],n),a=V(r[1],n),o=Zl(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return hd(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e._(n.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let a=r.map(e=>Qu(e,n));return i=>{let o=Hu(t.operator,i);if(o)return ed(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e._(`${t.operator} is a function; apply it with brackets`):new e._(`Unknown operator ${t.operator} at ${Ul(t)}`)}},yd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=V(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=V(a.set,t);return s=>vu(gu(o(s),a.set,t.runtime.version),t=>lu(i(cu(s,iu(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>V(e.set,t));return s=>{let c=a.map((e,n)=>gu(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?lu(i(cu(s,a)),r)!==n:vu(c[t],n=>l(t-1,iu(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>xu(o,e,t=>lu(i(cu(e,t)),r)!==n)?!n:n},bd=(e,t)=>{if(e.kind===`Tuple`)return j(e.names.map(e=>{let n=ru(t,e);return n?.kind===`Value`&&n.value}));let n=ru(t,e.name);return n?.kind===`Value`?n.value:void 0},xd=/* @__PURE__ */ new WeakSet,Sd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&xd.add(e)},Cd=(t,n)=>{let r=xd.has(t),i=V(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=V(o.set,n),l=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=Tn(e),a=vt(r,r.map(e=>i(cu(t,iu(t.scope,n,e)))));return Be(e)?a:St(a)}let n=[],r=a.map(e=>_u(H(e.set,t),e.set,t.environment.runtime.version));return bu(a,r,t.scope,e=>{let r=a.length===1?bd(o.pattern,e)??!1:j(a.map(t=>bd(t.pattern,e)??!1));return n.push([r,i(cu(t,e))]),!1}),_n(n)},u=Ou(a,t.body),d=(e,n)=>{let r=n.scope,o=Tu({value:Au(e,e=>i(cu(n,Cu(a,r,e))),ku(u,a,e)),bounds:a,body:t.body,scope:r});return a.length===1?St(o):o},f=n.callStack;return n=>{let i=s?c(n):Su(a,n);if(t.isRecursive||r||n.isKeepLazy||!M(i))return d(i,n);if(!Be(i)){if(f)return d(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e._))throw t;return d(i,n)}}if(!f)return l(i,n);try{return l(i,n)}catch(e){throw ld(f,t,e),e}}},wd=(e,t)=>{let n=xd.has(e);n&&Sd(e.function);let r=V(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):j(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(cu(i,iu(i.scope,`@`,e))):hr(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(Li.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${B(e.function)}`)}return n}},Td=(t,n)=>{if(t.kind===`SetFilter`){let e=V(t.predicate,n),r=V(t.bound.set,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:Wl(a)},s=(e,t)=>n=>lu(e(cu(t,au(t.scope,i,n))),`a set filter predicate`),c=(e,n,r)=>({kind:`FilteredSet`,base:e,test:s(r,n),source:o,rebind:r=>c(e,{...n,environment:r},V(t.predicate,r))});return t=>{let n=r(t);return Be(n)?_t(N(n).elements.filter(s(e,t))):c(n,t,e)}}if(t.kind===`SetMap`){let e=V(t.expression,n);return n=>{let r=[];return xu(t.bounds,n,t=>(r.push(e(cu(n,t))),!1)),fn(r)}}let r=t.set;if(!r)return()=>{throw new e._(`TLC cannot evaluate an unbounded CHOOSE at ${Ul(t)}`)};let i=V(t.body,n),a=V(r,n);return n=>{let o=a(n);if(!O(o)||lt(o))throw new e._(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${B(t)}`);let s={value:void 0},c=_u(o,r,n.environment.runtime.version);if(vu(c,e=>{let r=au(n.scope,t.pattern,e);return lu(i(cu(n,r)),`the body of CHOOSE`)?(s.value=bd(t.pattern,r),!0):!1}),s.value===void 0)throw new e._(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${B(t)}`);return s.value}},Ed=e=>[...e].sort((e,t)=>mt(e.name,t.name)),Dd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Od=(e,t)=>{let n=Ed(e),r=Dd(n),i=n.map(e=>V(e.value,t));if(r)return e=>Dn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>qe(a,i.map(t=>t(e)),o):e=>On(a,i.map(t=>t(e)))},kd=(t,n)=>{let r=e=>V(e,n);switch(t.kind){case`Number`:{let e=t.value;return Ue(e)?()=>e:()=>{throw $l(t)}}case`Decimal`:return()=>{throw Ql(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return fd(t,n);case`Apply`:return vd(t,n);case`Bracket`:return()=>{throw new e._(`A bracket without a function or subscript is not an expression at ${Ul(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e._(`An operator cannot be used as a value at ${Ul(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw ql(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw ql(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw nu(t);return e({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let e=r({kind:`Prime`,expression:t.expression,location:t.location}),n=r(t.expression);return t=>kt(e(t),n(t))}case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw Kl(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e._(`A non-boolean expression (${fi(n)}) was used as a condition of a CASE. ${Gl(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e._(`Attempted to evaluate a CASE with no conditions true.\n${B(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(cu(n,td(t.definitions,n)))}case`Forall`:case`Exists`:return yd(t,n);case`UnboundedQuantifier`:return()=>{throw new e._(`TLC cannot evaluate an unbounded quantifier at ${Ul(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Td(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>fn(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>j(e.map(e=>e(t)))}case`FunctionConstruction`:return Cd(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 Od(t.fields,n);case`RecordSet`:{let e=Ed(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return wd(t,n);case`ExceptAt`:return n=>{let r=ru(n.scope,`@`);if(r?.kind!==`Value`)throw new e._(`@ appears outside an EXCEPT at ${Ul(t)}`);return r.value};case`FunctionApplication`:{Sd(t.function);let e=r(t.function),i=n=>ou(e(su(n)),t),a=t.args.map(r),o=Yl(n.runtime.version);if(a.length===1){let e=a[0];return t=>fr(i(t),e(t),o)}return e=>fr(i(e),j(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Jl(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let e=r(t.action),n=r({kind:`Unchanged`,expression:t.subscript,location:t.location}),i=t.kind===`BoxAction`;return t=>i?lu(e(t),`an action`)||n(t):lu(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>Pl(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e._(`The subexpression reference at ${Ul(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e._(`TLC cannot evaluate a temporal formula in a state at ${Ul(t)}`)}}},Ad=`tlc2/value/impl/`,jd={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Md={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},Nd=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},Pd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Fd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Id=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Pd.get(e[3])}${`[]`.repeat(e[1].length)}`),Ld=(e,t)=>e[e[t].first].text,Rd=(e,t)=>Ld(e,t).replaceAll(`/`,`.`),zd=t=>{let n=Nd(t);if(n.readUint32()!==3405691582)throw new e.O(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===jd.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===jd.integer?i.value=n.readInt32():t===jd.float?n.readUint32():t===jd.long||t===jd.double?(n.readBytes(8),e++):t===jd.class||t===jd.string||t===jd.methodType||t===jd.module||t===jd.package?i.first=n.readUint16():t===jd.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Rd(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=Id(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:Nd(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()},()=>Rd(r,d.readUint16())):[],p=Fd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Id(i.slice(a+1))[0],ee=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${ee}`})}return{pool:r,methods:s}},Bd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Ld(e,n.first),name:e[r.first].text}},Vd=(t,n,r,i)=>{let a=()=>new e.A(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===jd.integer)return t.value;if(t.tag===jd.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>=Md.iconstM1&&t<=Md.iconst5)s.push(t-Md.iconst0),e+=1;else if(t===Md.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===Md.sipush)s.push(r()<<16>>16),e+=3;else if(t===Md.ldc)s.push(l(o[e+1])),e+=2;else if(t===Md.ldcW)s.push(l(r())),e+=3;else if(t===Md.dup){let t=c();s.push(t,t),e+=1}else if(t===Md.getstatic){let t=Bd(n,r());if(t.className!==`${Ad}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===Md.invokestatic){let t=Bd(n,r()),o=c();if(t.className!==`${Ad}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===Md.new)s.push({className:Ld(n,r()),value:void 0}),e+=3;else if(t===Md.invokespecial){let t=Bd(n,r()),o=c(),s=c();if(!(t.className===`${Ad}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===Md.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()},Hd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=zd(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:Vd(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)}))}},Ud=/* @__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(`,`),Wd=[[`\\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`,`≀`],[`^+`,`⁺`]],Gd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Kd=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),qd=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Jd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Yd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
140
140
  Nat == { }
141
141
  a+b == {a, b}
142
142
  a-b == CHOOSE n : b + n = a
@@ -452,9 +452,9 @@ _CheckName(name) ==
452
452
  => (PrintT(counts) /\\ FALSE)
453
453
  _PrintCounts == PrintT(_Counts)
454
454
  =============================================================================
455
- `]]),Kd=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),qd=y(`EOF`),Jd=y(`IDENTIFIER`),Yd=y(`DEFBREAK`),Xd=(e,t)=>Array.from({length:y(t)-y(e)+1},(t,n)=>y(e)+n),Zd=new Set(Xd(`op_57`,`op_119`)),Qd=new Set(Xd(`op_1`,`op_119`)),$d=new Set(Xd(`op_57`,`op_70`)),ef=/* @__PURE__ */ new Set([...Xd(`ACTION`,`EXCEPT`),y(`EXTENDS`),...Xd(`IF`,`SF`),y(`STATE`),...Xd(`THEN`,`WITH`),y(`US`),...Xd(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),tf=new Map([...U(`postfix`,160,160,!0,`[`),...U(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...U(`prefix`,120,120,!1,`-.`),...U(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...U(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...U(`prefix`,40,40,!0,`\\lnot`),...U(`nfix`,100,130,!0,`\\times`),...U(`infix`,140,140,!1,`^`,`^^`),...U(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...U(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...U(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...U(`infix`,100,110,!0,`|`,`||`,`%%`),...U(`infix`,100,110,!1,`%`),...U(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...U(`infix`,90,140,!1,`\\wr`),...U(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...U(`infix`,90,130,!1,`!!`),...U(`infix`,90,90,!1,`...`,`..`),...U(`infix`,80,80,!0,`\\intersect`,`\\union`),...U(`infix`,80,80,!1,`\\`),...U(`infix`,70,70,!1,`<:`,`:>`),...U(`infix`,60,60,!0,`@@`),...U(`infix`,50,140,!0,`\\cdot`),...U(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...U(`infix`,30,30,!0,`\\land`,`\\lor`),...U(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...U(`infix`,10,10,!1,`=>`)]),nf=new Map([...tf,...Bd.flatMap(e=>e.slice(1).map(t=>[t,tf.get(e[0])]))]),rf=nf.get(`[`),af={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},of=e=>({type:`tokens`,kinds:new Set(e)}),sf=e=>typeof e==`string`?e.startsWith(`<`)?of([y(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(sf)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),cf=e=>(...t)=>({type:e,body:W(...t)}),K=cf(`zeroOrMore`),lf=cf(`oneOrMore`),q=cf(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),uf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),df=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=uf(e,n);return n},ff=(...e)=>{let t=e.map(y);return e=>t.includes(df(e,1).kind)},pf=(e,t=df(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},mf=e=>{let t=df(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},hf=e=>ff(`CASESEP`)(e)&&pf(e),gf=e=>{let t=df(e,1);ef.has(t.kind)&&(t.kind=Jd)},_f=(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}`,vf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),yf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},bf=e=>e.operatorStacks[e.operatorStacks.length-1],xf=(e,t)=>e.low>t.high,Sf=(e,t)=>e.high<t.low,Cf=e=>e.fix===`prefix`?e:nf.get(`${e.name}.`),wf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===rf?vf(`FcnAppl`,[n,...r.node.heirs]):vf(`PostfixExpr`,[n,r.node]),operator:void 0})},Tf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:vf(`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:vf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Ef=e=>{let t=bf(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 wf(t,n),Ef(e);if(i.operator!==void 0){let t=Cf(r.operator);return t!==void 0&&xf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${_f(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 ${_f(e,a.node.first,a.node.last)} and expression at location ${_f(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Sf(a.operator,r.operator)?void 0:xf(a.operator,r.operator)?(Tf(t,a.operator),Ef(e)):`Precedence conflict between ops ${a.operator.name} in block ${_f(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Cf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Sf(s,r.operator))return;if(!xf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${_f(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Tf(t,s),Ef(e);let c=_f(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===af?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Df=e=>J(t=>{let n=bf(t),r=yf(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:Ef(t)}),Of=Df(()=>!1),kf=Df(()=>!0),Af=J(e=>{e.lastOperator=nf.get(e.token.image)}),jf=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},Mf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?jf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Nf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!pf(e,n.first.beginColumn))return n;let t=Nf(e,n);if(t!==void 0)return t}},Pf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(y),n=(e,...t)=>t.some(t=>e.kind===y(t)),r=e=>e!==void 0&&Zd.has(e.kind),i=e.token,a=uf(e,i);i.next=void 0;let o=uf(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===Jd&&(e=e.next)}else if(e.kind===Jd){let t=e.next;!r(t)||$d.has(t.kind)||Qd.has(t.kind)&&t.next?.kind!==Jd||(e=t.next?.kind===y(`SUBSTITUTE`)?i:Qd.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Yd&&(e.next={kind:Yd,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=uf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Ff=e=>{let t=df(e,1);if(t.kind===y(`LAB`)){let n=1;for(;n!==0;)if(t=uf(e,t),t.kind===y(`LAB`)&&n++,t.kind===y(`RAB`)&&n--,t.kind===qd)return!1;return uf(e,t).kind===y(`IN`)}if(t.kind!==Jd)return!1;for(t=uf(e,t);t.kind===y(`COMMA`);){if(t=uf(e,t),t.kind!==Jd)return!1;t=uf(e,t)}return t.kind===y(`IN`)},If=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Lf=e=>e.proofLevels.at(-1)??-1,Rf=e=>{let t=df(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:ff(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Lf(e)>=0&&If(t)>Lf(e):ff(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},zf=(e,t)=>{let n=If(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},Bf=e=>J(t=>zf(t,t.token)?void 0:`${_f(t,t.token)}: ${e}`),Vf=of([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(y)),Hf=of([...Vf.kinds,y(`op_76`)]),Uf=of(Qd),Wf=of($d),Gf=of([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(y)),Kf=()=>K(X({expansion:[G(Vf,`<op_77>`)],semantic:pf}),G(`PrefixOp`,`InfixOp`),kf),qf=()=>G(W(X({expansion:[`OpenStart`],semantic:pf}),`OpenExpression`,Of),W(X({semantic:pf}),`ExtendableExpr`)),Jf=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),Yf=()=>G(W(X({semantic:e=>ff(`ASSUME`,`BOXASSUME`)(e)||df(e,2).kind===y(`COLONCOLON`)&&[y(`ASSUME`),y(`BOXASSUME`)].includes(df(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Xf=()=>[`JuncItem`,K(X({semantic:mf}),`JuncItem`)],Zf=e=>J(t=>{t.expecting=e,gf(t)}),Qf=e=>J(t=>{t.isTerminalProof=e}),$f=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Pf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),ep={CompilationUnit:Z(void 0,[J(Pf),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),Zf(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,Zf(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Zf(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(Pf)),W(X({semantic:e=>ff(`USE`)(e)&&df(e,2).kind!==y(`ONLY`)||ff(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G($f(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),$f(`Expression`,X({expansion:[`<IDENTIFIER>`,Wf]}),`PostfixLHS`,`Expression`),$f(`Expression`,X({expansion:[`<IDENTIFIER>`,Uf]}),`InfixLHS`,`Expression`),$f(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),$f(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[Hf,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,Uf,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,Wf]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,Zf(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[Vf,Af]),NonExpPrefixOp:Z(void 0,[Hf,Af]),InfixOp:Z(`Infix Op`,[Uf,Af]),PostfixOp:Z(void 0,[Wf,Af]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Pf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),Yf(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),Yf(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=yf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${_f(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(Pf),G(W(X({amount:3}),X({semantic:ff(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Rf}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>ff(`BY`)(e)||df(e,2).kind===y(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>df(e,2).kind!==y(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,Qf(!0),q(`<ONLY>`)),W(`<USE>`,Qf(!1),q(`<ONLY>`)),W(`<HIDE>`,Qf(!1))),Y("an expression, `MODULE' or `DEF'"),q(Jf(),K(`<COMMA>`,Y(`MODULE or expression`),Jf(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),Jf(),K(`<COMMA>`,Y(`MODULE or expression`),Jf(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),Gf,Bf(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Rf}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),Gf,Bf(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:ff(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:ff(`INSTANCE`)}),`Instantiation`),W(X({semantic:ff(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Rf}),J(e=>{let t=yf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${_f(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),lf(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:ff(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(Hf,Uf,Wf),of([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(y))],semantic:pf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${_f(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:pf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:Ff}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),lf(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=yf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,K(`<COMMA>`,`QuantBound`)),lf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Ff}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>df(e,2).kind===y(`MAPTO`)&&ef.has(df(e,1).kind)}),J(e=>{df(e,1).kind=Jd}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=vf(`FcnAppl`,t.heirs),e.lastOperator=rf})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,lf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(gf),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===y(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>hf(e)&&df(e,2).kind!==y(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:hf}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[lf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=df(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...Xf()),W(X({expansion:[`<AND>`]}),...Xf())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Nf(t,e.heirs[1]);return n&&`Item at ${_f(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${_f(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),Kf(),qf()],(e,t)=>{let n=bf(t);n.push({node:e.heirs[0],operator:af});let r=Ef(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Of,K(G(W(X({expansion:[`PostfixOp`],semantic:pf}),`PostfixOp`,kf),W(X({expansion:[`<DOT>`],semantic:pf}),`<DOT>`,J(gf),X({semantic:pf}),`Identifier`,J(e=>{let t=bf(e);t[t.length-1].operator!==void 0&&wf(t,t.length),t[t.length-1]={node:vf(`RecordComponent`,[t[t.length-1].node,yf(e,2),yf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:pf}),Y(`function argument`),`SBracketCases`,Df(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:pf}),`InfixOp`,kf,Kf(),qf()),W(X({expansion:[`<COLONCOLON>`],semantic:pf}),`<COLONCOLON>`,J(e=>{let t=bf(e);if(!Mf(t[t.length-1].node))return`\`::' at ${_f(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=bf(e),n=yf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Sf(r,e.lastOperator)){let t=yf(e,3);return`Removing label at ${_f(e,t.first,t.last)} would change expression parsing.`}t.push({node:vf(`Label`,[yf(e,3),yf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:pf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:pf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>Lf(e)<0&&e.proofLevels.length<=1?`${_f(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${_f(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:jf(e.heirs)===void 0?e.heirs.length===1?vf(`GeneralId`,e.heirs):void 0:vf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>df(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>df(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${_f(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},tp=/* @__PURE__ */ new Map,np=e=>{let t=tp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=np(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,np(ep[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 tp.set(e,n),n},rp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},ip=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=uf(e,e.scanPosition)),e.scanPosition=uf(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`},ap=(e,t)=>{if(t.type===`tokens`)return ip(e,t.kinds);if(t.type===`call`)return ap(e,ep[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||rp(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=ap(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||rp(e,t.semantic)?ap(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=ap(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=ap(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},op=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=ap(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},sp=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||np(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!np(a).hasSemanticStart?np(a).first.has(df(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):op(e,i,a)&&(o===void 0||o(e))}),cp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,ap(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=uf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===qd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=uf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${De(e.token.image)}" `},lp=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??cp(e)}\n\nResidual stack trace follows:\n${r}`,!1},up=(e,t)=>{let n=uf(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,lp(e))},dp=(e,t)=>{let n=ep[t];n.message!==void 0&&(e.messages.push({name:n.message,token:df(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!fp(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 lp(e,i);let a=r.node??(r.heirs.length===0?void 0:vf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},fp=(e,t)=>{if(t.type===`tokens`)return up(e,t.kinds);if(t.type===`call`)return dp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||lp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||lp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||fp(e,t));if(t.type===`choice`){let n=sp(e,t.alternatives);return n===-1?lp(e):fp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!fp(e,t.body))return!1;if(t.type===`optional`)return sp(e,[t.body])===-1||fp(e,t.body);for(;sp(e,[t.body])===0;)if(!fp(e,t.body))return!1;return!0},pp=e=>{let t=Te(e),n={kind:qd,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=fp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},mp={low:15,high:15},hp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),gp=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),_p=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),vp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),yp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),bp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),xp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Sp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,..._p]),Cp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),wp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Tp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ep=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Dp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Op=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),kp=/* @__PURE__ */ new Set([``,`*`,`-`]),Ap=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),jp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Mp=/* @__PURE__ */ new Set([`NEW`,...jp.keys()]),Np=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Pp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Fp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Ip=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?gp.has(e.operator):_p.has(e.operator)),Lp=e=>gp.has(e)||_p.has(e)||e===`-.`,Rp=(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}}},zp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
456
- `)}\n`},Bp=(t,n,r=oe(t))=>{let i=n===`tlapm`,a=i?r:r.map(ne),o={index:0,offsideColumns:[]},c={},l=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>l[l.length-1].has(e),m=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),h=[],ee=[],te=[],g=(e,t=o.index-1)=>{let n=e===t?te[e]:void 0;if(n)return n;let r=a[t];h[e]??=m(a[e]),ee[t]??={line:r.line,column:r.endColumn};let i={module:f[0].name,start:h[e],end:ee[t]};return e===t&&(te[e]=i),i},_=(e,t)=>(e.location.range=g(t),e),re=(e=0)=>a[Math.min(o.index+e,a.length-1)],v=(e=0)=>{let t=re(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ie=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ae={index:0},se=e=>{let t=a.slice(ae.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ce=e=>i&&(e.kind===`Keyword`||Fp.has(e.text)),le=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},y=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Op.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ce(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,ue=(t,n=re(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.O(`${t} at line ${n.line}, column ${n.column}`,void 0,de(t,n,o,r))},de=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...se(le(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${y(r)}`,...le(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},fe=(e,t=re())=>ue(e,t,t),pe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ce(e),b=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=v();if(e.kind===`End`)throw ue(`Unexpected end of expression`);return o.index++,e},S=e=>b(e)?(o.index++,!0):!1,C=e=>{if(!b(e))throw fe(`Expected ${JSON.stringify(e)} but found ${ie(v())}`);return x()},me=()=>{let e=v();if(e.kind!==`Identifier`)throw fe(`Expected an identifier but found ${ie(e)}`);if(ce(e))throw fe(`Unexpected keyword ${e.text}`);return o.index++,e.text},he=()=>{let e=o.index;return{name:me(),range:g(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=v();return e.kind!==`String`&&(yp.has(e.text)||gp.has(e.text)||_p.has(e.text)||e.text===`'`)?(o.index++,e.text):me()},ve={isUsed:!1},ye=()=>v().kind===`Identifier`||!pe(v())?me():(ve.isUsed=!0,x().text),be=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},w=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},xe=()=>{if(b(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},Se=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},Ce=()=>{if(!S(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(w(he));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},we=()=>w(()=>{let e=w(Ce);C(`\\in`);let t=k();return e.map(e=>({pattern:e,set:t}))}).flat(),Te=()=>{let e=v();if(e.kind===`Identifier`){let t=o.index,n=[x().text];for(;b(`!`)&&v(1).kind===`Identifier`;)x(),n.push(me());return _({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(b(`<<`)||b(`(`))return Re();throw fe(`Expected a subscript but found ${ie(e)}`)},Ee=e=>{let t=v(1),n=v(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&b(`==`,_p.has(n.text)?3:4))},De=e=>{let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&wp.has(t.text)||Ee(e)},Oe=()=>{let e=v(),t=e.kind===`Operator`&&(gp.has(e.text)||vp.has(e.text))&&De(e);if(i&&e.kind!==`String`&&(vp.has(e.text)||Sp.has(e.text)&&e.text!==`'`&&!_p.has(e.text)||xp.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&De(e))throw ue(`incomplete expression`,e);if(t)return o.index++,_({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&Sp.has(e.text)&&De(e)){o.index++;let t=m(e);if(_p.has(e.text))return _({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return _({kind:`Lambda`,params:[n.name],body:Rp(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(b(`LAMBDA`)){let t=o.index;x();let n=ge(w(he));C(`:`);let r=k();return _({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return k()},ke={range:void 0},T=()=>be(()=>{let e=o.index;C(`(`);let t=w(Oe);return C(`)`),ke.range=g(e),t}),E=()=>{let e=x();o.offsideColumns.push(e.column);let t=[k()];for(;re().text===e.text&&re().column===e.column;)o.index++,t.push(k());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},Ae=e=>be(()=>{let t=m(e),n=v().kind===`Identifier`,r=b(`|->`,1)&&(n||pe(v()));if(r||n&&b(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=m(v()),i=e();return n.range=g(t),C(r?`|->`:`:`),{name:i,value:k(),location:n}},a=[i(()=>n?me():x().text),...S(`,`)?w(()=>i(me)):[]];return C(`]`),{kind:e,fields:a,location:t}}if(xe()){let e=we();C(`|->`);let n=k();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=k();if(S(`->`)){let e=k();return C(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(S(`EXCEPT`)){let e=w(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!pe(v()))throw fe(`Expected a field name but found ${ie(v())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:w(()=>k())}),C(`]`);return C(`=`),{path:e,value:k()}});return C(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!b(`]_`)){let e=[a];for(;S(`,`);)e.push(k());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:a,subscript:Te(),location:t}}),je=()=>{let e=o.index,t=_(O(),e),n=m(x());return _({kind:`Apply`,operator:`\\in`,args:[t,k()],location:n},e)},Me=e=>be(()=>{let t=m(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(xe()&&(v(1).text===`\\in`||b(`<<`))){let e=o.index,n=Ce();C(`\\in`);let r=k();if(S(`:`)){let e=k();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=v().kind===`Identifier`&&b(`\\in`,1)?je():k();if(S(`:`)){let e=we();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(k());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ne=e=>{let t=m(e),n=be(()=>b(`>>`)||b(`>>_`)?[]:w(()=>k()));if(S(`>>_`)){if(n.length!==1)throw ue(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Te(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Pe=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&xe()){let e=we();return C(`:`),{kind:n,bounds:e,body:k(),location:t}}let i=ge(w(he));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:k(),isTemporal:r,location:t}},Fe=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:k(),location:m(e)};let n=k();C(`->`),t.push({condition:n,body:k()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Ie=()=>{let e=v(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Cp.has(e.text)||e.kind===`Operator`&&(gp.has(e.text)||_p.has(e.text)||vp.has(e.text)))},Le=()=>{let e=x();if(e.kind===`Number`)return{kind:`Operand`,operand:s(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:T()}}return{kind:`Name`,name:e.text,args:b(`(`)?T():[]}},Re=e=>{let t=o.index,n=x(),r=m(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=w(me);return C(`:`),{kind:`Lambda`,params:e,body:k(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw ue(`incomplete expression`,n);return{kind:`Number`,value:s(n.text),text:n.text,location:r}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:r};if(n.kind===`String`)return{kind:`String`,value:n.text,location:r};let a=n.kind===`Step`&&$e(n);if(a&&Xe()<0&&Ye.length<=1)throw ue(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw ue(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let s=a?et(n)??n.text:n.text;if(Se()){let t=ge(S(`(`)?w(he):[]);t.names.length>0&&C(`)`),C(`::`);let a=k();if(!i&&e!==void 0&&c.last!==void 0&&Ip(a)&&e.high>=c.last.low)throw ue(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=b(`(`);if(s===`@`&&!l&&!Ie())return{kind:`ExceptAt`,location:r};let u=l?T():[],d=[l?ke.range:void 0];if(!Ie())return l?{kind:`Apply`,operator:s,args:u,argumentsRange:ke.range,location:r}:{kind:`Identifier`,name:s,location:r};let f=[{kind:`Name`,name:s,args:u}],p=[g(t,t)];for(;Ie();)x(),p.push(g(o.index,o.index)),ke.range=void 0,f.push(Le()),d.push(ke.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),ee=f.flatMap(e=>`args`in e?e.args:[]),te=f.map(e=>`args`in e?e.args.length:0),_=d.at(-1)??g(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:ee.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:r}:{kind:`Apply`,operator:h,args:ee,...te.slice(0,-1).some(e=>e>0)&&{argumentCounts:te},argumentsRange:_,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&Lp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:T(),location:r};if(n.kind===`Operator`&&Lp(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=be(()=>k());return C(`)`),e}case`[`:return Ae(n);case`{`:return Me(n);case`<<`:return Ne(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Pe(n);case`IF`:{let e=k();C(`THEN`);let t=k();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:k(),location:r}}case`CASE`:return Fe(n);case`LET`:{let e=[],t=[];for(l.push(/* @__PURE__ */ new Set);!S(`IN`);){if(i&&b(`RECURSIVE`))throw ue(`Unexpected keyword RECURSIVE`,se(re()));if(S(`RECURSIVE`)){Ke();continue}let n=ze(!1);n.kind===`Instance`?t.push(n):e.push(n)}l.pop();let n=k();return t.length===0?{kind:`Let`,definitions:e,body:n,location:r}:{kind:`Let`,definitions:e,instances:t,body:n,location:r}}case`CHOOSE`:{let e=Ce(),t=S(`\\in`)?k():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:k(),location:r}}case`WF_`:case`SF_`:{let e=Te(),t=be(()=>{C(`(`);let e=k();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw fe(`Unexpected ${ie(n)}`,n)},D=(e,t,n)=>{c.last=c.preceding={low:t,high:n};let r=k(n+1),a=v(),o=a.text===`'`||_p.has(a.text)?mp.high:gp.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw ue(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},O=()=>{let e=c.preceding;c.preceding=void 0;let t=v(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return E();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[D(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[D(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:D(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:D(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:D(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:D(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[i?k(9):D(t,10,13)],location:n}}return Re(e)},k=(e=0)=>{let t=o.index,n=O(),r={left:n.location.range?n:_(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){x(),c.last=mp,r.left=_({kind:`Prime`,expression:r.left,location:i},t);continue}if(_p.has(n.text)&&e<=15){x(),c.last=mp,r.left=_({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=be(()=>w(()=>k()));be(()=>C(`]`)),c.last=hp,r.left=_({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&pe(v(1))){x();let e=x().text;r.left=_({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=gp.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw ue(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw ue(`Precedence conflict between ${n.text} and -`,v());c.last=c.preceding=a;let s=k(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[g(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,s],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,s],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,s]}:{kind:`Product`,factors:[l,s],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,s],location:i};r.left=_(r.left,t),r.previous={...a,text:n.text}}return r.left},A=()=>{if(!S(`(`))return[];let e=Ge();return C(`)`),e},j=()=>{let e=m(v()),t=k(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},ze=e=>{let t=o.index;return _(Ve(e),t)},Be=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Ve=e=>{let t=v(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...j(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&gp.has(v(1).text)&&v(2).kind===`Identifier`&&b(`==`,3)){let e=he(),t=x().text,n=he();return C(`==`),r(t,[Be(e),Be(n)])}let i=t.kind!==`String`&&yp.has(t.text),a=t.kind===`Identifier`&&_p.has(v(1).text)&&b(`==`,2);if(i||a){let e=i?t.text:v(1).text;i&&x();let n=he();return a&&x(),C(`==`),r(e,[Be(n)])}let s=me();if(S(`[`)){let t=be(()=>we());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:k(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=A();return C(`==`),b(`INSTANCE`)?{...He(s,l,e,n),definitionRange:g(c)}:r(s,l)},He=(e,t,n,r)=>{let i=o.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:S(`WITH`)?w(()=>{let e=o.index,t=_e(),n=g(e);return C(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:g(i)}},Ue=()=>{let e=o.index;return _(We(),e)},We=()=>{let e=m(v());if(b(`_`)&&v(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(v().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!S(`(`))return{name:t,arity:0,location:e};let n=w(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},Ge=()=>w(Ue),Ke=()=>{let e=Ge();return e.forEach(e=>l[l.length-1].add(e.name)),e},qe=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Np.has(e.text)&&t.value++,e.kind===`Operator`&&Pp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Je=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,qe(1)):t.kind===`Operator`&&_p.has(t.text)?b(`==`,2):t.kind===`Operator`&&gp.has(t.text)?v(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&yp.has(e.text)&&t.kind===`Identifier`&&b(`==`,2)},Ye=[],Xe=()=>Ye[Ye.length-1]??-1,Ze=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Qe=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},$e=e=>!e.text.endsWith(`.`)&&!kp.has(Qe(e)),et=e=>{let t=Qe(e);if(kp.has(t))return;let n=Ze(e);if(n>=0)return`<${n}>${t}`;let r=Xe(),i=Ye[Ye.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},tt=e=>{if(e.kind===`Keyword`)return Ep.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Ye.length===0;if(e.text[1]===`+`||Ye.length===0)return!0;let t=Xe();return t>=0&&Ze(e)>t},nt=e=>{let t=Ze(e),n=Ye.length-1,r=Ye[n-1]??-1,i=Ye[n]<0;return i&&(Ye[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Ye[n]===t},rt=e=>!u.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),it=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Fp.has(e.name)&&!rt(e.name):!1,at=()=>{let e=v();return e.kind===`Step`?$e(e):e.kind===`Keyword`?Ap.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Je()},ot=()=>{let e=o.index,t=v();return t.kind===`Operator`&&!bp.has(t.text)&&Lp(t.text)?(o.index++,_({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):S(`MODULE`)?_({kind:`ModuleFact`,name:me(),location:m(t)},e):k()},st=e=>d[d.length-1]?.add(e),ct=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},lt=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ut=()=>{let e=o.index,t=v(),n=w(()=>{let e=v();if((e.kind!==`Identifier`||ce(e))&&e.kind!==`Operator`)throw fe(`Expected a definition name but found ${ie(e)}`,e);return o.index++,e.text},`!`),r=m(t);return _(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},dt=()=>{if(i)return w(ut);let e=w(ot),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&lt(e.name)):void 0;if(t)throw ue(`DEF clause entry should describe a defined operator`,t.location);return e},ft=()=>({facts:at()?w(ot):[],defs:S(`DEF`)||S(`DEFS`)?dt():[]}),pt=()=>{let t=o.index,r=x(),i=r.text===`USE`&&S(`ONLY`),a=g(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...ft(),keyword:a,location:m(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!it(e)):[];if(c.length>0)throw e.I(c.map(n=>({location:e.z(n.location.range??g(t)),message:`The only expression allowed as a fact in a HIDE is
457
- the name of a theorem, assumption, or step.`})));return _(s,t)},mt=()=>{let e=o.index,t=m(v()),n=S(`NEW`),r=v().kind===`Keyword`?jp.get(v().text):void 0;if(!n&&r===void 0)throw fe(`Expected a declaration but found ${ie(v())}`);if(r!==void 0&&x(),r===`Variable`){let n=he();return st(n.name),_({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=Ue();st(i.name);let a=(r??`Constant`)===`Constant`&&b(`\\in`);if(a&&i.arity>0)throw ue(`declared symbol with arguments before \\in`);return a&&x(),_({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?k():void 0,nameRange:i.location.range,location:t},e)},ht=()=>{let e=o.index,t=m(C(`ASSUME`)),n=w(()=>b(`ASSUME`)?ct(ht):v().kind===`Keyword`&&Mp.has(v().text)?mt():k());return C(`PROVE`),_({kind:`AssumeProve`,assumptions:n,conclusion:k(),location:t},e)},gt=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&b(e,t.value+1)},_t=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},vt=()=>{let e=v();if(b(`USE`)||b(`HIDE`))return pt();if(b(`INSTANCE`)){let t=o.index;return _(He(void 0,[],!1,m(e)),t)}if(b(`DEFINE`)||Je()){let t=o.index;S(`DEFINE`);let n=[ze(!1)];for(;Je();)n.push(ze(!1));let r={kind:`Define`,definitions:n,location:m(e)};return _(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:k()};if(S(`TAKE`)){let e=xe(),t=ge(e?[]:w(he)),n=e?we():[];return _t(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:w(()=>k())};if(S(`PICK`)){let e=gt(`:`),t=ge(e?w(he):[]),n=e?[]:we();return _t(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:k()}}return S(`CASE`)?{kind:`Case`,expression:k()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?ht():k()}},yt=e=>{let t=v();if(t.kind!==`Step`)throw fe(`Expected a step number but found ${ie(t)}`,t);if(!nt(t))throw ue(`${e?`QED step`:`step`}'s number has bad level`,t);if(Ze(t)<0&&et(t)!==void 0)throw ue(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:et(t),token:t.text,location:m(t)}},bt=()=>{let e=o.index,t=yt(b(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=S(`QED`)?{kind:`Qed`}:vt(),a=g(e),s=g(n),c=tt(v());if(c&&!Dp.has(i.kind))throw ue(`Proof of a step that does not take a proof`);let l=c?St():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(st),_({...t,body:i,head:a,statement:s,proof:l},e)},xt=()=>{let e=m(v());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=g(o.index-1);return{kind:`By`,isOnly:S(`ONLY`),...ft(),keyword:t,location:e}}let t=v(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=g(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[bt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(bt());return{kind:`Steps`,level:Xe(),steps:n,location:e}},St=()=>{let e=o.index;Ye.push(-1);let t=ct(xt);return Ye.pop(),_(t,e)},Ct=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},wt=e=>{let t=o.index,n=x(),r=v().kind===`Identifier`&&b(`==`,1)?me():void 0;r!==void 0&&(u.add(r),x());let i=ct(()=>({statement:b(`ASSUME`)?ht():k(),proof:tt(v())?St():void 0})),a=i.statement,s=_({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&Ct(e,_({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Tt=()=>{let e=o.index,t=x(),n=v().kind===`Identifier`&&b(`==`,1)?me():void 0;return n!==void 0&&(u.add(n),x()),_({name:n,expression:k(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Et=()=>{let e=m(C(`----`));C(`MODULE`);let t=ye();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),l.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&w(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(g(e))});;){let t=o.index;ae.index=t;let r=v();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),l.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=Et();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(x()),r=Ge();n.constants.push(...r),e.range=g(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(x()),r=w(()=>{let e=o.index,t=m(v());return _({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=g(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Tt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Ct(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(b(`USE`)&&b(`ONLY`,1))throw fe(`Expected a module unit but found ${ie(r)}`);let e=pt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:Ke()});continue;case`INSTANCE`:Dt(n,_(He(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Dt(n,_(He(void 0,[],!0,m(r)),t));continue}Dt(n,_(Ve(!0),t));continue}r.kind===`Keyword`&&Tp.has(r.text)?wt(n):Dt(n,ze(!1))}}},Dt=(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}))},Ot=Et(),kt=ve.isUsed?pp(t):void 0;if(kt!==void 0)throw new e.O(kt);return Ot},Vp=e=>Bp(e,`tlc`),Hp=(e,t)=>Bp(e,`tlc`,t),Up=e=>Bp(e,`tlapm`),Wp=e=>Bp(e,`sany`),Gp=10454148508367108822n,Kp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Gp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),qp=Int32Array.from(Kp,e=>Number(BigInt.asIntN(32,e>>32n))),Jp=Int32Array.from(Kp,e=>Number(BigInt.asIntN(32,e))),Yp=Number(BigInt.asIntN(32,Gp>>32n)),Xp=Number(BigInt.asIntN(32,Gp));let Zp=Yp,Qp=Xp;const $p=e=>{let t=(e^Qp)&255;Qp=(Qp>>>8|Zp<<24)^Jp[t],Zp=Zp>>>8^qp[t]},em=e=>{for(let t=0;t<32;t+=8)$p(e>>>t)},tm=e=>{if(typeof e==`boolean`)return $p(0),$p(e?116:102),2;if(typeof e==`number`)return $p(1),em(e),5;if(typeof e==`string`){$p(3),em(e.length);for(let t=0;t<e.length;t++)$p(e.charCodeAt(t));return 5+e.length}return $p(21),em(at(e.name)+1),5},nm=e=>{if(typeof e!=`object`||j(e))tm(e);else if(A(e)){let t=F(e);$p(9),em(t.domain.length);for(let e=0;e<t.domain.length;e++)nm(t.domain[e]),nm(t.range[e])}else{let t=N(e).elements;$p(5),em(t.length);for(let e of t)nm(e)}},rm=e=>{let t={high:Zp,low:Qp};Zp=Yp,Qp=Xp;for(let t of e)nm(t);let n=BigInt(Zp>>>0)<<32n|BigInt(Qp>>>0);return Zp=t.high,Qp=t.low,n},im=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Zp=n<32?0:1<<n-32,Qp=n<32?1<<n:0;for(let t=0;t<e;t++)$p(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Zp,t[n+1]=t[a+1]^Qp}}return t},am=(e,t=4194304)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=[],o=e=>{let t=n.get(e);if(t)return t;let r=im(e);return n.set(e,r),r},s=e=>{if(typeof e!=`object`||j(e))return tm(e);let t=c(e),n=a[t],r=Zp,o=Qp;Zp=i[3*t+1],Qp=i[3*t+2];for(let e=0;e<8;e++){let t=e<4?o:r,i=(e*256+(t>>>(e&3)*8&255))*2;Zp^=n[i],Qp^=n[i+1]}return i[3*t]},c=e=>{let t=r.get(e);if(t!==void 0)return t;let n=Zp,c=Qp;Zp=0,Qp=0;let l={value:5};if(A(e)){let t=F(e);$p(9),em(t.domain.length);for(let e=0;e<t.domain.length;e++)l.value+=s(t.domain[e]),l.value+=s(t.range[e])}else{let t=N(e).elements;$p(5),em(t.length);for(let e of t)l.value+=s(e)}let u=a.length;return r.set(e,u),i.push(l.value,Zp,Qp),a.push(o(l.value)),Zp=n,Qp=c,u};return o=>{let c=new BigInt64Array(o.length),l=new Int32Array(c.buffer),u=Zp,d=Qp;return o.forEach((o,c)=>{r.size>=t&&(n.clear(),r.clear(),i.length=0,a.length=0),Zp=Yp,Qp=Xp;for(let t of e)s(o[t]);l[2*c]=Qp,l[2*c+1]=Zp}),Zp=u,Qp=d,c}},om=25214903917n,sm=(1n<<48n)-1n,cm=2147483647,lm=e=>{let t={value:(BigInt.asUintN(64,e)^om)&sm},n=e=>(t.value=t.value*om+11n&sm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^om)&sm},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=cm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},um=[],dm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},fm=()=>{for(let e=1277011;um.length<1341;e++)dm(e)&&um.push(e);return um},pm=e=>{let t=fm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},mm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},hm=e=>{for(let t=Math.max(e,9);;t++){let e=mm(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)}}},gm=(e,t,n)=>{if(t<=0)return[];let r=hm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(pm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},_m=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:cm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},vm=(1n<<63n)-1n-24n,ym=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(vm*BigInt(n)+i)%t;return r<0n?r+t:r})},bm=(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,xm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=wn(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>gt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>Dn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:En}}},Sm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Cm=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?_m:gm;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=Sm(t,r)?void 0:xm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(cm)?ym(e,t,n):i(e,Number(t),n)).map(e=>a.create(bm(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},wm=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e._(`RandomElement of the empty set`);return r},Tm=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...wn(t.domain)];return gt(e,e.map(()=>Tm(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Dn(t.names.map((e,r)=>[e,Tm(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return En(t.factors.map(e=>Tm(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e._(`RandomElement of the empty set`);return t.low+i}return wm(N(t).elements,n)},Em=(e,t=0n)=>{let n=lm(t),r={random:lm(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Dn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:rm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Dm=e=>gn([...e.possibleCounts].map(([e,t])=>[e,t])),Om=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Dm(e)]]),km=`----------------------------- MODULE Bags --------------------------------
455
+ `]]),Xd=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Zd=v(`EOF`),Qd=v(`IDENTIFIER`),$d=v(`DEFBREAK`),ef=(e,t)=>Array.from({length:v(t)-v(e)+1},(t,n)=>v(e)+n),tf=new Set(ef(`op_57`,`op_119`)),nf=new Set(ef(`op_1`,`op_119`)),rf=new Set(ef(`op_57`,`op_70`)),af=/* @__PURE__ */ new Set([...ef(`ACTION`,`EXCEPT`),v(`EXTENDS`),...ef(`IF`,`SF`),v(`STATE`),...ef(`THEN`,`WITH`),v(`US`),...ef(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),of=new Map([...U(`postfix`,160,160,!0,`[`),...U(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...U(`prefix`,120,120,!1,`-.`),...U(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...U(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...U(`prefix`,40,40,!0,`\\lnot`),...U(`nfix`,100,130,!0,`\\times`),...U(`infix`,140,140,!1,`^`,`^^`),...U(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...U(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...U(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...U(`infix`,100,110,!0,`|`,`||`,`%%`),...U(`infix`,100,110,!1,`%`),...U(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...U(`infix`,90,140,!1,`\\wr`),...U(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...U(`infix`,90,130,!1,`!!`),...U(`infix`,90,90,!1,`...`,`..`),...U(`infix`,80,80,!0,`\\intersect`,`\\union`),...U(`infix`,80,80,!1,`\\`),...U(`infix`,70,70,!1,`<:`,`:>`),...U(`infix`,60,60,!0,`@@`),...U(`infix`,50,140,!0,`\\cdot`),...U(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...U(`infix`,30,30,!0,`\\land`,`\\lor`),...U(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...U(`infix`,10,10,!1,`=>`)]),sf=new Map([...of,...Wd.flatMap(e=>e.slice(1).map(t=>[t,of.get(e[0])]))]),cf=sf.get(`[`),lf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},uf=e=>({type:`tokens`,kinds:new Set(e)}),df=e=>typeof e==`string`?e.startsWith(`<`)?uf([v(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(df)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),ff=e=>(...t)=>({type:e,body:W(...t)}),K=ff(`zeroOrMore`),pf=ff(`oneOrMore`),q=ff(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),mf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),hf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=mf(e,n);return n},gf=(...e)=>{let t=e.map(v);return e=>t.includes(hf(e,1).kind)},_f=(e,t=hf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},vf=e=>{let t=hf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},yf=e=>gf(`CASESEP`)(e)&&_f(e),bf=e=>{let t=hf(e,1);af.has(t.kind)&&(t.kind=Qd)},xf=(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}`,Sf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Cf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},wf=e=>e.operatorStacks[e.operatorStacks.length-1],Tf=(e,t)=>e.low>t.high,Ef=(e,t)=>e.high<t.low,Df=e=>e.fix===`prefix`?e:sf.get(`${e.name}.`),Of=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===cf?Sf(`FcnAppl`,[n,...r.node.heirs]):Sf(`PostfixExpr`,[n,r.node]),operator:void 0})},kf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Sf(`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:Sf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Af=e=>{let t=wf(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 Of(t,n),Af(e);if(i.operator!==void 0){let t=Df(r.operator);return t!==void 0&&Tf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${xf(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 ${xf(e,a.node.first,a.node.last)} and expression at location ${xf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Ef(a.operator,r.operator)?void 0:Tf(a.operator,r.operator)?(kf(t,a.operator),Af(e)):`Precedence conflict between ops ${a.operator.name} in block ${xf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Df(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Ef(s,r.operator))return;if(!Tf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${xf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return kf(t,s),Af(e);let c=xf(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===lf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},jf=e=>J(t=>{let n=wf(t),r=Cf(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:Af(t)}),Mf=jf(()=>!1),Nf=jf(()=>!0),Pf=J(e=>{e.lastOperator=sf.get(e.token.image)}),Ff=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},If=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Ff(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Lf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!_f(e,n.first.beginColumn))return n;let t=Lf(e,n);if(t!==void 0)return t}},Rf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(v),n=(e,...t)=>t.some(t=>e.kind===v(t)),r=e=>e!==void 0&&tf.has(e.kind),i=e.token,a=mf(e,i);i.next=void 0;let o=mf(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===Qd&&(e=e.next)}else if(e.kind===Qd){let t=e.next;!r(t)||rf.has(t.kind)||nf.has(t.kind)&&t.next?.kind!==Qd||(e=t.next?.kind===v(`SUBSTITUTE`)?i:nf.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==$d&&(e.next={kind:$d,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=mf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},zf=e=>{let t=hf(e,1);if(t.kind===v(`LAB`)){let n=1;for(;n!==0;)if(t=mf(e,t),t.kind===v(`LAB`)&&n++,t.kind===v(`RAB`)&&n--,t.kind===Zd)return!1;return mf(e,t).kind===v(`IN`)}if(t.kind!==Qd)return!1;for(t=mf(e,t);t.kind===v(`COMMA`);){if(t=mf(e,t),t.kind!==Qd)return!1;t=mf(e,t)}return t.kind===v(`IN`)},Bf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Vf=e=>e.proofLevels.at(-1)??-1,Hf=e=>{let t=hf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:gf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Vf(e)>=0&&Bf(t)>Vf(e):gf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Uf=(e,t)=>{let n=Bf(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},Wf=e=>J(t=>Uf(t,t.token)?void 0:`${xf(t,t.token)}: ${e}`),Gf=uf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(v)),Kf=uf([...Gf.kinds,v(`op_76`)]),qf=uf(nf),Jf=uf(rf),Yf=uf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(v)),Xf=()=>K(X({expansion:[G(Gf,`<op_77>`)],semantic:_f}),G(`PrefixOp`,`InfixOp`),Nf),Zf=()=>G(W(X({expansion:[`OpenStart`],semantic:_f}),`OpenExpression`,Mf),W(X({semantic:_f}),`ExtendableExpr`)),Qf=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),$f=()=>G(W(X({semantic:e=>gf(`ASSUME`,`BOXASSUME`)(e)||hf(e,2).kind===v(`COLONCOLON`)&&[v(`ASSUME`),v(`BOXASSUME`)].includes(hf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),ep=()=>[`JuncItem`,K(X({semantic:vf}),`JuncItem`)],tp=e=>J(t=>{t.expecting=e,bf(t)}),np=e=>J(t=>{t.isTerminalProof=e}),rp=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Rf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),ip={CompilationUnit:Z(void 0,[J(Rf),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),tp(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,tp(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,tp(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(Rf)),W(X({semantic:e=>gf(`USE`)(e)&&hf(e,2).kind!==v(`ONLY`)||gf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(rp(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),rp(`Expression`,X({expansion:[`<IDENTIFIER>`,Jf]}),`PostfixLHS`,`Expression`),rp(`Expression`,X({expansion:[`<IDENTIFIER>`,qf]}),`InfixLHS`,`Expression`),rp(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),rp(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[Kf,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,qf,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,Jf]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,tp(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[Gf,Pf]),NonExpPrefixOp:Z(void 0,[Kf,Pf]),InfixOp:Z(`Infix Op`,[qf,Pf]),PostfixOp:Z(void 0,[Jf,Pf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Rf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),$f(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),$f(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=Cf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${xf(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(Rf),G(W(X({amount:3}),X({semantic:gf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Hf}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>gf(`BY`)(e)||hf(e,2).kind===v(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>hf(e,2).kind!==v(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,np(!0),q(`<ONLY>`)),W(`<USE>`,np(!1),q(`<ONLY>`)),W(`<HIDE>`,np(!1))),Y("an expression, `MODULE' or `DEF'"),q(Qf(),K(`<COMMA>`,Y(`MODULE or expression`),Qf(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),Qf(),K(`<COMMA>`,Y(`MODULE or expression`),Qf(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),Yf,Wf(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Hf}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),Yf,Wf(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:gf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:gf(`INSTANCE`)}),`Instantiation`),W(X({semantic:gf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Hf}),J(e=>{let t=Cf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${xf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),pf(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:gf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(Kf,qf,Jf),uf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(v))],semantic:_f}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${xf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:_f}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:zf}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),pf(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=Cf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,K(`<COMMA>`,`QuantBound`)),pf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:zf}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>hf(e,2).kind===v(`MAPTO`)&&af.has(hf(e,1).kind)}),J(e=>{hf(e,1).kind=Qd}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=Sf(`FcnAppl`,t.heirs),e.lastOperator=cf})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,pf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(bf),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===v(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>yf(e)&&hf(e,2).kind!==v(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:yf}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[pf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=hf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...ep()),W(X({expansion:[`<AND>`]}),...ep())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Lf(t,e.heirs[1]);return n&&`Item at ${xf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${xf(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),Xf(),Zf()],(e,t)=>{let n=wf(t);n.push({node:e.heirs[0],operator:lf});let r=Af(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Mf,K(G(W(X({expansion:[`PostfixOp`],semantic:_f}),`PostfixOp`,Nf),W(X({expansion:[`<DOT>`],semantic:_f}),`<DOT>`,J(bf),X({semantic:_f}),`Identifier`,J(e=>{let t=wf(e);t[t.length-1].operator!==void 0&&Of(t,t.length),t[t.length-1]={node:Sf(`RecordComponent`,[t[t.length-1].node,Cf(e,2),Cf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:_f}),Y(`function argument`),`SBracketCases`,jf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:_f}),`InfixOp`,Nf,Xf(),Zf()),W(X({expansion:[`<COLONCOLON>`],semantic:_f}),`<COLONCOLON>`,J(e=>{let t=wf(e);if(!If(t[t.length-1].node))return`\`::' at ${xf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=wf(e),n=Cf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Ef(r,e.lastOperator)){let t=Cf(e,3);return`Removing label at ${xf(e,t.first,t.last)} would change expression parsing.`}t.push({node:Sf(`Label`,[Cf(e,3),Cf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:_f}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:_f}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>Vf(e)<0&&e.proofLevels.length<=1?`${xf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${xf(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Ff(e.heirs)===void 0?e.heirs.length===1?Sf(`GeneralId`,e.heirs):void 0:Sf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>hf(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>hf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${xf(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},ap=/* @__PURE__ */ new Map,op=e=>{let t=ap.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=op(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,op(ip[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 ap.set(e,n),n},sp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},cp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=mf(e,e.scanPosition)),e.scanPosition=mf(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`},lp=(e,t)=>{if(t.type===`tokens`)return cp(e,t.kinds);if(t.type===`call`)return lp(e,ip[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||sp(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=lp(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||sp(e,t.semantic)?lp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=lp(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=lp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},up=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=lp(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},dp=(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||op(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!op(a).hasSemanticStart?op(a).first.has(hf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):up(e,i,a)&&(o===void 0||o(e))}),fp=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,lp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=mf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Zd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=mf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ee(e.token.image)}" `},pp=(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??fp(e)}\n\nResidual stack trace follows:\n${r}`,!1},mp=(e,t)=>{let n=mf(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,pp(e))},hp=(e,t)=>{let n=ip[t];n.message!==void 0&&(e.messages.push({name:n.message,token:hf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!gp(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 pp(e,i);let a=r.node??(r.heirs.length===0?void 0:Sf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},gp=(e,t)=>{if(t.type===`tokens`)return mp(e,t.kinds);if(t.type===`call`)return hp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||pp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||pp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||gp(e,t));if(t.type===`choice`){let n=dp(e,t.alternatives);return n===-1?pp(e):gp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!gp(e,t.body))return!1;if(t.type===`optional`)return dp(e,[t.body])===-1||gp(e,t.body);for(;dp(e,[t.body])===0;)if(!gp(e,t.body))return!1;return!0},_p=e=>{let t=we(e),n={kind:Zd,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=gp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},vp={low:15,high:15},yp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),bp=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),xp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Sp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Cp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),wp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Tp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Ep=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...xp]),Dp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Op=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),kp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ap=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),jp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Mp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Np=/* @__PURE__ */ new Set([``,`*`,`-`]),Pp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Fp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Ip=/* @__PURE__ */ new Set([`NEW`,...Fp.keys()]),Lp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Rp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),zp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Bp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?bp.has(e.operator):xp.has(e.operator)),Vp=e=>bp.has(e)||xp.has(e)||e===`-.`,Hp=(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}}},Up=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
456
+ `)}\n`},Wp=(t,n,r=se(t))=>{let i=n===`tlapm`,a=i?r:r.map(re),o={index:0,offsideColumns:[]},c={},l=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>l[l.length-1].has(e),m=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],te=[],ne=[],h=(e,t=o.index-1)=>{let n=e===t?ne[e]:void 0;if(n)return n;let r=a[t];ee[e]??=m(a[e]),te[t]??={line:r.line,column:r.endColumn};let i={module:f[0].name,start:ee[e],end:te[t]};return e===t&&(ne[e]=i),i},g=(e,t)=>(e.location.range=h(t),e),ie=(e=0)=>a[Math.min(o.index+e,a.length-1)],_=(e=0)=>{let t=ie(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ae=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),oe={index:0},ce=e=>{let t=a.slice(oe.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},le=e=>i&&(e.kind===`Keyword`||zp.has(e.text)),ue=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},v=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Mp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):le(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,y=(t,n=ie(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.O(`${t} at line ${n.line}, column ${n.column}`,void 0,de(t,n,o,r))},de=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ce(ue(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${v(r)}`,...ue(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},fe=(e,t=ie())=>y(e,t,t),pe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!le(e),b=(e,t=0)=>{let n=_(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=_();if(e.kind===`End`)throw y(`Unexpected end of expression`);return o.index++,e},S=e=>b(e)?(o.index++,!0):!1,C=e=>{if(!b(e))throw fe(`Expected ${JSON.stringify(e)} but found ${ae(_())}`);return x()},me=()=>{let e=_();if(e.kind!==`Identifier`)throw fe(`Expected an identifier but found ${ae(e)}`);if(le(e))throw fe(`Unexpected keyword ${e.text}`);return o.index++,e.text},he=()=>{let e=o.index;return{name:me(),range:h(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=_();return e.kind!==`String`&&(Cp.has(e.text)||bp.has(e.text)||xp.has(e.text)||e.text===`'`)?(o.index++,e.text):me()},ve={isUsed:!1},ye=()=>_().kind===`Identifier`||!pe(_())?me():(ve.isUsed=!0,x().text),w=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},be=()=>{if(b(`<<`)){let e={value:1};for(;_(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;_(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},xe=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;_(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return _(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},Se=()=>{if(!S(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(T(he));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>T(()=>{let e=T(Se);C(`\\in`);let t=O();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=_();if(e.kind===`Identifier`){let t=o.index,n=[x().text];for(;b(`!`)&&_(1).kind===`Identifier`;)x(),n.push(me());return g({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(b(`<<`)||b(`(`))return Re();throw fe(`Expected a subscript but found ${ae(e)}`)},Te=e=>{let t=_(1),n=_(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&b(`==`,xp.has(n.text)?3:4))},Ee=e=>{let t=_(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&Op.has(t.text)||Te(e)},De=()=>{let e=_(),t=e.kind===`Operator`&&(bp.has(e.text)||Sp.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Sp.has(e.text)||Ep.has(e.text)&&e.text!==`'`&&!xp.has(e.text)||Tp.has(e.text)&&_(-1).text===`(`&&_(-1).line===e.line&&_(-1).endColumn+1===e.column&&_(1).text===`)`&&_(1).line===e.line&&_(1).column===e.endColumn+1)&&Ee(e))throw y(`incomplete expression`,e);if(t)return o.index++,g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&Ep.has(e.text)&&Ee(e)){o.index++;let t=m(e);if(xp.has(e.text))return g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return g({kind:`Lambda`,params:[n.name],body:Hp(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(b(`LAMBDA`)){let t=o.index;x();let n=ge(T(he));C(`:`);let r=O();return g({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return O()},Oe={range:void 0},ke=()=>w(()=>{let e=o.index;C(`(`);let t=T(De);return C(`)`),Oe.range=h(e),t}),E=()=>{let e=x();o.offsideColumns.push(e.column);let t=[O()];for(;ie().text===e.text&&ie().column===e.column;)o.index++,t.push(O());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},Ae=e=>w(()=>{let t=m(e),n=_().kind===`Identifier`,r=b(`|->`,1)&&(n||pe(_()));if(r||n&&b(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=m(_()),i=e();return n.range=h(t),C(r?`|->`:`:`),{name:i,value:O(),location:n}},a=[i(()=>n?me():x().text),...S(`,`)?T(()=>i(me)):[]];return C(`]`),{kind:e,fields:a,location:t}}if(be()){let e=Ce();C(`|->`);let n=O();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=O();if(S(`->`)){let e=O();return C(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(S(`EXCEPT`)){let e=T(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!pe(_()))throw fe(`Expected a field name but found ${ae(_())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:T(()=>O())}),C(`]`);return C(`=`),{path:e,value:O()}});return C(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!b(`]_`)){let e=[a];for(;S(`,`);)e.push(O());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:a,subscript:we(),location:t}}),je=()=>{let e=o.index,t=g(ze(),e),n=m(x());return g({kind:`Apply`,operator:`\\in`,args:[t,O()],location:n},e)},Me=e=>w(()=>{let t=m(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(_(1).text===`\\in`||b(`<<`))){let e=o.index,n=Se();C(`\\in`);let r=O();if(S(`:`)){let e=O();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=_().kind===`Identifier`&&b(`\\in`,1)?je():O();if(S(`:`)){let e=Ce();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(O());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ne=e=>{let t=m(e),n=w(()=>b(`>>`)||b(`>>_`)?[]:T(()=>O()));if(S(`>>_`)){if(n.length!==1)throw y(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Pe=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return C(`:`),{kind:n,bounds:e,body:O(),location:t}}let i=ge(T(he));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:O(),isTemporal:r,location:t}},Fe=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:O(),location:m(e)};let n=O();C(`->`),t.push({condition:n,body:O()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Ie=()=>{let e=_(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Dp.has(e.text)||e.kind===`Operator`&&(bp.has(e.text)||xp.has(e.text)||Sp.has(e.text)))},Le=()=>{let e=x();if(e.kind===`Number`)return{kind:`Operand`,operand:s(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:b(`(`)?ke():[]}},Re=e=>{let t=o.index,n=x(),r=m(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(me);return C(`:`),{kind:`Lambda`,params:e,body:O(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw y(`incomplete expression`,n);return{kind:`Number`,value:s(n.text),text:n.text,location:r}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:r};if(n.kind===`String`)return{kind:`String`,value:n.text,location:r};let a=n.kind===`Step`&&et(n);if(a&&Ze()<0&&Xe.length<=1)throw y(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw y(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let s=a?tt(n)??n.text:n.text;if(xe()){let t=ge(S(`(`)?T(he):[]);t.names.length>0&&C(`)`),C(`::`);let a=O();if(!i&&e!==void 0&&c.last!==void 0&&Bp(a)&&e.high>=c.last.low)throw y(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=b(`(`);if(s===`@`&&!l&&!Ie())return{kind:`ExceptAt`,location:r};let u=l?ke():[],d=[l?Oe.range:void 0];if(!Ie())return l?{kind:`Apply`,operator:s,args:u,argumentsRange:Oe.range,location:r}:{kind:`Identifier`,name:s,location:r};let f=[{kind:`Name`,name:s,args:u}],p=[h(t,t)];for(;Ie();)x(),p.push(h(o.index,o.index)),Oe.range=void 0,f.push(Le()),d.push(Oe.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),ee=m.join(`!`),te=f.flatMap(e=>`args`in e?e.args:[]),ne=f.map(e=>`args`in e?e.args.length:0),g=d.at(-1)??h(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:te.length===0?{kind:`Identifier`,name:ee,selectorRanges:p,location:r}:{kind:`Apply`,operator:ee,args:te,...ne.slice(0,-1).some(e=>e>0)&&{argumentCounts:ne},argumentsRange:g,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&Vp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:ke(),location:r};if(n.kind===`Operator`&&Vp(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=w(()=>O());return C(`)`),e}case`[`:return Ae(n);case`{`:return Me(n);case`<<`:return Ne(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Pe(n);case`IF`:{let e=O();C(`THEN`);let t=O();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:O(),location:r}}case`CASE`:return Fe(n);case`LET`:{let e=[],t=[];for(l.push(/* @__PURE__ */ new Set);!S(`IN`);){if(i&&b(`RECURSIVE`))throw y(`Unexpected keyword RECURSIVE`,ce(ie()));if(S(`RECURSIVE`)){qe();continue}let n=A(!1);n.kind===`Instance`?t.push(n):e.push(n)}l.pop();let n=O();return t.length===0?{kind:`Let`,definitions:e,body:n,location:r}:{kind:`Let`,definitions:e,instances:t,body:n,location:r}}case`CHOOSE`:{let e=Se(),t=S(`\\in`)?O():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:O(),location:r}}case`WF_`:case`SF_`:{let e=we(),t=w(()=>{C(`(`);let e=O();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw fe(`Unexpected ${ae(n)}`,n)},D=(e,t,n)=>{c.last=c.preceding={low:t,high:n};let r=O(n+1),a=_(),o=a.text===`'`||xp.has(a.text)?vp.high:bp.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw y(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},ze=()=>{let e=c.preceding;c.preceding=void 0;let t=_(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return E();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[D(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[D(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:D(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:D(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:D(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:D(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[i?O(9):D(t,10,13)],location:n}}return Re(e)},O=(e=0)=>{let t=o.index,n=ze(),r={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=_();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){x(),c.last=vp,r.left=g({kind:`Prime`,expression:r.left,location:i},t);continue}if(xp.has(n.text)&&e<=15){x(),c.last=vp,r.left=g({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=w(()=>T(()=>O()));w(()=>C(`]`)),c.last=yp,r.left=g({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&pe(_(1))){x();let e=x().text;r.left=g({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=bp.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw y(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw y(`Precedence conflict between ${n.text} and -`,_());c.last=c.preceding=a;let s=O(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[h(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,s],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,s],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,s]}:{kind:`Product`,factors:[l,s],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,s],location:i};r.left=g(r.left,t),r.previous={...a,text:n.text}}return r.left},Be=()=>{if(!S(`(`))return[];let e=Ke();return C(`)`),e},k=()=>{let e=m(_()),t=O(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},A=e=>{let t=o.index;return g(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=_(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...k(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&_(1).kind===`Operator`&&bp.has(_(1).text)&&_(2).kind===`Identifier`&&b(`==`,3)){let e=he(),t=x().text,n=he();return C(`==`),r(t,[Ve(e),Ve(n)])}let i=t.kind!==`String`&&Cp.has(t.text),a=t.kind===`Identifier`&&xp.has(_(1).text)&&b(`==`,2);if(i||a){let e=i?t.text:_(1).text;i&&x();let n=he();return a&&x(),C(`==`),r(e,[Ve(n)])}let s=me();if(S(`[`)){let t=w(()=>Ce());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:O(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=Be();return C(`==`),b(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:h(c)}:r(s,l)},Ue=(e,t,n,r)=>{let i=o.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:S(`WITH`)?T(()=>{let e=o.index,t=_e(),n=h(e);return C(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:h(i)}},We=()=>{let e=o.index;return g(Ge(),e)},Ge=()=>{let e=m(_());if(b(`_`)&&_(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(_().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!S(`(`))return{name:t,arity:0,location:e};let n=T(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},Ke=()=>T(We),qe=()=>{let e=Ke();return e.forEach(e=>l[l.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=_(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Lp.has(e.text)&&t.value++,e.kind===`Operator`&&Rp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=_(),t=_(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,Je(1)):t.kind===`Operator`&&xp.has(t.text)?b(`==`,2):t.kind===`Operator`&&bp.has(t.text)?_(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&Cp.has(e.text)&&t.kind===`Identifier`&&b(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!Np.has($e(e)),tt=e=>{let t=$e(e);if(Np.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return Ap.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},it=e=>!u.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),at=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!zp.has(e.name)&&!it(e.name):!1,ot=()=>{let e=_();return e.kind===`Step`?et(e):e.kind===`Keyword`?Pp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},st=()=>{let e=o.index,t=_();return t.kind===`Operator`&&!wp.has(t.text)&&Vp(t.text)?(o.index++,g({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):S(`MODULE`)?g({kind:`ModuleFact`,name:me(),location:m(t)},e):O()},ct=e=>d[d.length-1]?.add(e),lt=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},ut=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),dt=()=>{let e=o.index,t=_(),n=T(()=>{let e=_();if((e.kind!==`Identifier`||le(e))&&e.kind!==`Operator`)throw fe(`Expected a definition name but found ${ae(e)}`,e);return o.index++,e.text},`!`),r=m(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},ft=()=>{if(i)return T(dt);let e=T(st),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ut(e.name)):void 0;if(t)throw y(`DEF clause entry should describe a defined operator`,t.location);return e},pt=()=>({facts:ot()?T(st):[],defs:S(`DEF`)||S(`DEFS`)?ft():[]}),mt=()=>{let t=o.index,r=x(),i=r.text===`USE`&&S(`ONLY`),a=h(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...pt(),keyword:a,location:m(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!at(e)):[];if(c.length>0)throw e.I(c.map(n=>({location:e.z(n.location.range??h(t)),message:`The only expression allowed as a fact in a HIDE is
457
+ the name of a theorem, assumption, or step.`})));return g(s,t)},ht=()=>{let e=o.index,t=m(_()),n=S(`NEW`),r=_().kind===`Keyword`?Fp.get(_().text):void 0;if(!n&&r===void 0)throw fe(`Expected a declaration but found ${ae(_())}`);if(r!==void 0&&x(),r===`Variable`){let n=he();return ct(n.name),g({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=We();ct(i.name);let a=(r??`Constant`)===`Constant`&&b(`\\in`);if(a&&i.arity>0)throw y(`declared symbol with arguments before \\in`);return a&&x(),g({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?O():void 0,nameRange:i.location.range,location:t},e)},gt=()=>{let e=o.index,t=m(C(`ASSUME`)),n=T(()=>b(`ASSUME`)?lt(gt):_().kind===`Keyword`&&Ip.has(_().text)?ht():O());return C(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:O(),location:t},e)},_t=e=>{let t={value:0};for(;_(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return _(t.value).kind===`Identifier`&&b(e,t.value+1)},vt=(e,t)=>{e.forEach(ct),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ct))},yt=()=>{let e=_();if(b(`USE`)||b(`HIDE`))return mt();if(b(`INSTANCE`)){let t=o.index;return g(Ue(void 0,[],!1,m(e)),t)}if(b(`DEFINE`)||Ye()){let t=o.index;S(`DEFINE`);let n=[A(!1)];for(;Ye();)n.push(A(!1));let r={kind:`Define`,definitions:n,location:m(e)};return g(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:O()};if(S(`TAKE`)){let e=be(),t=ge(e?[]:T(he)),n=e?Ce():[];return vt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:T(()=>O())};if(S(`PICK`)){let e=_t(`:`),t=ge(e?T(he):[]),n=e?[]:Ce();return vt(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:O()}}return S(`CASE`)?{kind:`Case`,expression:O()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?gt():O()}},bt=e=>{let t=_();if(t.kind!==`Step`)throw fe(`Expected a step number but found ${ae(t)}`,t);if(!rt(t))throw y(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw y(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:tt(t),token:t.text,location:m(t)}},xt=()=>{let e=o.index,t=bt(b(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=S(`QED`)?{kind:`Qed`}:yt(),a=h(e),s=h(n),c=nt(_());if(c&&!jp.has(i.kind))throw y(`Proof of a step that does not take a proof`);let l=c?Ct():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ct),g({...t,body:i,head:a,statement:s,proof:l},e)},St=()=>{let e=m(_());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=h(o.index-1);return{kind:`By`,isOnly:S(`ONLY`),...pt(),keyword:t,location:e}}let t=_(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=h(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[xt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(xt());return{kind:`Steps`,level:Ze(),steps:n,location:e}},Ct=()=>{let e=o.index;Xe.push(-1);let t=lt(St);return Xe.pop(),g(t,e)},wt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Tt=e=>{let t=o.index,n=x(),r=_().kind===`Identifier`&&b(`==`,1)?me():void 0;r!==void 0&&(u.add(r),x());let i=lt(()=>({statement:b(`ASSUME`)?gt():O(),proof:nt(_())?Ct():void 0})),a=i.statement,s=g({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&wt(e,g({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Et=()=>{let e=o.index,t=x(),n=_().kind===`Identifier`&&b(`==`,1)?me():void 0;return n!==void 0&&(u.add(n),x()),g({name:n,expression:O(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Dt=()=>{let e=m(C(`----`));C(`MODULE`);let t=ye();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),l.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&T(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(h(e))});;){let t=o.index;oe.index=t;let r=_();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),l.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=Dt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(x()),r=Ke();n.constants.push(...r),e.range=h(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(x()),r=T(()=>{let e=o.index,t=m(_());return g({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=h(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Et();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&wt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(b(`USE`)&&b(`ONLY`,1))throw fe(`Expected a module unit but found ${ae(r)}`);let e=mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Ot(n,g(Ue(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Ot(n,g(Ue(void 0,[],!0,m(r)),t));continue}Ot(n,g(He(!0),t));continue}r.kind===`Keyword`&&kp.has(r.text)?Tt(n):Ot(n,A(!1))}}},Ot=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},kt=Dt(),At=ve.isUsed?_p(t):void 0;if(At!==void 0)throw new e.O(At);return kt},Gp=e=>Wp(e,`tlc`),Kp=(e,t)=>Wp(e,`tlc`,t),qp=e=>Wp(e,`tlapm`),Jp=e=>Wp(e,`sany`),Yp=10454148508367108822n,Xp=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Yp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Zp=Int32Array.from(Xp,e=>Number(BigInt.asIntN(32,e>>32n))),Qp=Int32Array.from(Xp,e=>Number(BigInt.asIntN(32,e))),$p=Number(BigInt.asIntN(32,Yp>>32n)),em=Number(BigInt.asIntN(32,Yp));let tm=$p,nm=em;const rm=e=>{let t=(e^nm)&255;nm=(nm>>>8|tm<<24)^Qp[t],tm=tm>>>8^Zp[t]},im=(()=>{let e=[Zp],t=[Qp];for(let n=1;n<4;n++){let r=e[n-1],i=t[n-1],a=/* @__PURE__ */ new Int32Array(256),o=/* @__PURE__ */ new Int32Array(256);for(let e=0;e<256;e++){let t=i[e]&255;o[e]=(i[e]>>>8|r[e]<<24)^Qp[t],a[e]=r[e]>>>8^Zp[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),am=im.highs[0],om=im.highs[1],sm=im.highs[2],cm=im.highs[3],lm=im.lows[0],um=im.lows[1],dm=im.lows[2],fm=im.lows[3],pm=e=>{let t=nm^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;nm=tm^fm[n]^dm[r]^um[i]^lm[a],tm=cm[n]^sm[r]^om[i]^am[a]},mm=e=>{if(typeof e==`boolean`)return rm(0),rm(e?116:102),2;if(typeof e==`number`)return rm(1),pm(e),5;if(typeof e==`string`){rm(3),pm(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)pm(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++)rm(e.charCodeAt(n));return 5+e.length}return rm(21),pm(st(e.name)+1),5},hm=e=>{if(typeof e!=`object`||A(e))mm(e);else if(k(e)){let t=F(e);rm(9),pm(t.domain.length);for(let e=0;e<t.domain.length;e++)hm(t.domain[e]),hm(t.range[e])}else{let t=N(e).elements;rm(5),pm(t.length);for(let e of t)hm(e)}},gm=e=>{let t={high:tm,low:nm};tm=$p,nm=em;for(let t of e)hm(t);let n=BigInt(tm>>>0)<<32n|BigInt(nm>>>0);return tm=t.high,nm=t.low,n},_m=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=tm,a=nm;return e.forEach((e,n)=>{tm=$p,nm=em;for(let n of t)hm(e[n]);r[2*n]=nm,r[2*n+1]=tm}),tm=i,nm=a,n},vm=25214903917n,ym=(1n<<48n)-1n,bm=2147483647,xm=e=>{let t={value:(BigInt.asUintN(64,e)^vm)&ym},n=e=>(t.value=t.value*vm+11n&ym,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^vm)&ym},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<=bm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Sm=[],Cm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},wm=()=>{for(let e=1277011;Sm.length<1341;e++)Cm(e)&&Sm.push(e);return Sm},Tm=e=>{let t=wm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Em=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},Dm=e=>{for(let t=Math.max(e,9);;t++){let e=Em(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)}}},Om=(e,t,n)=>{if(t<=0)return[];let r=Dm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Tm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},km=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:bm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Am=(1n<<63n)-1n-24n,jm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Am*BigInt(n)+i)%t;return r<0n?r+t:r})},Mm=(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,Nm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Tn(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>vt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>Dn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:j}}},Pm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Fm=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?km:Om;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=Pm(t,r)?void 0:Nm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(bm)?jm(e,t,n):i(e,Number(t),n)).map(e=>a.create(Mm(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Im=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e._(`RandomElement of the empty set`);return r},Lm=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...Tn(t.domain)];return vt(e,e.map(()=>Lm(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Dn(t.names.map((e,r)=>[e,Lm(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return j(t.factors.map(e=>Lm(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e._(`RandomElement of the empty set`);return t.low+i}return Im(N(t).elements,n)},Rm=(e,t=0n)=>{let n=xm(t),r={random:xm(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Dn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:gm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},zm=e=>_n([...e.possibleCounts].map(([e,t])=>[e,t])),Bm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,zm(e)]]),Vm=`----------------------------- MODULE Bags --------------------------------
458
458
  (**************************************************************************)
459
459
  (* A bag, also called a multiset, is a set that can contain multiple *)
460
460
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -607,7 +607,7 @@ CopiesIn(e, B) ==
607
607
  7 Dec 98 : Corrected error found by Stephan Merz.
608
608
  6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
609
609
  5 Dec 98 : Initial version.
610
- `,Am=/* @__PURE__ */ new Map([[`Bags`,km],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
610
+ `,Hm=/* @__PURE__ */ new Map([[`Bags`,Vm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
611
611
  (***************************************************************************)
612
612
  (* The two definitions in this standard module are overridden by TLC in *)
613
613
  (* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
@@ -1667,7 +1667,7 @@ _TLCTrace ==
1667
1667
  /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1668
1668
 
1669
1669
  =============================================================================
1670
- `]]),jm=new Map([...[...Am].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,km.replace(`
1670
+ `]]),Um=new Map([...[...Hm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Vm.replace(`
1671
1671
  LOCAL INSTANCE Naturals
1672
1672
  `,`
1673
1673
  EXTENDS TLC
@@ -1759,7 +1759,7 @@ _TEPosition ==
1759
1759
  ELSE TLCGet("level") + 1
1760
1760
 
1761
1761
  =============================================================================
1762
- `]]),Mm=(e=`master`)=>e===`1.7.4`?jm:Am,Nm=(t,n,r)=>new e.C(`Applying ${t} to the following value,\nwhich is not ${n}:\n${I(r)}`),Pm=e=>A(e)?F(e):void 0,Fm=(e,t,n)=>{let r=L(e,t,n),i=Pm(r);if(!i)throw Nm(n,`a function with a finite domain`,r);return i},Im=(e,t,n)=>{let r=L(e,t,n),i=Pm(r);if(!i)throw Yr(t===0?`first`:`second`,n,`bag`,r);return i},Lm=(e,t)=>{if(!O(e)||!M(e))throw t();return N(e).elements},Rm=e=>e.range.every(e=>typeof e==`number`&&e>0),zm=(e,t)=>{let n=e.domain.findIndex(e=>Ot(e,t));return n===-1?void 0:e.range[n]},Bm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Vm=Bm(`BagDiff`,`tlc2.value.impl.Value`,2),Hm=Bm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Um=Bm(`BagUnion`,`tlc2.value.impl.Value`,1),Wm=Bm(`BagOfAll`,`tlc2.value.impl.Value`,2),Gm=Bm(`BagCup`,`tlc2.value.impl.Value`,2),Km=Bm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),qm=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${hi(e)}`;throw _i(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Jm=(e,t,n)=>{let r=qm(e,n)+qm(t,n);if(li(r))throw ui(`${e}+${t}`);return r},Ym=(e,t,n,r)=>{let i=zm(n,e.domain[t]),a=qm(e.range[t],r);return i===void 0?a:a-qm(i,r)|0},Xm=(e,t)=>gn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Ot(e[0],r));a?a[1]=Jm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Zm=gt([],[]),Qm=t=>[ai(`EmptyBag`,Zm),R(`IsABag`,1,e=>{let t=Pm(L(e,0,`IsABag`));return t!==void 0&&Rm(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return Fm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Nm(`BagCardinality`,`a bag`,t);return Jm(e,n,Km)},0)}),R(`BagIn`,2,e=>{let t=L(e,1,`BagIn`),n=zm(Fm(e,1,`BagIn`),L(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Yr(`second`,`BagIn`,`bag`,t);return n>0}),R(`CopiesIn`,2,e=>{let t=L(e,1,`CopiesIn`),n=zm(Fm(e,1,`CopiesIn`),L(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Yr(`second`,`CopiesIn`,`bag`,t);return n}),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Im(e,t,`(+)`);if(!Rm(n))throw Yr(t===0?`first`:`second`,`(+)`,`bag`,L(e,t,`(+)`));return n});return Xm(t,Gm)}),R(`\\ominus`,2,e=>{let t=Im(e,0,`(-)`),n=Im(e,1,`(-)`);return gn(t.domain.flatMap((e,r)=>{let i=Ym(t,r,n,Vm);return i>0?[[e,i]]:[]}))}),R(`BagUnion`,1,t=>{let n=L(t,0,`BagUnion`),r=Lm(n,()=>Nm(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Zm;let i=r.map(t=>{let r=Pm(t);if(!r)throw new e.C(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(n)}`);return r});return Xm(i,Um)}),R(`\\sqsubseteq`,2,e=>{let t=Fm(e,0,`\\sqsubseteq`),n=Fm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Ym(t,r,n,Hm)<=0)}),oi(`BagOfAll`,2,t=>{let n=ii(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.C(`The first argument of BagOfAll should be an operator, but instead it is:\n${I(n.literalBody)}`);let r=L(t,1,`BagOfAll`),i=Pm(r);if(!i)throw Yr(`second`,`BagOfAll`,`function with a finite domain`,r);return Xm(i.domain.map((e,t)=>gt([n.call([e])],[i.range[t]])),Wm)}),R(`SubBag`,1,n=>{let r=L(n,0,`SubBag`);if(!A(r))throw new e._(`DOMAIN expects a function but received ${I(r)}`);let i=F(r),a=un(i.range).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e._(`Attempted to apply a function to ${I(i)}, which is not in its domain`);return un(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>gt(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>hr(Fm(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=Lm(t,()=>Nm(`BagToSet`,`a function with a finite domain`,t));return gt([...n],n.map(()=>1))})],$m=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,eh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,th=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,nh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,rh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,ih=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,ah=e=>{if(!A(e))return!1;let t=F(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},oh=(e,t)=>_i(e,`Cannot convert value: unsupported value type tlc2.value.impl.${hi(t)}`),sh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),ch=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw oh(t,e);return`[${N(e).elements.map(e=>uh(e,t)).join(`,`)}]`},lh=(e,t)=>{let n=F(e),r=Qn(n);return r?`[${r.map(e=>uh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${sh(typeof e==`string`?e:I(e))}:${uh(n.range[r],t)}`).join(`,`)}}`},uh=(e,t)=>typeof e==`string`?sh(e):typeof e==`object`?e.kind===`ModelValue`?sh(e.name):O(e)?ch(e,t):lh(e,t):String(e),dh=e=>{if(O(e))return ch(e,$m);if(!A(e)||ah(e))throw oh($m,e);return lh(e,$m)},fh=e=>{if(!A(e))throw oh(eh,e);return lh(e,eh)},ph=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},mh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return rt(e);if(Array.isArray(e))return En(e.map(e=>mh(e,t)));if(typeof e==`object`&&e)return Dn(Object.entries(e).map(([e,n])=>[rt(e),mh(n,t)]));throw _i(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},hh=(e,t)=>{if(e.trim()===``)return mh(null,t);try{return mh(JSON.parse(e,(e,t,n)=>typeof t==`number`?ph(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?_i(t,e.message):e}},gh=(e,t)=>{if(typeof e!=`string`)throw _i(t,`Cannot cast tlc2.value.impl.${hi(e)} to tlc2.value.impl.StringValue`);return e},_h=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw _i(n,`${t} (No such file or directory)`);return r},vh=e=>[si(`ToJson`,1,e=>rt(uh(L(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),si(`ToJsonArray`,1,e=>rt(dh(L(e,0,`ToJsonArray`)))),si(`ToJsonObject`,1,e=>rt(fh(L(e,0,`ToJsonObject`)))),si(`JsonSerialize`,2,t=>{let n=gh(L(t,0,`JsonSerialize`),th),r=L(t,1,`JsonSerialize`);if(!Qn(r)&&!ah(r))throw Yr(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,uh(r,th)),!0}),si(`ndJsonSerialize`,2,t=>{let n=gh(L(t,0,`ndJsonSerialize`),nh),r=L(t,1,`ndJsonSerialize`),i=Qn(r);if(!i)throw Yr(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${uh(e,nh)}\n`).join(``)),!0}),si(`JsonDeserialize`,1,t=>{let n=gh(L(t,0,`JsonDeserialize`),rh);return hh(_h(e,n,rh),rh)}),si(`ndJsonDeserialize`,1,t=>{let n=gh(L(t,0,`ndJsonDeserialize`),ih);return En(_h(e,n,ih).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>hh(e,ih)))})],yh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,bh=1e6,xh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Yr(t,n,`nonnegative integer`,e);return e},Sh=(e,t,n,r)=>un(Array.from({length:t},()=>un(e.filter(()=>r.nextDouble()<n)))),Ch=(e,t)=>{let n=`RandomSetOfSubsets`,r=xh(L(e,0,n),`first`,n),i=xh(L(e,1,n),`second`,n),a=L(e,2,n);if(!O(a)||!M(a))throw Yr(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw Yr(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Yr(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Sh(o,r,o.length===0?0:i/o.length,t.getRandom())},wh=e=>[si(`RandomSubset`,2,t=>{let n=L(t,0,`RandomSubset`);if(typeof n!=`number`)throw Yr(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw _i(yh,String(n));let r=L(t,1,`RandomSubset`);if(!O(r)||!P(r)&&!M(r))throw Yr(`second`,`RandomSubset`,`a finite set`,r);let i=Sm(r,e.version);if(i&&i.reduce((e,t)=>e*N(t).elements.length,1)>bh)throw _i(yh,`Attempted to construct a set with too many elements (>${bh}).`);return un(Cm(n,r,e.getRandom(),e.version))}),si(`RandomSetOfSubsets`,3,t=>Ch(t,e)),si(`TestRandomSetOfSubsets`,3,t=>En(Array.from({length:5},()=>N(Ch(t,e)).elements.length)))],Th=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Eh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Th})`,Dh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Th}) throws java.io.IOException`,Oh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Th})`,kh=e=>Dn([[`name`,e??`UnnamedAction`],[`location`,Dn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Ah=(e,t,n)=>{let r=e.map((e,t)=>En([t+1,Dn(Object.entries(e))])),i=r.slice(1).map((e,n)=>En([r[n],t[n],e])),a=n?[En([r[r.length-1],n.action,r[n.start]])]:[];return Dn([[`action`,un([...i,...a])],[`state`,un(r)]])},jh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Om(e).get(t)},Mh=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),I(i));else throw new e.C(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(r)}`)},Nh=e=>e.every(e=>e!==void 0),Ph=(e,t)=>Dn(t.variables.map((t,n)=>[t,e[n]])),Fh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!E(e)){if(t.variableIndex.has(r))return!0;let e=gl(r,t);if(e&&!n.has(e)&&(n.add(e),Fh(e.body,t,n)))return!0}return T(e).some(e=>Fh(e,t,n))},Ih=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[R(`AssertEq`,2,e=>{let n=L(e,0,`AssertEq`),r=L(e,1,`AssertEq`),i=Ot(n,r);return i||(t(I(`Assertion failed`,!0)),t(I(n,!0)),t(I(r,!0))),i}),wi(`AssertError`,2,t=>{let r=ii(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw _i(Eh,`In computing AssertError, a non-string expression (line ${r.location.line}, col ${r.location.column}) was used as the err of an AssertError(err, exp).`);let i=Ti(t,0,`AssertError`)();try{Ti(t,1,`AssertError`)()}catch(t){if(t instanceof e._)return ea(t.message,n.isTool)===i;throw t}return!1}),si(`TLCGetOrDefault`,2,e=>{let t=L(e,0,`TLCGetOrDefault`);return jh(n,t)??L(e,1,`TLCGetOrDefault`)}),{...oi(`TLCGetAndSet`,4,e=>{let r=L(e,0,`TLCGetAndSet`),i=jh(n,r)??L(e,3,`TLCGetAndSet`),a=ii(e,1,`TLCGetAndSet`);return Mh(n,t,r,a.call([i,L(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},si(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!Nh(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw _i(Dh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return En(n.getBehavior(r).map(e=>Ph(e,t.environment)))}),si(`CounterExample`,0,()=>n.counterExample??Dn([[`action`,un([])],[`state`,un([])]])),R(`ToTrace`,1,t=>{let n=L(t,0,`ToTrace`);if(!A(n)||!Ot(hr(n),un([`action`,`state`])))throw new e._(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(n)}`);let r=N(pr(n,`state`)).elements.map(e=>Qn(e)??[]);return En(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),R(`TLCModelValue`,1,t=>{let n=L(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.C(`The argument of ModelValue should be a string, but instead it is:\n${I(n)}`);return mt(n)}),wi(`TLCDefer`,1,()=>!0),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),wi(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!Nh(i))throw _i(Oh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||hl(Ti(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.A(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),wi(`TLCCache`,2,(e,t)=>{let n=ii(e,0,`TLCCache`),i=Lr(Ti(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Fh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?a(t.state):r,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(i);if(l!==void 0)return l;let u=n.call([]);return c.set(i,u),u}),R(`TLCFP`,1,e=>Number(BigInt.asIntN(32,rm([L(e,0,`TLCFP`)])))),si(`TLCEvalDefinition`,1,(t,n)=>{let r=L(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?gl(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.C(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.C(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return V({kind:`Identifier`,name:r,location:i.location},n)})]},Lh=(e,t)=>[si(`_Track`,2,e=>{let n=String(L(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,L(e,0,`_Track`)===!0?r+1:r),!0}),si(`_Counts`,0,()=>Dm(t)),si(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(Dm(t),!0)),!1)}),si(`_PrintCounts`,0,()=>(e(I(Dm(t),!0)),!0))],Rh=e=>String(e).padStart(2,`0`),zh=e=>`${e.getUTCFullYear()}.${Rh(e.getUTCMonth()+1)}.${Rh(e.getUTCDate())}.${Rh(e.getUTCHours())}${Rh(e.getUTCMinutes())}${Rh(e.getUTCSeconds())}`,Bh=e=>gn([...e].map(([e,t])=>[e,En([t])])),Vh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Hh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Uh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Wh=(t,n,r)=>{if(t.version===`1.7.4`?!Hh.has(n)||!t.isStarted&&Uh.has(n):!t.isStarted&&Vh.has(n))throw new e.C(`TLCGet(${n}) was undefined.`);let i=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return i;case`stats`:return Dn([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Dn([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return Dn([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,rt(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,rt(zh(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return kh(void 0);case`all`:return Bh(t.registers);case`all:named`:return Bh(Om(t))}if(n.startsWith(`s:`)){let r=Om(t).get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return rt(t.properties.get(n.slice(2))??n);throw new e.C(`TLCGet(${n}) was undefined.`)},Gh=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.C(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(n)}`);return Wh(t,n,r?.state)},Kh=e=>e.length===0?[[]]:e.flatMap((t,n)=>Kh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),qh=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(qh),e.kind===`Function`&&e.range.forEach(qh))},Jh=(t,n)=>[R(`Print`,2,e=>(t(`${D(I(L(e,0,`Print`),!0,!0))} ${D(I(L(e,1,`Print`),!0,!0))}`),L(e,1,`Print`))),R(`PrintT`,1,e=>(t(D(I(L(e,0,`PrintT`),!0,!0))),!0)),R(`Assert`,2,t=>{if(L(t,0,`Assert`)!==!0)throw new e.C(`The first argument of Assert evaluated to FALSE; the second argument was:\n${D(I(L(t,1,`Assert`)))}`,e.W.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>gn([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=ri(e,0,`@@`),n=ri(e,1,`@@`);return _n([...We(t),...We(n)])}),R(`ToString`,1,e=>rt(I(L(e,0,`ToString`),!0))),R(`TLCEval`,1,e=>{let t=L(e,0,`TLCEval`);return qh(t),t}),R(`Permutations`,1,e=>{let t=ti(e,0,`Permutations`);return un(Kh(t).map(e=>gn(t.map((t,n)=>[t,e[n]]))))}),oi(`SortSeq`,2,e=>{let t=ii(e,1,`SortSeq`);return En(ni(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?vi({...si(`TLCGet`,1,(e,t)=>Gh(n,L(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):vi(wi(`TLCGet`,1,(e,t)=>Gh(n,Ti(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),si(`TLCSet`,2,e=>{let r=L(e,0,`TLCSet`);return Mh(n,t,r,L(e,1,`TLCSet`)),!0}),ai(`Any`,ut),R(`RandomElement`,1,e=>Tm(ei(e,0,`RandomElement`),n.getRandom()))],Yh=(e,t)=>e.every(e=>nr(e,t)),Xh=un([!1,!0]),Zh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return hn(Zh(e,t,r),Zh(e,r,n))},Qh=[`\\cup`,`\\cap`,`\\`],$h=e=>typeof e==`object`&&e.kind===`MixedSet`,eg=(e,t,n)=>{let r=t.kind===`Interval`?N(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return dn(r.filter(e=>nr(e,n)===t))}if(r.length===0)return n;if(!k(n))return wt({kind:`SetOperation`,operator:e,left:t,right:n});let i=N(n).elements.filter(e=>!nr(e,t));return dn([...r,...i])},tg=[ai(`TRUE`,!0),ai(`FALSE`,!1),ai(`BOOLEAN`,Xh),ai(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ci(`=`,cn),ci(`#`,(e,t)=>!cn(e,t)),R(`~`,1,e=>!Qr(e,0,`~`)),R(`<=>`,2,e=>Qr(e,0,`<=>`)===Qr(e,1,`<=>`)),R(`/\\`,2,e=>Qr(e,0,`/\\`)&&Qr(e,1,`/\\`)),R(`\\/`,2,e=>Qr(e,0,`\\/`)||Qr(e,1,`\\/`)),R(`=>`,2,e=>!Qr(e,0,`=>`)||Qr(e,1,`=>`)),R(`\\in`,2,e=>nr(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!nr(L(e,0,`\\notin`),L(e,1,`\\notin`))),R(`\\subseteq`,2,e=>{let t=$r(e,0,`\\subseteq`),n=L(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&M(t.base)?Yh(N(t.base).elements,n.base):Yh(N(t).elements,n)}),...Qh.map(e=>R(e,2,t=>{let n=L(t,0,e),r=L(t,1,e);if(k(n)&&k(r)&&!$h(n)&&!$h(r)){if(e===`\\cup`&&P(n))return r;let t=e===`\\cup`?hn:e===`\\cap`?mn:pn;return tr((e,n)=>t(N(e),N(n)),(t,n)=>eg(e,t,n),n,r)}return k(n)?eg(e,n,r):e!==`\\`&&k(r)?eg(e,r,n):wt({kind:`SetOperation`,operator:e,left:n,right:r})})),R(`SUBSET`,1,e=>({kind:`Subset`,base:L(e,0,`SUBSET`)})),R(`UNION`,1,e=>{let t=$r(e,0,`UNION`),n=ze(t)?t.elements.filter(ze):[];if(!ze(t)||n.length!==t.elements.length)return wt({kind:`Union`,base:t});if($h(t)||n.some($h)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{nr(t,e)||e.elements.push(t)})),dn(e.elements)}return n.length===0?fn:Zh(n.map(N),0,n.length)}),R(`DOMAIN`,1,t=>{let n=L(t,0,`DOMAIN`);if(!A(n))throw new e._(`DOMAIN expects a function but received ${I(n)}`);return hr(n)})],ng=bi(`Integers`,`Neg`,`IntValue`,1),rg=t=>{let n=bi(t,`DotDot`,`IntervalValue`,2);return[xi(t,`+`,`Plus`,(e,t)=>e+t),xi(t,`-`,`Minus`,(e,t)=>e-t),xi(t,`*`,`Times`,(e,t)=>e*t),xi(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.C(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.C(`0^0 is undefined.`);return t**n}),xi(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.C(`The second argument of \\div is 0.`);if(t===`Naturals`){let e=Math.trunc(n/r)|0;return e<0&&Math.imul(e,r)!==n?e-1:e}let i=Math.floor(n/r);if(li(i))throw ui(`${n} \\div ${r}`);return i}),xi(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.C(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),R(`..`,2,e=>({kind:`Interval`,low:yi(L(e,0,`..`),n),high:yi(L(e,1,`..`),n)}))]},ig=rg(`Naturals`),ag=rg(`Integers`),og=e=>{let t=ig.indexOf(e);return t===-1?void 0:ag[t]},sg=[ai(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...ig,Ci(`<`,(e,t)=>e<t),Ci(`>`,(e,t)=>e>t),Ci(`<=`,(e,t)=>e<=t),Ci(`>=`,(e,t)=>e>=t,`>`)],cg=[ai(`Int`,{kind:`InfiniteSet`,name:`Int`}),...ag,Ci(`>=`,(e,t)=>e>=t),R(`-.`,1,e=>{let t=yi(L(e,0,`-`),ng);if(li(-t))throw ui(`-${t}`);return-t})],lg=(t,n,r)=>{let i=L(t,n,r),a=Qn(i);if(!a)throw new e.C(`${r}\n${I(i)}`);return a},ug=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:lg(e,t,n)},dg=(e,t,n)=>typeof e==`string`?rt(e.slice(t,n)):En(e.slice(t,n)),fg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,pg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,mg=(e,t)=>{let n=Kd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?vi(e,t):e}):t},hg=t=>mg(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>ug(e,0,fg(``,`Len`)).length),R(`\\o`,2,t=>{let n=ug(t,0,pg(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=lg(t,1,pg(`t \\o s`,`sequence`));return En([...n,...e])}let r=L(t,1,`\\o`);if(typeof r!=`string`)throw new e.C(`${pg(`t \\o s`,`string`)}\n${I(r)}`);return rt(n+r)}),R(`Append`,2,e=>En([...lg(e,0,pg(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(e,1,`Append`)])),R(`Head`,1,t=>{let n=lg(t,0,fg(``,`Head`));if(n.length===0)throw new e.C(`Attempted to apply Head to the empty sequence.`);return n[0]}),R(`Tail`,1,t=>{let n=ug(t,0,fg(``,`Tail`));if(n.length===0)throw new e.C(`Attempted to apply Tail to the empty sequence.`);return dg(n,1)}),R(`SubSeq`,3,t=>{let n=ug(t,0,fg(`first `,`SubSeq`)),r=Zr(t,1,`SubSeq`),i=Zr(t,2,`SubSeq`);if(r>i)return dg(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.C(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return dg(n,r-1,i)}),oi(`SelectSeq`,2,e=>{let t=ii(e,1,`SelectSeq`);return En(lg(e,0,fg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw Yr(`second`,`SelectSeq`,`operator`,n);return n}))})]),gg=t=>mg(`FiniteSets`,[R(`IsFiniteSet`,1,t=>{let n=L(t,0,`IsFiniteSet`);if(O(n))return Xn(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e._(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${I(n)}\nis a finite set.`:`Attempted to check if the ${Be(n)} ${I(n)} is a finite set.`)}),R(`Cardinality`,1,n=>{let r=L(n,0,`Cardinality`);if(!O(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.C(`Attempted to compute cardinality of the value\n${I(r)}`);return Jn(r,t)})]),_g=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),vg=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:sg};case`Integers`:return{extends:[`Naturals`],operators:cg};case`Sequences`:return{extends:[],operators:hg(n.version)};case`FiniteSets`:return{extends:[],operators:gg(n.version)};case`TLC`:return{extends:[],operators:mg(`TLC`,Jh(t,n))};case`Randomization`:return{extends:[],operators:wh(n)};case`_Possible`:return{extends:[],operators:Lh(t,n)};case`Json`:return{extends:[],operators:vh(r)};case`Bags`:return{extends:[],operators:Qm(i)};case`TLCExt`:return{extends:[],operators:Ih(t,n)};default:return}},yg=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),bg={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]}},xg=(e,t)=>{let n=bg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Sg=`$subexpression`,Cg=(t,n)=>new e.O(`${t} at line ${n.line}, column ${n.column}`),wg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return wg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of T(e)){let e=wg(r,t,n);if(e)return e}},Tg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Eg=(e,t)=>{let n=e.location,r=Tg(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw Cg(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw Cg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Sg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Sg,args:e.args,location:n,resolution:va},location:n}},Dg=(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:va})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:va}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:va};return Eg({...t,params:[...t.params,...r]},a)},Og=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s={index:0,current:void 0,isFailed:!1},c=(n,i)=>{if(!n)throw Cg(i,a);ba.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.z(n),message:i}}),s.isFailed=!0},l=e=>{let r=[],i=[];for(;s.index<t.length;){let o=t[s.index];if(o.kind!==`Name`)throw Cg(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Ho(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw Cg(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=Ta(u),f=s.index===t.length-1;if(n.args.length!==d&&(!i||n.args.length!==0))return c(r.argumentRanges?.[s.index]??a.range,`The operator ${n.name} requires ${d-n.earlier} arguments.`);if(f)return{definition:u,args:n.args};if(u.kind!==`Operator`)throw Cg(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),s.current=u.body,s.index++},d=()=>{for(;s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&wg(s.current,e.name,[]);if(!a)return c(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return c(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),s.current=a.label.body,s.index++}},f=e=>{let n=s.current;if(!n)throw Cg(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(e);return}if(n.kind===`Let`){if(e.kind!==`Operand`||Ka(e.operand,1)!==0)throw Cg(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=Xa(n);if(r&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),s.current=r.body;return}if(n.kind===`Case`&&e.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[Ka(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw Cg(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=Ka(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Cg(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw Cg(`Unexpected subexpression selector`,a);let i=r?r.sets:Za(n),c=i?.[Ka(e.operand,i.length)];if(!c)throw Cg(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return Dg(p.definition,{...o,args:p.args});for(d();s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw Cg(`A name selector here must be from a LET clause`,a);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return r;if(e)return Dg(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw Cg(`Subexpression selection failed`,a);return Eg(o,s.current)},kg=(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 qa(e,t,n)},Ag=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||T(e).some(Ag),jg=(e,t,n,r=!1)=>{if(!Ag(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Go(e,e=>jg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Mg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>jg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Go(e,e=>jg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?kg(a.name,[],void 0,t):a.kind===`Apply`?kg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Og(o,t,a,r);return c!==a&&ya.add(c),c},Mg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:jg(e.expression,t,n,!0)}))}),Ng=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Pg=(e,t)=>Mg(e,Ng(t.definitions),()=>!1),Fg=(e,t)=>{let n=Ng([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>jg(e,n,i),o=e=>i(e)||!n(e),s=e=>jg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Mg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Mg(e,n,o):Wo(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>Ag(e.body))||e.assumptions.some(e=>Ag(e.expression))?{...p,definitions:e.definitions.map(e=>Wo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Ig=(e,t)=>`${e}${t}`,Lg=(e,t,n)=>`${e}${t}${n}`,Rg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},zg=(e,t,n)=>`${e},${t},${n}`,Bg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Vg=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Hg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Ug=(e,t,n,r)=>({...Bg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Wg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Gg=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Kg=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Ug(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),qg=Ug(`$Set`,0,[2],[1]),Jg=Ug(`$Junction`,0,[3],[1]),Yg=Ug(`$Choose`,0,[2],[1]),Xg=Ug(`$Function`,0,[3],[1]),Zg=Ug(`$FcnApply`,0,[2,2],[1,1]),Qg=Ug(`$RcdSelect`,0,[2,0],[1,1]),$g=Ug(`'`,2,[1],[0]),e_=Ug(`ENABLED`,1,[2],[0]),t_=Ug(`[]`,3,[3],[0]),n_=Ug(`$SquareAct`,2,[2,1],[0,0]),r_=Ug(`$WF`,3,[1,2],[0,0]),i_=Ug(`$TemporalExists`,3,[3],[0]),a_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),o_=e=>e.map(e=>({name:e,arity:0})),s_=(t,n)=>n.location.range?e.L(`${t}.`,n.location.range):new e.O(`${t} at line ${n.location.line}, column ${n.location.column}`),c_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),l_=e=>e.kind!==`Let`&&e.kind!==`Label`,u_=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:g(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=g(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Kg.get(e)??yg.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Bg(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(Lg(e,n,t))}),t.data.constraints.forEach((e,t)=>Vg(r.constraints,t,e)),Hg(r.argConstraints,Ig(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Hg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>Wg(t,r))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.O(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(zg(e,n,r)),c=Bg(Math.max(t.level,...n.filter((e,n)=>Gg(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)=>{Gg(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)=>Vg(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Vg(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Vg(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Vg(c.constraints,e,Wg(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Vg(c.constraints,e,Wg(r,a)))}))}),t.argParams.forEach(e=>{let t=Rg(e),n=o(t.operator)?.operator;n&&Vg(c.constraints,t.param,Wg(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Hg(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>Hg(c.argConstraints,Ig(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Hg(c.argConstraints,Ig(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=Rg(e),n=o(t.operator);n&&Hg(c.argConstraints,Ig(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Rg(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Rg(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(Lg(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(Lg(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(Lg(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=te(`LAMBDA`,o_(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Bg();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=a_(n,o_(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw s_(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw s_(`Action used where only temporal formula or state predicate allowed`,e);c_.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&l_(n)&&n.kind!==r)throw s_(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=g(e,n);t.constraints.forEach((e,t)=>Vg(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Hg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.O)||n.sany?n:s_(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Bg();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Jg,n)}case`Prime`:case`Unchanged`:return c($g,[e.expression],t);case`Enabled`:return c(e_,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(t_,[n])}case`If`:return c(Jg,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Jg,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(Jg,[e.body],t,e.bounds.map(e=>e.set),La(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw s_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?i_:Jg,[e.body],t,[],e.names);case`Choose`:return c(Yg,[e.body],t,e.set?[e.set]:[],Ia(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(qg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(qg,[e.predicate],t,[e.bound.set],Ia(e.bound.pattern));case`SetMap`:return c(qg,[e.expression],t,e.bounds.map(e=>e.set),La(e.bounds));case`FunctionConstruction`:return c(Xg,[e.body],t,e.bounds.map(e=>e.set),La(e.bounds));case`Record`:return c(Xg,e.fields.map(e=>e.value),t);case`RecordSet`:return c(qg,e.fields.map(e=>e.value),t);case`Except`:return c(qg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Zg,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(qg,e.args,t)}]);case`Bracket`:return Bg();case`FieldAccess`:return a(Qg,[o(e.record,t),{data:Bg()}]);case`BoxAction`:case`AngleAction`:return c(n_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(r_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Bg()}},ee=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>ee(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return T(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,a_(t,o_(e.names))),i;default:return Go(e,(e,r)=>(a(e,n,a_(t,o_(r))),e)),i}},te=(e,t,n,r)=>{let i=a_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=ee(n,i),c={...Bg(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(Ig(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(Lg(e.name,n,t.name))).map(e=>zg(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(Rg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Rg(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},g=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Bg(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=te(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:g,toOperand:o}},d_=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?d_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Bg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Vg(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Hg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},f_=(t,n,r,i)=>{let a=u_(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`?d_(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.z(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.z(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Fo([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?d_(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.I(r)}})),...r],i);if(u.length>0)throw e.I(u,!1,void 0,i)},p_=(e,t)=>e.maxLevels[t]??3,m_=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=u_({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=>Vg(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Vg(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Hg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Rg(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)&&Vg(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(d_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.z(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(Ig(e.name,i));a!==void 0&&p_(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=Rg(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=p_(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.I([...i.values()])}},h_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],g_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),__=new Map(Bd.flatMap(e=>e.map(t=>[t,e[0]]))),v_=e=>__.get(e)??e,y_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},b_=()=>{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}}},x_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:y_(e)&2147483647,kind:t,isLocal:n}),S_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:v_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:v_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},C_=(e,t)=>{let n=[];for(let r=t;;){let t=S_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},w_=e=>({line:e.line,column:e.column}),T_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=C_(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},E_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,D_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},O_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&E_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&E_(e[n+1],e[n+2])?n+=E_(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=>D_[e])}"`:r.text)}return t},k_=e=>e[2]?.text,A_=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},j_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>j_(e.modules,t)).find(Boolean),M_=e=>{let t=e===void 0?[]:oe(e),n={module:void 0};return{tokens:t,ranges:A_(t),getModule:()=>n.module??=e===void 0?Vp(``):Hp(e,t)}},N_=/* @__PURE__ */ new Map,P_=(e,t)=>{let n=N_.get(e);if(n)return n;let r=M_(t);return N_.set(e,r),r},F_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(Wd.has(i)?t?.(i):void 0)??Gd.get(i)??t?.(i)??zp(e,i),s=i!==void 0&&o!==void 0&&o===Gd.get(i),{tokens:c,ranges:l,getModule:u}=s?P_(i,o):M_(o),d=l.get(k_(c)??``)??{start:0,end:0},f={tokens:c,...d,isTlcSource:s,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,isTlcSource:!1,getModule:()=>j_(f.getModule().modules,t)??f.getModule()})}),f};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},I_=/* @__PURE__ */ new Map,L_=e=>{let t=/* @__PURE__ */ new Map,n=r=>{let i=t.get(r);if(i!==void 0)return i;t.set(r,!1);let a=e(r),o=a.isTlcSource?a.getModule():void 0,s=o!==void 0&&o.extends.every(e=>n(e))&&o.instances.every(e=>n(e.module));return t.set(r,s),s},r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],o=(e,n)=>{let i=C_(t,e+1);r.push({location:w_(t[e]),apply:e=>i.forEach(t=>e.put(x_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,a)=>{let l=e.start+a,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:w_(u),apply:t=>t.put(x_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&C_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),g_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(w_(u)),r.push({location:w_(u),apply:e=>e.put(x_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(x_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=v_(e.name);r.push({location:e.location,apply:n=>n.put(x_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=a(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...i,...o].forEach(n=>{n.isLocal||t.put(x_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(x_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>wa(e.location,t.location)?-1:+!!wa(t.location,e.location))},i=/* @__PURE__ */ new Map,a=t=>{let o=t!==void 0&&n(t),s=i.get(t??``)??(o?I_.get(t):void 0);if(s)return s;let c=b_();i.set(t??``,c),zd.toReversed().forEach(e=>c.put(x_(e,`builtin`,!1)));let l=e(t);return l.getModule().extends.forEach(e=>a(e).inserted.forEach(e=>{e.isLocal||c.put(e)})),c.ownStart=c.inserted.length,r(l).forEach(e=>e.apply(c)),o&&I_.set(t,c),c};return{getContext:a,getOwnEntries:e=>{let t=a(e);return t.inserted.slice(t.ownStart)}}},R_=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),Vd.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=T_(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),ee=m(e=>e.instances),te=/* @__PURE__ */ new Set([void 0]),g=/* @__PURE__ */ new Map;O_(o(void 0)).forEach((e,t)=>{t===3&&Ud.forEach(i),i(e)});let _=l(void 0);for(;;){let n=h(_,/* @__PURE__ */ new Set)??ee(_,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),g.set(r.unit,[...g.get(r.unit)??[],a]),!te.has(a)){if(te.add(a),t(a).tokens.length===0){let n=r.unit??k_(t(void 0).tokens);throw e.F(a,n)}O_(o(a)).forEach(i)}}h_.forEach(i);let ne=/* @__PURE__ */ new Set,re=e=>{if(ne.has(e))return;ne.add(e);let t=g.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(re),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return re(void 0),Hd.forEach(i),[...r]},z_=(e,t)=>{let n=F_(e,t),r,i=()=>r??=L_(n);return{getRootModule:()=>n(void 0).getModule(),getStringOrder:e=>R_(n,e),getDeclarationOrder:e=>i().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=i();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},B_=t=>{switch(t.kind){case`Number`:if(!Ve(t.value))throw e.K(new e.C(`Integer overflow: ${t.value} is outside TLC's 32-bit range`),e.W.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return mt(t.name);case`Set`:return un(t.elements.map(B_))}},V_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],H_=(t,n)=>{try{return Vp(t)}catch(r){if(!(r instanceof e.O))throw r;let i=pp(t);throw i===void 0?r:e.I([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},U_=t=>new e.O(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),W_=(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)}.`},G_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,K_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:G_(e),q_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:as(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),J_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>I(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e._(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Ot(e,r)})});if(n)return n[1];throw new e._(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Y_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||T(e).some(e=>Y_(e,t)),X_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(es(e),n.get(e)??n.size)),n},Z_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Q_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw il(e);if(e.kind===`Number`&&!Ve(e.value))throw al(e);Q_(e.kind===`Let`?[...T(e),...Z_(e.instances??[])]:T(e))}),$_=(t,n)=>{let r=n.order??z_(n.source,n.loadModule),i=r.getRootModule(),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=new Map(tg.map(e=>[e.name,e])),u=/* @__PURE__ */ new Map,d=Em(t.checkDeadlock,n.seed);d.isWarningEnabled=n.isWarningEnabled??!0,d.isTool=n.isTool??!1,d.version=n.version??`master`;let f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],ee=/* @__PURE__ */ new Map,te=[],g=[],_=(e,t)=>te.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,v=[],ie=[],ae=m_(e=>{let t=m.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,le=e=>{let t=u.get(e);if(t)return t;let r=vg(e,n.print,d,n.files,l);if(!r)return;_g.get(e)?.forEach(le);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>le(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{l.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:yg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:xg(e,t.name)??i.get(t.name)?.range})}),u.set(e,i),i},y=e=>{if(Wd.has(e)&&n.loadModule?.(e)!==void 0)return;let t=le(e),r=_g.get(e)??[];return t&&_(e,r),t&&r.includes(`Integers`)&&le(`Integers`),t},ue=e=>(Q_([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Z_(e.instances)]),e.modules.forEach(ue),e);ue(i);let de=(t,r)=>{let i=n.loadModule?.(t)??Ne.get(t)??zp(n.source,t);if(i===void 0)throw e.F(t,r);let a=H_(i,t);if(a.name!==t)throw e.I([{location:`Unknown location`,message:`File name '${t}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return ue(a)},fe=t=>{let n=g.indexOf(t.name);if(n!==-1){let r=[...g.slice(n),t.name].map(e=>`${e}.tla`);throw new e.O(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];g.push(t.name),te.push(r);let s=ye(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:ie,levelChecks:o});if(te.pop(),g.pop(),a.length>0)throw e.I(a,!1,void 0,ie);let c=i.find(e=>r.has(e.name)),l=c&&f.get(c.name),u=l&&W_(c,l.module);if(u)throw e.I([u],!1,void 0,ie);if(c)throw U_(c);return o.forEach(e=>e()),{linked:s,closure:r}},pe=(e,t)=>{let r=f.get(e);if(r)return _(e,ee.get(e)??[]),r;let i=fe(de(e,t));return(Mm(d.version).has(e)?vg(e,n.print,d,n.files,l):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(l.set(t.key,e),a.delete(t.key))}),f.set(e,i.linked),ee.set(e,i.closure),_(e,i.closure),i.linked},b=(e,t,n,r,i)=>{let l=i?void 0:y(e.module);if(l)return x(e,l);let u=i??pe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=V_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Po(Pg(e,t),d,t,n);v.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=fs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,zo(t,p)])),variables:new Set(u.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=re(`${i}@${t.name}`),f=l(u);return a.set(u,f),d.length>0&&c.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:re});return S(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&ce.set(r,n),r})},x=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),S=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},C=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:os(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),me=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),he=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=me(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:os(r,n),location:n}}},ge=(e,t,n,r)=>{let i=e.location,s=r?void 0:y(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=me(n.arity);return C(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=V_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};v.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=>Y_(f(e),p),h=d.map(t=>{let n=he(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),ee=[],te=fs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:os(e.params,i),location:i,resolution:va}:as(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${ee.length}`,a=r(i);return ee.push(a.kind===`Operator`?{...a,name:i}:q_(a,i)),i},createName:re}),g=new Set(d.map(e=>e.name)),_=[...c.exported].filter(([e])=>!g.has(e)).map(([t,n])=>{let r=te.getKey(n.key),a=me(n.arity),o=[...e.params,...a];return C(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...ee,..._]},_e=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),ve=/* @__PURE__ */ new Map,ye=(t,r)=>{let s=Rd(t,n.loadClass?.(t.name),t===i);ve.set(t.name,s.overrides);let c=s.module,l=v.length,u=new Map([...tg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:ko,errors:[],warnings:[]},ee=[f],te=t=>t.forEach((t,n)=>{let r=g.get(n);if(!r){u.set(n,t),g.set(n,t);return}if(!r.range||!t.range||e.z(r.range)===e.z(t.range))return;let i=e.z(t.range),a=e.z(r.range);K_(r.kind)===K_(t.kind)?f.warnings.push({location:i,message:`Warning: the ${G_(r.kind)} of '${n}' conflicts with \nits ${G_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${G_(t.kind)} of '${n}' conflicts with \nits ${G_(r.kind)} at ${a}.`})}),g=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Set,ne=/* @__PURE__ */ new Map,re=[],oe=[...c.constants],se=c.variables.map(e=>e.name),le=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:y(e);if(n){te(n);return}let i=t??pe(e,c.name);oe.push(...i.constants.filter(e=>oe.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{se.includes(e)||(se.push(e),le.push(i.variableLocations[t]))}),te(i.exported),i.facts.forEach(e=>_.add(e)),i.modules.forEach((e,t)=>ne.set(t,e)),re.push(i)});let ue=new Map(u),de=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],fe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});de.forEach(e=>g.set(e.name,fe(e)));let C=e=>({key:he(e),arity:Ta(e),params:Ea(e),kind:Ao(c,e)?`Theorem`:`Definition`,range:e.location.range}),me=oe.length===0&&se.length===0,he=e=>c===i?e.name:`${e.name}@${r.id}`,be=/* @__PURE__ */ new Map,w=()=>new Map([...r.modules,...ne]),xe=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&wa(e.location,t.location)},Se=e=>{let t=c.modules.find(t=>t.name===e.module);return t?xe(t)?ne.get(t.name):void 0:w().get(e.module)},Ce=e=>({imported:u,getInstance:e=>{let t=Se(e),n=t?void 0:y(e.module);if(n)return{declarations:[],symbols:x(e,n),instancer:c.name};let r=t??pe(e.module,c.name),i=V_(r);return{declarations:i,symbols:S(e,r.exported,i,e=>e),instancer:c.name}},bound:ue,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:he,instanced:be,facts:_,reports:ee,warnings:r.warnings}),we=e=>[...de.filter(t=>wa(t.location,e)).map(e=>[e.name,fe(e)]),...c.definitions.filter(t=>wa(t.location,e)).map(e=>[e.name,C(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),Te=e=>{let t=w(),n=t.get(e.name),i=n&&W_(e,n.module);if(n&&!i)throw U_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};ee.push(a);let o=ye(e,{id:`${r.id}/${e.name}`,symbols:we(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||ne.set(e.name,o),p.has(e.name)||p.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=b(e,c,Ce(c),me,w().get(e.module));be.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||g.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>Te(e)}))].sort((e,t)=>wa(e.location,t.location)?-1:1).forEach(e=>e.link());let Ee=Fg(gs(c,(e,t)=>ge(e,t,c.name,Se(e))),_e(u));r.errors.push(...Io(Ee,Ce(Ee))),Ee.definitions.forEach(e=>{let t=he(e);a.set(t,e),o.set(t,!me);let n=C(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!wa(r,e.location))&&(u.set(e.name,n),e.isLocal||g.set(e.name,n))});let De={module:Ee,constants:oe,variables:se,variableLocations:le,visible:u,exported:g,modules:ne,extended:re,facts:/* @__PURE__ */ new Set([..._,...[...Ee.theorems,...Ee.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,De);let Oe=v.splice(l).map(e=>({location:e.location,check:()=>ae(e)}));return r.levelChecks.push(()=>f_(Ee,{constants:new Set(oe.map(e=>e.name)),variables:new Set(se),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>ce.get(u.get(e)?.key??e)},Oe,ie)),h.push(De),De},be=fe(i).linked;ie.length>0&&!n.isSanyReported&&n.print(e.B(ie));let w=e=>be.visible.get(e)?.key??e;be.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let xe=[],Se=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Se(e,t)),xe.push(...e.module.assumptions))};Se(be,/* @__PURE__ */ new Set);let Ce=be.constants.map(e=>e.name),we=be.variables,Te=e=>e.module===void 0?[e.name,w(e.name)]:e.module===i.name||Ce.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:be.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{l.set(e,t),a.delete(e),De.delete(e),Oe.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=B_(e.value);sn(t),Te(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let T=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=T.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.h(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(B_),B_(t.value)]),T.set(n,r)}),T.forEach(e=>Te(e).forEach(t=>ke(t,J_(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let E=new Map(t.substitutions.flatMap(e=>Te(e).map(t=>[t,w(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!Ce.includes(r)&&!be.visible.has(r))throw new e.h(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e.h(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let o=w(i),s=a.get(o);if(!(s!==void 0||l.has(o)||De.has(o)||Ce.includes(i)||we.includes(i)))throw new e.h(`The configuration file substitutes for ${r} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(be.constants.find(e=>e.name===r)?.arity??be.visible.get(r)?.arity))throw new e.h(`The configuration file substitutes for ${r} with ${i} of different number of arguments.`)});let Ae=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(Te)),je=(e,t)=>{if(Ae.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&je(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=je(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=C(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),be.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Me=Ce.filter(e=>!De.has(e)&&!E.has(e)&&!Oe.has(e));if(Me.length>0&&!n.isUnconfigured){let t=r.getDeclarationOrder(`constant`).find(e=>Me.includes(e))??Me[0];throw new e.h(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&l.forEach((e,t)=>{let n=og(e);n&&l.set(t,n)});let Pe={runtime:d,definitions:a,builtins:l,constants:De,substitutions:E,instanceNames:se,variables:we,variableIndex:X_(we,h.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:c,evaluators:/* @__PURE__ */ new WeakMap},Fe=u_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...we,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>l.has(e))]),getDefinition:e=>gl(e,Pe)}),Ie=t=>{try{V(t,{environment:Pe,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e._)return t;throw t}};E.forEach((t,n)=>{let r=a.get(t),i=Ce.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Fe.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ie(r.body):void 0;if(i){let r=Zi(i)?``:` - specifically: ${i.message}`;throw new e.h(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),d.version!==`1.7.4`&&(d.isStarted=!0);let Le=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),Re=r.createDefinitionOrder();return{environment:Pe,assumptions:xe,variableLocations:be.variableLocations,instanceActions:oe,startupDefinitions:h.filter(e=>!Le.has(e.module.name)||V_(e).length===0).flatMap(e=>Re(e===be?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:be.constants,rootSymbols:be.visible,javaOverrides:h.flatMap(e=>ve.get(e.module.name)??[])}},ev={kind:`Boolean`,value:!0},tv={kind:`Boolean`,value:!1},nv=e=>e?ev:tv,rv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,iv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),av=(e,t,n)=>({kind:e,operands:[t,n]}),ov=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?ov(e,t.operands).operands:[t])}),sv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return sv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,sv(t)),0)}},cv=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 cv(e.body);case`And`:case`Or`:return e.operands.some(cv)}},lv=/* @__PURE__ */ new WeakMap,uv={count:0},dv=e=>{let t=lv.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`#${uv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(dv).join(`,`)})`;default:return`${e.kind}(${dv(e.body)})`}})();return lv.set(e,n),n},fv=(e,t)=>e===t||dv(e)===dv(t),pv=(e,t)=>{let n=dv(t);return e.some(e=>e===t||dv(e)===n)},mv=e=>e===`And`?`Or`:`And`,hv=(e,t)=>{switch(e.kind){case`Boolean`:return t?nv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return hv(e.body,!t);case`And`:case`Or`:return ov(t?mv(e.kind):e.kind,e.operands.map(e=>hv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,hv(e.body,t))}}},gv=e=>{switch(e.kind){case`Boolean`:return nv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return ov(mv(e.kind),e.operands.map(gv));case`Always`:return $(`Eventually`,gv(e.body));case`Eventually`:return $(`Always`,gv(e.body));default:return $(`Not`,e)}},_v=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=_v(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return nv(t)}return n.length===0?nv(!t):n.length===1?n[0]:ov(e.kind,n)}case`Not`:{let t=_v(e.body);return t.kind===`Boolean`?nv(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=_v(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},vv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,yv=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=yv(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r.value*=t.operands.length,r.value>2147483647))throw new e._(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r.value===1)return{kind:`And`,operands:n};let i=Array.from({length:r.value},()=>[]),a={groups:1,repeat:r.value};for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}a.repeat/=e.operands.length;let t={value:0};for(let n=0;n<a.groups;n++)for(let n of e.operands)for(let e=0;e<a.repeat;e++)i[t.value++].push(n);a.groups*=e.operands.length}return{kind:`Or`,operands:i.map(e=>ov(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=yv(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=vv(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:ov(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return ov(`Or`,n)}case`Not`:return rv(t.body)?t:yv(gv(t.body));default:return t}},bv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?bv(e.operands[0]):ov(e.kind,e.operands.map(bv));case`Not`:return e.body.kind===`Not`?bv(e.body.body):$(`Not`,bv(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,bv(e.body));default:return e}},xv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return xv(e.operands[0]);let t=Math.floor(e.operands.length/2);return av(e.kind,xv(ov(e.kind,e.operands.slice(0,t))),xv(ov(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,xv(e.body));default:return e}},Sv=(e,t)=>{e.kind===`Eventually`&&!pv(t,e)&&t.push(e),`body`in e&&Sv(e.body,t),`operands`in e&&e.operands.forEach(e=>Sv(e,t))},Cv=e=>{let t=e.filter(iv),n=e.flatMap(e=>e.kind===`Not`&&iv(e.body)?[e.body]:[]);return!t.some(e=>pv(n,e))},wv=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,$(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e._(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},Tv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Ev=(e,t,n)=>e.flatMap(e=>{let r=Tv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Dv=e=>[...new Set(e.map(dv))].sort().join(`|`),Ov=(e,t)=>{let n=new Set(t.map(Dv));return[...e.filter(e=>!n.has(Dv(e))),...t]},kv=e=>{let t=wv(e),n=Ev(t,`Always`,`And`),r=Ev(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Tv(t,`Eventually`,`Or`);if(n&&!(pv(e,n.first)||pv(e,n.second)))return Ov(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(pv(e,t.first)||pv(e,t.second))&&!pv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Cv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Tv(t[e],`Always`,`And`);n&&(pv(t,n.first)||t.push(n.first),pv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)pv(t,e.first)&&pv(t,e.second)&&!pv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Cv(t)?[]:i(t)};return a(e)},Av=e=>({particle:e,successors:[],statePredicates:e.filter(e=>sv(e)<=1)}),jv=e=>{let t=kv([e]).map(Av),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Dv(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 kv(n)){let n=Dv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Av(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Mv=(e,t)=>!pv(e,t)||pv(e,t.body),Nv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&sv(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=vv(t);if(r){let e=sv(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(cv(t))throw new e._(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},Pv=(e,t)=>{let n=e.findIndex(e=>fv(e,t));return n===-1?(e.push(t),e.length-1):n},Fv=e=>{let t=yv(_v(hv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=bv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Nv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:ov(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:fv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&xv(e.formula),n=[];t&&Sv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Pv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Pv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Pv(i,e))}));return{tableau:t&&jv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Iv=()=>e.K(new e._(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.W.livenessEvaluationFailure),Lv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Rv=/* @__PURE__ */ new WeakMap,zv=/* @__PURE__ */ new WeakSet,Bv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Vv=(t,n)=>new e._(`TLC cannot handle the temporal formula ${Xc(t)}${n===void 0?``:`:\n${n}`}`),Hv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ll(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Hv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Hv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=gl(e,n);if(t)return Uv(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:E(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Go(e,(e,a)=>(i.value=Math.max(i.value,Hv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Lv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Uv=(e,t)=>{let n=Rv.get(e);if(n!==void 0)return n;Rv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Hv(e.body,void 0,t),...r.map(e=>Hv(e.set,void 0,t)));return Rv.set(e,i),i},Wv=(t,n)=>{try{return kl(t,n)}catch(t){if(!(t instanceof e._))throw t;if(!Zi(t))return;throw e.K(new e._(`${e.N}${t.message}`),e.W.error)}},Gv=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s)=>{let c=(e,t,n=s,c=a,l)=>Gv(e,t,r,i,c,o||l!==void 0&&r.substitutedDefinitions.has(l),n);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,n,Xc(e)));if(t.kind===`Label`)return c(t.body,n);if(t.kind===`Let`)return c(t.body,Kv(t,n,r));if(t.kind===`Identifier`){let i=E(t)?ll(n,t.name):void 0;if(i?.kind===`Thunk`)return c(i.expression,i.scope);let o=r.constants.has(t.name)?void 0:gl(t.name,r);if(!i&&o?.kind===`Operator`&&o.params.length===0&&Uv(o,r)>0){if(a.has(o))throw e.R();return c(o.body,void 0,o.name,/* @__PURE__ */ new Set([...a,o]),o)}}let l=Bv(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||Hv(t,n,r)===3)){let e=eu(t,l),n=E(t)?void 0:gl(t.operator,r);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&!o)return c(e.body,mu(e,t.args,l),t.operator,a,n)}let u=i&&t.kind===`Forall`&&t.bounds.every(e=>Hv(e.set,n,r)===0),d=u?Wv(t.bounds,l):void 0;if(u&&d){let e=[];if(Al(t.bounds,d,n,n=>(e.push(...c(t.body,n,Xc(t.body))),!1)),e.length===0)throw Iv();return e}return[{expression:t,scope:n,name:s}]},Kv=(e,t,n)=>{let r=gu(e.definitions,Bv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&zv.add(e.binding);return r},qv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?Hv(t,n,r):a;if(o===0){let i=V(t,Bv(r,n));if(typeof i!=`boolean`)throw new e._(`TLC expected a boolean value, but did not find one. ${Zc(t)}`);return nv(i)}return o===1?{kind:`State`,expression:t,scope:n}:{kind:`Action`,expression:t,unchanged:void 0,scope:n}},o={depth:0},s=(t,n,r,i)=>{if(o.depth>=100)throw e.R();o.depth++;let s=p(t,n);o.depth--;let c=sv(s);return c>2?s:a(r,i,c)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=Bv(r,t),o=E(e)||gl(n,r)===void 0?ll(t,n):void 0;if(o?.kind===`Thunk`&&zv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:E(e)?tu(n,a):Ql(n,r);if(c?.kind!==`Closure`)throw Vv(e);let u=e.kind===`Apply`?e.args:[],d=!E(e)&&gl(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>V(e,a)),s(c.body,mu(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.D||r&&!i;throw!(n instanceof e._)||a?n:Vv(t)}},u=(t,n)=>{let i=Hv(t,n,r);if(!t.bounds.every(e=>Hv(e.set,n,r)===0)){if(i<=2)return a(t,n,i);throw Vv(t)}let o=[],s=t.kind===`Forall`;try{jl(t.bounds,Bv(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e._)||r instanceof e.D)throw r;if(i<=2)return a(t,n,i);throw Vv(t,s&&!Zi(r)?r.message:void 0)}return o.length===0?nv(s):d(t,n,ov(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=sv(n);return r>2?n:a(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!E(e)||e.operator===`=>`),p=(e,t)=>{let n=Hv(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Kv(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,av(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!E(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,av(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,ov(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Hv(e.condition,t,r)===0){let n=V(e.condition,Bv(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,av(`Or`,av(`And`,n,p(e.consequent,t)),av(`And`,$(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,av(`Or`,i,a))):av(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Vv(e)}};return p(t,n)},Jv=(t,n,r,i,a)=>{let o=e=>Jv(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r={environment:i,scope:t.scope,state:n,next:void 0},o=t.kind===`State`?hl(V(t.expression,r),`a temporal property predicate`):zc(t.step,r);return a.set(t,o),o}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let e={environment:i,scope:t.scope,state:n,next:r};return t.unchanged&&hl(V(t.unchanged,e),`a subscript`)?!1:hl(V(t.expression,e),`an action predicate`)}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return Jv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e._(`TLC cannot evaluate a temporal formula in a single step`)}},Yv=(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)=>Yv(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 Jv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Xv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Zv=(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},Qv=t=>e.K(new e._(`${e.P}${t}`),e.W.error),$v=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!j(e)||!j(i))throw Qv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},ey=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(ey);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},ty=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,ny=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.h(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Qv(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>V(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!O(o)||!M(o))throw Qv(`The symmetry operator must specify a set of functions.`);let s=N(o).elements;if(!s.every(A))throw Qv(`The symmetry values must be function records.`);let c=s.map($v),l=i.body.kind===`Apply`?i.body.args:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=ey(ty(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Vi.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;c.forEach(e=>{e.size>0&&f.set(Xv(e),e)});let p=[...f.values()],m={start:0};for(;m.start<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m.start,t).forEach(e=>{let t=Zv(n,e),r=Xv(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),ee=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!ty(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||ee.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>j(e)&&h.has(e.name))})),f.size===0)return;let te=Math.max(256,Math.floor(4194304/f.size));return{permutations:[...f.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:te})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:te}},ry=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=oy(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(oy(e[r],t));return a}},iy=(e,t)=>{let n=[],r=[];for(let i of e){let e=oy(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(ft);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(ft(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},ay=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,oy=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=ay(e);if(n===0||n>64)return sy(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=sy(e,t),a=i!==e&&At(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},sy=(e,t)=>{let n=e.kind;if(n===`Set`){let n=iy(e.elements,t);return n?ht(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=ry(n.domain,t),i=ry(n.range,t)??n.range;if(r){let e=gn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?gt(n.domain,e.range):e}return i===n.range?n:gt(n.domain,i)}if(n===`Interval`||!O(e)||!M(e))return e;let r=N(e),i=ry(r.elements,t);return i?un(i):r},cy=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},ly=(e,t,n)=>e.images[t]??=oy(e.images[0],n.permutations[t-1]),uy=(e,t,n,r)=>{let i=cy(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=ft(ly(i,t,r),ly(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},dy=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?uy(i,t,n,r):0;if(o!==0)return o<0}return!1},fy=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>dy(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?ly(cy(e,t),r,t):e)},py={line:0,column:0},my=e=>({kind:`Identifier`,name:e,location:py}),hy=/* @__PURE__ */ new Set([`name`,`property`]),gy=(t,n,r)=>{let i=gl(n,r);if(!i)throw new e.h(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.h(hy.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},_y=(t,n,r)=>{if(bl(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return V(my(t),zy(r,void 0,void 0))}catch(t){if(t instanceof e._||e.U(t))return;throw t}},vy=(t,n,r)=>{let i=gy(t,n,r);if(_y(n,i,r)!==void 0)throw new e.h(`The ${t} ${n} cannot be a constant.`);return i},yy=(t,n,r)=>{let i=r.constants.has(n)?void 0:gy(t,n,r),a=i?_y(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.h(`The ${t} of ${n} is equal to ${I(a)}`);return a===void 0?i:void 0},by=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},xy=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Jl(e.startupDefinitions,r),t.invariants.forEach(e=>{yy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Sy=(t,n)=>{let r=u_({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>gl(e,n)});return t.flatMap(t=>{let i=yy(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1762
+ `]]),Wm=(e=`master`)=>e===`1.7.4`?Um:Hm,Gm=(t,n,r)=>new e.C(`Applying ${t} to the following value,\nwhich is not ${n}:\n${I(r)}`),Km=e=>k(e)?F(e):void 0,qm=(e,t,n)=>{let r=L(e,t,n),i=Km(r);if(!i)throw Gm(n,`a function with a finite domain`,r);return i},Jm=(e,t,n)=>{let r=L(e,t,n),i=Km(r);if(!i)throw Gr(t===0?`first`:`second`,n,`bag`,r);return i},Ym=(e,t)=>{if(!O(e)||!M(e))throw t();return N(e).elements},Xm=e=>e.range.every(e=>typeof e==`number`&&e>0),Zm=(e,t)=>{let n=e.domain.findIndex(e=>kt(e,t));return n===-1?void 0:e.range[n]},Qm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,$m=Qm(`BagDiff`,`tlc2.value.impl.Value`,2),eh=Qm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),th=Qm(`BagUnion`,`tlc2.value.impl.Value`,1),nh=Qm(`BagOfAll`,`tlc2.value.impl.Value`,2),rh=Qm(`BagCup`,`tlc2.value.impl.Value`,2),ih=Qm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),ah=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${di(e)}`;throw pi(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},oh=(e,t,n)=>{let r=ah(e,n)+ah(t,n);if(ai(r))throw oi(`${e}+${t}`);return r},sh=(e,t,n,r)=>{let i=Zm(n,e.domain[t]),a=ah(e.range[t],r);return i===void 0?a:a-ah(i,r)|0},ch=(e,t)=>_n(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>kt(e[0],r));a?a[1]=oh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),lh=vt([],[]),uh=t=>[ti(`EmptyBag`,lh),R(`IsABag`,1,e=>{let t=Km(L(e,0,`IsABag`));return t!==void 0&&Xm(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return qm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Gm(`BagCardinality`,`a bag`,t);return oh(e,n,ih)},0)}),R(`BagIn`,2,e=>{let t=L(e,1,`BagIn`),n=Zm(qm(e,1,`BagIn`),L(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Gr(`second`,`BagIn`,`bag`,t);return n>0}),R(`CopiesIn`,2,e=>{let t=L(e,1,`CopiesIn`),n=Zm(qm(e,1,`CopiesIn`),L(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Gr(`second`,`CopiesIn`,`bag`,t);return n}),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Jm(e,t,`(+)`);if(!Xm(n))throw Gr(t===0?`first`:`second`,`(+)`,`bag`,L(e,t,`(+)`));return n});return ch(t,rh)}),R(`\\ominus`,2,e=>{let t=Jm(e,0,`(-)`),n=Jm(e,1,`(-)`);return _n(t.domain.flatMap((e,r)=>{let i=sh(t,r,n,$m);return i>0?[[e,i]]:[]}))}),R(`BagUnion`,1,t=>{let n=L(t,0,`BagUnion`),r=Ym(n,()=>Gm(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??lh;let i=r.map(t=>{let r=Km(t);if(!r)throw new e.C(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(n)}`);return r});return ch(i,th)}),R(`\\sqsubseteq`,2,e=>{let t=qm(e,0,`\\sqsubseteq`),n=qm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>sh(t,r,n,eh)<=0)}),ni(`BagOfAll`,2,t=>{let n=ei(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.C(`The first argument of BagOfAll should be an operator, but instead it is:\n${I(n.literalBody)}`);let r=L(t,1,`BagOfAll`),i=Km(r);if(!i)throw Gr(`second`,`BagOfAll`,`function with a finite domain`,r);return ch(i.domain.map((e,t)=>vt([n.call([e])],[i.range[t]])),nh)}),R(`SubBag`,1,n=>{let r=L(n,0,`SubBag`);if(!k(r))throw new e._(`DOMAIN expects a function but received ${I(r)}`);let i=F(r),a=dn(i.range).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e._(`Attempted to apply a function to ${I(i)}, which is not in its domain`);return dn(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>vt(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>mr(qm(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=Ym(t,()=>Gm(`BagToSet`,`a function with a finite domain`,t));return vt([...n],n.map(()=>1))})],dh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,fh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,ph=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,mh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,hh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,gh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,_h=e=>{if(!k(e))return!1;let t=F(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},vh=(e,t)=>pi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${di(t)}`),yh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),bh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw vh(t,e);return`[${N(e).elements.map(e=>Sh(e,t)).join(`,`)}]`},xh=(e,t)=>{let n=F(e),r=Zn(n);return r?`[${r.map(e=>Sh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${yh(typeof e==`string`?e:I(e))}:${Sh(n.range[r],t)}`).join(`,`)}}`},Sh=(e,t)=>typeof e==`string`?yh(e):typeof e==`object`?e.kind===`ModelValue`?yh(e.name):O(e)?bh(e,t):xh(e,t):String(e),Ch=e=>{if(O(e))return bh(e,dh);if(!k(e)||_h(e))throw vh(dh,e);return xh(e,dh)},wh=e=>{if(!k(e))throw vh(fh,e);return xh(e,fh)},Th=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},Eh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return at(e);if(Array.isArray(e))return j(e.map(e=>Eh(e,t)));if(typeof e==`object`&&e)return Dn(Object.entries(e).map(([e,n])=>[at(e),Eh(n,t)]));throw pi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Dh=(e,t)=>{if(e.trim()===``)return Eh(null,t);try{return Eh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Th(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?pi(t,e.message):e}},Oh=(e,t)=>{if(typeof e!=`string`)throw pi(t,`Cannot cast tlc2.value.impl.${di(e)} to tlc2.value.impl.StringValue`);return e},kh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw pi(n,`${t} (No such file or directory)`);return r},Ah=e=>[ri(`ToJson`,1,e=>at(Sh(L(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),ri(`ToJsonArray`,1,e=>at(Ch(L(e,0,`ToJsonArray`)))),ri(`ToJsonObject`,1,e=>at(wh(L(e,0,`ToJsonObject`)))),ri(`JsonSerialize`,2,t=>{let n=Oh(L(t,0,`JsonSerialize`),ph),r=L(t,1,`JsonSerialize`);if(!Zn(r)&&!_h(r))throw Gr(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,Sh(r,ph)),!0}),ri(`ndJsonSerialize`,2,t=>{let n=Oh(L(t,0,`ndJsonSerialize`),mh),r=L(t,1,`ndJsonSerialize`),i=Zn(r);if(!i)throw Gr(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${Sh(e,mh)}\n`).join(``)),!0}),ri(`JsonDeserialize`,1,t=>{let n=Oh(L(t,0,`JsonDeserialize`),hh);return Dh(kh(e,n,hh),hh)}),ri(`ndJsonDeserialize`,1,t=>{let n=Oh(L(t,0,`ndJsonDeserialize`),gh);return j(kh(e,n,gh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Dh(e,gh)))})],jh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Mh=1e6,Nh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Gr(t,n,`nonnegative integer`,e);return e},Ph=(e,t,n,r)=>dn(Array.from({length:t},()=>dn(e.filter(()=>r.nextDouble()<n)))),Fh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Nh(L(e,0,n),`first`,n),i=Nh(L(e,1,n),`second`,n),a=L(e,2,n);if(!O(a)||!M(a))throw Gr(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw Gr(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Gr(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Ph(o,r,o.length===0?0:i/o.length,t.getRandom())},Ih=e=>[ri(`RandomSubset`,2,t=>{let n=L(t,0,`RandomSubset`);if(typeof n!=`number`)throw Gr(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw pi(jh,String(n));let r=L(t,1,`RandomSubset`);if(!O(r)||!P(r)&&!M(r))throw Gr(`second`,`RandomSubset`,`a finite set`,r);let i=Pm(r,e.version);if(i&&i.reduce((e,t)=>e*N(t).elements.length,1)>Mh)throw pi(jh,`Attempted to construct a set with too many elements (>${Mh}).`);return dn(Fm(n,r,e.getRandom(),e.version))}),ri(`RandomSetOfSubsets`,3,t=>Fh(t,e)),ri(`TestRandomSetOfSubsets`,3,t=>j(Array.from({length:5},()=>N(Fh(t,e)).elements.length)))],Lh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Rh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Lh})`,zh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Lh}) throws java.io.IOException`,Bh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Lh})`,Vh=e=>Dn([[`name`,e??`UnnamedAction`],[`location`,Dn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Hh=(e,t,n)=>{let r=e.map((e,t)=>j([t+1,Dn(Object.entries(e))])),i=r.slice(1).map((e,n)=>j([r[n],t[n],e])),a=n?[j([r[r.length-1],n.action,r[n.start]])]:[];return Dn([[`action`,dn([...i,...a])],[`state`,dn(r)]])},Uh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Bm(e).get(t)},Wh=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),I(i));else throw new e.C(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(r)}`)},Gh=e=>e.every(e=>e!==void 0),Kh=(e,t)=>Dn(t.variables.map((t,n)=>[t,e[n]])),qh=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!E(e)){if(t.variableIndex.has(r))return!0;let e=uu(r,t);if(e&&!n.has(e)&&(n.add(e),qh(e.body,t,n)))return!0}return ke(e).some(e=>qh(e,t,n))},Jh=(t,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[R(`AssertEq`,2,e=>{let n=L(e,0,`AssertEq`),r=L(e,1,`AssertEq`),i=kt(n,r);return i||(t(I(`Assertion failed`,!0)),t(I(n,!0)),t(I(r,!0))),i}),bi(`AssertError`,2,t=>{let r=ei(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw pi(Rh,`In computing AssertError, a non-string expression (line ${r.location.line}, col ${r.location.column}) was used as the err of an AssertError(err, exp).`);let i=xi(t,0,`AssertError`)();try{xi(t,1,`AssertError`)()}catch(t){if(t instanceof e._)return Xi(t.message,n.isTool)===i;throw t}return!1}),ri(`TLCGetOrDefault`,2,e=>{let t=L(e,0,`TLCGetOrDefault`);return Uh(n,t)??L(e,1,`TLCGetOrDefault`)}),{...ni(`TLCGetAndSet`,4,e=>{let r=L(e,0,`TLCGetAndSet`),i=Uh(n,r)??L(e,3,`TLCGetAndSet`),a=ei(e,1,`TLCGetAndSet`);return Wh(n,t,r,a.call([i,L(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},ri(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!Gh(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw pi(zh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return j(n.getBehavior(r).map(e=>Kh(e,t.environment)))}),ri(`CounterExample`,0,()=>n.counterExample??Dn([[`action`,dn([])],[`state`,dn([])]])),R(`ToTrace`,1,t=>{let n=L(t,0,`ToTrace`);if(!k(n)||!kt(mr(n),dn([`action`,`state`])))throw new e._(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(n)}`);let r=N(fr(n,`state`)).elements.map(e=>Zn(e)??[]);return j(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),R(`TLCModelValue`,1,t=>{let n=L(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.C(`The argument of ModelValue should be a string, but instead it is:\n${I(n)}`);return gt(n)}),bi(`TLCDefer`,1,()=>!0),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),bi(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!Gh(i))throw pi(Bh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||lu(xi(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.A(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),bi(`TLCCache`,2,(e,t)=>{let n=ei(e,0,`TLCCache`),i=Nr(xi(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=qh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?a(t.state):r,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(i);if(l!==void 0)return l;let u=n.call([]);return c.set(i,u),u}),R(`TLCFP`,1,e=>Number(BigInt.asIntN(32,gm([L(e,0,`TLCFP`)])))),ri(`TLCEvalDefinition`,1,(t,n)=>{let r=L(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?uu(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.C(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.C(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return H({kind:`Identifier`,name:r,location:i.location},n)})]},Yh=(e,t)=>[ri(`_Track`,2,e=>{let n=String(L(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,L(e,0,`_Track`)===!0?r+1:r),!0}),ri(`_Counts`,0,()=>zm(t)),ri(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(zm(t),!0)),!1)}),ri(`_PrintCounts`,0,()=>(e(I(zm(t),!0)),!0))],Xh=e=>String(e).padStart(2,`0`),Zh=e=>`${e.getUTCFullYear()}.${Xh(e.getUTCMonth()+1)}.${Xh(e.getUTCDate())}.${Xh(e.getUTCHours())}${Xh(e.getUTCMinutes())}${Xh(e.getUTCSeconds())}`,Qh=e=>_n([...e].map(([e,t])=>[e,j([t])])),$h=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),eg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),tg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),ng=(t,n,r)=>{if(t.version===`1.7.4`?!eg.has(n)||!t.isStarted&&tg.has(n):!t.isStarted&&$h.has(n))throw new e.C(`TLCGet(${n}) was undefined.`);let i=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return i;case`stats`:return Dn([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Dn([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return Dn([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,at(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,at(Zh(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return Vh(void 0);case`all`:return Qh(t.registers);case`all:named`:return Qh(Bm(t))}if(n.startsWith(`s:`)){let r=Bm(t).get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return at(t.properties.get(n.slice(2))??n);throw new e.C(`TLCGet(${n}) was undefined.`)},rg=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.C(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(n)}`);return ng(t,n,r?.state)},ig=e=>e.length===0?[[]]:e.flatMap((t,n)=>ig([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),ag=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(ag),e.kind===`Function`&&e.range.forEach(ag))},og=(t,n)=>[R(`Print`,2,e=>(t(`${D(I(L(e,0,`Print`),!0,!0))} ${D(I(L(e,1,`Print`),!0,!0))}`),L(e,1,`Print`))),R(`PrintT`,1,e=>(t(D(I(L(e,0,`PrintT`),!0,!0))),!0)),R(`Assert`,2,t=>{if(L(t,0,`Assert`)!==!0)throw new e.C(`The first argument of Assert evaluated to FALSE; the second argument was:\n${D(I(L(t,1,`Assert`)))}`,e.W.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>_n([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=$r(e,0,`@@`),n=$r(e,1,`@@`);return vn([...Ke(t),...Ke(n)])}),R(`ToString`,1,e=>at(I(L(e,0,`ToString`),!0))),R(`TLCEval`,1,e=>{let t=L(e,0,`TLCEval`);return ag(t),t}),R(`Permutations`,1,e=>{let t=Zr(e,0,`Permutations`);return dn(ig(t).map(e=>_n(t.map((t,n)=>[t,e[n]]))))}),ni(`SortSeq`,2,e=>{let t=ei(e,1,`SortSeq`);return j(Qr(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?mi({...ri(`TLCGet`,1,(e,t)=>rg(n,L(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):mi(bi(`TLCGet`,1,(e,t)=>rg(n,xi(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)`),ri(`TLCSet`,2,e=>{let r=L(e,0,`TLCSet`);return Wh(n,t,r,L(e,1,`TLCSet`)),!0}),ti(`Any`,ft),R(`RandomElement`,1,e=>Lm(Xr(e,0,`RandomElement`),n.getRandom()))],sg=(e,t)=>e.every(e=>tr(e,t)),cg=dn([!1,!0]),lg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return gn(lg(e,t,r),lg(e,r,n))},ug=[`\\cup`,`\\cap`,`\\`],dg=e=>typeof e==`object`&&e.kind===`MixedSet`,fg=(e,t,n)=>{let r=t.kind===`Interval`?N(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return fn(r.filter(e=>tr(e,n)===t))}if(r.length===0)return n;if(!Be(n))return Tt({kind:`SetOperation`,operator:e,left:t,right:n});let i=N(n).elements.filter(e=>!tr(e,t));return fn([...r,...i])},pg=[ti(`TRUE`,!0),ti(`FALSE`,!1),ti(`BOOLEAN`,cg),ti(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ii(`=`,ln),ii(`#`,(e,t)=>!ln(e,t)),R(`~`,1,e=>!Jr(e,0,`~`)),R(`<=>`,2,e=>Jr(e,0,`<=>`)===Jr(e,1,`<=>`)),R(`/\\`,2,e=>Jr(e,0,`/\\`)&&Jr(e,1,`/\\`)),R(`\\/`,2,e=>Jr(e,0,`\\/`)||Jr(e,1,`\\/`)),R(`=>`,2,e=>!Jr(e,0,`=>`)||Jr(e,1,`=>`)),R(`\\in`,2,e=>tr(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!tr(L(e,0,`\\notin`),L(e,1,`\\notin`))),R(`\\subseteq`,2,e=>{let t=Yr(e,0,`\\subseteq`),n=L(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&M(t.base)?sg(N(t.base).elements,n.base):sg(N(t).elements,n)}),...ug.map(e=>R(e,2,t=>{let n=L(t,0,e),r=L(t,1,e);if(Be(n)&&Be(r)&&!dg(n)&&!dg(r)){if(e===`\\cup`&&P(n))return r;let t=e===`\\cup`?gn:e===`\\cap`?hn:mn;return er((e,n)=>t(N(e),N(n)),(t,n)=>fg(e,t,n),n,r)}return Be(n)?fg(e,n,r):e!==`\\`&&Be(r)?fg(e,r,n):Tt({kind:`SetOperation`,operator:e,left:n,right:r})})),R(`SUBSET`,1,e=>({kind:`Subset`,base:L(e,0,`SUBSET`)})),R(`UNION`,1,e=>{let t=Yr(e,0,`UNION`),n=Ve(t)?t.elements.filter(Ve):[];if(!Ve(t)||n.length!==t.elements.length)return Tt({kind:`Union`,base:t});if(dg(t)||n.some(dg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{tr(t,e)||e.elements.push(t)})),fn(e.elements)}return n.length===0?pn:lg(n.map(N),0,n.length)}),R(`DOMAIN`,1,t=>{let n=L(t,0,`DOMAIN`);if(!k(n))throw new e._(`DOMAIN expects a function but received ${I(n)}`);return mr(n)})],mg=gi(`Integers`,`Neg`,`IntValue`,1),hg=t=>{let n=gi(t,`DotDot`,`IntervalValue`,2);return[_i(t,`+`,`Plus`,(e,t)=>e+t),_i(t,`-`,`Minus`,(e,t)=>e-t),_i(t,`*`,`Times`,(e,t)=>e*t),_i(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.C(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.C(`0^0 is undefined.`);return t**n}),_i(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.C(`The second argument of \\div is 0.`);if(t===`Naturals`){let e=Math.trunc(n/r)|0;return e<0&&Math.imul(e,r)!==n?e-1:e}let i=Math.floor(n/r);if(ai(i))throw oi(`${n} \\div ${r}`);return i}),_i(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.C(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),R(`..`,2,e=>({kind:`Interval`,low:hi(L(e,0,`..`),n),high:hi(L(e,1,`..`),n)}))]},gg=hg(`Naturals`),_g=hg(`Integers`),vg=e=>{let t=gg.indexOf(e);return t===-1?void 0:_g[t]},yg=[ti(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...gg,yi(`<`,(e,t)=>e<t),yi(`>`,(e,t)=>e>t),yi(`<=`,(e,t)=>e<=t),yi(`>=`,(e,t)=>e>=t,`>`)],bg=[ti(`Int`,{kind:`InfiniteSet`,name:`Int`}),..._g,yi(`>=`,(e,t)=>e>=t),R(`-.`,1,e=>{let t=hi(L(e,0,`-`),mg);if(ai(-t))throw oi(`-${t}`);return-t})],xg=(t,n,r)=>{let i=L(t,n,r),a=Zn(i);if(!a)throw new e.C(`${r}\n${I(i)}`);return a},Sg=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:xg(e,t,n)},Cg=(e,t,n)=>typeof e==`string`?at(e.slice(t,n)):j(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=Xd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?mi(e,t):e}):t},Dg=t=>Eg(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>Sg(e,0,wg(``,`Len`)).length),R(`\\o`,2,t=>{let n=Sg(t,0,Tg(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=xg(t,1,Tg(`t \\o s`,`sequence`));return j([...n,...e])}let r=L(t,1,`\\o`);if(typeof r!=`string`)throw new e.C(`${Tg(`t \\o s`,`string`)}\n${I(r)}`);return at(n+r)}),R(`Append`,2,e=>j([...xg(e,0,Tg(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(e,1,`Append`)])),R(`Head`,1,t=>{let n=xg(t,0,wg(``,`Head`));if(n.length===0)throw new e.C(`Attempted to apply Head to the empty sequence.`);return n[0]}),R(`Tail`,1,t=>{let n=Sg(t,0,wg(``,`Tail`));if(n.length===0)throw new e.C(`Attempted to apply Tail to the empty sequence.`);return Cg(n,1)}),R(`SubSeq`,3,t=>{let n=Sg(t,0,wg(`first `,`SubSeq`)),r=qr(t,1,`SubSeq`),i=qr(t,2,`SubSeq`);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.C(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Cg(n,r-1,i)}),ni(`SelectSeq`,2,e=>{let t=ei(e,1,`SelectSeq`);return j(xg(e,0,wg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw Gr(`second`,`SelectSeq`,`operator`,n);return n}))})]),Og=t=>Eg(`FiniteSets`,[R(`IsFiniteSet`,1,t=>{let n=L(t,0,`IsFiniteSet`);if(O(n))return Yn(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e._(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${I(n)}\nis a finite set.`:`Attempted to check if the ${He(n)} ${I(n)} is a finite set.`)}),R(`Cardinality`,1,n=>{let r=L(n,0,`Cardinality`);if(!O(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.C(`Attempted to compute cardinality of the value\n${I(r)}`);return qn(r,t)})]),kg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Ag=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:yg};case`Integers`:return{extends:[`Naturals`],operators:bg};case`Sequences`:return{extends:[],operators:Dg(n.version)};case`FiniteSets`:return{extends:[],operators:Og(n.version)};case`TLC`:return{extends:[],operators:Eg(`TLC`,og(t,n))};case`Randomization`:return{extends:[],operators:Ih(n)};case`_Possible`:return{extends:[],operators:Yh(t,n)};case`Json`:return{extends:[],operators:Ah(r)};case`Bags`:return{extends:[],operators:uh(i)};case`TLCExt`:return{extends:[],operators:Jh(t,n)};default:return}},jg=`$subexpression`,Mg=(t,n)=>new e.O(`${t} at line ${n.line}, column ${n.column}`),Ng=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Ng(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ke(e)){let e=Ng(r,t,n);if(e)return e}},Pg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Fg=(e,t)=>{let n=e.location,r=Pg(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw Mg(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw Mg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:jg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:jg,args:e.args,location:n,resolution:da},location:n}},Ig=(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:da})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:da}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:da};return Fg({...t,params:[...t.params,...r]},a)},Lg=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s={index:0,current:void 0,isFailed:!1},c=(n,i)=>{if(!n)throw Mg(i,a);pa.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.z(n),message:i}}),s.isFailed=!0},l=e=>{let r=[],i=[];for(;s.index<t.length;){let o=t[s.index];if(o.kind!==`Name`)throw Mg(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Fo(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw Mg(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=va(u),f=s.index===t.length-1;if(n.args.length!==d&&(!i||n.args.length!==0))return c(r.argumentRanges?.[s.index]??a.range,`The operator ${n.name} requires ${d-n.earlier} arguments.`);if(f)return{definition:u,args:n.args};if(u.kind!==`Operator`)throw Mg(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),s.current=u.body,s.index++},d=()=>{for(;s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&Ng(s.current,e.name,[]);if(!a)return c(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return c(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),s.current=a.label.body,s.index++}},f=e=>{let n=s.current;if(!n)throw Mg(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(e);return}if(n.kind===`Let`){if(e.kind!==`Operand`||za(e.operand,1)!==0)throw Mg(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=Ua(n);if(r&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),s.current=r.body;return}if(n.kind===`Case`&&e.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[za(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw Mg(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=za(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Mg(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw Mg(`Unexpected subexpression selector`,a);let i=r?r.sets:Wa(n),c=i?.[za(e.operand,i.length)];if(!c)throw Mg(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return Ig(p.definition,{...o,args:p.args});for(d();s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw Mg(`A name selector here must be from a LET clause`,a);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return r;if(e)return Ig(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw Mg(`Subexpression selection failed`,a);return Fg(o,s.current)},Rg=(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 Ba(e,t,n)},zg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ke(e).some(zg),Bg=(e,t,n,r=!1)=>{if(!zg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Ro(e,e=>Bg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Vg(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>Bg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Ro(e,e=>Bg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Rg(a.name,[],void 0,t):a.kind===`Apply`?Rg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Lg(o,t,a,r);return c!==a&&fa.add(c),c},Vg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Bg(e.expression,t,n,!0)}))}),Hg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Ug=(e,t)=>Vg(e,Hg(t.definitions),()=>!1),Wg=(e,t)=>{let n=Hg([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>Bg(e,n,i),o=e=>i(e)||!n(e),s=e=>Bg(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return Vg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Vg(e,n,o):Lo(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>zg(e.body))||e.assumptions.some(e=>zg(e.expression))?{...p,definitions:e.definitions.map(e=>Lo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Gg=(e,t)=>e.maxLevels[t]??3,Kg=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Vs({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=>vs(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>vs(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>ys(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=hs(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&vs(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(Hs(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.z(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(ps(e.name,i));a!==void 0&&Gg(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=hs(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=Gg(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.I([...i.values()])}},qg=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Jg=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Yg=new Map(Wd.flatMap(e=>e.map(t=>[t,e[0]]))),Xg=e=>Yg.get(e)??e,Zg=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Qg=()=>{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}}},$g=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Zg(e)&2147483647,kind:t,isLocal:n}),e_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Xg(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Xg(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}},t_=(e,t)=>{let n=[];for(let r=t;;){let t=e_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},n_=e=>({line:e.line,column:e.column}),r_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=t_(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},i_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,a_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},o_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&i_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&i_(e[n+1],e[n+2])?n+=i_(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=>a_[e])}"`:r.text)}return t},s_=e=>e[2]?.text,c_=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},l_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>l_(e.modules,t)).find(Boolean),u_=e=>{let t=e===void 0?[]:se(e),n={module:void 0};return{tokens:t,ranges:c_(t),getModule:()=>n.module??=e===void 0?Gp(``):Kp(e,t)}},d_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=u_(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:(Jd.has(i)?t?.(i):void 0)??Yd.get(i)??t?.(i)??Up(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(s_(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>l_(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},f_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=t_(t,e+1);i.push({location:n_(t[e]),apply:e=>r.forEach(t=>e.put($g(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:n_(u),apply:t=>t.put($g(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&t_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),Jg.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(n_(u)),i.push({location:n_(u),apply:e=>e.put($g(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put($g(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=Xg(e.name);i.push({location:e.location,apply:n=>n.put($g(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($g(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put($g(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>_a(e.location,t.location)?-1:+!!_a(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=Qg();n.set(i??``,o),Ud.toReversed().forEach(e=>o.put($g(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)}}},p_=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),Gd.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=r_(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},ee=m(e=>e.extends),te=m(e=>e.instances),ne=/* @__PURE__ */ new Set([void 0]),h=/* @__PURE__ */ new Map;o_(o(void 0)).forEach((e,t)=>{t===3&&qd.forEach(i),i(e)});let g=l(void 0);for(;;){let n=ee(g,/* @__PURE__ */ new Set)??te(g,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),h.set(r.unit,[...h.get(r.unit)??[],a]),!ne.has(a)){if(ne.add(a),t(a).tokens.length===0){let n=r.unit??s_(t(void 0).tokens);throw e.F(a,n)}o_(o(a)).forEach(i)}}qg.forEach(i);let re=/* @__PURE__ */ new Set,ie=e=>{if(re.has(e))return;re.add(e);let t=h.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ie),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ie(void 0),Kd.forEach(i),[...r]},m_=(e,t)=>{let n=d_(e,t),r=n.getParsed,i,a=()=>i??=f_(r);return{getStringOrder:e=>p_(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},h_=t=>{switch(t.kind){case`Number`:if(!Ue(t.value))throw e.K(new e.C(`Integer overflow: ${t.value} is outside TLC's 32-bit range`),e.W.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return gt(t.name);case`Set`:return dn(t.elements.map(h_))}},g_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],__=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.O))throw r;let i=_p(t);throw i===void 0?r:e.I([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},v_=t=>new e.O(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),y_=(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)}.`},b_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,x_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:b_(e),S_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Qo(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),C_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>I(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e._(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&kt(e,r)})});if(n)return n[1];throw new e._(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},w_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||ke(e).some(e=>w_(e,t)),T_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(qo(e),n.get(e)??n.size)),n},E_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),D_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Ql(e);if(e.kind===`Number`&&!Ue(e.value))throw $l(e);D_(e.kind===`Let`?[...ke(e),...E_(e.instances??[])]:ke(e))}),O_=(t,n)=>{let r=n.order??m_(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=new Map(pg.map(e=>[e.name,e])),u=/* @__PURE__ */ new Map,d=Rm(t.checkDeadlock,n.seed);d.isWarningEnabled=n.isWarningEnabled??!0,d.isTool=n.isTool??!1,d.version=n.version??`master`;let f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,ee=[],te=/* @__PURE__ */ new Map,ne=[],h=[],g=(e,t)=>ne.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),re={value:0},ie=e=>`${e}#${re.value++}`,_=[],ae=[],oe=Kg(e=>{let t=m.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,le=/* @__PURE__ */ new Map,ue=e=>{let t=u.get(e);if(t)return t;let r=Ag(e,n.print,d,n.files,l);if(!r)return;kg.get(e)?.forEach(ue);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ue(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{l.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:us.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:fs(e,t.name)??i.get(t.name)?.range})}),u.set(e,i),i},v=e=>{if(Jd.has(e)&&n.loadModule?.(e)!==void 0)return;let t=ue(e),r=kg.get(e)??[];return t&&g(e,r),t&&r.includes(`Integers`)&&ue(`Integers`),t},y=e=>(D_([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...E_(e.instances)]),e.modules.forEach(y),e);y(i);let de=(t,i)=>{let a=n.loadModule?.(t)??Ne.get(t)??Up(n.source,t);if(a===void 0)throw e.F(t,i);let o=__(a,t,r);if(o.name!==t)throw e.I([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return y(o)},fe=t=>{let n=h.indexOf(t.name);if(n!==-1){let r=[...h.slice(n),t.name].map(e=>`${e}.tla`);throw new e.O(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];h.push(t.name),ne.push(r);let s=ye(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:ae,levelChecks:o});if(ne.pop(),h.pop(),a.length>0)throw e.I(a,!1,void 0,ae);let c=i.find(e=>r.has(e.name)),l=c&&f.get(c.name),u=l&&y_(c,l.module);if(u)throw e.I([u],!1,void 0,ae);if(c)throw v_(c);return o.forEach(e=>e()),{linked:s,closure:r}},pe=(e,t)=>{let r=f.get(e);if(r)return g(e,te.get(e)??[]),r;let i=fe(de(e,t));return(Wm(d.version).has(e)?Ag(e,n.print,d,n.files,l):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(l.set(t.key,e),a.delete(t.key))}),f.set(e,i.linked),te.set(e,i.closure),g(e,i.closure),i.linked},b=(e,t,n,r,i)=>{let l=i?void 0:v(e.module);if(l)return x(e,l);let u=i??pe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=g_(u),f=`#${re.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Do(Ug(e,t),d,t,n);_.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let ee=as({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Mo(t,p)])),variables:new Set(u.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ie(`${i}@${t.name}`),f=l(u);return a.set(u,f),d.length>0&&c.add(f),e.name!==void 0&&ce.set(u,`${e.name}!${ce.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ie});return S(e,u.exported,d,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return d.length>0&&se.set(r,{name:n,location:e.location}),e.name!==void 0&&le.set(r,n),r})},x=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),S=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:o.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},C=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:$o(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),me=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),he=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=me(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:$o(r,n),location:n}}},ge=(e,t,n,r)=>{let i=e.location,s=r?void 0:v(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=me(n.arity);return C(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${re.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=g_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};_.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>w_(f(e),p),ee=d.map(t=>{let n=he(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),te=[],ne=as({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:$o(e.params,i),location:i,resolution:da}:Qo(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${te.length}`,a=r(i);return te.push(a.kind===`Operator`?{...a,name:i}:S_(a,i)),i},createName:ie}),h=new Set(d.map(e=>e.name)),g=[...c.exported].filter(([e])=>!h.has(e)).map(([t,n])=>{let r=ne.getKey(n.key),a=me(n.arity),o=[...e.params,...a];return C(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...ee,...te,...g]},_e=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),ve=/* @__PURE__ */ new Map,ye=(t,r)=>{let s=Hd(t,n.loadClass?.(t.name),t===i);ve.set(t.name,s.overrides);let c=s.module,l=_.length,u=new Map([...pg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:So,errors:[],warnings:[]},te=[f],ne=t=>t.forEach((t,n)=>{let r=h.get(n);if(!r){u.set(n,t),h.set(n,t);return}if(!r.range||!t.range||e.z(r.range)===e.z(t.range))return;let i=e.z(t.range),a=e.z(r.range);x_(r.kind)===x_(t.kind)?f.warnings.push({location:i,message:`Warning: the ${b_(r.kind)} of '${n}' conflicts with \nits ${b_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${b_(t.kind)} of '${n}' conflicts with \nits ${b_(r.kind)} at ${a}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,re=/* @__PURE__ */ new Map,ie=[],se=[...c.constants],ce=c.variables.map(e=>e.name),ue=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:v(e);if(n){ne(n);return}let i=t??pe(e,c.name);se.push(...i.constants.filter(e=>se.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{ce.includes(e)||(ce.push(e),ue.push(i.variableLocations[t]))}),ne(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>re.set(t,e)),ie.push(i)});let y=new Map(u),de=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],fe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});de.forEach(e=>h.set(e.name,fe(e)));let C=e=>({key:he(e),arity:va(e),params:ya(e),kind:Co(c,e)?`Theorem`:`Definition`,range:e.location.range}),me=se.length===0&&ce.length===0,he=e=>c===i?e.name:`${e.name}@${r.id}`,w=/* @__PURE__ */ new Map,T=()=>new Map([...r.modules,...re]),be=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&_a(e.location,t.location)},xe=e=>{let t=c.modules.find(t=>t.name===e.module);return t?be(t)?re.get(t.name):void 0:T().get(e.module)},Se=e=>({imported:u,getInstance:e=>{let t=xe(e),n=t?void 0:v(e.module);if(n)return{declarations:[],symbols:x(e,n),instancer:c.name};let r=t??pe(e.module,c.name),i=g_(r);return{declarations:i,symbols:S(e,r.exported,i,e=>e),instancer:c.name}},bound:y,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:he,instanced:w,facts:g,reports:te,warnings:r.warnings}),Ce=e=>[...de.filter(t=>_a(t.location,e)).map(e=>[e.name,fe(e)]),...c.definitions.filter(t=>_a(t.location,e)).map(e=>[e.name,C(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),we=e=>{let t=T(),n=t.get(e.name),i=n&&y_(e,n.module);if(n&&!i)throw v_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};te.push(a);let o=ye(e,{id:`${r.id}/${e.name}`,symbols:Ce(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||re.set(e.name,o),p.has(e.name)||p.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=b(e,c,Se(c),me,T().get(e.module));w.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||h.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>we(e)}))].sort((e,t)=>_a(e.location,t.location)?-1:1).forEach(e=>e.link());let Te=Wg(ls(c,(e,t)=>ge(e,t,c.name,xe(e))),_e(u));r.errors.push(...ko(Te,Se(Te))),Te.definitions.forEach(e=>{let t=he(e);a.set(t,e),o.set(t,!me);let n=C(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!_a(r,e.location))&&(u.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ee={module:Te,constants:se,variables:ce,variableLocations:ue,visible:u,exported:h,modules:re,extended:ie,facts:/* @__PURE__ */ new Set([...g,...[...Te.theorems,...Te.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Ee);let De=_.splice(l).map(e=>({location:e.location,check:()=>oe(e)}));return r.levelChecks.push(()=>Us(Te,{constants:new Set(se.map(e=>e.name)),variables:new Set(ce),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>le.get(u.get(e)?.key??e)},De,ae)),ee.push(Ee),Ee},w=fe(i).linked;ae.length>0&&!n.isSanyReported&&n.print(e.B(ae));let T=e=>w.visible.get(e)?.key??e;w.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let be=[],xe=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>xe(e,t)),be.push(...e.module.assumptions))};xe(w,/* @__PURE__ */ new Set);let Se=w.constants.map(e=>e.name),Ce=w.variables,we=e=>e.module===void 0?[e.name,T(e.name)]:e.module===i.name||Se.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],Te=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:w.constants.find(t=>t.name===e)?.arity??0},Ee=/* @__PURE__ */ new Map,De=/* @__PURE__ */ new Set,Oe=(e,t)=>{l.set(e,t),a.delete(e),Ee.delete(e),De.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=h_(e.value);cn(t),we(e).forEach(e=>{let n=Te(e);n===0?Ee.set(e,t):Oe(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ke=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=ke.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.h(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(h_),h_(t.value)]),ke.set(n,r)}),ke.forEach(e=>we(e).forEach(t=>Oe(t,C_(e.name,Te(t)||e.rows[0][0].length,e.rows))));let E=new Map(t.substitutions.flatMap(e=>we(e).map(t=>[t,T(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!Se.includes(r)&&!w.visible.has(r))throw new e.h(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e.h(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let o=T(i),s=a.get(o);if(!(s!==void 0||l.has(o)||Ee.has(o)||Se.includes(i)||Ce.includes(i)))throw new e.h(`The configuration file substitutes for ${r} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(w.constants.find(e=>e.name===r)?.arity??w.visible.get(r)?.arity))throw new e.h(`The configuration file substitutes for ${r} with ${i} of different number of arguments.`)});let Ae=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(we)),je=(e,t)=>{if(Ae.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&je(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=je(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=C(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),w.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Me=Se.filter(e=>!Ee.has(e)&&!E.has(e)&&!De.has(e));if(Me.length>0&&!n.isUnconfigured){let t=r.getDeclarationOrder(`constant`).find(e=>Me.includes(e))??Me[0];throw new e.h(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&l.forEach((e,t)=>{let n=vg(e);n&&l.set(t,n)});let Pe=T_(Ce,ee.flatMap(e=>e.module.variables.map(e=>e.name))),Fe=rc({definitions:a,substitutions:E,constants:Ee,variableIndex:Pe,builtins:l,variables:Ce}),Ie={runtime:d,definitions:a,builtins:l,constants:Ee,substitutions:E,instanceNames:ce,variables:Ce,variableIndex:Pe,facts:Fe,startupValues:Array.from({length:Fe.ids.size},()=>void 0),substitutedDefinitions:c,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Le=Vs({constants:new Set(Ee.keys()),variables:/* @__PURE__ */ new Set([...Ce,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>l.has(e))]),getDefinition:e=>uu(e,Ie)}),Re=t=>{try{H(t,{environment:Ie,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e._)return t;throw t}};E.forEach((t,n)=>{let r=a.get(t),i=Se.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Le.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Re(r.body):void 0;if(i){let r=qi(i)?``:` - specifically: ${i.message}`;throw new e.h(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),d.version!==`1.7.4`&&(d.isStarted=!0);let D=new Set(ee.flatMap(e=>e.module.instances.map(e=>e.module))),ze=r.createDefinitionOrder();return{environment:Ie,assumptions:be,variableLocations:w.variableLocations,instanceActions:se,startupDefinitions:ee.filter(e=>!D.has(e.module.name)||g_(e).length===0).flatMap(e=>ze(e===w?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:w.constants,rootSymbols:w.visible,javaOverrides:ee.flatMap(e=>ve.get(e.module.name)??[])}},k_={kind:`Boolean`,value:!0},A_={kind:`Boolean`,value:!1},j_=e=>e?k_:A_,M_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,N_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),P_=(e,t,n)=>({kind:e,operands:[t,n]}),F_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?F_(e,t.operands).operands:[t])}),I_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return I_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,I_(t)),0)}},L_=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 L_(e.body);case`And`:case`Or`:return e.operands.some(L_)}},R_=/* @__PURE__ */ new WeakMap,z_={count:0},B_=e=>{let t=R_.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`#${z_.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(B_).join(`,`)})`;default:return`${e.kind}(${B_(e.body)})`}})();return R_.set(e,n),n},V_=(e,t)=>e===t||B_(e)===B_(t),H_=(e,t)=>{let n=B_(t);return e.some(e=>e===t||B_(e)===n)},U_=e=>e===`And`?`Or`:`And`,W_=(e,t)=>{switch(e.kind){case`Boolean`:return t?j_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return W_(e.body,!t);case`And`:case`Or`:return F_(t?U_(e.kind):e.kind,e.operands.map(e=>W_(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,W_(e.body,t))}}},G_=e=>{switch(e.kind){case`Boolean`:return j_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return F_(U_(e.kind),e.operands.map(G_));case`Always`:return $(`Eventually`,G_(e.body));case`Eventually`:return $(`Always`,G_(e.body));default:return $(`Not`,e)}},K_=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=K_(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return j_(t)}return n.length===0?j_(!t):n.length===1?n[0]:F_(e.kind,n)}case`Not`:{let t=K_(e.body);return t.kind===`Boolean`?j_(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=K_(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},q_=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,J_=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=J_(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r.value*=t.operands.length,r.value>2147483647))throw new e._(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r.value===1)return{kind:`And`,operands:n};let i=Array.from({length:r.value},()=>[]),a={groups:1,repeat:r.value};for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}a.repeat/=e.operands.length;let t={value:0};for(let n=0;n<a.groups;n++)for(let n of e.operands)for(let e=0;e<a.repeat;e++)i[t.value++].push(n);a.groups*=e.operands.length}return{kind:`Or`,operands:i.map(e=>F_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=J_(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=q_(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:F_(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return F_(`Or`,n)}case`Not`:return M_(t.body)?t:J_(G_(t.body));default:return t}},Y_=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Y_(e.operands[0]):F_(e.kind,e.operands.map(Y_));case`Not`:return e.body.kind===`Not`?Y_(e.body.body):$(`Not`,Y_(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Y_(e.body));default:return e}},X_=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return X_(e.operands[0]);let t=Math.floor(e.operands.length/2);return P_(e.kind,X_(F_(e.kind,e.operands.slice(0,t))),X_(F_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,X_(e.body));default:return e}},Z_=(e,t)=>{e.kind===`Eventually`&&!H_(t,e)&&t.push(e),`body`in e&&Z_(e.body,t),`operands`in e&&e.operands.forEach(e=>Z_(e,t))},Q_=e=>{let t=e.filter(N_),n=e.flatMap(e=>e.kind===`Not`&&N_(e.body)?[e.body]:[]);return!t.some(e=>H_(n,e))},$_=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,$(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e._(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},ev=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},tv=(e,t,n)=>e.flatMap(e=>{let r=ev(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),nv=e=>[...new Set(e.map(B_))].sort().join(`|`),rv=(e,t)=>{let n=new Set(t.map(nv));return[...e.filter(e=>!n.has(nv(e))),...t]},iv=e=>{let t=$_(e),n=tv(t,`Always`,`And`),r=tv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=ev(t,`Eventually`,`Or`);if(n&&!(H_(e,n.first)||H_(e,n.second)))return rv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(H_(e,t.first)||H_(e,t.second))&&!H_(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Q_(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=ev(t[e],`Always`,`And`);n&&(H_(t,n.first)||t.push(n.first),H_(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)H_(t,e.first)&&H_(t,e.second)&&!H_(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Q_(t)?[]:i(t)};return a(e)},av=e=>({particle:e,successors:[],statePredicates:e.filter(e=>I_(e)<=1)}),ov=e=>{let t=iv([e]).map(av),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=nv(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 iv(n)){let n=nv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(av(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},sv=(e,t)=>!H_(e,t)||H_(e,t.body),cv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&I_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=q_(t);if(r){let e=I_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(L_(t))throw new e._(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},lv=(e,t)=>{let n=e.findIndex(e=>V_(e,t));return n===-1?(e.push(t),e.length-1):n},uv=e=>{let t=J_(K_(W_(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Y_(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])cv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:F_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:V_(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&X_(e.formula),n=[];t&&Z_(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>lv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>lv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>lv(i,e))}));return{tableau:t&&ov(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},dv=()=>e.K(new e._(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.W.livenessEvaluationFailure),fv=/* @__PURE__ */ new Set([`~>`,`-+->`]),pv=/* @__PURE__ */ new WeakSet,mv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),hv=(t,n)=>new e._(`TLC cannot handle the temporal formula ${B(t)}${n===void 0?``:`:\n${n}`}`),gv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ru(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return gv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?gv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=uu(e,n);if(t)return lc(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:E(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Ro(e,(e,a)=>(i.value=Math.max(i.value,gv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return fv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},_v=(t,n)=>{try{return yu(t,n)}catch(t){if(!(t instanceof e._))throw t;if(!qi(t))return;throw e.K(new e._(`${e.N}${t.message}`),e.W.error)}},vv=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s)=>{let c=(e,t,n=s,c=a,l)=>vv(e,t,r,i,c,o||l!==void 0&&r.substitutedDefinitions.has(l),n);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,n,B(e)));if(t.kind===`Label`)return c(t.body,n);if(t.kind===`Let`)return c(t.body,yv(t,n,r));if(t.kind===`Identifier`){let i=E(t)?ru(n,t.name):void 0;if(i?.kind===`Thunk`)return c(i.expression,i.scope);let o=r.constants.has(t.name)?void 0:uu(t.name,r);if(!i&&o?.kind===`Operator`&&o.params.length===0&&lc(o,r)>0){if(a.has(o))throw e.R();return c(o.body,void 0,o.name,/* @__PURE__ */ new Set([...a,o]),o)}}let l=mv(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||gv(t,n,r)===3)){let e=Vu(t,l),n=E(t)?void 0:uu(t.operator,r);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&!o)return c(e.body,$u(e,t.args,l),t.operator,a,n)}let u=i&&t.kind===`Forall`&&t.bounds.every(e=>gv(e.set,n,r)===0),d=u?_v(t.bounds,l):void 0;if(u&&d){let e=[];if(bu(t.bounds,d,n,n=>(e.push(...c(t.body,n,B(t.body))),!1)),e.length===0)throw dv();return e}return[{expression:t,scope:n,name:s}]},yv=(e,t,n)=>{let r=td(e.definitions,mv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&pv.add(e.binding);return r},bv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?gv(t,n,r):a;if(o===0){let i=H(t,mv(r,n));if(typeof i!=`boolean`)throw new e._(`TLC expected a boolean value, but did not find one. ${Gl(t)}`);return j_(i)}return o===1?{kind:`State`,expression:t,scope:n}:{kind:`Action`,expression:t,unchanged:void 0,scope:n}},o={depth:0},s=(t,n,r,i)=>{if(o.depth>=100)throw e.R();o.depth++;let s=p(t,n);o.depth--;let c=I_(s);return c>2?s:a(r,i,c)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=mv(r,t),o=E(e)||uu(n,r)===void 0?ru(t,n):void 0;if(o?.kind===`Thunk`&&pv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:E(e)?Hu(n,a):Bu(n,r);if(c?.kind!==`Closure`)throw hv(e);let u=e.kind===`Apply`?e.args:[],d=!E(e)&&uu(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,$u(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.D||r&&!i;throw!(n instanceof e._)||a?n:hv(t)}},u=(t,n)=>{let i=gv(t,n,r);if(!t.bounds.every(e=>gv(e.set,n,r)===0)){if(i<=2)return a(t,n,i);throw hv(t)}let o=[],s=t.kind===`Forall`;try{xu(t.bounds,mv(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e._)||r instanceof e.D)throw r;if(i<=2)return a(t,n,i);throw hv(t,s&&!qi(r)?r.message:void 0)}return o.length===0?j_(s):d(t,n,F_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=I_(n);return r>2?n:a(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!E(e)||e.operator===`=>`),p=(e,t)=>{let n=gv(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,yv(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,P_(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!E(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,P_(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,F_(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&gv(e.condition,t,r)===0){let n=H(e.condition,mv(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,P_(`Or`,P_(`And`,n,p(e.consequent,t)),P_(`And`,$(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,P_(`Or`,i,a))):P_(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw hv(e)}};return p(t,n)},xv=(t,n,r,i,a)=>{let o=e=>xv(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r={environment:i,scope:t.scope,state:n,next:void 0},o=t.kind===`State`?lu(H(t.expression,r),`a temporal property predicate`):Pl(t.step,r);return a.set(t,o),o}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let e={environment:i,scope:t.scope,state:n,next:r};return t.unchanged&&lu(H(t.unchanged,e),`a subscript`)?!1:lu(H(t.expression,e),`an action predicate`)}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return xv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e._(`TLC cannot evaluate a temporal formula in a single step`)}},Sv=(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)=>Sv(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 xv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Cv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),wv=(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},Tv=t=>e.K(new e._(`${e.P}${t}`),e.W.error),Ev=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!A(e)||!A(i))throw Tv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Dv=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Dv);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Ov=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,kv=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.h(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Tv(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>H(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!O(o)||!M(o))throw Tv(`The symmetry operator must specify a set of functions.`);let s=N(o).elements;if(!s.every(k))throw Tv(`The symmetry values must be function records.`);let c=s.map(Ev),l=i.body.kind===`Apply`?i.body.args:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=Dv(Ov(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Li.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;c.forEach(e=>{e.size>0&&f.set(Cv(e),e)});let p=[...f.values()],m={start:0};for(;m.start<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m.start,t).forEach(e=>{let t=wv(n,e),r=Cv(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let ee=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),te=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!Ov(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||te.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>A(e)&&ee.has(e.name))})),f.size!==0)return[...f.values()]},Av=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Mv(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(Mv(e[r],t));return a}},jv=(e,t)=>{let n=[],r=[];for(let i of e){let e=Mv(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(mt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(mt(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},Mv=(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=jv(e.elements,t);return n?_t(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=Av(n.domain,t),i=Av(n.range,t)??n.range;if(r){let e=_n(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?vt(n.domain,e.range):e}return i===n.range?n:vt(n.domain,i)}if(n===`Interval`||!O(e)||!M(e))return e;let r=N(e),i=Av(r.elements,t);return i?dn(i):r},Nv=(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]=Mv(e[o],i),a===0&&(a=mt(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Pv={line:0,column:0},Fv=e=>({kind:`Identifier`,name:e,location:Pv}),Iv=/* @__PURE__ */ new Set([`name`,`property`]),Lv=(t,n,r)=>{let i=uu(n,r);if(!i)throw new e.h(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.h(Iv.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},Rv=(t,n,r)=>{if(oc(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return H(Fv(t),oy(r,void 0,void 0))}catch(t){if(t instanceof e._||e.U(t))return;throw t}},zv=(t,n,r)=>{let i=Lv(t,n,r);if(Rv(n,i,r)!==void 0)throw new e.h(`The ${t} ${n} cannot be a constant.`);return i},Bv=(t,n,r)=>{let i=r.constants.has(n)?void 0:Lv(t,n,r),a=i?Rv(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.h(`The ${t} of ${n} is equal to ${I(a)}`);return a===void 0?i:void 0},Vv=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Hv=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Lu(e.startupDefinitions,r),t.invariants.forEach(e=>{Bv(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Uv=(t,n)=>{let r=Vs({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>uu(e,n)});return t.flatMap(t=>{let i=Bv(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1763
1763
  Note that a bug can cause TLC to incorrectly report this error.
1764
1764
  If you believe your TLA+ or PlusCal specification to be correct,
1765
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.K(new e.h(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.W.safetyEvaluationFailure)}return[{name:t,expression:my(t),scope:void 0}]})},Cy=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Cy(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=gl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Cy(n.body,t)}return[e]},wy=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||Hv(i,t.scope,n)>0)return!1;let a=V(i,zy(n,void 0,void 0,t.scope));if(a===!1)throw new e.h(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.h(`The operator ${i.name}, which equals ${I(a)},\ncannot be used as a ${r}`);return!0},Ty=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return vy(t,e,n),my(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new e.h(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=gy(`name`,t.specification,n),s=_y(t.specification,o,n);if(s!==void 0)throw new e.h(`The value of ${t.specification} is equal to ${I(s)}`);if(Gv(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(wy(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.K(new e.h(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.W.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){i.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Hv(s.expression,o.scope,n)<2)throw e.K(new e._(`TLC cannot handle the temporal formula ${Xc(s.expression)}`),e.W.error);let c=Hv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.h(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.h(`The specification ${t.specification} must contain at most one [][Next]_vars`);let c=[...r,...i],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:r.length===0?void 0:{kind:`And`,operands:r.map(d),location:py},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},Ey=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=yy(`property`,t,n);if(!a)return;Hv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;Gv(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(wy(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`&&Hv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!E(e)?gl(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=Hv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2)throw new e.h(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},Dy=(e,t,n)=>t.flatMap(t=>yy(e,t,n)?[{name:t,expression:my(t),scope:void 0}]:[]),Oy=(e,t)=>{let n=gl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ky=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.h(`_POSSIBLE lists ${r} more than once`);vy(`possible`,r,n);let a=my(r);if(Hv(a,void 0,n)===3)throw new e.h(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),Ay=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||E(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},jy=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=gl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},My=(e,t)=>e.flatMap(e=>Cy(e.expression,t).map(n=>{let r=e.scope===void 0?_a(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Ay(n,r,t),predicate:jy(e.expression,t)}})),Ny=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},Py=/[\u0100-\uffff]/,Fy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Iy=e=>e.kind===`String`?Py.test(e.value):e.kind===`Set`&&e.elements.some(Iy),Ly=e=>e.kind===`String`&&Py.test(e.value)||e.kind===`Apply`&&Fy.has(e.operator)||T(e).some(Ly),Ry=(e,t)=>e.constants.some(e=>Iy(e.value)||(e.args??[]).some(Iy))||[...t.definitions.values()].some(e=>Ly(e.body)||e.kind===`Function`&&e.bounds.some(e=>Ly(e.set))),zy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),By=(e,t,n)=>hl(V(e,t),n),Vy=(t,n,r=Hy)=>{let i=V(t,n);if(typeof i!=`boolean`)throw new e._(r(t,n.environment));return i},Hy=(e,t)=>{let n=e.kind===`Identifier`?gl(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?Yc(i):Zc(r)}`},Uy=(e,t)=>Vy(e.expression,t,(n,r)=>(Vy(e.predicate,t),Hy(n,r))),Wy=()=>{},Gy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=By(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ky=(t,n,r)=>{try{return By(t,zy(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e._)return{message:t.message};throw t}},qy=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ky(n.expression,t,`an assumption`);if(e)return{name:Xc(n.expression),trace:[],message:e.message}}},Jy=(t,n,r,i)=>{let a=Sy(t.invariants,n),o=Ty(t,n),s=Ey(t,n,i),c=My([...a,...s.invariants],n),l=[...new Map(c.map(e=>[e.predicate,e])).values()],u=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(u||s.initialPredicates.length>0||n.variables.length>0))throw new e.h(n.runtime.version===`1.7.4`?Gi:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.h(`The configuration file did not specify the next state predicate.`);let d=My(Dy(`constraint`,t.constraints,n),n),f=Dy(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&gy(`rlreward`,t.rlReward,n),t.periodic!==void 0&&gy(`periodic`,t.periodic,n);let p=ky(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:ny(t.symmetry,n,t.substitutions);t.view!==void 0&&gy(`view function`,t.view,n);let h=t.view===void 0?void 0:{name:t.view,expression:my(t.view),scope:void 0},ee=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:py};return{...e,unchanged:t}}),te=e=>Hv(e.expression,void 0,n)>=2,g=p.filter(e=>!te(e)),_=p.filter(te),ne=n.runtime,re={indices:void 0},v=()=>{if(re.indices)return re.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return re.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),re.indices},ie=(e,t)=>V(e,zy(n,t,void 0)),ae=e=>{let t=v(),n=m===void 0?e:fy(e,m,t);return rm(h===void 0?t.map(e=>n[e]):[ie(h.expression,n)])},oe=Ry(t,n),se;ne.getFingerprint=ae;let ce=()=>{let e=p.find(e=>!ne.possibleCounts.get(e.name));if(!e)return;let t=Oy(e.name,n),r=t?` at ${Yc(t)}`:``;return{name:e.name,code:Vi.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:D(I(Dm(ne),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:v,getStoredFingerprints:(e,t)=>h!==void 0||oe?BigInt64Array.from(e,ae):(se??=am(v()),se(t)),getFingerprintState:e=>{if(oe)return[String(ae(e))];let t=m===void 0?e:fy(e,m,v());return h===void 0?t:[ie(h.expression,t)]},findViolatedInvariant:(t,r)=>c.find(i=>{if(Ny(i,t,r))return!1;try{let e=zy(n,t,void 0,i.scope),a=i.membership;return r&&a?!or(t[a.variable],r[a.variable],V(a.set,e)):!Uy(i,e)}catch(t){throw r?aa(e.K(t,e.W.safetyEvaluationFailure),Vi.invariantEvaluationFailed,`Evaluating invariant ${i.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Vy(n,zy(t,e,void 0,r));d.every(e=>r(e.predicate,e.scope))&&n();let i=l.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(d.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope)))&&f.every(r=>Vy(r.expression,zy(n,e,t,r.scope))))||r())||l.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope))))&&ee.every(r=>Vy(r.box,zy(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>Ny(r,e,t)||Uy(r,zy(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Vy(t.expression,zy(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>ee.find(r=>{try{return!Vy(r.action,zy(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Xc(r.box)}`)&&!By(r.unchanged,zy(n,e,t,r.scope),`a subscript`)}catch(e){throw aa(Yy(e),Vi.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>Vy(i.expression,zy(n,t,r),t=>`${e.P}${Hy(t,n)}`)),trackStatePossible:g.length===0?Wy:e=>Gy(g,ne,zy(n,e,void 0)),trackActionPossible:_.length===0?Wy:(e,t)=>Gy(_,ne,zy(n,e,t)),findUnwitnessedPossible:ce,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=gl(e,n);return t!==void 0&&n.definitionValues.has(t)});if(i!==void 0){if(r)return;throw e.K(new e._(`${e.P}The post condition ${i} cannot be a constant.`),e.W.error)}let a=ce();if(a)return a;for(let e of t.postconditions){let t=Ky(my(e),n,`a postcondition`);if(!t)continue;let r=Oy(e,n),i=r?` at ${Yc(r)}`:``;return t.message===void 0?{name:e,code:Vi.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Vi.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},Yy=t=>t instanceof e.C?e.K(t,t.exitCode):t,Xy=(e,t)=>e*((t-e)/2**64),Zy=e=>e.includes(`.`)?e:`${e}.0`,Qy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Zy(String(e));let[n,r]=e.toExponential().split(`e`);return`${Zy(n)}E${r.replace(`+`,``)}`},$y=e=>e!==void 0&&e>=`0`&&e<=`9`,eb=e=>{if(e===0)return`0.0`;let t=Qy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;$y(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;$y(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;$y(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for($y(t[n.next])&&Number(t[n.next])>=5&&(n.result=tb(n.result));$y(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},tb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${tb(r)}.`:n===`9`?`${tb(r)}0`:`${r}${Number(n)+1}`},nb=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},rb=(e,t,n)=>{if(Xy(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},ib=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},ab=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},ob=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Or(e[t]),16777619),r=Math.imul(r^Fr(e[t]),1540483477);t[0]=ab(n)||1,t[1]=ab(r)},sb=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},cb=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},lb=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),ub=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return cb(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},db=e=>Atomics.load(e.used,0)*2>=e.slots.length,fb=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&cb(t,n);return{slots:t,used:e.used}},pb=[void 0,`lambda`,`tuple`,`record`],mb=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=mr(e.domain);return t?(r(7),r(pb.indexOf(yt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(pb.indexOf(yt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},hb=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return mt(t.strings[n[r.index++]]);if(e===5)return ht(i(n[r.index++]));let a=pb[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=wn({kind:`Interval`,low:e,high:e+t-1});return vt(gt(o,i(t)),a)}let o=n[r.index++],s=i(o);return vt(gt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return gl}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return dv}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Kr}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return zp}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return nt}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Jv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return da}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return ov}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return qv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return mt}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return Ah}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Or}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Bd}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Wp}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return jm}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return A}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Uu}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return te}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return gu}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return w}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return Am}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return At}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return $_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Er}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return z_}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Dr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return un}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return kh}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Yc}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return Mm}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Dt}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Iv}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return oa}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Hv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Nt}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Up}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return E}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Vp}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return pp}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return Oe}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return V}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Xc}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return jl}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return vy}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return na}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return fb}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Bc}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return xy}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return ob}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Uc}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return rb}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Vi}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return Ou}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Xy}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Hi}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return qy}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return ra}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Jy}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return ea}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return lb}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Ql}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Mv}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Fv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return En}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return eb}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Ws}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return my}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return $i}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return mb}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Du}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return ub}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Hc}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return ib}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return mu}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return h}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return sb}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return ll}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return db}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Vc}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return hb}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return bl}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return nb}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Gs}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return zy}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Xi}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Yv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return yr}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Yy}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Zi}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return by}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return ma}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return rm}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return et}});
1765
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.K(new e.h(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.W.safetyEvaluationFailure)}return[{name:t,expression:Fv(t),scope:void 0}]})},Wv=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Wv(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=uu(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Wv(n.body,t)}return[e]},Gv=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||gv(i,t.scope,n)>0)return!1;let a=H(i,oy(n,void 0,void 0,t.scope));if(a===!1)throw new e.h(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.h(`The operator ${i.name}, which equals ${I(a)},\ncannot be used as a ${r}`);return!0},Kv=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return zv(t,e,n),Fv(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new e.h(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=Lv(`name`,t.specification,n),s=Rv(t.specification,o,n);if(s!==void 0)throw new e.h(`The value of ${t.specification} is equal to ${I(s)}`);if(vv(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(Gv(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.K(new e.h(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.W.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){i.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&gv(s.expression,o.scope,n)<2)throw e.K(new e._(`TLC cannot handle the temporal formula ${B(s.expression)}`),e.W.error);let c=gv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.h(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.h(`The specification ${t.specification} must contain at most one [][Next]_vars`);let c=[...r,...i],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:r.length===0?void 0:{kind:`And`,operands:r.map(d),location:Pv},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},qv=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=Bv(`property`,t,n);if(!a)return;gv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;vv(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(Gv(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`&&gv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!E(e)?uu(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=gv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2)throw new e.h(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},Jv=(e,t,n)=>t.flatMap(t=>Bv(e,t,n)?[{name:t,expression:Fv(t),scope:void 0}]:[]),Yv=(e,t)=>{let n=uu(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Xv=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.h(`_POSSIBLE lists ${r} more than once`);zv(`possible`,r,n);let a=Fv(r);if(gv(a,void 0,n)===3)throw new e.h(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),Zv=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||E(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Qv=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=uu(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},$v=(e,t)=>e.flatMap(e=>Wv(e.expression,t).map(n=>{let r=e.scope===void 0?dc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Zv(n,r,t),predicate:Qv(e.expression,t)}})),ey=(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},ty=/[\u0100-\uffff]/,ny=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),ry=e=>e.kind===`String`?ty.test(e.value):e.kind===`Set`&&e.elements.some(ry),iy=e=>e.kind===`String`&&ty.test(e.value)||e.kind===`Apply`&&ny.has(e.operator)||ke(e).some(iy),ay=(e,t)=>e.constants.some(e=>ry(e.value)||(e.args??[]).some(ry))||[...t.definitions.values()].some(e=>iy(e.body)||e.kind===`Function`&&e.bounds.some(e=>iy(e.set))),oy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),sy=(e,t,n)=>lu(H(e,t),n),cy=(t,n,r=ly)=>{let i=H(t,n);if(typeof i!=`boolean`)throw new e._(r(t,n.environment));return i},ly=(e,t)=>{let n=e.kind===`Identifier`?uu(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?Wl(i):Gl(r)}`},uy=(e,t)=>cy(e.expression,t,(n,r)=>(cy(e.predicate,t),ly(n,r))),dy=()=>{},fy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=sy(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),py=(t,n,r)=>{try{return sy(t,oy(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e._)return{message:t.message};throw t}},my=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=py(n.expression,t,`an assumption`);if(e)return{name:B(n.expression),trace:[],message:e.message}}},hy=(t,n,r,i)=>{let a=Uv(t.invariants,n),o=Kv(t,n),s=qv(t,n,i),c=$v([...a,...s.invariants],n),l=[...new Map(c.map(e=>[e.predicate,e])).values()],u=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(u||s.initialPredicates.length>0||n.variables.length>0))throw new e.h(n.runtime.version===`1.7.4`?Vi:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.h(`The configuration file did not specify the next state predicate.`);let d=$v(Jv(`constraint`,t.constraints,n),n),f=Jv(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&Lv(`rlreward`,t.rlReward,n),t.periodic!==void 0&&Lv(`periodic`,t.periodic,n);let p=Xv(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:kv(t.symmetry,n,t.substitutions);t.view!==void 0&&Lv(`view function`,t.view,n);let ee=t.view===void 0?void 0:{name:t.view,expression:Fv(t.view),scope:void 0},te=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Pv};return{...e,unchanged:t}}),ne=e=>gv(e.expression,void 0,n)>=2,h=p.filter(e=>!ne(e)),g=p.filter(ne),re=n.runtime,ie={indices:void 0},_=()=>{if(ie.indices)return ie.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return ie.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ie.indices},ae=(e,t)=>H(e,oy(n,t,void 0)),oe=e=>{let t=_(),n=m===void 0?e:Nv(e,m,t);return gm(ee===void 0?t.map(e=>n[e]):[ae(ee.expression,n)])},se=ay(t,n);re.getFingerprint=oe;let ce=()=>{let e=p.find(e=>!re.possibleCounts.get(e.name));if(!e)return;let t=Yv(e.name,n),r=t?` at ${Wl(t)}`:``;return{name:e.name,code:Li.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:D(I(zm(re),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:_,getStoredFingerprints:(e,t)=>ee!==void 0||se?BigInt64Array.from(e,oe):_m(t,_()),getFingerprintState:e=>{if(se)return[String(oe(e))];let t=m===void 0?e:Nv(e,m,_());return ee===void 0?t:[ae(ee.expression,t)]},findViolatedInvariant:(t,r)=>c.find(i=>{if(ey(i,t,r))return!1;try{let e=oy(n,t,void 0,i.scope),a=i.membership;return r&&a?!ar(t[a.variable],r[a.variable],H(a.set,e)):!uy(i,e)}catch(t){throw r?ta(e.K(t,e.W.safetyEvaluationFailure),Li.invariantEvaluationFailed,`Evaluating invariant ${i.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>cy(n,oy(t,e,void 0,r));d.every(e=>r(e.predicate,e.scope))&&n();let i=l.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(d.every(e=>cy(e.predicate,oy(n,t,void 0,e.scope)))&&f.every(r=>cy(r.expression,oy(n,e,t,r.scope))))||r())||l.every(e=>cy(e.predicate,oy(n,t,void 0,e.scope))))&&te.every(r=>cy(r.box,oy(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>ey(r,e,t)||uy(r,oy(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!cy(t.expression,oy(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>te.find(r=>{try{return!cy(r.action,oy(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${B(r.box)}`)&&!sy(r.unchanged,oy(n,e,t,r.scope),`a subscript`)}catch(e){throw ta(gy(e),Li.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>cy(i.expression,oy(n,t,r),t=>`${e.P}${ly(t,n)}`)),trackStatePossible:h.length===0?dy:e=>fy(h,re,oy(n,e,void 0)),trackActionPossible:g.length===0?dy:(e,t)=>fy(g,re,oy(n,e,t)),findUnwitnessedPossible:ce,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=uu(e,n);return t!==void 0&&Iu(t,n)!==void 0});if(i!==void 0){if(r)return;throw e.K(new e._(`${e.P}The post condition ${i} cannot be a constant.`),e.W.error)}let a=ce();if(a)return a;for(let e of t.postconditions){let t=py(Fv(e),n,`a postcondition`);if(!t)continue;let r=Yv(e,n),i=r?` at ${Wl(r)}`:``;return t.message===void 0?{name:e,code:Li.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Li.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},gy=t=>t instanceof e.C?e.K(t,t.exitCode):t,_y=(e,t)=>e*((t-e)/2**64),vy=e=>e.includes(`.`)?e:`${e}.0`,yy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return vy(String(e));let[n,r]=e.toExponential().split(`e`);return`${vy(n)}E${r.replace(`+`,``)}`},by=e=>e!==void 0&&e>=`0`&&e<=`9`,xy=e=>{if(e===0)return`0.0`;let t=yy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;by(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;by(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;by(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(by(t[n.next])&&Number(t[n.next])>=5&&(n.result=Sy(n.result));by(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Sy=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Sy(r)}.`:n===`9`?`${Sy(r)}0`:`${r}${Number(n)+1}`},Cy=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},wy=(e,t,n)=>{if(_y(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},Ty=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Ey=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Dy=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Er(e[t]),16777619),r=Math.imul(r^Mr(e[t]),1540483477);t[0]=Ey(n)||1,t[1]=Ey(r)},Oy=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},ky=(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}},Ay=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),jy=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return ky(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},My=e=>Atomics.load(e.used,0)*2>=e.slots.length,Ny=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&ky(t,n);return{slots:t,used:e.used}},Py=[void 0,`lambda`,`tuple`,`record`],Fy=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=pr(e.domain);return t?(r(7),r(Py.indexOf(xt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Py.indexOf(xt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},Iy=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return gt(t.strings[n[r.index++]]);if(e===5)return _t(i(n[r.index++]));let a=Py[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Tn({kind:`Interval`,low:e,high:e+t-1});return bt(vt(o,i(t)),a)}let o=n[r.index++],s=i(o);return bt(vt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return uu}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return B_}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Hr}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Up}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return xv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return sa}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return F_}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Dn}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return bv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return gt}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return Hh}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Er}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return Wd}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return Oe}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return Um}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return k}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return ud}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return td}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return Hm}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return jt}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return O_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return wr}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return m_}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Tr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return dn}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Vh}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Wl}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return Wm}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Ot}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return dv}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return na}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return gv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Pt}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return qp}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return E}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Gp}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return _p}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return B}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return xu}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return zv}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Qi}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Ny}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Ll}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return Hv}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return oa}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Bc}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return wy}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Li}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return ad}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return _y}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Ri}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return my}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return $i}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return hy}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Xi}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Ay}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Fl}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return sv}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return uv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return j}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return xy}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Vc}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Fv}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Yi}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Fy}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return ru}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return jy}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Il}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Ty}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Bi}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return $u}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return ee}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Oy}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Bu}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return My}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Rl}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Iy}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return id}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Cy}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return oc}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return oy}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Ki}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Sv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return _r}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return gy}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return qi}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Vv}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return gm}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return nt}});