tla-ts 0.0.3-dev.d9ff6f2 → 0.0.3-dev.e5b05b9

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/dist/transfer.js CHANGED
@@ -13,22 +13,24 @@ The exception was a java.lang.RuntimeException
13
13
  : `,u=`This was a Java StackOverflowError. It was probably the result
14
14
  of an incorrect recursive function definition that caused TLC to enter
15
15
  an infinite loop when trying to compute the function or its application
16
- to an element in its putative domain.`,d=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var f=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},p=class extends f{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}};const m=(e,t=!1)=>new p(e.map(e=>`${e.location}\n\n${e.message}`).join(`
16
+ to an element in its putative domain.`,d=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var f=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},p=class extends f{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}};const m=(e,t=!1,n,r=[])=>new p(e.map(e=>`${e.location}\n\n${e.message}`).join(`
17
17
 
18
- `),void 0,void 0,{errors:e,isFatal:t}),h=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,g=(e,t)=>m([{location:h(t),message:e}]);var _=class extends f{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},v=class extends f{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}},y=class extends v{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},b=class extends v{state;action;missing;constructor(e,t,n){super(`Successor state is not completely specified by the next-state action. The following variable${n.length>1?`s are`:` is`} not defined: ${n.join(`, `)}.\n`),this.name=`TlaEvaluationError`,this.state=e,this.action=t,this.missing=n}},x=class extends f{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},ee=class extends x{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},te=class extends f{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const ne=t=>r(t)??(t instanceof p?e.specParseError:t instanceof _?e.configParseError:t instanceof v?e.specEvaluationFailure:e.error),re=/* @__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(`.`)),ie=/* @__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`]]),S=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),C=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ae=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),oe=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,w=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),se=e=>e.startsWith(`\\`)?parseInt(e.slice(2),w.get(e[1].toLowerCase())):Number(e),T=/-{4,}[ \t]*MODULE\b/,E=e=>/[A-Za-z0-9_]/.test(e),D=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!ie.has(n.slice(0,r.value));)r.value--;let i=ie.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=ae.get(n);if(r)return{text:r,length:n.length};let i=C.find(n=>e.startsWith(n,t));return i?{text:S.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},O=e=>e!==void 0&&e>=`0`&&e<=`9`,ce=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},k=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:ce(e,t+1,O);if(n===t+1||e[n]!==`>`)return 0;let r=ce(e,n+1,E),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return ce(e,i?r+1:r,e=>e===`.`)-t},le=(e,t)=>t===` `?e+8-e%8:e+1,ue=e=>{let t=T.exec(e);if(!t)throw new p(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
19
- `),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=le(o.width,e[o.position]);return le(o.width,e[a.index])},c=(e,t,r)=>{let i=s();n.push({kind:e,text:t,line:a.line,column:i,endColumn:i+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
18
+ `),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),h=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
19
+ `)}`;var g=class extends f{constructor(e){super(e),this.name=`TlaParseError`}};const _=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,v=(e,t)=>m([{location:_(t),message:e}]);var y=class extends f{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},b=class extends f{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}},x=class extends b{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},S=class extends b{variable;constructor(e,t){super(e),this.name=`TlaEvaluationError`,this.variable=t}},C=class extends b{state;action;missing;constructor(e,t,n){super(`Successor state is not completely specified by the next-state action. The following variable${n.length>1?`s are`:` is`} not defined: ${n.join(`, `)}.\n`),this.name=`TlaEvaluationError`,this.state=e,this.action=t,this.missing=n}},w=class extends b{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},T=class extends f{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},ee=class extends T{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},te=class extends f{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const ne=t=>r(t)??(t instanceof p?e.specParseError:t instanceof y?e.configParseError:t instanceof b?e.specEvaluationFailure:e.error),E=/* @__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(`.`)),re=/* @__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`]]),D=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),O=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),k=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),A=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,ie=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),j=e=>e.startsWith(`\\`)?parseInt(e.slice(2),ie.get(e[1].toLowerCase())):Number(e),ae=/-{4,}[ \t]*MODULE\b/,oe=e=>/[A-Za-z0-9_]/.test(e),se=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!re.has(n.slice(0,r.value));)r.value--;let i=re.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=k.get(n);if(r)return{text:r,length:n.length};let i=O.find(n=>e.startsWith(n,t));return i?{text:D.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ce=e=>e!==void 0&&e>=`0`&&e<=`9`,le=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},ue=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:le(e,t+1,ce);if(n===t+1||e[n]!==`>`)return 0;let r=le(e,n+1,oe),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return le(e,i?r+1:r,e=>e===`.`)-t},de=(e,t)=>t===` `?e+8-e%8:e+1,fe=e=>{let t=ae.exec(e);if(!t)throw new p(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
20
+ `),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=de(o.width,e[o.position]);return de(o.width,e[a.index])},c=(e,t,r)=>{let i=s();n.push({kind:e,text:t,line:a.line,column:i,endColumn:i+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
20
21
  `&&(a.line++,a.lineStart=a.index+1),a.index++},u=t=>new p(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
21
22
  `||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
22
- `,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw u(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=ce(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,ce(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||e[a.index]===`
23
+ `,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw u(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=le(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,le(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||e[a.index]===`
23
24
  `)throw u(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];i.push({n:`
24
- `,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=oe.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(E(t)){let t=e.slice(a.index,ce(e,a.index,E));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let n=r.get(t)??t;r.set(n,n),c(re.has(t)?`Keyword`:`Identifier`,n,t.length);continue}let o=k(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let d=D(e,a.index);if(d)c(`Operator`,d.text,d.length);else throw u(`Unexpected character ${JSON.stringify(t)}`)}let d=s();return n.push({kind:`End`,text:``,line:a.line,column:d,endColumn:d}),n},de=/* @__PURE__ */ new Set([`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),fe=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`],A={INIT:`init`,NEXT:`next`,SPECIFICATION:`specification`,VIEW:`view`,SYMMETRY:`symmetry`,ALIAS:`alias`,_PERIODIC:`periodic`,_RL_REWARD:`rlReward`},pe={INVARIANT:`invariants`,INVARIANTS:`invariants`,PROPERTY:`properties`,PROPERTIES:`properties`,CONSTRAINT:`constraints`,CONSTRAINTS:`constraints`,ACTION_CONSTRAINT:`actionConstraints`,ACTION_CONSTRAINTS:`actionConstraints`,POSTCONDITION:`postconditions`,POSTCONDITIONS:`postconditions`,_POSSIBLE:`possible`},me=e=>Object.hasOwn(A,e),he=e=>Object.hasOwn(pe,e),ge=e=>[...e].map(e=>{let t={"\b":`\\b`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`}[e];if(t)return t;if(e===`"`||e===`'`||e===`\\`)return`\\${e}`;let n=e.codePointAt(0)??0;return n<32||n>126?`\\u${n.toString(16).padStart(4,`0`)}`:e}).join(``),_e=(e,t,n,r=``)=>new _(`TLC found an error in the configuration file:\nLexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${ge(n)}" (${n.codePointAt(0)}), `}after : "${ge(r)}"`),j=(e,t)=>new _(`TLC found an error in the configuration file at line ${e}\n${t}`),ve=e=>{let t=`${e}\n`,n=[],r={index:0,line:1,lineStart:0},i=e=>{let n=t.slice(r.index,r.index+e),i=n.lastIndexOf(`
25
+ `,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=A.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(oe(t)){let t=e.slice(a.index,le(e,a.index,oe));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let n=r.get(t)??t;r.set(n,n),c(E.has(t)?`Keyword`:`Identifier`,n,t.length);continue}let o=ue(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let d=se(e,a.index);if(d)c(`Operator`,d.text,d.length);else throw u(`Unexpected character ${JSON.stringify(t)}`)}let d=s();return n.push({kind:`End`,text:``,line:a.line,column:d,endColumn:d}),n},pe=/* @__PURE__ */ new Set([`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),M=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`],me={INIT:`init`,NEXT:`next`,SPECIFICATION:`specification`,VIEW:`view`,SYMMETRY:`symmetry`,ALIAS:`alias`,_PERIODIC:`periodic`,_RL_REWARD:`rlReward`},he={INVARIANT:`invariants`,INVARIANTS:`invariants`,PROPERTY:`properties`,PROPERTIES:`properties`,CONSTRAINT:`constraints`,CONSTRAINTS:`constraints`,ACTION_CONSTRAINT:`actionConstraints`,ACTION_CONSTRAINTS:`actionConstraints`,POSTCONDITION:`postconditions`,POSTCONDITIONS:`postconditions`,_POSSIBLE:`possible`},ge=e=>Object.hasOwn(me,e),_e=e=>Object.hasOwn(he,e),ve=e=>[...e].map(e=>{let t={"\b":`\\b`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`}[e];if(t)return t;if(e===`"`||e===`'`||e===`\\`)return`\\${e}`;let n=e.codePointAt(0)??0;return n<32||n>126?`\\u${n.toString(16).padStart(4,`0`)}`:e}).join(``),ye=(e,t,n,r=``)=>new y(`TLC found an error in the configuration file:\nLexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${ve(n)}" (${n.codePointAt(0)}), `}after : "${ve(r)}"`),be=(e,t)=>new y(`TLC found an error in the configuration file at line ${e}\n${t}`),xe=e=>{let t=`${e}\n`,n=[],r={index:0,line:1,lineStart:0},i=e=>{let n=t.slice(r.index,r.index+e),i=n.lastIndexOf(`
25
26
  `);i!==-1&&(r.line+=n.split(`
26
- `).length-1,r.lineStart=r.index+i+1),r.index+=e},a=e=>_e(r.line+1,0,void 0,e);for(;r.index<t.length;){let e=t.slice(r.index),o=/^\s+/.exec(e)?.[0];if(o){i(o.length);continue}if(e.startsWith(`\\*`)){r.index+=e.indexOf(`
27
+ `).length-1,r.lineStart=r.index+i+1),r.index+=e},a=e=>ye(r.line+1,0,void 0,e);for(;r.index<t.length;){let e=t.slice(r.index),o=/^\s+/.exec(e)?.[0];if(o){i(o.length);continue}if(e.startsWith(`\\*`)){r.index+=e.indexOf(`
27
28
  `);continue}if(e.startsWith(`(*`)){let t=e.indexOf(`*)`);if(t===-1)throw r.line+=e.split(`
28
29
  `).length-2,a(``);i(t+2);continue}let s=/^\d+(?![A-Za-z_])/.exec(e)?.[0];if(s){n.push({kind:`Number`,text:s,line:r.line}),r.index+=s.length;continue}let c=/^[A-Za-z0-9_!]+/.exec(e)?.[0];if(c){n.push({kind:`Word`,text:c,line:r.line}),r.index+=c.length;continue}if(e.startsWith(`"`)){let t=/^"((?:[^"\\\n]|\\.)*)"/.exec(e);if(!t){let t=e.indexOf(`
29
- `);throw t===e.length-1?a(e):_e(r.line,r.index+t-r.lineStart+1,`
30
- `,e.slice(0,t))}n.push({kind:`String`,text:t[1],line:r.line}),r.index+=t[0].length;continue}let l=fe.find(t=>e.startsWith(t));if(l){n.push({kind:`Symbol`,text:l,line:r.line}),r.index+=l.length;continue}let u=D(t,r.index);if(!u)throw _e(r.line,r.index-r.lineStart+1,e[0]);n.push({kind:`Word`,text:u.text,line:r.line}),r.index+=u.length}return n.push({kind:`End`,text:``,line:r.line-1}),n},ye=e=>{let t=ve(e),n={index:0},r={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},i={isSet:!1},a=()=>t[Math.min(n.index++,t.length-1)],o=e=>e.kind===`Word`&&de.has(e.text),s=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=a();if(t.text!==`}`)for(;e.push(s(t)),t=a(),t.text===`,`;)t=a();if(t.text!==`}`)throw j(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw j(e.line,`It was expecting a value, but did not find it.`)},c=e=>{let t=a();if(t.kind===`End`)throw j(t.line,`Expected an identifier after ${e}[.`);let n=a();if(n.text!==`]`)throw j(n.line,`It was expecting ], but did not find it.`);return t.text},l=e=>{for(;;){let t=a();if(t.kind===`End`||o(t))return t;let n={text:t.text},i=a();for(;i.text===`!`;)n.text=`${n.text}!${a().text}`,i=a();if(i.text===`<-`){if(i=a(),i.text===`[`){let e=c(`<-`),t=a();if(t.kind===`End`)throw j(t.line,`Expected an identifier after <-[mod].`);r.substitutions.push({name:n.text,target:t.text,module:e});continue}if(i.kind===`End`)throw j(i.line,`Expected an identifier after <-.`);r.substitutions.push({name:n.text,target:i.text});continue}let l=[];if(i.text===`(`){for(;l.push(s(a())),i=a(),i.text===`,`;);if(i.text!==`)`)throw j(e,``);i=a()}if(i.text!==`=`)throw j(i.line,`It was expecting = or <-, but did not find it.`);i=a();let u=i.text===`[`?c(`=`):void 0,d=s(u===void 0?i:a());r.constants.push({name:n.text,value:d,...l.length>0&&{args:l},...u&&{module:u}})}},u=a();for(;u.kind!==`End`;){let e=u.text,t=u.line;if(me(e)){let n=a();if(n.kind===`End`)throw j(t,`The keyword ${e} was not followed by an identifier.`);let i=A[e];if(r[i]!==void 0)throw j(t,`The keyword ${e} appeared twice.`);r[i]=n.text,u=a()}else if(he(e)){let t=r[pe[e]];for(u=a();u.kind!==`End`&&!o(u);)t.push(u.text),u=a()}else if(e===`CONSTANT`||e===`CONSTANTS`)u=l(t);else if(e===`CHECK_DEADLOCK`){let e=a();if(e.kind===`End`)throw j(t,`The keyword CHECK_DEADLOCK was not followed by an identifier.`);if(e.text!==`TRUE`&&e.text!==`FALSE`)throw j(e.line,`It was expecting TRUE or FALSE, but did not find it.`);if(i.isSet)throw j(t,`The keyword CHECK_DEADLOCK appeared twice.`);i.isSet=!0,r.checkDeadlock=e.text===`TRUE`,u=a()}else throw j(t,`It was expecting a keyword, but did not find it.`)}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new _(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);return r},be={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:` `}},xe=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},Se=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ce=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),we=e=>{let t=t=>{let n=ce(e,t,xe);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=ce(e,t,Se);if(e.startsWith(`..`,n)&&Se(e[n+2]))return{kind:`Constant`,first:t,last:ce(e,n+2,Se)-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=Se(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ce(e,t+1,Se)-1,children:[]};if(Ce(n))return{kind:`Constant`,first:t,last:ce(e,t,Ce)-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)},Te=e=>{let t=e.length===0?void 0:we(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=be[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},M=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ee=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),N=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),P=e=>typeof e==`object`&&e.kind===`ModelValue`,De=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:M(e)?`set`:`function`,Oe=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new y(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ke={isUsed:!1},Ae=(e,t)=>(ke.isUsed=!0,e.writtenKeys=t,e),je=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[dn(e.domain,t)]]),Me=(e,t,n)=>Ae(Qe(e,t),n),Ne=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(Ne);e.writtenKeys=void 0,e.range.forEach(Ne)}},Pe=e=>e.every(e=>typeof e==`string`),Fe=(e,t)=>e.length>0&&t.length>0&&Pe(e)!==Pe(t),Ie=(e,t)=>{ke.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Fe(n,r)?vt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=L(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=L(i[e],a[e]);if(t!==0)return t}return 0},Le=(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=L(n[e],r[e]);if(t!==0)return t}return 0},F=e=>P(e)?e.type:void 0,Re=(e,t,n)=>{let r=F(e),i=F(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(P(e)&&P(t)){if(r===void 0||i===void 0||r===i)return;throw new v(`Attempted to ${a} the differently-typed model values ${U(e)} and ${U(t)}`)}throw r===void 0?new v(`Attempted to ${a} the typed model value ${U(t)} and the non-model value\n${U(e)}`):new v(`Attempted to ${a}${n?``:` the`} typed model value ${U(e)} and non-model value\n${U(t)}`)},ze={ranks:Object.create(null),size:0},Be=e=>{ze.ranks=Object.create(null),ze.size=0,Ye.clear();for(let t of e)Ve(t)},Ve=e=>(ze.ranks[e]===void 0&&(ze.ranks[e]=ze.size++),e),He=()=>ze.size,Ue=e=>ze.ranks[Ve(e)],We=(e,t)=>{if(e===t)return 0;let n=ze.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},I=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ge=(e,t)=>(I(e)||I(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Ke=(e,t,n)=>{if(!I(e))throw new v(`Attempted to ${n} the set ${U(z(e)?B(e):e,!0)} with the value:\n${U(t,!0)}`);if(!I(t))throw new v(`Attempted to compare overridden value ${U(e,!0)} with non-overridden value:\n${U(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new v(`Attempted to compare ${U(e,!0)} with the value\n${U(t,!0)}`)},qe={kind:`InfiniteSet`,name:`Any`},Je=e=>{throw new v(`Attempted to compare ANY with the value\n${U(e)}`)},L=(e,t)=>{if(e===t)return ke.isUsed&&Ne(e),e===qe?Je(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Ie(e,t);if(n===`Set`&&r===`Set`)return Le(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&Re(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Re(e,t,!1),n===`ModelValue`?-1:1;if(e===qe||t===qe)return Je(e===qe?t:e);if(M(e)&&M(t)&&Ge(e,t))return Ke(e,t,`compare`);let i=M(e);if(i!==M(t))throw new v(`Attempted to compare ${De(e)} ${U(e)} with ${De(t)} ${U(t)}`);return i?Le(B(e),rn(t)):Ie(H(e),H(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return We(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Re(e,t,!1),P(e))return-1;if(P(t))return 1;throw new v(`Attempted to compare ${De(e)} ${U(e)} with ${De(t)} ${U(t)}`)},Ye=/* @__PURE__ */ new Map,Xe=e=>{let t=Ye.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Ue(e)};return Ye.set(e,n),n},Ze=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Qe=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),$e=(e,t)=>{if(e===t)return ke.isUsed&&Ne(e),e!==qe||Je(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Re(e,t,!0),L(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 Ie(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Le(e,t)===0;if(P(e)||P(t))return Re(e,t,!0),P(e)&&P(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return $e(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=V(e.domain),r=V(t.domain);if(n||r)return n===r;let i=V(e.range),a=V(t.range);return i||a?i===a:$e(e.domain,t.domain)&&$e(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(V(e))return V(t);if(V(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]&&$e(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return V(e)?V(t):!V(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>$e(e,t.factors[n]));let n=M(e)&&M(t)&&!(z(e)&&z(t));if(n&&Ge(e,t))return Ke(e,t,`check equality of`)===0;if(n){if(!I(e)){let n=B(e);if(!I(t))return Le(n,B(t))===0}return qn(e)===qn(t)}return L(e,t)===0},et=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>tt(e,t[n])),tt=(e,t)=>e===t?!0:typeof e!=`object`||typeof t!=`object`?!1:e.kind===`Set`&&t.kind===`Set`?(e.hash===0||t.hash===0||e.hash===t.hash)&&et(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&et(e.domain,t.domain)&&et(e.range,t.range):qn(e)===qn(t),nt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rt=e=>{if(!N(e))return;let t=H(e);return{domain:t.domain,range:t.range,low:nt(t.domain)}},it=e=>{if(!N(e))return;let t=H(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},at=(e,t)=>{if(F(e)!==void 0)throw new v(`Attempted to compare the typed model value ${U(e)} and the non-model value\n${U(t)}`);return 1},ot=(e,t)=>{if(F(e)!==void 0)throw new v(`Attempted to check equality of the typed model value ${U(e)} and the non-model value\n${U(t)}`);return!1},st=(e,t)=>{let n=F(e);if(n===void 0)return P(t)?e.rank-t.rank:-1;if(!P(t))throw new v(`Attempted to compare the typed model value ${U(e)} and non-model value\n${U(t)}`);let r=F(t);if(r!==void 0&&r!==n)throw new v(`Attempted to compare the differently-typed model values ${U(e)} and ${U(t)}`);return e.rank-t.rank},ct=(e,t)=>{let n=F(e);if(n===void 0)return P(t)&&e.name===t.name;if(!P(t))throw new v(`Attempted to check equality of typed model value ${U(e)} and non-model value\n${U(t)}`);let r=F(t);if(r!==void 0&&r!==n)throw new v(`Attempted to check equality of the differently-typed model values ${U(e)} and ${U(t)}`);return e.name===t.name},lt={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=lt[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${U(e)} with ${r.other}:\n${U(t)}`},dt=(e,t,n)=>{let r=rt(n);if(!r){if(P(n))return at(n,t);throw new v(`Attempted to compare the function ${U(t)} with the value:\n${U(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>ft(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return ft(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new v(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${U(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},ft=(e,t)=>{for(let n=0;n<e.length;n++){let r=vt(e[n],t[n]);if(r!==0)return r}return 0},pt=(e,t)=>{let n=H(e);if(e.kind===`Function`&&fn(n)!==void 0){let r=N(t)?fn(t):void 0;return r?n.range.length-r.length||ft(n.range,r):dt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=it(t);if(!r){if(P(t))return at(t,e);throw new v(`Attempted to compare record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length-r.domain.length||ft(n.domain,r.domain)||ft(n.range,r.range)}return dt({...n,low:nt(n.domain)},e,t)},mt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),ht=(e,t)=>I(e)||I(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),gt=(e,t)=>{let n=mt(t)?t:B(t);return{elements:B(e).elements,otherElements:B(n).elements}},_t=(e,t)=>{if(ht(e,t))return L(e,t);if(!mt(e))return _t(B(e),t);if(!M(t)){if(P(t))return at(t,e);throw new v(`Attempted to compare the set ${U(e)} with the value:\n${U(t)}`)}let n=gt(e,t);return n.elements.length-n.otherElements.length||ft(n.elements,n.otherElements)},vt=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return L(e,t);if(P(t))return at(t,e);throw new v(ut(e,t,!1))}return e.kind===`ModelValue`?st(e,t):N(e)?pt(e,t):_t(e,t)},yt=(e,t)=>e.every((e,n)=>Ct(e,t[n])),bt=(e,t,n)=>{let r=rt(n);if(!r){if(P(n))return ot(n,t);throw new v(`Attempted to check equality of the function ${U(t)} with the value:\n${U(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&yt(e.range,r.range);let i=e.low??r.low;return i===void 0?yt(e.domain,r.domain)&&yt(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new v(`Attempted to compare an integer with non-integer:\n${U(e)}.`);return e===i+t})&&yt(e.range,r.range)},xt=(e,t)=>{let n=H(e);if(e.kind===`Function`&&fn(n)!==void 0){let r=N(t)?fn(t):void 0;return r?n.range.length===r.length&&yt(n.range,r):bt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=it(t);if(!r){if(P(t))return ot(t,e);throw new v(`Attempted to check equality of record:\n${U(e)}\nwith non-record\n${U(t)}`)}return n.domain.length===r.domain.length&&yt(n.domain,r.domain)&&yt(n.range,r.range)}return bt({...n,low:nt(n.domain)},e,t)},St=(e,t)=>{if(ht(e,t))return $e(e,t);if(!mt(e))return St(B(e),t);if(!M(t)){if(P(t))return ot(t,e);throw new v(`Attempted to check equality of the set ${U(e)} with the value:\n${U(t)}`)}let n=gt(e,t);return n.elements.length===n.otherElements.length&&yt(n.elements,n.otherElements)},Ct=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(P(t))return ot(t,e);throw new v(ut(e,t,!0))}return e.kind===`ModelValue`?ct(e,t):N(e)?xt(e,t):St(e,t)},wt=e=>{let t=[];for(let n of e){let e={low:0,high:t.length,comparison:1};for(;e.low<e.high;){let r=e.low+(e.high-e.low>>1);if(e.comparison=vt(n,t[r]),e.comparison===0)break;e.comparison<0?e.high=r:e.low=r+1}e.comparison!==0&&t.splice(e.low,0,n)}return t},Tt=(e,t)=>t.some(t=>Ct(t,e)),Et=(e,t)=>{try{return $e(e,t)}catch(n){if(!(n instanceof v))throw n;return Ct(e,t)}},Dt=e=>{for(let t=1;t<e.length;t++)if(L(e[t],e[t-1])<=0)return!1;return!0},Ot=e=>{if(e.length<2||Dt(e))return Ze(e);let t=[...e].sort(L),n=[t[0]];for(let e=1;e<t.length;e++)L(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ze(n)},kt=e=>{try{return Ot(e)}catch(t){if(!(t instanceof v))throw t;return{kind:`MixedSet`,elements:e}}},At=Ze([]),jt=(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&&L(r[a],t)<0;)a++;a<r.length&&L(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ze(i)},Mt=(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&&L(r[a],t)<0;)a++;a<r.length&&L(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ze(i)},Nt=(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=L(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=Ze(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+Fn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Hn(a[e])|0;c.fingerprint=t}return c},Pt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>L(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&L(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Qe(n,r)},Ft=e=>{let t=Pt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Ae(t,e.map(e=>e[0]))},It=[],Lt=[],Rt=/* @__PURE__ */ new WeakMap,zt=e=>{let t=It[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return It[e]=n,n},Bt=e=>{if(cn(e),e.low===1&&e.high>=1)return zt(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Vt=e=>e.length>0&&(e===It[e.length]||Rt.has(e)),Ht=e=>{let t=B(e).elements;return Vt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Ut=e=>{let t=Lt[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Lt[e]=n,n},R=e=>Qe(zt(e.length),e),Wt=e=>Pt(e),Gt=e=>M(e)&&!I(e),Kt=(e,t=!1)=>`UNION(${U(e.base,t)})`,qt=(e,t=e=>B(e).elements)=>{if(!Gt(e.base))throw new v(`Attempted to enumerate the nonenumerable set:\n${Kt(e)}`);return t(e.base)},Jt=(e,t,n)=>{if(Gt(e))return e;throw new v(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${U(e)}\nwhen enumerating:\n${Kt(n)}`)},z=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 z(e.base);case`FunctionSet`:return z(e.domain)&&z(e.range)||Yt(e.domain)===!0||Yt(e)===!0;case`RecordSet`:return e.sets.every(z)||Yt(e)===!0;case`ProductSet`:return e.factors.every(z)||Yt(e)===!0;case`Union`:return z(e.base)&&an(e.base).every(z);case`SetOperation`:return e.operator===`\\cup`?z(e.left)&&z(e.right):e.operator===`\\cap`?z(e.left)||z(e.right):z(e.left);default:return!1}},Yt=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=Yt(e.domain);return t===void 0?void 0:!t&&Yt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Yt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return z(e)?B(e).elements.length===0:void 0;default:return}},Xt=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},Zt=(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},Qt=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ze(r.map(t=>e[t])));while(Zt(r,e.length))}return t},$t=e=>{if(typeof e!=`object`)throw new v(`Expected a set but found ${U(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return wt(e.elements);case`Interval`:{let t=Bt(e);return t!==It[t.length]&&Rt.set(t,e),t}case`Subset`:{I(e.base)&&cn(e.base);let t=B(e.base).elements;if(t.length>30)throw new v(sn(e));return Qt(t)}case`FunctionSet`:{if(V(e))return[];if(I(e.domain))throw new v(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${U(e.domain)}\ncannot be enumerated.`);let t=Ht(e.domain);if(t.length>0&&I(e.range))throw new v(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${U(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:B(e.range).elements;return Xt(t.map(()=>n)).map(e=>Qe(t,e))}case`RecordSet`:{if(V(e))return[];let t=e.sets.map((t,n)=>{if(I(t))throw new v(`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${U(t)}`);return B(t).elements});return Xt(t).map(t=>Wt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(V(e))return[];let t=e.factors.map((e,t)=>{if(I(e))throw new v(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${U(e)}`);return B(e).elements});return Xt(t).map(R)}case`FilteredSet`:if(I(e.base))throw new v(`Attempted to enumerate { x \\in S : p(x) } when S:\n${U(e.base)}\nis not enumerable`);return B(e.base).elements.filter(e.test);case`Union`:{let t=qt(e).flatMap((t,n)=>B(Jt(t,n,e)).elements);return B(kt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(I(e.left)||I(e.right)))throw new v(`Attempted to enumerate S \\cup T when S:\n${U(e.left)}\nand T:\n${U(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&I(e.left)&&I(e.right))throw new v(`Attempted to enumerate S \\cap T when neither S:\n${U(e.left)}\nnor T:\n${U(e.right)}\nis enumerable`);if(e.operator===`\\`&&I(e.left))throw new v(`Attempted to enumerate S \\ T when S:\n${U(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Nt(B(e.left),B(e.right)).elements;let t=e.operator===`\\`||z(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return B(n).elements.filter(t=>hn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new v(`Attempted to enumerate the non-enumerable set ${U(e)}`);default:throw new v(`Expected a set but found ${U(e)}`)}},en=/* @__PURE__ */ new WeakMap,tn=/* @__PURE__ */ new WeakMap,B=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ze($t(e));let t=typeof e==`object`?en.get(e):void 0;if(t)return t;let n=(typeof e==`object`?tn.get(e):void 0)??nn(e);return typeof e==`object`&&en.set(e,n),n},nn=e=>{let t=$t(e);return typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Ze(t):Ot(t)},rn=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||en.has(e))return B(e);let t=tn.get(e);if(t)return t;let n=nn(e);return tn.set(e,n),n},an=e=>{if(typeof e!=`object`||en.has(e))return B(e).elements;if(e.kind===`Union`)return qt(e,an).flatMap((t,n)=>an(Jt(t,n,e)));if(e.kind===`FilteredSet`&&!I(e.base))return an(e.base).filter(e.test);if(e.kind!==`SetOperation`)return B(e).elements;if(e.operator===`\\cup`)return I(e.left)||I(e.right)?B(e).elements:[...an(e.left),...an(e.right)];let t=e.operator===`\\`||z(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return I(n)?B(e).elements:an(n).filter(t=>hn(t,r)===(e.operator===`\\cap`))},V=e=>{if(typeof e!=`object`||!M(e))throw new v(`Shouldn't call isEmpty() on value ${U(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new v(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(V);case`RecordSet`:return e.sets.some(V);case`FunctionSet`:return!V(e.domain)&&V(e.range);case`Union`:return qt(e).every((t,n)=>V(Jt(t,n,e)));default:return B(e).elements.length===0}},on=(e,t)=>e.reduce((e,n)=>{let r=e*cn(n);if(r>2147483647)throw new v(t());return r},1),sn=e=>`Overflow when computing the number of elements in:\n${U(e)}`,cn=e=>{if(typeof e!=`object`)return B(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new v(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new v(`Attempted to compute the number of elements in the overridden value ${U(e)}.`);case`Subset`:{let t=cn(e.base);if(t>=31)throw new v(sn(e));return 2**t}case`FunctionSet`:{if(V(e.domain))return 1;if(V(e.range))return 0;let t=cn(e.range);if(t===1)return 1;let n=cn(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new v(sn(e));return r.value}case`RecordSet`:return V(e)?0:on(e.sets,()=>sn(e));case`ProductSet`:return V(e)?0:on(e.factors,()=>`Overflow when computing the number of elements in ${U(e)}`);default:return B(e).elements.length}},ln=e=>`Attempted to check if the set ${U(e)}is finite.`,un=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new v(`Attempted to check if the ${De(e)} ${U(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new v(`Attempted to check if the function:\n${U(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return un(e.base)&&V(e.base);case`Subset`:return un(e.base);case`FunctionSet`:{let t=un(e.domain);if(t&&V(e.domain))return!0;let n=un(e.range);return n&&V(e.range)?!0:n&&(t||cn(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!un(e))n.isAllFinite=!1;else if(V(e))return!0;return n.isAllFinite}case`Union`:if(!Gt(e.base))throw new v(`Attempted to check if the nonenumerable set:\n${Kt(e)}\nis a finite set.`);return B(e.base).elements.every(un);case`SetOperation`:if(e.operator===`\\cup`)return un(e.left)&&un(e.right);if(e.operator===`\\cap`){if(!un(e.left)&&!un(e.right))throw new v(ln(e));return!0}if(un(e.left))return!0;if(!un(e.right))throw new v(ln(e));return!1;case`FilteredSet`:if(!un(e.base))throw new v(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${U(e.base)}\nis finite.`);return!0}},dn=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=L(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},fn=e=>{if(typeof e!=`object`||!N(e))return;let t=H(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},pn=(e,t)=>`Attempted to check if the value ${U(e)} is an element of ${U(t)}`,mn=(e,t)=>{let n=`Attempted to check if the value:\n${U(e)}\nis an element of the`;if(!N(t))return`${n} ${De(t)} ${U(t)}`;let r=t.kind===`Function`||z(t.domain)?H(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${U(e)}\nis in the record:\n${U(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${U(t)}`},hn=(e,t)=>{if(!M(t))throw new v(mn(e,t));switch(t.kind){case`Set`:try{return dn(t.elements,e)!==-1}catch(n){if(!(n instanceof v))throw n;return Tt(e,t.elements)}case`MixedSet`:return Tt(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!P(e))throw new v(`Attempted to check if the value:\n${U(e)}\nis in the integer interval ${U(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(P(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new v(`Attempted to check if the value:\n${U(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!M(e))throw new v(pn(e,t));return B(e).elements.every(e=>hn(e,t.base));case`FunctionSet`:{if(!N(e)){if(P(e))return!1;throw new v(`Attempted to check if \n${U(e)}\nwhich is not a TLC function value, is in the set of functions:\n${Te(U(t))}`)}let n=H(e),r=nt(n.domain);return(r===void 0?Et(t.domain,Ze(n.domain)):Et({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>hn(e,t.range))}case`RecordSet`:{let n=N(e)?H(e):void 0;if(!n||!Pe(n.domain)){if(P(e))return!1;throw new v(`Attempted to check if non-record\n${U(e)}\nis in the set of records:\n${U(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=dn(n.domain,e);return i!==-1&&hn(n.range[i],t.sets[r])})}case`ProductSet`:{let n=N(e)?fn(e):void 0;if(n===void 0){if(N(e)&&H(e).domain.every(e=>typeof e==`number`)||P(e))return!1;throw new v(`Attempted to check if non-tuple\n${U(e)}\nis in the set of tuples:\n${U(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>hn(e,t.factors[n]))}case`FilteredSet`:return hn(e,t.base)&&t.test(e);case`Union`:if(!Gt(t.base))throw new v(`Attempted to check if:\n ${U(e)}\nis an element of the non-enumerable set:\n ${Kt(t)}`);return B(t.base).elements.some(t=>hn(e,t));case`SetOperation`:return t.operator===`\\cup`?hn(e,t.left)||hn(e,t.right):hn(e,t.left)&&hn(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=fn(e);if(n===void 0){if(P(e))return!1;throw new v(pn(e,t))}return n.every(e=>hn(e,t.base))}default:throw new v(mn(e,t))}},gn=(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?hn(e,n):e.range.every((e,r)=>gn(e,t.range[r],n.range)),H=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){z(e.domain)||cn(e.domain);let t=Ht(e.domain);return Qe(t,t.map(t=>e.apply(t)))}throw new v(`Expected a function but found ${U(e)}`)},_n=/* @__PURE__ */ new WeakSet,vn=e=>(_n.add(e),e),yn=e=>{let t=e.domain;return t.length===0?_n.has(e)?`FcnRcdValue`:`TupleValue`:t===It[t.length]?`TupleValue`:Rt.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},bn=(e,t)=>`Attempted to apply function:\n${Te(U(e))}\nto argument ${Te(U(t))}, which is not in the domain of the function.`,xn=e=>`Attempted to apply function with integer domain to the non-integer argument ${Te(U(e))}`,Sn=(e,t)=>{if(_n.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${Te(U(e))},\nthe first argument is:\n${Te(U(t))}\nwhich is not in its domain.\n`;let n=yn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${Te(U(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${Te(U(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${Te(U(e))}`:`Attempted to access record by a non-string argument: ${Te(U(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?xn(t):bn(e,t)},Cn=(e,t)=>yn(e)===`FcnRcdValue`?bn(e,t):xn(t),wn=e=>yn(e)===`RecordValue`,Tn=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===It[e.length]||Rt.has(e)):typeof n==`string`&&typeof t!=`string`},En=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return dn(e,t)},Dn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!hn(t,e.domain))throw new v(_n.has(e)?Sn(e,t):`Attempted to apply a function to ${U(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new v(r?.(e)??`Attempted to apply ${U(e)}, which is not a function`);let i=Tn(e.domain,t)?-1:En(e.domain,t);if(i===-1)throw new v(n?.(e)??Sn(e,t));return e.range[i]},On=e=>Vt(e)?Rt.get(e)??Ut(e.length):void 0,kn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=H(e).domain;return On(t)??Ze(t)},An=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!z(e.domain))){if(!hn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>Et(t,n)?r:e.apply(n),source:e.source}}let i=H(e),a=En(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Qe(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-In(e,s)+In(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Un(e,s)+Un(e,c)|0}return l},jn=/* @__PURE__ */ new WeakMap,Mn=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Nn=(e,t)=>Math.imul(e^t,16777619),Pn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Mn(t)},Fn=e=>Mn(Rn(e)+2654435769|0),In=(e,t)=>Mn(Math.imul(Rn(e),668265261)+Rn(t)|0),Ln=e=>{if(e.kind===`ModelValue`)return Mn(Nn(Pn(e.name),109));if(M(e)){if(!z(e))return Pn(qn(e));let t=B(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+Fn(t[e])|0;return n}let t=H(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+In(t.domain[e],t.range[e])|0;return n},Rn=e=>{if(typeof e==`number`)return Mn(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Pn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Ln(e)),e.hash;let t=jn.get(e);if(t!==void 0)return t;let n=Ln(e);return jn.set(e,n),n},zn=/* @__PURE__ */ new WeakMap,Bn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Vn=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Bn(t)},Hn=e=>Bn(Gn(e)+2135587861|0),Un=(e,t)=>Bn(Math.imul(Gn(e),374761393)+Gn(t)|0),Wn=e=>{if(e.kind===`ModelValue`)return Bn(Vn(e.name)^60);if(M(e)){if(!z(e))return Vn(qn(e));let t=B(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Hn(t[e])|0;return n}let t=H(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Un(t.domain[e],t.range[e])|0;return n},Gn=e=>{if(typeof e==`number`)return Bn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Vn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Wn(e)),e.fingerprint;let t=zn.get(e);if(t!==void 0)return t;let n=Wn(e);return zn.set(e,n),n},Kn=/* @__PURE__ */ new WeakMap,qn=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=Kn.get(e);if(t!==void 0)return t;let n=Jn(e);return Kn.set(e,n),n},Jn=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${qn(e.base)}>`;if(e.kind===`FilteredSet`&&!z(e))throw new v(`Attempted to compare the non-enumerable set ${U(e)} with another value`);if(M(e))return z(e)?`{${B(e).elements.map(qn).join(`,`)}}`:`<${e.kind} ${U(e)}>`;let t=H(e);return`(${t.domain.map((e,n)=>`${qn(e)}:${qn(t.range[n])}`).join(`,`)})`},Yn=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Xn=e=>e.reduce((e,t)=>e===0?0:e*cn(t),1),Zn=e=>{if(e.kind===`Subset`)return cn(e.base)<=6?B(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return B(e);if(e.kind===`FunctionSet`&&z(e.domain)&&cn(e.domain)===0)return Ze([Qe([],[])]);let t=e.kind===`FunctionSet`?cn(e.range)**cn(e.domain):Xn(e.kind===`RecordSet`?e.sets:e.factors);return t===0?At:t<=1999?B(e):void 0},Qn=(e,t)=>{if(t)return Zn(e);if(z(e))try{return Zn(e)}catch(e){if(e instanceof v)return;throw e}},$n=(e,t)=>{let n=e=>U(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`{x \\in ${n(e.base)} : ...}`;case`Union`:return Kt(e,t)}},er=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),U=(e,t=!1,n=!1)=>{let r=e=>U(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Yn(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(B(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=Qn(e,t);return n?r(n):$n(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!z(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${U(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=H(e),a=r=>U(r,t,n&&e.kind===`Function`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:i.domain.every(e=>typeof e==`string`&&er(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):je(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},tr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Te(U(n))}\n`).join(``)},nr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},rr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Rn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||tt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||tt(i[e],n))return i[e]}return n.kind===`Set`?nr(n.elements,t):(nr(n.domain,t),nr(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}},ir=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`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:[])}},W=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,ar=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),or=(e,t)=>ar.has(e)?new v(t):new y(t),sr=e=>typeof e==`object`&&e.kind===`Operator`,G=(e,t,n)=>{let r=e[t];if(r===void 0||sr(r))throw or(n,`${n} expects a value as argument ${t+1}`);return r},cr=(e,t,n)=>{let r=G(e,t,n);if(typeof r!=`number`)throw or(n,`${n} expects an integer but received ${U(r)}`);return r},lr=(e,t,n)=>{let r=G(e,t,n);if(typeof r!=`boolean`)throw or(n,`${n} expects a boolean but received ${U(r)}`);return r},ur=(e,t,n)=>{let r=G(e,t,n);if(!M(r))throw or(n,`${n} expects a set but received ${U(r)}`);return r},dr=(e,t,n)=>{let r=ur(e,t,n);if(!z(r))throw or(n,`${n} cannot enumerate the non-enumerable set ${U(r)}`);return r},fr=(e,t,n)=>B(dr(e,t,n)),pr=(e,t,n)=>fr(e,t,n).elements,mr=(e,t,n)=>{let r=G(e,t,n),i=fn(r);if(!i)throw or(n,`${n} expects a sequence but received ${U(r)}`);return i},hr=(e,t,n)=>{let r=G(e,t,n);if(!N(r))throw or(n,`${n} expects a function but received ${U(r)}`);return H(r)},gr=(e,t,n)=>{let r=e[t];if(r===void 0||!sr(r))throw or(n,`${n} expects an operator as argument ${t+1}`);return r},_r=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),K=(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}),vr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),yr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),br=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(G(n,0,e),G(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),xr=e=>e>2147483647||e<-2147483648,Sr=e=>new y(`Overflow when computing ${e}`),Cr={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`},wr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Tr={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`},Er=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return wr[e.operator];if(e.kind!==`Function`)return Cr[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},Dr=e=>Tr[Er(e)],Or=(e,t)=>new v(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),kr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof v&&(e.isLazy===!0||!(n instanceof y))?Or(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Ar=(e,t)=>{if(typeof e!=`number`)throw Or(t,`Cannot cast tlc2.value.impl.${Er(e)} to tlc2.value.impl.IntValue`);return e},jr=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Mr=(e,t,n)=>{let r=jr(t,`IntValue`,2);return br(e,(t,i)=>{let a=Ar(t,r),o=Ar(i,r),s=n(a,o);if(xr(s))throw Sr(`${a}${e}${o}`);return s})},Nr=(e,t,n)=>{if(typeof e!=`number`)throw new y(`The ${t} argument of ${n} should be an integer, but instead it is:\n${U(e)}`);return e},Pr=(e,t)=>br(e,(n,r)=>t(Nr(n,`first`,e),Nr(r,`second`,e))),Fr=(e,t,n)=>({...yr(e,t,n),isLazy:!0}),Ir=(e,t,n)=>{let r=gr(e,t,n);return()=>r.call([])},Lr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Rr=()=>({bool:ko,condition:(e,t)=>{if(typeof e!=`boolean`)throw go(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw _o(t,n,e);return e},apply:Dn,tuple:R,set:kt,record:Qe,writtenRecord:Me,equal:$e,enumerate:Po,unassigned:(e,t)=>{throw oc(e,t)},primeOutsideAction:e=>{throw sc(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0}),extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Eo(e,t,n[r]),e.scope),state:e.state,next:e.next})}),zr={value:void 0},Br=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Vr=e=>`local${e.counter++}`,Hr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),ir(e).forEach(e=>Hr(e,t)),t),Ur=(e,t,n)=>{let r=Br(e,Y(t,e.environment)),i=Hr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Br(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Wr=(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(()=>Vr(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Kr(e,t.set,s)}, ${Br(e,t.set)});`),u=t.bounds.map(t=>{let n=Vr(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Kr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Vr(e);return`for (let ${i} = 0; ${i} < ${c[r]}.length; ${i}++) { const ${n} = ${c[r]}[${i}]; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Gr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Kr(e,r[0],n)}, "the left side of =>") ? bool(${Kr(e,r[1],n)}, "the right side of =>") : true)`;if(W(t))return Ur(e,t,n);let i=Jo(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ur(e,t,n);if(i.name===`DOMAIN`)return`${Br(e,xo(t))}(${Kr(e,r[0],n)})`;if(i.name===`TLCEval`)return Ur(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Br(e,So(t,i))}(${Kr(e,r[0],n)}, ${Kr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Bs(r[0],a))return`${Br(e,i.evaluateUnary)}(${Kr(e,r[0],n)})`;let o=r.length===2&&Bs(r[0],a)&&Bs(r[1],a);return i.evaluateBinary&&o?`${Br(e,i.evaluateBinary)}(${Kr(e,r[0],n)}, ${Kr(e,r[1],n)})`:Ur(e,t,n)},Kr=(e,t,n)=>{let r=(t,r=n)=>Kr(e,t,r);if(ks(t)&&ws(t,e.environment))return Ur(e,t,n);switch(t.kind){case`Number`:return fs(t.value)?String(t.value):Ur(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(W(t))return Ur(e,t,n);let i=is(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Br(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Br(e,i.value):Ur(e,t,n)}case`Apply`:return Gr(e,t,n);case`And`:{let n=Br(e,t);return`(${t.operands.map((e,t)=>`conjunct(${r(e)}, ${n}, ${t})`).join(` && `)})`}case`Or`:return`(${t.operands.map(e=>`bool(${r(e)}, "a disjunct")`).join(` || `)})`;case`If`:return`(condition(${r(t.condition)}, ${Br(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{ec(t.function);let n=r(t.function),i=Br(e,yo(t));return t.args.length===1?`apply(${n}, ${r(t.args[0])}, undefined, ${i})`:`apply(${n}, tuple([${t.args.map(e=>r(e)).join(`, `)}]), undefined, ${i})`}case`FieldAccess`:return`apply(${r(t.record)}, ${JSON.stringify(t.field)}, ${Br(e,vo(t))}, ${Br(e,bo(t))})`;case`Record`:{let i=ic(t.fields);if(ac(i))return Ur(e,t,n);let a=Br(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}, ${Br(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=Br(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`)?Wr(e,t,n):Ur(e,t,n);default:return Ur(e,t,n)}},qr=(e,t)=>{if(!Lr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Kr(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(`
31
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;zr.value??=Rr();let o=zr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Jr={kind:`Local`},Yr=/* @__PURE__ */ new WeakMap,Xr=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Zr=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),Qr=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,$r=e=>e.kind===`Operator`?e.params.length:0,ei=e=>e.name.includes(`!`),ti=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ni=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),ri=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),ii=e=>e.kind===`Name`?[e.name]:e.names,ai=e=>e.flatMap(e=>ii(e.pattern)),oi=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Qr(n.location,t.location))?n:void 0},si=(e,t)=>{let n=oi(e,t);return n?{key:t.getKey(n),arity:$r(n)}:t.imported.get(e)},ci=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),li=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Qr(e.location,e.args[0].location)?`prefix`:`postfix`}},ui=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),di=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),fi=(e,t,n,r)=>{let i=e.location,a=Yr.get(e);if(a!==void 0)return a;if(Xr(t))return e.kind===`Apply`?e.args.length:0;if(di(t))return 0;let o=ti(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=Jr),o)return o.arity;let s=si(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Yr.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(ti(n,c)!==void 0||si(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=ci(i,t===`-.`?`-`:t);if(!ui(t))throw g(`Unknown operator: \`${t}'.`,l);let u={location:h(l),message:`Could not find declaration or definition of symbol '${t}'.`},d=li(e);throw m(d&&i.range?[u,{location:h(i.range),message:`Couldn't resolve ${d} operator symbol \`${t}'.`}]:[u])},pi=(e,t,n)=>(e.forEach(e=>q(e.set,t,n)),e.reduce((e,t)=>ni(e,ii(t.pattern)),t)),mi=(e,t)=>e.kind===`Identifier`&&e.name===t&&W(e)||ir(e).some(e=>mi(e,t)),hi=(e,t)=>{e.kind===`FunctionConstruction`&&mi(e.body,t)&&(e.isRecursive=!0),ir(e).forEach(e=>hi(e,t))},gi=(e,t,n)=>{let r=ni(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(q(e.body,pi(e.bounds,r,n),n),hi(e.body,e.name)):q(e.body,ri(r,e.params),n)},_i=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:$r(t),parent:e}),t);return e.reduce((e,t)=>(ei(t)||gi(t,e,n),{name:t.name,arity:$r(t),parent:e}),r)},vi=(e,t,n,r,i)=>{let a=e.kind===`Operator`?e.params[t]:void 0,o=n.location;if(a?.arity===0&&r>0)throw new p(`Operator used in argument number ${t+1} has incorrect number of arguments at line ${o.line}, column ${o.column}`);let s=i?.kind===`Operator`&&i.params.some(e=>e.arity>0);if(a!==void 0&&a.arity>0&&(r!==a.arity||s))throw new p(`Argument number ${t+1} to operator '${e.name}' should be a ${a.arity}-parameter operator at line ${o.line}, column ${o.column}`)},yi=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,bi=(e,t,n)=>{let r=e.operator,i=ti(t,r)?void 0:oi(r,n),a=fi(e,r,t,n);if(a!==e.args.length)throw g(`The operator ${r} requires ${a} arguments.`,e.argumentsRange??ci(e.location,r));e.args.forEach((e,r)=>{let a=yi(e),o=a===void 0||ti(t,a)?void 0:oi(a,n),s=xi(e,t,n);i&&vi(i,r,e,s,o)})},xi=(e,t,n)=>e.kind===`Identifier`?fi(e,e.name,t,n):e.kind===`OperatorReference`?fi(e,e.operator,t,n):(q(e,t,n),e.kind===`Lambda`?e.params.length:0),q=(e,t,n)=>{let r=e=>e.forEach(e=>q(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=e.name,i=fi(e,r,t,n);if(i>0)throw g(`The operator ${r} requires ${i} arguments.`,ci(e.location,r));return}case`OperatorReference`:fi(e,e.operator,t,n);return;case`Apply`:bi(e,t,n);return;case`Lambda`:q(e.body,ni(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:q(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&q(e.other,t,n);return;case`Let`:q(e.body,_i(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:q(e.body,pi(e.bounds,t,n),n);return;case`UnboundedQuantifier`:q(e.body,ni(t,e.names),n);return;case`Choose`:e.set&&q(e.set,t,n),q(e.body,ni(t,ii(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:q(e.predicate,pi([e.bound],t,n),n);return;case`SetMap`:q(e.expression,pi(e.bounds,t,n),n);return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:{let t=e.fields.filter((t,n)=>e.fields.slice(0,n).some(e=>e.name===t.name));if(t.length>0)throw m(t.map(e=>({location:h(e.location.range??ci(e.location,e.name)),message:`Non-unique fields in constructor.`})));r(e.fields.map(e=>e.value));return}case`Except`:r([e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])]);return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:q(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:q(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>xi(e,t,n))}},Si=(e,t,n)=>(e.set&&q(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),Ci=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?Si(t,e,n):(t.kind===`AssumeProve`?Ci(t,e,n):q(t,e,n),e),t);return q(e.conclusion,r,n),r},wi=(e,t,n)=>e.kind===`AssumeProve`?Ci(e,t,n):(q(e,t,n),t),Ti=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>Ei(t,e,n),t)},Ei=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=wi(r.statement,t,n);return Ti(e.proof,i,n),r.isSuffices?i:t}case`Define`:return _i(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return q(r.expression,t,n),Ti(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>q(e,t,n)),t;case`Take`:return ni(pi(r.bounds,t,n),r.names);case`Pick`:{let i=ni(pi(r.bounds,t,n),r.names);return q(r.body,i,n),Ti(e.proof,t,n),i}default:return Ti(e.proof,t,n),t}},Di=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:wi(e.statement,void 0,t);Ti(e.proof,n,t)},Oi=(e,t)=>new p(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),ki=(e,t,n,r)=>t.reduce((e,t)=>{if(ti(e,t)||n(t))throw Oi(t,r);return{name:t,arity:0,parent:e}},e),Ai=(e,t,n,r)=>(e.forEach(e=>Mi(e.set,t,n)),e.reduce((e,t)=>ki(e,ii(t.pattern),n,r),t)),ji=(e,t,n)=>{if(e.kind===`Function`){let r=ni(t,[e.name]),i=Ai(e.bounds,r,n,e.location);Mi(e.body,i,n);return}let r=ki(t,e.params.map(e=>e.name),n,e.location);Mi(e.body,r,n)},Mi=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:Mi(e.body,ki(t,e.params,n,r),n);return;case`Let`:{let i=e.definitions.filter(e=>e.isRecursive).map(e=>e.name),a=e.definitions.reduce((e,t)=>{if(ti(e,t.name)||n(t.name))throw Oi(t.name,t.location);return ji(t,ni(e,i),n),ni(e,[t.name])},t);Mi(e.body,ki(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:Mi(e.body,Ai(e.bounds,t,n,r),n);return;case`SetFilter`:Mi(e.predicate,Ai([e.bound],t,n,r),n);return;case`SetMap`:Mi(e.expression,Ai(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:Mi(e.body,ki(t,e.names,n,r),n);return;case`Choose`:e.set&&Mi(e.set,t,n),Mi(e.body,ki(t,ii(e.pattern),n,r),n);return;default:ir(e).forEach(e=>Mi(e,t,n))}},Ni=e=>[...e.definitions.map(e=>({name:e.name,kind:`Definition`,location:e.location,isRecursive:e.isRecursive})),...e.instances.flatMap(e=>e.name===void 0?[]:[{name:e.name,kind:`Definition`,location:e.location,isRecursive:!1}]),...e.constants.map(e=>({name:e.name,kind:`Constant`,location:e.location,isRecursive:!1})),...e.variables.map(e=>({name:e.name,kind:`Variable`,location:e.location,isRecursive:!1}))],Pi=(e,t)=>{let n=/* @__PURE__ */ new Map;Ni(e).sort((e,t)=>Qr(e.location,t.location)?-1:1).forEach(e=>n.set(e.name,[...n.get(e.name)??[],e]));let r=(e,n)=>{if(!t.imported.has(e)&&!Zr.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||Qr(r,n)};n.forEach(e=>e.forEach((n,i)=>{let a=e.slice(0,i).some(e=>e.kind===`Definition`||n.kind===`Definition`||e.kind!==n.kind),o=t.imported.get(n.name)?.declaration===n.kind;if(a||!o&&r(n.name,n.location))throw Oi(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||Qr(t.location,e))||r(t,e);e.definitions.forEach(e=>ji(e,void 0,i(e.location))),e.assumptions.forEach(e=>Mi(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=ki(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>Mi(e.expression,n,t))})},Fi=(e,t)=>{let n=new Map([...Zr,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0})),n},Ii=(e,t,n,r)=>{let i=ri(void 0,e.params),a={imported:Fi(n,r.imported),definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set},o=new Map(e.substitutions.map(e=>[e.name,e.expression])),s=`in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`;return o.forEach((e,n)=>{if(t.every(e=>e.name!==n))throw new p(`Identifier '${n}' is not a legal target of a substitution ${s}`)}),new Map(t.map(t=>{let n=t.name;if(!o.has(n)&&!ti(i,n)&&!si(n,a))throw new p(`Substitution missing for symbol ${n} ${s}`);let r=o.get(n)??{kind:`Identifier`,name:n,location:e.location};if(t.arity===0||r.kind!==`Identifier`)return q(r,i,a),[n,r];if(fi(r,r.name,i,a)!==t.arity)throw new p(`An operator must be substituted for symbol '${n}', and it must have arity ${t.arity} ${s}`);return[n,r]}))},Li=e=>{let t=[];if(e.toSorted((e,t)=>Qr(e.location,t.location)?-1:1).forEach(e=>{try{e.check()}catch(e){if(!(e instanceof p)||!e.sany)throw e;e.sany.errors.filter(e=>t.every(t=>t.location!==e.location||t.message!==e.message)).forEach(e=>t.push(e))}}),t.length>0)throw m(t)},Ri=(e,t)=>{let n=Fi(e,t.imported),r=new Set([...e.theorems,...e.assumptions].flatMap(e=>e.name??[])),i=(e,i)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:i,facts:r});Li([...e.definitions.map(e=>({location:e.location,check:()=>gi(e,void 0,i(e.location,e))})),...e.assumptions.map(e=>({location:e.location,check:()=>q(e.expression,void 0,i(e.location,void 0))})),...e.theorems.map(e=>({location:e.location,check:()=>Di(e,i(e.location,void 0))}))])},zi=/* @__PURE__ */ new WeakSet,Bi=/* @__PURE__ */ new WeakSet,Vi=(e,t,n=/* @__PURE__ */ new Set)=>{let r=qi(e,(e,r)=>Vi(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&W(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&W(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Hi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Ui=/* @__PURE__ */ new WeakMap,Wi=e=>Ui.get(e)??e.name,Gi=(e,t)=>(Wi(t)!==e.name&&Ui.set(e,Wi(t)),e),Ki=(e,t)=>Gi(e.kind===`Function`?{...e,bounds:Hi(e.bounds,e=>t(e,[])),body:t(e.body,ai(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),qi=(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=>Ki(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Hi(e.bounds,n),body:t(e.body,ai(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,ii(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,ii(e.bound.pattern))};case`SetMap`:return{...e,bounds:Hi(e.bounds,n),expression:t(e.expression,ai(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`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)}}},Ji=`LAMBDA`,Yi=(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 qi(e,(e,n)=>(r.push(...Yi(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Xi=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}},Zi=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Qi=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},$i=(e,t)=>e.map(e=>({pattern:Qi(e.pattern,t),set:e.set})),ea=(e,t)=>e.kind===`Function`?{...e,bounds:$i(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ta=(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=>Gi({...ea(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:$i(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Qi(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Qi(e.bound.pattern,n),set:e.bound.set}};default:return e}},na=e=>`${e}@ENABLED`,ra=(e,t)=>e.modes.get(t)??e,ia=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!W(e)&&t.instantiation.variables.has(e.name),aa=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>aa(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(ia(e,t,n))return[e.name];let r=W(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?aa(r.body,t,/* @__PURE__ */ new Map):void 0},oa=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ia(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:na(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:da(e.expression,ra(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[da(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:da(e.subscript,ra(t,`Primed`),n),location:r},da(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=aa(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:na(r),location:e.location},location:e.location},da({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},sa=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),ca=(e,t)=>e.map(e=>sa(e.name,t)),la=(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:[...ca(t,r),...i.map(e=>sa(e,r))],location:r},location:r}},ua=(e,t)=>e.instantiation.isParameterized(t)?pa(e,t):void 0,da=(e,t,n)=>{let r=e=>da(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!W(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:da(e.expression,ra(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:da(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ra(t,`Enabled`),n)};let s=oa(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return zi.add(n),n;let r=ua(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&$r(o)>0?la(r,a,$r(o),e.location):{kind:`Apply`,operator:r,args:ca(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||Bi.has(e),c=e=>(s&&Bi.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Ji,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Ji,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new p(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=ua(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...ca(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=ua(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?la(n,a,$r(r),e.location):{...e,operator:n}}let c=Xi(t),l=qi(e,(e,i)=>i.length===0?r(e):da(e,t,Zi(n,i,c)));return ta(l,n,c)},fa=(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:sa(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},pa=(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=Xi(e),o=ea(Ki(i,(t,n)=>da(t,e,Zi(/* @__PURE__ */ new Map,n,a))),a);return fa(o,r.params,i.location)}):t},ma=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Yi(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=>ua(i,e)??e,getQualifiedKey:t=>{let n=ua(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>fa(r,e.params,r.location)):t}}},ha=e=>e.kind===`Let`&&e.instances!==void 0||ir(e).some(ha),ga=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=qi(e,e=>ga(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Qr(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions),body:i.body,location:i.location}},_a=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,va=(e,t)=>e.definitions.some(e=>ha(e.body))||e.assumptions.some(e=>ha(e.expression))||e.theorems.some(e=>{let t=_a(e);return t!==void 0&&ha(t)})?{...e,definitions:e.definitions.map(e=>Ki(e,e=>ga(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:ga(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=_a(e);return n===void 0?e:{...e,statement:ga(n,t,[])}})}:e,ya=/* @__PURE__ */ new WeakMap,ba=/* @__PURE__ */ new WeakMap,J=(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},xa=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Sa=(e,t,n)=>{if(typeof t==`boolean`)return t;throw new v(`In computing ${n?`initial`:`next`} states, TLC expected a boolean expression,\nbut instead found ${U(t)}.\n${ho(e)}`)},Ca=(t,r,i=X(t,r))=>{if(r.next!==void 0&&t.kind===`Number`)throw n(new v(`The next state relation is not a boolean expression.\n${t.text??t.value}`),e.error);return Sa(t,i,r.next===void 0)},wa=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ta=/* @__PURE__ */ new WeakMap,Ea=(e,t)=>{if(!e.trace)return t?ya:ba;let n=Ta.get(e)??[/* @__PURE__ */ new WeakMap,/* @__PURE__ */ new WeakMap];return Ta.set(e,n),n[+!t]},Da=(e,t,n)=>{let r=Ea(t,n),i=r.get(e);if(i)return i;let a=ro(e,t,n),o=t.trace,s=o?(t,n,r,i,s,c)=>{let l=o.length;o.push(e),a(t,n,r,i,s,c),o.length=l}:a;return r.set(e,s),s},Oa=(e,t)=>{if(t.constants.has(e))return;let n=Ao(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},ka=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return ka(e.expression,t,!1,r);if(e.kind!==`Identifier`||W(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Oa(e.name,t);if(a&&!r.has(a))return r.add(a),ka(a.body,t,n,r)},Aa=(e,t,n)=>ka(e,t,!n),ja=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ja(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=us(e.definitions,J(r,t,n));return ja(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=To(t,e.name);if(a?.kind===`Thunk`)return ja(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=Oa(e.name,r.environment);if(s)return ja(s.body,void 0,n,r,i)},Ma=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||W(e))||!t&&e.kind===`Prime`,Na=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Na(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=Oa(e.name,t);if(i)return n.add(e.name),Na(i.body,t,n)},Pa=(e,t)=>{if(e.kind===`Tuple`)return[e,...e.elements.flatMap(e=>Pa(e,t))];let n=e.kind===`Identifier`&&!t.variableIndex.has(e.name)?Oa(e.name,t):void 0;return n?[e,...Pa(n.body,t)]:[e]},Fa=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ia=(e,t,n)=>Fa.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||wa(e.operator)&&(Ma(e.args[0],n)||Aa(e.args[0],t,n)!==void 0)||W(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,La=/* @__PURE__ */ new Set,Ra=(e,t)=>{if(W(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return qi(e,(e,i)=>{let a=r.isReadOnly?Ra(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},za=(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||W(e)?void 0:Ao(r,t);return i&&!n.has(i)&&(n.add(i),za(i.body,t,n))?!0:ir(e).some(e=>za(e,t,n))},Ba=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Aa(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=Na(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Ia(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Da(e,t,n)}},Va=(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(fc(e,t)===void 0||za(e,t,/* @__PURE__ */ new Set))return!0;let n=Ra(e,La);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)}},Ha=(e,t,n)=>{let r=e.map(e=>Ba(e,t,n)),i=r.map(()=>void 0),a=t.trace,o=(e,n,s,c,l,u)=>{let d=c,f;for(let c=e;c<r.length;c++){if(c>0&&n.isInit&&so(d)){f??=J(n,s,d);for(let e=c;e<r.length;e++)if(!Ua(r[e].expression,f))return;u(d,l);return}let e=r[c];if(a&&(a.push(e.expression),e.expression.kind===`Unchanged`&&a.push(...Pa(e.expression.expression,t))),e.kind===`Guard`){f??=J(n,s,d);let r=i[c]??=Fs(e.expression,t);if(!Ca(e.expression,f,r(f)))return;continue}if(e.kind===`Assign`){f??=J(n,s,d);let r=(i[c]??=Fs(e.value,t))(f),a=d[e.index];if(a===void 0)d=xa(d,e.index,r),f=void 0;else if(!$e(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=d[n];if(e===void 0)d=xa(d,n,t[n]),f=void 0;else if(!$e(e,t[n]))return}continue}let p=c+1;e.runner(n,s,d,l,!0,(e,t)=>o(p,n,s,e,t,u));return}u(d,l)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Ua=(e,t)=>Sa(e,X(e,t),!0),Wa=e=>(t,n,r,i,a,o)=>{Ca(e,J(t,n,r))&&o(r,i)},Ga=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=J(r,i,a);if(a[l]!==void 0){Ca(e,u)&&c(a,o);return}let d=X(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!z(f))throw new v(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${ho(e)}`);let p=an(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(xa(a,l,p[e]),o)}},Ka=/* @__PURE__ */ new WeakMap,qa=e=>{let t=Ka.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(qa),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Ka.set(e,n),n},Ja=(e,t)=>{let n=e.args[0],r=Wa(e),i=(e,r,i)=>ja(n,r,i,e,!t)??-1,a=Ga(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=X(e.args[1],J(t,n,o));l(xa(o,u,d),s)}},Ya=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=To(t,e.name);if(i?.kind===`Thunk`)return Ya(i.expression,i.scope,n,r);let a=i?void 0:Ao(e.name,r.environment);if(a?.kind!==`Function`)return;let o=X(e,J(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:Eo(void 0,a.name,o)}},Xa=(e,t,n)=>{let r=Wa(e);return(i,a,o,s,c,l)=>{let u=Ya(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=J(i,a,o),f=e.args.map(e=>X(e,d)),p=f.length===1?f[0]:R(f),m=Io(u.bounds,J(i,u.scope,o));if(!hn(p,m))throw new v(`Attempted to apply a function to ${U(p)}, which is not in its domain at ${mo(e)}`);Da(u.body,t,n)(i,Lo(u.bounds,u.scope,p),o,s,c,l)}},Za=(e,t)=>{if(Na(e,t))return Ha([qa(e)],t,!1);if(e.kind===`Tuple`)return Da(qa(e),t,!1);let n=qa(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?To(i,e.name):void 0;l?.kind===`Thunk`?Da(qa(l.expression),t,!1)(r,l.scope,a,o,s,c):Ca(n,J(r,i,a))&&c(a,o)}},Qa=(e,t,n)=>{let r=e.operator,i=Wa(e),a=W(e)?void 0:Jo(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Us(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Da(a.body,t,n),o.body(e,i(J(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=J(a,o,s),f=Xo(e,d);f?.kind===`Closure`?Da(f.body,t,n)(a,cs(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},$a=(e,t,n)=>{let r=Wa(e),i=W(e)?void 0:Oa(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=To(s,e.name);f?.kind===`Thunk`?Da(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Da(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},eo=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||W(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!W(a))return;let o=ka(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>eo(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||W(e))return;let r=Jo(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=eo(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`&&W(o))return{variable:i.variable,argument:o.name,labels:i.labels}},to=(e,t,n)=>{let r=To(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},no=(e,t,n)=>{let r=e.map(e=>Da(e,t,n)),i=n?[]:e.map(e=>eo(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&to(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},ro=(e,t,n)=>{let r=e=>Da(e,t,n);switch(e.kind){case`And`:return Ha(e.operands,t,n);case`Or`:return no(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(t,n,r,o,s,c)=>{let l=Po(X(a.set,J(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,Eo(n,e,l[a]),r,o,s,c)}}let o=n||t.trace?void 0:Va(e,t);if(o){let r=Ha(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=J(t,n,i),u=e.bounds.map(e=>Po(X(e.set,l),e.set));if(u.some(e=>e.length===0))return;let d=(e,n)=>{if(e<0)r(t,n,i,a,s,c);else for(let r of u[e]){if(t.isStopped)return;let a=Eo(n,o.names[e],r);if(e===u.length-1){let e=J(t,a,i);if(!o.guards.every(t=>Ca(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{Fo(e.bounds,J(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&fc(e,t)!==void 0&&!za(e.body,t,/* @__PURE__ */ new Set)?Ra(e,La):void 0;return(t,n,r,o,s,c)=>{let l=[];Fo(e.bounds,J(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>To(n,e)?.kind===`Value`)){u.every(n=>Ca(e.body,J(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&so(r)?u.slice(n).every(n=>Ua(e.body,J(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=X(e.condition,J(r,i,a));(ko(l,`an IF condition`)?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=J(r,i,a),u=t.find(e=>ko(X(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new v(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${ho(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=bs(e.definitions,t);return(t,r,a,o,s,c)=>n(t,us(e.definitions,J(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new v(`UNCHANGED appears in an initial predicate at ${mo(e)}`)}:Za(e.expression,t);case`AngleAction`:{let t=r(e.action),n=qa(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{Ca(n,J(e,r,t))||s(t,i)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,qa(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return $a(e,t,n);case`FunctionApplication`:return Xa(e,t,n);case`Apply`:{let i=e.args;if(wa(e.operator)){let r=Aa(i[0],t,n);if(r!==void 0)return e.operator===`=`?Ha([e],t,n):Ga(e,()=>r);if(Ma(i[0],n))return Ja(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=X(i[0],J(t,n,r));(typeof c==`boolean`?c:ko(c,`the left side of => at ${mo(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Qa(e,t,n)}default:return Wa(e)}},io=/* @__PURE__ */ new WeakMap,ao=e=>{let t=io.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return io.set(e,n),n},oo=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),so=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},co=(e,t)=>{let n=t.state;if(!n||!so(n))throw new v(`ENABLED needs a complete state at ${mo(e)}`);let r=t.environment,i={environment:r,isInit:!1,current:n,isStopped:!1};return Da(e,r,!1)(i,t.scope,ao(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},lo=(t,r,i,a)=>{let o={environment:r,isInit:!0,current:void 0,isStopped:!1};Da(t,r,!0)(o,a,ao(r),void 0,!1,t=>{if(!o.isStopped){if(!so(t))throw n(new v(`The initial predicate does not assign ${oo(t,r).join(`, `)}`),e.error);o.isStopped=i(t)}})},uo=(e,t,n)=>{let r=[];return lo(e,t,e=>(r.push(e),!1),n),r},fo=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,current:t,isStopped:!1},o={successors:0};return Da(e,n,!1)(a,i,ao(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!so(e))throw new b(e,t,oo(e,n).sort());o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},po=(e,t,n,r)=>{let i=[];return fo(e,t,n,e=>(i.push(e),!1),r),i},mo=e=>`line ${e.location.line}, column ${e.location.column}`,ho=e=>{let t=e.location.range;return t?h(t):mo(e)},go=(e,t)=>new v(`A non-boolean expression (${Dr(t)}) was used as the condition of an IF.\n${ho(e)}`),_o=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r){let r=e.operands[t],i=r.kind===`Number`?String(r.value):ho(r);return new v(`A non-boolean expression (${Dr(n)}) was used as a formula in a conjunction.\n${i}`)}let i=e.operands[Math.max(t,1)].location.range?.end??r.end;return new v(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${Dr(n)}.\n${ho({...e,location:{...e.location,range:{...r,end:i}}})}`)},vo=e=>t=>wn(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${U(t)}\n${ho(e)}`:Cn(t,e.field),yo=e=>t=>`A non-function (${Dr(t)}) was applied as a function.\n${ho(e)}`,bo=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${U(t)}\n${ho(e)}`,xo=e=>t=>{if(!N(t))throw new v(`Attempted to apply the operator DOMAIN to a non-function\n(${Dr(t)})\n${ho(e)}`);return kn(t)},So=(e,t)=>(n,r)=>{if(!M(n)||I(n))throw new v(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${ho(e)}`);return t.evaluate([n,r])},Co=t=>n(new v(`TLC can't handle real numbers: ${t.text} at ${mo(t)}`),e.configParseError),wo=t=>n(new v(`TLC can't handle a number this big: ${t.text??t.value} at ${mo(t)}`),e.error),To=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Eo=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Do=(e,t,n)=>{if(t.kind===`Name`)return Eo(e,t.name,n);let r=fn(n);if(!r||r.length!==t.names.length)throw new v(`Cannot bind <<${t.names.join(`, `)}>> to ${U(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Eo(e,t,r[n]),e)},Oo=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),ko=(e,t)=>{if(typeof e!=`boolean`)throw new v(`Expected ${t} to be a boolean but found ${U(e)}`);return e},Ao=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),jo=(e,t)=>{if(e.kind===`Prime`||e.kind===`Unchanged`||e.kind===`Enabled`)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=Ao(n,t);if(e&&!t.constants.has(n)&&!Mo(e,t))return!0}return ir(e).some(e=>jo(e,t))},Mo=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!jo(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>jo(e.set,t)));return t.constantLevels.set(e,r),r},No=(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.`},Po=(e,t)=>{if(!M(e)||I(e)){let n=U(e),r=No(e,n);throw new v(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${ho(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${ho(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?Bt(e):B(e).elements},Fo=(e,t,n)=>{let r=e.map(e=>Po(X(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,Do(a,e[t].pattern,n)));return i(e.length-1,t.scope)},Io=(e,t)=>{let n=e.map(e=>X(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Lo=(e,t,n)=>{if(e.length===1)return Do(t,e[0].pattern,n);let r=fn(n)??[];return e.reduce((e,t,n)=>Do(e,t.pattern,r[n]),t)},Ro=/* @__PURE__ */ new WeakMap,zo=(e,t)=>{let n=Ro.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:h(r)};return Ro.set(t,i),i},Bo=(e,t,n)=>{let r=zo(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}},Vo=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Rn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(tt(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},Ho=(e,t)=>{let n=Io(e.bounds,t),r=Vo(n,(n,r)=>X(e.body,Oo(t,Lo(e.bounds,Eo(void 0,e.name,r),n))),Bo(e.bounds,e.body,n));return e.bounds.length===1?vn(r):r},Uo=(e,t)=>e.kind===`Function`?Ho(e,t):X(e.body,t),Wo=(e,t)=>{let n=Mo(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new v(`Operator ${e.name} requires ${e.params.length} arguments`);let i=Oo(t,void 0);if(!n)return Uo(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Uo(e,i));return t.environment.definitionValues.set(e,a),a},Go=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=X(e.expression,Oo(t,e.scope));return n&&(e.cache=r),r},Ko=/* @__PURE__ */ new WeakMap,qo=e=>{let t=Ko.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Ko.set(e,n),n},Jo=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Jo(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?qo(r):t.builtins.get(e)},Yo=/* @__PURE__ */ new WeakMap,Xo=(e,t)=>{if(W(e))return Zo(e.operator,t);let n=Yo.get(e),r=n===void 0?Jo(e.operator,t.environment)??null:n;return n===void 0&&Yo.set(e,r),r??Zo(e.operator,t)},Zo=(e,t)=>{let n=To(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Jo(e,t.environment)},Qo=e=>e.kind===`Closure`?e.params.length:e.arity,$o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Zo(n,t);if(!r)throw new v(`Expected an operator argument at ${mo(e)}`);return r},es=(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)=>Eo(e,n.name,t[r]),e.scope);return X(e.body,Oo(n,r))},ts=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Qo(e),call:n=>es(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},ns=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Zo(e.name,t);return n!==void 0&&Qo(n)>0},rs=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),is=(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 is(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([])}},as=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&fs(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=W(e)?void 0:is(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=To(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:rs(e,t)}}return t=>rs(e,t)},os=/* @__PURE__ */ new WeakMap,ss=(e,t)=>{let n=os.get(e);if(n)return n;let r=as(e,t);return os.set(e,r),r},cs=(e,t,n)=>{if(t.length!==e.params.length)throw new v(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:$o(t[i],n)}:ss(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},ls=(e,t,n)=>e.kind===`Closure`?X(e.body,Oo(n,cs(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>X(e,n))):e.isLazy?e.evaluate(Vs(t,n),n):e.evaluate(t.map(e=>ns(e,n)?ts($o(e,n),n):X(e,n)),n),us=(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},i):r.params.length>0||n?.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},i)},t.scope),ds=(e,t,n)=>{let r=To(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Go(r,n);if(r?.kind===`Operator`){if(Qo(r.operator)===0)return es(r.operator,[],n);throw new v(`Operator ${e} is used without arguments`)}let i=is(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw oc(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Wo(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new v(`Unknown identifier ${e} at ${mo(t)}`)},fs=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,ps=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),ms=(e,t)=>ps.has(e)||t.builtins.get(e)?.isStateLevel===!0,hs={builtins:ps,definitions:/* @__PURE__ */ new WeakMap},gs={builtins:new Set([...ps].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},_s=(e,t)=>e.kind===`Operator`&&e.params.length===0&&Mo(e,t),vs=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!W(e)){let e=Ao(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!_s(e,t)&&ys(e,t,n))return!0}return ir(e).some(e=>vs(e,t,n))},ys=(e,t,n=hs)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=vs(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>vs(e.set,t,n));return n.definitions.set(e,i),i},bs=(e,t)=>new Set(e.filter(e=>ys(e,t))),xs=e=>[...e.definitions.values()].some(t=>ys(t,e)),Ss=e=>[...e.definitions.values()].some(t=>ys(t,e,gs)),Cs=/* @__PURE__ */ new WeakMap,ws=(e,t)=>{let n=Cs.get(e);if(n!==void 0)return n;let r=Os(e,t,Es);return Cs.set(e,r),r},Ts=/* @__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`]),Es=/* @__PURE__ */ new Set,Ds=(e,t,n)=>n.size===0?ws(e,t):Os(e,t,n),Os=(e,t,n)=>{if(!Ts.has(e.kind))return!1;if(e.kind===`Identifier`&&W(e))return n.has(e.name);if(W(e))return!1;if(e.kind===`Identifier`){let n=is(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&_s(n.definition,t)}if(e.kind===`Apply`){if(ms(e.operator,t)||e.operator===`~>`)return!1;let r=Jo(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Ao(e.operator,t);if(!n||!Mo(n,t)||ys(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`&&Ds(e,t,n))}let r={value:!0};return qi(e,(e,i)=>(r.value&&=Ds(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},ks=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,As=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}},js=(e,t)=>{if(e.kind===`Identifier`&&W(e))return!t.has(e.name);if(W(e))return!0;let n={value:!1};return qi(e,(e,r)=>(n.value||=js(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Ms=(e,t)=>zi.has(e)&&ks(e)&&fc(e,t)!==void 0&&!js(e,Es),Ns=/* @__PURE__ */ new WeakMap,Y=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=lc(e,t),i=ks(e)&&ws(e,t)?As(r):Ms(e,t)?Rs(r):r,a=t.trace,o=a?n=>{let r=a.length;a.push(e);let o=i(n);a.length=r;let s=typeof o==`object`&&o.kind===`FilteredSet`?Ns.get(o):void 0;return s?s(t):o}:i;return t.evaluators.set(e,o),o},Ps=/* @__PURE__ */ new WeakMap,Fs=(e,t)=>{if(t.trace)return Y(e,t);let n=Ps.get(e);if(n)return n;let r=(ks(e)&&ws(e,t)?void 0:qr(e,t))??Y(e,t);return Ps.set(e,r),r},X=(e,t)=>Fs(e,t.environment)(t),Is=(e,t)=>{let n=e.name,r=W(e)?void 0:is(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw oc(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&&Mo(e,t))return t=>Wo(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Fs(e.body,t),n.body(Oo(r,void 0)));return Ls(e,t)?Rs(r):r}return t=>Wo(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Wo(e,t);return Mo(e,t)||!Ls(e,t)?n:Rs(n)}return t=>ds(n,e,t)},Ls=(e,t)=>fc(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>fc(e.set,t)!==void 0)),Rs=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}},zs=(e,t)=>{let n=Jo(e,t);return n!==void 0&&Qo(n)>0},Bs=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!W(e)&&zs(e.name,t)),Vs=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>X(e,t),expression:e})),Hs=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Vs(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Bs(t[0],n)){let e=Y(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Bs(t[0],n)&&Bs(t[1],n);if(i&&a){let e=Y(t[0],n),r=Y(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>ns(e,n)?ts($o(e,n),n):X(e,n)),n)},Us=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new v(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:ss(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:$o(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Ws=/* @__PURE__ */ new WeakMap,Gs=e=>{let t=Ws.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Ws.set(e,n),n},Ks=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},qs=(e,t)=>e.every((e,n)=>tt(e,t[n])),Js=(e,t)=>{let n=Ao(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&Mo(n,t)&&!ys(n,t)},Ys=(e,t,n,r)=>{let i=Us(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Fs(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next}));if(!r)return e=>o(i(e),e);let s=Gs(e);return e=>{let n=i(e),r=Ks(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=Nn(a,Rn(e));let c=s.calls.get(a),l=c?.find(e=>qs(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},Xs=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Y(n[0],t),r=Y(n[1],t);return t=>!ko(e(t),`the left side of =>`)||ko(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new v(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=W(e)?void 0:Jo(e.operator,t);if(r?.kind===`Closure`)return Ys(r,n,t,Js(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Y(n[0],t),i=xo(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Y(n[0],t);return Bi.has(e)||jo(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=Y(n[0],t),a=Y(n[1],t),o=So(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?Hs(r,n,t):r=>{let i=Zo(e.operator,r);if(i)return ls(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new v(`${e.operator} is a function; apply it with brackets`):e.operator===`\\cdot`?new v(`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.`):new v(`Unknown operator ${e.operator} at ${mo(e)}`)}},Zs=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Y(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Y(a.set,t);return t=>{let s=Po(o(t),a.set);for(let a=0;a<s.length;a++){let o=ko(i(Oo(t,Eo(t.scope,e,s[a]))),r);if(o!==n)return o}return 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=>Y(e.set,t));return t=>{let s=a.map((e,n)=>Po(e(t),o[n].set)),c=(a,o)=>{if(a<0)return ko(i(Oo(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,Eo(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>Fo(o,e,t=>ko(i(Oo(e,t)),r)!==n)?!n:n},Qs=(e,t)=>{if(e.kind===`Tuple`)return R(e.names.map(e=>{let n=To(t,e);return n?.kind===`Value`&&n.value}));let n=To(t,e.name);return n?.kind===`Value`?n.value:void 0},$s=/* @__PURE__ */ new WeakSet,ec=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&$s.add(e)},tc=(e,t)=>{let n=$s.has(e),r=Y(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Y(a.set,t);return t=>{let c=o?s(t):Io(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(Ee)){let n=Vo(c,e=>r(Oo(t,Lo(i,t.scope,e))),Bo(i,e.body,c));return i.length===1?vn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Ht(c);return vn(Qe(n,n.map(n=>r(Oo(t,Eo(t.scope,e,n))))))}let u=[];return Fo(i,t,e=>{let n=i.length===1?Qs(a.pattern,e)??!1:R(i.map(t=>Qs(t.pattern,e)??!1));return u.push([n,r(Oo(t,e))]),!1}),Pt(u)}},nc=(e,t)=>{let n=$s.has(e);n&&ec(e.function);let r=Y(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=>Y(e,t))}),value:Y(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):R(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Oo(i,Eo(i.scope,`@`,e))):An(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return e=>{let t=r(e);for(let n of i)t=o(t,n.path,0,e,n.value);return t}},rc=(e,t)=>{if(e.kind===`SetFilter`){let n=Y(e.predicate,t),r=Y(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>n=>ko(e(Oo(t,Do(t.scope,i,n))),`a set filter predicate`),s=o(n);if(!Ee(a)){if(M(a)){let t={kind:`FilteredSet`,base:a,test:s};return Ns.set(t,n=>({...t,test:o(Y(e.predicate,n))})),t}throw new v(`TLC encountered a non-enumerable quantifier bound ${U(a)} at ${mo(e.bound.set)}`)}return Ze(B(a).elements.filter(s))}}if(e.kind===`SetMap`){let n=Y(e.expression,t);return t=>{let r=[];return Fo(e.bounds,t,e=>(r.push(n(Oo(t,e))),!1)),kt(r)}}let n=e.set;if(!n)return()=>{throw new v(`TLC cannot evaluate an unbounded CHOOSE at ${mo(e)}`)};let r=Y(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(Fo([i],t,i=>ko(r(Oo(t,i)),`the body of CHOOSE`)?(n.value=Qs(e.pattern,i),!0):!1),n.value===void 0)throw new v(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${ho(e)}`);return n.value}},ic=e=>[...e].sort((e,t)=>L(e.name,t.name)),ac=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),oc=(t,n)=>a(new v(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${ho(n)}`),e.configParseError),sc=e=>new v(`A primed expression appears outside an action at ${mo(e)}`),cc=(e,t)=>{let n=ic(e),r=ac(n),i=n.map(e=>Y(e.value,t));if(r)return e=>Pt(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=>Me(a,i.map(t=>t(e)),o):e=>Qe(a,i.map(t=>t(e)))},lc=(e,t)=>{let n=e=>Y(e,t);switch(e.kind){case`Number`:{let t=e.value;return fs(t)?()=>t:()=>{throw wo(e)}}case`Decimal`:return()=>{throw Co(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Is(e,t);case`Apply`:return Xs(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new v(`An operator cannot be used as a value at ${mo(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw _o(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return e=>{for(let n=0;n<t.length;n++)if(ko(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw sc(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>$e(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw go(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t)if(ko(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new v(`Attempted to evaluate a CASE with no conditions true.\n${ho(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Oo(n,us(e.definitions,n)))}case`Forall`:case`Exists`:return Zs(e,t);case`UnboundedQuantifier`:return()=>{throw new v(`TLC cannot evaluate an unbounded quantifier at ${mo(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return rc(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>kt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>R(t.map(t=>t(e)))}case`FunctionConstruction`:return tc(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return cc(e.fields,t);case`RecordSet`:{let t=ic(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return nc(e,t);case`ExceptAt`:return t=>{let n=To(t.scope,`@`);if(n?.kind!==`Value`)throw new v(`@ appears outside an EXCEPT at ${mo(e)}`);return n.value};case`FunctionApplication`:{ec(e.function);let t=n(e.function),r=e.args.map(n),i=yo(e);if(r.length===1){let e=r[0];return n=>Dn(t(n),e(n),void 0,i)}return e=>Dn(t(e),R(r.map(t=>t(e))),void 0,i)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=vo(e),a=bo(e);return e=>Dn(t(e),r,i,a)}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?ko(t(e),`an action`)||r(e):ko(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>co(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new v(`The subexpression reference at ${mo(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new v(`TLC cannot evaluate a temporal formula in a state at ${mo(e)}`)}}},uc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),dc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},fc=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(uc.has(e.kind))return!1;let a=dc(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&ms(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 ir(e).every(i)};return i(e)?[...n]:void 0},pc=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
30
+ `);throw t===e.length-1?a(e):ye(r.line,r.index+t-r.lineStart+1,`
31
+ `,e.slice(0,t))}n.push({kind:`String`,text:t[1],line:r.line}),r.index+=t[0].length;continue}let l=M.find(t=>e.startsWith(t));if(l){n.push({kind:`Symbol`,text:l,line:r.line}),r.index+=l.length;continue}let u=se(t,r.index);if(!u)throw ye(r.line,r.index-r.lineStart+1,e[0]);n.push({kind:`Word`,text:u.text,line:r.line}),r.index+=u.length}return n.push({kind:`End`,text:``,line:r.line-1}),n},Se=e=>{let t=xe(e),n={index:0},r={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},i={isSet:!1},a=()=>t[Math.min(n.index++,t.length-1)],o=e=>e.kind===`Word`&&pe.has(e.text),s=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=a();if(t.text!==`}`)for(;e.push(s(t)),t=a(),t.text===`,`;)t=a();if(t.text!==`}`)throw be(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw be(e.line,`It was expecting a value, but did not find it.`)},c=e=>{let t=a();if(t.kind===`End`)throw be(t.line,`Expected an identifier after ${e}[.`);let n=a();if(n.text!==`]`)throw be(n.line,`It was expecting ], but did not find it.`);return t.text},l=e=>{for(;;){let t=a();if(t.kind===`End`||o(t))return t;let n={text:t.text},i=a();for(;i.text===`!`;)n.text=`${n.text}!${a().text}`,i=a();if(i.text===`<-`){if(i=a(),i.text===`[`){let e=c(`<-`),t=a();if(t.kind===`End`)throw be(t.line,`Expected an identifier after <-[mod].`);r.substitutions.push({name:n.text,target:t.text,module:e});continue}if(i.kind===`End`)throw be(i.line,`Expected an identifier after <-.`);r.substitutions.push({name:n.text,target:i.text});continue}let l=[];if(i.text===`(`){for(;l.push(s(a())),i=a(),i.text===`,`;);if(i.text!==`)`)throw be(e,``);i=a()}if(i.text!==`=`)throw be(i.line,`It was expecting = or <-, but did not find it.`);i=a();let u=i.text===`[`?c(`=`):void 0,d=s(u===void 0?i:a());r.constants.push({name:n.text,value:d,...l.length>0&&{args:l},...u&&{module:u}})}},u=a();for(;u.kind!==`End`;){let e=u.text,t=u.line;if(ge(e)){let n=a();if(n.kind===`End`)throw be(t,`The keyword ${e} was not followed by an identifier.`);let i=me[e];if(r[i]!==void 0)throw be(t,`The keyword ${e} appeared twice.`);r[i]=n.text,u=a()}else if(_e(e)){let t=r[he[e]];for(u=a();u.kind!==`End`&&!o(u);)t.push(u.text),u=a()}else if(e===`CONSTANT`||e===`CONSTANTS`)u=l(t);else if(e===`CHECK_DEADLOCK`){let e=a();if(e.kind===`End`)throw be(t,`The keyword CHECK_DEADLOCK was not followed by an identifier.`);if(e.text!==`TRUE`&&e.text!==`FALSE`)throw be(e.line,`It was expecting TRUE or FALSE, but did not find it.`);if(i.isSet)throw be(t,`The keyword CHECK_DEADLOCK appeared twice.`);i.isSet=!0,r.checkDeadlock=e.text===`TRUE`,u=a()}else throw be(t,`It was expecting a keyword, but did not find it.`)}if(r.specification!==void 0&&(r.init!==void 0||r.next!==void 0))throw new y(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);return r},Ce={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:` `}},we=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},Te=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ee=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),De=e=>{let t=t=>{let n=le(e,t,we);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=le(e,t,Te);if(e.startsWith(`..`,n)&&Te(e[n+2]))return{kind:`Constant`,first:t,last:le(e,n+2,Te)-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=Te(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:le(e,t+1,Te)-1,children:[]};if(Ee(n))return{kind:`Constant`,first:t,last:le(e,t,Ee)-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)},Oe=e=>{let t=e.length===0?void 0:De(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=Ce[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},ke={current:void 0},N=/* @__PURE__ */ new WeakMap,Ae=e=>e instanceof b?N.get(e):void 0,je=(e,t)=>{let n=ke.current;if(!n||typeof e!=`object`)return t();try{return t()}catch(t){let r=n.get(e);throw r&&t instanceof b&&N.set(t,[r,...N.get(t)??[]]),t}},Me=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ne=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),P=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Pe=e=>typeof e==`object`&&e.kind===`ModelValue`,Fe=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:Me(e)?`set`:`function`,F=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new x(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},Ie={isUsed:!1},Le=(e,t)=>(Ie.isUsed=!0,e.writtenKeys=t,e),I=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[mn(e.domain,t)]]),L=(e,t,n)=>Le($e(e,t),n),R=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(R);e.writtenKeys=void 0,e.range.forEach(R)}},z=e=>e.every(e=>typeof e==`string`),B=(e,t)=>e.length>0&&t.length>0&&z(e)!==z(t),Re=(e,t)=>{Ie.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return B(n,r)?_t(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ye(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=Ye(i[e],a[e]);if(t!==0)return t}return 0},V=(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=Ye(n[e],r[e]);if(t!==0)return t}return 0},H=e=>Pe(e)?e.type:void 0,U=(e,t,n)=>{let r=H(e),i=H(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(Pe(e)&&Pe(t)){if(r===void 0||i===void 0||r===i)return;throw new b(`Attempted to ${a} the differently-typed model values ${Y(e)} and ${Y(t)}`)}throw r===void 0?new b(`Attempted to ${a} the typed model value ${Y(t)} and the non-model value\n${Y(e)}`):new b(`Attempted to ${a}${n?``:` the`} typed model value ${Y(e)} and non-model value\n${Y(t)}`)},W={ranks:Object.create(null),size:0},ze=e=>{W.ranks=Object.create(null),W.size=0,Xe.clear();for(let t of e)Be(t)},Be=e=>(W.ranks[e]===void 0&&(W.ranks[e]=W.size++),e),Ve=()=>W.size,He=e=>W.ranks[Be(e)],Ue=(e,t)=>{if(e===t)return 0;let n=W.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},We=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ge=(e,t)=>(We(e)||We(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Ke=(e,t,n)=>{if(!We(e))throw new b(`Attempted to ${n} the set ${Y(Yt(e)?q(e):e,!0)} with the value:\n${Y(t,!0)}`);if(!We(t))throw new b(`Attempted to compare overridden value ${Y(e,!0)} with non-overridden value:\n${Y(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new b(`Attempted to compare ${Y(e,!0)} with the value\n${Y(t,!0)}`)},qe={kind:`InfiniteSet`,name:`Any`},Je=e=>{throw new b(`Attempted to compare ANY with the value\n${Y(e)}`)},Ye=(e,t)=>{if(e===t)return Ie.isUsed&&R(e),e===qe?Je(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Re(e,t);if(n===`Set`&&r===`Set`)return V(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&U(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return U(e,t,!1),n===`ModelValue`?-1:1;if(e===qe||t===qe)return Je(e===qe?t:e);if(Me(e)&&Me(t)&&Ge(e,t))return Ke(e,t,`compare`);let i=Me(e);if(i!==Me(t))throw new b(`Attempted to compare ${Fe(e)} ${Y(e)} with ${Fe(t)} ${Y(t)}`);return i?V(q(e),on(t)):Re(xn(e),xn(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Ue(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(U(e,t,!1),Pe(e))return-1;if(Pe(t))return 1;throw new b(`Attempted to compare ${Fe(e)} ${Y(e)} with ${Fe(t)} ${Y(t)}`)},Xe=/* @__PURE__ */ new Map,Ze=e=>{let t=Xe.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:He(e)};return Xe.set(e,n),n},Qe=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),$e=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),et=(e,t)=>{if(e===t)return Ie.isUsed&&R(e),e!==qe||Je(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&U(e,t,!0),Ye(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 Re(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return V(e,t)===0;if(Pe(e)||Pe(t))return U(e,t,!0),Pe(e)&&Pe(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return et(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=cn(e.domain),r=cn(t.domain);if(n||r)return n===r;let i=cn(e.range),a=cn(t.range);return i||a?i===a:et(e.domain,t.domain)&&et(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(cn(e))return cn(t);if(cn(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]&&et(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return cn(e)?cn(t):!cn(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>et(e,t.factors[n]));let n=Me(e)&&Me(t)&&!(Yt(e)&&Yt(t));if(n&&Ge(e,t))return Ke(e,t,`check equality of`)===0;if(n){if(!We(e)){let n=q(e);if(!We(t))return V(n,q(t))===0}return er(e)===er(t)}return Ye(e,t)===0},tt=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>nt(e,t[n])),nt=(e,t)=>e===t?!0:typeof e!=`object`||typeof t!=`object`?!1:e.kind===`Set`&&t.kind===`Set`?(e.hash===0||t.hash===0||e.hash===t.hash)&&tt(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&tt(e.domain,t.domain)&&tt(e.range,t.range):er(e)===er(t),rt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},G=e=>{if(!P(e))return;let t=xn(e);return{domain:t.domain,range:t.range,low:rt(t.domain)}},K=e=>{if(!P(e))return;let t=xn(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},it=(e,t)=>{if(H(e)!==void 0)throw new b(`Attempted to compare the typed model value ${Y(e)} and the non-model value\n${Y(t)}`);return 1},at=(e,t)=>{if(H(e)!==void 0)throw new b(`Attempted to check equality of the typed model value ${Y(e)} and the non-model value\n${Y(t)}`);return!1},ot=(e,t)=>{let n=H(e);if(n===void 0)return Pe(t)?e.rank-t.rank:-1;if(!Pe(t))throw new b(`Attempted to compare the typed model value ${Y(e)} and non-model value\n${Y(t)}`);let r=H(t);if(r!==void 0&&r!==n)throw new b(`Attempted to compare the differently-typed model values ${Y(e)} and ${Y(t)}`);return e.rank-t.rank},st=(e,t)=>{let n=H(e);if(n===void 0)return Pe(t)&&e.name===t.name;if(!Pe(t))throw new b(`Attempted to check equality of typed model value ${Y(e)} and non-model value\n${Y(t)}`);let r=H(t);if(r!==void 0&&r!==n)throw new b(`Attempted to check equality of the differently-typed model values ${Y(e)} and ${Y(t)}`);return e.name===t.name},ct={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`}},lt=(e,t,n)=>{let r=ct[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${Y(e)} with ${r.other}:\n${Y(t)}`},ut=(e,t,n)=>{let r=G(n);if(!r){if(Pe(n))return it(n,t);throw new b(`Attempted to compare the function ${Y(t)} with the value:\n${Y(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>dt(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return dt(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new b(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${Y(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},dt=(e,t)=>{for(let n=0;n<e.length;n++){let r=_t(e[n],t[n]);if(r!==0)return r}return 0},ft=(e,t)=>{let n=xn(e);if(e.kind===`Function`&&hn(n)!==void 0){let r=P(t)?hn(t):void 0;return r?n.range.length-r.length||dt(n.range,r):ut({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=K(t);if(!r){if(Pe(t))return it(t,e);throw new b(`Attempted to compare record:\n${Y(e)}\nwith non-record\n${Y(t)}`)}return n.domain.length-r.domain.length||dt(n.domain,r.domain)||dt(n.range,r.range)}return ut({...n,low:rt(n.domain)},e,t)},pt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),mt=(e,t)=>We(e)||We(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),ht=(e,t)=>{let n=pt(t)?t:q(t);return{elements:q(e).elements,otherElements:q(n).elements}},gt=(e,t)=>{if(mt(e,t))return Ye(e,t);if(!pt(e))return gt(q(e),t);if(!Me(t)){if(Pe(t))return it(t,e);throw new b(`Attempted to compare the set ${Y(e)} with the value:\n${Y(t)}`)}let n=ht(e,t);return n.elements.length-n.otherElements.length||dt(n.elements,n.otherElements)},_t=(e,t)=>je(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return Ye(e,t);if(Pe(t))return it(t,e);throw new b(lt(e,t,!1))}return e.kind===`ModelValue`?ot(e,t):P(e)?ft(e,t):gt(e,t)}),vt=(e,t)=>e.every((e,n)=>St(e,t[n])),yt=(e,t,n)=>{let r=G(n);if(!r){if(Pe(n))return at(n,t);throw new b(`Attempted to check equality of the function ${Y(t)} with the value:\n${Y(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&vt(e.range,r.range);let i=e.low??r.low;return i===void 0?vt(e.domain,r.domain)&&vt(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new b(`Attempted to compare an integer with non-integer:\n${Y(e)}.`);return e===i+t})&&vt(e.range,r.range)},bt=(e,t)=>{let n=xn(e);if(e.kind===`Function`&&hn(n)!==void 0){let r=P(t)?hn(t):void 0;return r?n.range.length===r.length&&vt(n.range,r):yt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=K(t);if(!r){if(Pe(t))return at(t,e);throw new b(`Attempted to check equality of record:\n${Y(e)}\nwith non-record\n${Y(t)}`)}return n.domain.length===r.domain.length&&vt(n.domain,r.domain)&&vt(n.range,r.range)}return yt({...n,low:rt(n.domain)},e,t)},xt=(e,t)=>{if(mt(e,t))return et(e,t);if(!pt(e))return xt(q(e),t);if(!Me(t)){if(Pe(t))return at(t,e);throw new b(`Attempted to check equality of the set ${Y(e)} with the value:\n${Y(t)}`)}let n=ht(e,t);return n.elements.length===n.otherElements.length&&vt(n.elements,n.otherElements)},St=(e,t)=>je(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(Pe(t))return at(t,e);throw new b(lt(e,t,!0))}return e.kind===`ModelValue`?st(e,t):P(e)?bt(e,t):xt(e,t)}),Ct=e=>{let t=[];for(let n of e){let e={low:0,high:t.length,comparison:1};for(;e.low<e.high;){let r=e.low+(e.high-e.low>>1);if(e.comparison=_t(n,t[r]),e.comparison===0)break;e.comparison<0?e.high=r:e.low=r+1}e.comparison!==0&&t.splice(e.low,0,n)}return t},wt=(e,t)=>t.some(t=>St(t,e)),Tt=(e,t)=>{try{return et(e,t)}catch(n){if(!(n instanceof b))throw n;return St(e,t)}},Et=e=>{for(let t=1;t<e.length;t++)if(Ye(e[t],e[t-1])<=0)return!1;return!0},Dt=e=>{if(e.length<2||Et(e))return Qe(e);let t=[...e].sort(Ye),n=[t[0]];for(let e=1;e<t.length;e++)Ye(n[n.length-1],t[e])!==0&&n.push(t[e]);return Qe(n)},Ot=e=>{try{return Dt(e)}catch(t){if(!(t instanceof b))throw t;return{kind:`MixedSet`,elements:e}}},kt=Qe([]),At=(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&&Ye(r[a],t)<0;)a++;a<r.length&&Ye(r[a],t)===0||i.push(t)}return i.length===n.length?e:Qe(i)},jt=(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&&Ye(r[a],t)<0;)a++;a<r.length&&Ye(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Qe(i)},Mt=(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=Ye(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=Qe(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+zn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Yn(a[e])|0;c.fingerprint=t}return c},Nt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ye(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ye(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return $e(n,r)},Pt=e=>{let t=Nt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Le(t,e.map(e=>e[0]))},Ft=[],It=[],Lt=/* @__PURE__ */ new WeakMap,Rt=e=>{let t=Ft[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Ft[e]=n,n},zt=e=>{if(dn(e),e.low===1&&e.high>=1)return Rt(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Bt=e=>e.length>0&&(e===Ft[e.length]||Lt.has(e)),Vt=e=>{let t=q(e).elements;return Bt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Ht=e=>{let t=It[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return It[e]=n,n},Ut=e=>$e(Rt(e.length),e),Wt=e=>Nt(e),Gt=e=>Me(e)&&!We(e),Kt=(e,t=!1)=>`UNION(${Y(e.base,t)})`,qt=(e,t=e=>q(e).elements)=>{if(!Gt(e.base))throw new b(`Attempted to enumerate the nonenumerable set:\n${Kt(e)}`);return t(e.base)},Jt=(e,t,n)=>{if(Gt(e))return e;throw new b(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${Y(e)}\nwhen enumerating:\n${Kt(n)}`)},Yt=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 Yt(e.base);case`FunctionSet`:return Yt(e.domain)&&Yt(e.range)||Xt(e.domain)===!0||Xt(e)===!0;case`RecordSet`:return e.sets.every(Yt)||Xt(e)===!0;case`ProductSet`:return e.factors.every(Yt)||Xt(e)===!0;case`Union`:return Yt(e.base)&&sn(e.base).every(Yt);case`SetOperation`:return e.operator===`\\cup`?Yt(e.left)&&Yt(e.right):e.operator===`\\cap`?Yt(e.left)||Yt(e.right):Yt(e.left);default:return!1}},Xt=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=Xt(e.domain);return t===void 0?void 0:!t&&Xt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Xt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return Yt(e)?q(e).elements.length===0:void 0;default:return}},Zt=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},Qt=(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},$t=e=>{if(typeof e!=`object`||e.kind!==`Subset`||We(e.base))return;let t=q(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=[]:Qt(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Qe(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)})},en=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Qe(r.map(t=>e[t])));while(Qt(r,e.length))}return t},tn=e=>{if(typeof e!=`object`)throw new b(`Expected a set but found ${Y(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Ct(e.elements);case`Interval`:{let t=zt(e);return t!==Ft[t.length]&&Lt.set(t,e),t}case`Subset`:{We(e.base)&&dn(e.base);let t=q(e.base).elements;if(t.length>30)throw new b(un(e));return en(t)}case`FunctionSet`:{if(cn(e))return[];if(We(e.domain))throw new b(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${Y(e.domain)}\ncannot be enumerated.`);let t=Vt(e.domain);if(t.length>0&&We(e.range))throw new b(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${Y(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:q(e.range).elements;return Zt(t.map(()=>n)).map(e=>$e(t,e))}case`RecordSet`:{if(cn(e))return[];let t=e.sets.map((t,n)=>{if(We(t))throw new b(`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${Y(t)}`);return q(t).elements});return Zt(t).map(t=>Wt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(cn(e))return[];let t=e.factors.map((e,t)=>{if(We(e))throw new b(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${Y(e)}`);return q(e).elements});return Zt(t).map(Ut)}case`FilteredSet`:if(We(e.base))throw new b(`Attempted to enumerate { x \\in S : p(x) } when S:\n${Y(e.base)}\nis not enumerable`);return q(e.base).elements.filter(e.test);case`Union`:{let t=qt(e).flatMap((t,n)=>q(Jt(t,n,e)).elements);return q(Ot(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Gt(e.left)||!Gt(e.right)))throw new b(`Attempted to enumerate S \\cup T when S:\n${Y(e.left)}\nand T:\n${Y(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Gt(e.left)&&!Gt(e.right))throw new b(`Attempted to enumerate S \\cap T when neither S:\n${Y(e.left)}\nnor T:\n${Y(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Gt(e.left))throw new b(`Attempted to enumerate S \\ T when S:\n${Y(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Mt(q(e.left),q(e.right)).elements;let t=e.operator===`\\`||Yt(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return q(n).elements.filter(t=>yn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new b(`Attempted to enumerate the non-enumerable set ${Y(e)}`);default:throw new b(`Expected a set but found ${Y(e)}`)}},nn=/* @__PURE__ */ new WeakMap,rn=/* @__PURE__ */ new WeakMap,q=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Qe(tn(e));let t=typeof e==`object`?nn.get(e):void 0;if(t)return t;let n=(typeof e==`object`?rn.get(e):void 0)??(ke.current?je(e,()=>an(e)):an(e));return typeof e==`object`&&nn.set(e,n),n},an=e=>{let t=tn(e);return typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Qe(t):Dt(t)},on=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||nn.has(e))return q(e);let t=rn.get(e);if(t)return t;let n=an(e);return rn.set(e,n),n},sn=e=>{if(typeof e!=`object`||nn.has(e))return q(e).elements;if(e.kind===`Union`)return qt(e,sn).flatMap((t,n)=>sn(Jt(t,n,e)));if(e.kind===`FilteredSet`&&!We(e.base))return sn(e.base).filter(e.test);if(e.kind!==`SetOperation`)return q(e).elements;if(e.operator===`\\cup`)return!Gt(e.left)||!Gt(e.right)?q(e).elements:[...sn(e.left),...sn(e.right)];let t=e.operator===`\\`||Yt(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Gt(n)?sn(n).filter(t=>yn(t,r)===(e.operator===`\\cap`)):q(e).elements},cn=e=>{if(typeof e!=`object`||!Me(e))throw new b(`Shouldn't call isEmpty() on value ${Y(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new b(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(cn);case`RecordSet`:return e.sets.some(cn);case`FunctionSet`:return!cn(e.domain)&&cn(e.range);case`Union`:return qt(e).every((t,n)=>cn(Jt(t,n,e)));default:return q(e).elements.length===0}},ln=(e,t)=>e.reduce((e,n)=>{let r=e*dn(n);if(r>2147483647)throw new b(t());return r},1),un=e=>`Overflow when computing the number of elements in:\n${Y(e)}`,dn=e=>{if(typeof e!=`object`)return q(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new b(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new b(`Attempted to compute the number of elements in the overridden value ${Y(e)}.`);case`Subset`:{let t=dn(e.base);if(t>=31)throw new b(un(e));return 2**t}case`FunctionSet`:{if(cn(e.domain))return 1;if(cn(e.range))return 0;let t=dn(e.range);if(t===1)return 1;let n=dn(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new b(un(e));return r.value}case`RecordSet`:return cn(e)?0:ln(e.sets,()=>un(e));case`ProductSet`:return cn(e)?0:ln(e.factors,()=>`Overflow when computing the number of elements in ${Y(e)}`);default:return q(e).elements.length}},fn=e=>`Attempted to check if the set ${Y(e)}is finite.`,pn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new b(`Attempted to check if the ${Fe(e)} ${Y(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new b(`Attempted to check if the function:\n${Y(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return pn(e.base)&&cn(e.base);case`Subset`:return pn(e.base);case`FunctionSet`:{let t=pn(e.domain);if(t&&cn(e.domain))return!0;let n=pn(e.range);return n&&cn(e.range)?!0:n&&(t||dn(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!pn(e))n.isAllFinite=!1;else if(cn(e))return!0;return n.isAllFinite}case`Union`:if(!Gt(e.base))throw new b(`Attempted to check if the nonenumerable set:\n${Kt(e)}\nis a finite set.`);return q(e.base).elements.every(pn);case`SetOperation`:if(e.operator===`\\cup`)return pn(e.left)&&pn(e.right);if(e.operator===`\\cap`){if(!pn(e.left)&&!pn(e.right))throw new b(fn(e));return!0}if(pn(e.left))return!0;if(!pn(e.right))throw new b(fn(e));return!1;case`FilteredSet`:if(!pn(e.base))throw new b(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${Y(e.base)}\nis finite.`);return!0}},mn=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=Ye(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},hn=e=>{if(typeof e!=`object`||!P(e))return;let t=xn(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},gn=(e,t)=>`Attempted to check if the value ${Y(e)} is an element of ${Y(t)}`,_n=(e,t)=>{let n=`Attempted to check if the value:\n${Y(e)}\nis an element of the`;if(!P(t))return`${n} ${Fe(t)} ${Y(t)}`;let r=t.kind===`Function`||Yt(t.domain)?xn(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${Y(e)}\nis in the record:\n${Y(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${Y(t)}`},vn=(e,t)=>ke.current?je(t,()=>yn(e,t)):yn(e,t),yn=(e,t)=>{if(!Me(t))throw new b(_n(e,t));switch(t.kind){case`Set`:try{return mn(t.elements,e)!==-1}catch(n){if(!(n instanceof b))throw n;return je(t,()=>wt(e,t.elements))}case`MixedSet`:return je(t,()=>wt(e,t.elements));case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!Pe(e))throw new b(`Attempted to check if the value:\n${Y(e)}\nis in the integer interval ${Y(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(Pe(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new b(`Attempted to check if the value:\n${Y(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!Gt(e))throw new b(`Attempted to check if the non-enumerable value\n${Oe(Y(e))}\nis element of\n${Oe(Y(t))}`);return q(e).elements.every(e=>vn(e,t.base));case`FunctionSet`:{if(!P(e)){if(Pe(e))return!1;throw new b(`Attempted to check if \n${Y(e)}\nwhich is not a TLC function value, is in the set of functions:\n${Oe(Y(t))}`)}let n=xn(e),r=rt(n.domain);return(r===void 0?Tt(t.domain,Qe(n.domain)):Tt({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>vn(e,t.range))}case`RecordSet`:{let n=P(e)?xn(e):void 0;if(!n||!z(n.domain)){if(Pe(e))return!1;throw new b(`Attempted to check if non-record\n${Y(e)}\nis in the set of records:\n${Y(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=mn(n.domain,e);return i!==-1&&vn(n.range[i],t.sets[r])})}case`ProductSet`:{let n=P(e)?hn(e):void 0;if(n===void 0){if(P(e)&&xn(e).domain.every(e=>typeof e==`number`)||Pe(e))return!1;throw new b(`Attempted to check if non-tuple\n${Y(e)}\nis in the set of tuples:\n${Y(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>vn(e,t.factors[n]))}case`FilteredSet`:return vn(e,t.base)&&t.test(e);case`Union`:if(!Gt(t.base))throw new b(`Attempted to check if:\n ${Y(e)}\nis an element of the non-enumerable set:\n ${Kt(t)}`);return q(t.base).elements.some(t=>vn(e,t));case`SetOperation`:return t.operator===`\\cup`?vn(e,t.left)||vn(e,t.right):vn(e,t.left)&&vn(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=hn(e);if(n===void 0){if(Pe(e))return!1;throw new b(gn(e,t))}return n.every(e=>yn(e,t.base))}default:throw new b(_n(e,t))}},bn=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?yn(e,n):e.range.every((e,r)=>bn(e,t.range[r],n.range)),xn=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){Yt(e.domain)||dn(e.domain);let t=Vt(e.domain);return $e(t,t.map(t=>e.apply(t)))}throw new b(`Expected a function but found ${Y(e)}`)},Sn=/* @__PURE__ */ new WeakSet,Cn=e=>(Sn.add(e),e),wn=e=>{let t=e.domain;return t.length===0?Sn.has(e)?`FcnRcdValue`:`TupleValue`:t===Ft[t.length]?`TupleValue`:Lt.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},J=(e,t)=>`Attempted to apply function:\n${Oe(Y(e))}\nto argument ${Oe(Y(t))}, which is not in the domain of the function.`,Tn=e=>`Attempted to apply function with integer domain to the non-integer argument ${Oe(Y(e))}`,En=(e,t)=>{if(Sn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${Oe(Y(e))},\nthe first argument is:\n${Oe(Y(t))}\nwhich is not in its domain.\n`;let n=wn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${Oe(Y(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${Oe(Y(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${Oe(Y(e))}`:`Attempted to access record by a non-string argument: ${Oe(Y(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?Tn(t):J(e,t)},Dn=(e,t)=>wn(e)===`FcnRcdValue`?J(e,t):Tn(t),On=e=>wn(e)===`RecordValue`,kn=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===Ft[e.length]||Lt.has(e)):typeof n==`string`&&typeof t!=`string`},An=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return mn(e,t)},jn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!yn(t,e.domain))throw new b(Sn.has(e)?En(e,t):`Attempted to apply a function to ${Y(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new b(r?.(e)??`Attempted to apply ${Y(e)}, which is not a function`);let i=kn(e.domain,t)?-1:An(e.domain,t);if(i===-1)throw new b(n?.(e)??En(e,t));return e.range[i]},Mn=e=>Bt(e)?Lt.get(e)??Ht(e.length):void 0,Nn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=xn(e).domain;return Mn(t)??Qe(t)},Pn=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!Yt(e.domain))){if(!yn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>Tt(t,n)?r:e.apply(n),source:e.source}}let i=xn(e),a=An(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=$e(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-Bn(e,s)+Bn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Xn(e,s)+Xn(e,c)|0}return l},Fn=/* @__PURE__ */ new WeakMap,In=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Ln=(e,t)=>Math.imul(e^t,16777619),Rn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return In(t)},zn=e=>In(Un(e)+2654435769|0),Bn=(e,t)=>In(Math.imul(Un(e),668265261)+Un(t)|0),Vn={isHashed:!1},Hn=e=>{if(e.kind===`ModelValue`)return In(Ln(Rn(e.name),109));if(Me(e)){if(!Yt(e))return Vn.isHashed=!0,Rn(er(e));let t=q(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+zn(t[e])|0;return n}let t=xn(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+Bn(t.domain[e],t.range[e])|0;return n},Un=e=>{if(typeof e==`number`)return In(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Rn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Hn(e)),e.hash;let t=Fn.get(e);if(t!==void 0)return t;let n=Hn(e);return Fn.set(e,n),n},Wn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(We(e))throw new b(`TLC has found a state in which the value of a variable contains ${Y(e)}`);if(Me(e))return q(e).elements.forEach(Wn);let t=xn(e);t.domain.forEach(Wn),t.range.forEach(Wn)},Gn=e=>{Vn.isHashed&&e.forEach(Wn)},Kn=/* @__PURE__ */ new WeakMap,qn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Jn=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return qn(t)},Yn=e=>qn(Qn(e)+2135587861|0),Xn=(e,t)=>qn(Math.imul(Qn(e),374761393)+Qn(t)|0),Zn=e=>{if(e.kind===`ModelValue`)return qn(Jn(e.name)^60);if(Me(e)){if(!Yt(e))return Vn.isHashed=!0,Jn(er(e));let t=q(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Yn(t[e])|0;return n}let t=xn(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Xn(t.domain[e],t.range[e])|0;return n},Qn=e=>{if(typeof e==`number`)return qn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Jn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Zn(e)),e.fingerprint;let t=Kn.get(e);if(t!==void 0)return t;let n=Zn(e);return Kn.set(e,n),n},$n=/* @__PURE__ */ new WeakMap,er=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=$n.get(e);if(t!==void 0)return t;let n=tr(e);return $n.set(e,n),n},tr=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${er(e.base)}>`;if(e.kind===`FilteredSet`&&!Yt(e))throw new b(`Attempted to compare the non-enumerable set ${Y(e)} with another value`);if(Me(e))return Yt(e)?`{${q(e).elements.map(er).join(`,`)}}`:`<${e.kind} ${Y(e)}>`;let t=xn(e);return`(${t.domain.map((e,n)=>`${er(e)}:${er(t.range[n])}`).join(`,`)})`},nr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,rr=e=>e.reduce((e,t)=>e===0?0:e*dn(t),1),ir=e=>{if(e.kind===`Subset`)return dn(e.base)<=6?q(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return q(e);if(e.kind===`FunctionSet`&&Yt(e.domain)&&dn(e.domain)===0)return Qe([$e([],[])]);let t=e.kind===`FunctionSet`?dn(e.range)**dn(e.domain):rr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?kt:t<=1999?q(e):void 0},ar=(e,t)=>{if(t)return ir(e);if(Yt(e))try{return ir(e)}catch(e){if(e instanceof b)return;throw e}},or=(e,t)=>{let n=e=>Y(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`{x \\in ${n(e.base)} : ...}`;case`Union`:return Kt(e,t)}},sr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Y=(e,t=!1,n=!1)=>{let r=e=>Y(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return nr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(q(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=ar(e,t);return n?r(n):or(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!Yt(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${Y(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=xn(e),a=r=>Y(r,t,n&&e.kind===`Function`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:i.domain.every(e=>typeof e==`string`&&sr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):I(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},cr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Oe(Y(n))}\n`).join(``)},lr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},ur=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Un(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||nt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||nt(i[e],n))return i[e]}return n.kind===`Set`?lr(n.elements,t):(lr(n.domain,t),lr(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}},dr=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`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:[])}},X=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,fr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),pr=(e,t)=>fr.has(e)?new b(t):new x(t),mr=e=>typeof e==`object`&&e.kind===`Operator`,Z=(e,t,n)=>{let r=e[t];if(r===void 0||mr(r))throw pr(n,`${n} expects a value as argument ${t+1}`);return r},hr=(e,t,n)=>{let r=Z(e,t,n);if(typeof r!=`number`)throw pr(n,`${n} expects an integer but received ${Y(r)}`);return r},gr=(e,t,n)=>{let r=Z(e,t,n);if(typeof r!=`boolean`)throw pr(n,`${n} expects a boolean but received ${Y(r)}`);return r},_r=(e,t,n)=>{let r=Z(e,t,n);if(!Me(r))throw pr(n,`${n} expects a set but received ${Y(r)}`);return r},vr=(e,t,n)=>{let r=_r(e,t,n);if(!Yt(r))throw pr(n,`${n} cannot enumerate the non-enumerable set ${Y(r)}`);return r},yr=(e,t,n)=>q(vr(e,t,n)),br=(e,t,n)=>yr(e,t,n).elements,xr=(e,t,n)=>{let r=Z(e,t,n),i=hn(r);if(!i)throw pr(n,`${n} expects a sequence but received ${Y(r)}`);return i},Sr=(e,t,n)=>{let r=Z(e,t,n);if(!P(r))throw pr(n,`${n} expects a function but received ${Y(r)}`);return xn(r)},Cr=(e,t,n)=>{let r=e[t];if(r===void 0||!mr(r))throw pr(n,`${n} expects an operator as argument ${t+1}`);return r},wr=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),Q=(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}),Tr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Er=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Dr=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(Z(n,0,e),Z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Or=e=>e>2147483647||e<-2147483648,kr=e=>new x(`Overflow when computing ${e}`),Ar={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`},jr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Mr={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`},Nr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return jr[e.operator];if(e.kind!==`Function`)return Ar[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},Pr=e=>Mr[Nr(e)],Fr=(e,t)=>new b(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ir=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof b&&(e.isLazy===!0||!(n instanceof x))?Fr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Lr=(e,t)=>{if(typeof e!=`number`)throw Fr(t,`Cannot cast tlc2.value.impl.${Nr(e)} to tlc2.value.impl.IntValue`);return e},Rr=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,zr=(e,t,n,r)=>{let i=Rr(e,n,`IntValue`,2);return Dr(t,(e,n)=>{let a=Lr(e,i),o=Lr(n,i),s=r(a,o);if(Or(s))throw kr(`${a}${t}${o}`);return s})},Br=(e,t,n)=>{if(typeof e!=`number`)throw new x(`The ${t} argument of ${n} should be an integer, but instead it is:\n${Y(e)}`);return e},Vr=(e,t)=>Dr(e,(n,r)=>t(Br(n,`first`,e),Br(r,`second`,e))),Hr=(e,t,n)=>({...Er(e,t,n),isLazy:!0}),Ur=(e,t,n)=>{let r=Cr(e,t,n);return()=>r.call([])},Wr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Gr=()=>({bool:as,condition:(e,t)=>{if(typeof e!=`boolean`)throw Ko(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw qo(t,n,e);return e},apply:jn,tuple:Ut,set:Ot,record:$e,writtenRecord:L,equal:et,enumerate:us,unassigned:(e,t)=>{throw Wc(e,t)},primeOutsideAction:e=>{throw Gc(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0}),extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>ns(e,t,n[r]),e.scope),state:e.state,next:e.next})}),Kr={value:void 0},qr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Jr=e=>`local${e.counter++}`,Yr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),dr(e).forEach(e=>Yr(e,t)),t),Xr=(e,t,n)=>{let r=qr(e,mc(t,e.environment)),i=Yr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=qr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Zr=(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(()=>Jr(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${$r(e,t.set,s)}, ${qr(e,t.set)});`),u=t.bounds.map(t=>{let n=Jr(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${$r(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Jr(e);return`for (let ${i} = 0; ${i} < ${c[r]}.length; ${i}++) { const ${n} = ${c[r]}[${i}]; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},Qr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${$r(e,r[0],n)}, "the left side of =>") ? bool(${$r(e,r[1],n)}, "the right side of =>") : true)`;if(X(t))return Xr(e,t,n);let i=ws(t.operator,e.environment);if(i?.kind!==`Builtin`)return Xr(e,t,n);if(i.name===`DOMAIN`)return`${qr(e,Zo(t))}(${$r(e,r[0],n)})`;if(i.name===`TLCEval`)return Xr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${qr(e,Qo(t,i))}(${$r(e,r[0],n)}, ${$r(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Sc(r[0],a))return`${qr(e,i.evaluateUnary)}(${$r(e,r[0],n)})`;let o=r.length===2&&Sc(r[0],a)&&Sc(r[1],a);return i.evaluateBinary&&o?`${qr(e,i.evaluateBinary)}(${$r(e,r[0],n)}, ${$r(e,r[1],n)})`:Xr(e,t,n)},$r=(e,t,n)=>{let r=(t,r=n)=>$r(e,t,r);if(ac(t)&&ec(t,e.environment))return Xr(e,t,n);switch(t.kind){case`Number`:return Hs(t.value)?String(t.value):Xr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(X(t))return Xr(e,t,n);let i=Ps(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=qr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?qr(e,i.value):Xr(e,t,n)}case`Apply`:return Qr(e,t,n);case`And`:{let n=qr(e,t);return`(${t.operands.map((e,t)=>`conjunct(${r(e)}, ${n}, ${t})`).join(` && `)})`}case`Or`:return`(${t.operands.map(e=>`bool(${r(e)}, "a disjunct")`).join(` || `)})`;case`If`:return`(condition(${r(t.condition)}, ${qr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Rc(t.function);let n=r(t.function),i=qr(e,Yo(t));return t.args.length===1?`apply(${n}, ${r(t.args[0])}, undefined, ${i})`:`apply(${n}, tuple([${t.args.map(e=>r(e)).join(`, `)}]), undefined, ${i})`}case`FieldAccess`:return`apply(${r(t.record)}, ${JSON.stringify(t.field)}, ${qr(e,Jo(t))}, ${qr(e,Xo(t))})`;case`Record`:{let i=Hc(t.fields);if(Uc(i))return Xr(e,t,n);let a=qr(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}, ${qr(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=qr(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`)?Zr(e,t,n):Xr(e,t,n);default:return Xr(e,t,n)}},ei=(e,t)=>{if(!Wr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=$r(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(`
32
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Kr.value??=Gr();let o=Kr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ti={kind:`Local`},ni=/* @__PURE__ */ new WeakSet,ri=/* @__PURE__ */ new WeakMap,ii=/* @__PURE__ */ new WeakMap,ai=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},oi=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),si=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ci=e=>e.kind===`Operator`?e.params.length:0,li=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],ui=e=>e.name.includes(`!`),di=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},fi=(e,t,n)=>{let r=t.bindings.get(e);return r&&si(r.position,t.location)&&(!n||si(r.position,n.start))?r:void 0},pi=(e,t)=>e!==void 0&&t!==void 0&&_(e)===_(t),mi=(e,t,n,r)=>{if(t===void 0)return!0;if(pi(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=_(i),o=t.range&&_(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},hi=(e,t,n,r)=>mi(t,di(e,t)??fi(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,gi=(e,t,n)=>{mi(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},_i=(e,t,n,r)=>t.reduce((e,t,i)=>hi(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),vi=(e,t,n)=>t.reduce((e,t)=>hi(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),yi=e=>e.kind===`Name`?[e.name]:e.names,bi=e=>e.flatMap(e=>yi(e.pattern)),xi=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||si(n.location,t.location))?n:void 0},Si=(e,t)=>{let n=xi(e,t);return n?{key:t.getKey(n),arity:ci(n),params:li(n),kind:`Definition`}:t.imported.get(e)},Ci=(e,t,n)=>di(t,e)??Si(e,n),wi=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ti=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return si(e.location,e.args[0].location)?`prefix`:`postfix`}},Ei=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),Di=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Oi=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,ki=(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])}})},Ai=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?ki(e.name,[],void 0):ki(e.operator,e.args,e.argumentCounts),ji=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Mi=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:bi(e.bounds),body:e.body,sets:ji(e.bounds)};case`SetMap`:return{names:bi(e.bounds),body:e.expression,sets:ji(e.bounds)};case`SetFilter`:return{names:yi(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:yi(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}},Ni=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}},Pi=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Fi=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ii=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Ii(e.body,t):dr(e).reduce((e,n)=>e??Ii(n,t),void 0)},Li=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Li(i,t,n||Fi(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ii(e.set,t):Ii(e,t)},Ri=e=>e.kind===`Label`?Ri(e.body):e,zi=e=>typeof e==`number`?`argument selector ${e}`:e,Bi=`within the scope of a declaration
33
+ from outside that declaration's scope.`,Vi=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:_(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Ri(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:Li(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?Ii(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Fi(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Bi}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=zi(n.operand);if(l.isSufficesOpen){if(Oi(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=Ri(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ci(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=Mi(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Ni(e);if(!c)return;let f=Oi(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Oi(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Fi(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Bi}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},Hi=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:_(e.location.range),message:n}),!0)},Ui=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=_(r),a=e.params.filter((r,i)=>{let a=di(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:_(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Wi=(e,t,n,r)=>{if(!Pi(e))return!1;let i=Ai(e),a=i[0],o=i.length>1&&a.kind===`Name`?di(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Vi(e,i,o,t,n,r),o!==void 0},Gi=(e,t,n,r)=>{let i=e.location;if($i(e,n,r))return;let a=ii.get(e);if(a!==void 0)return a;if(ai(t)||Wi(e,n,r,!1)||Di(t))return e.kind===`Apply`?e.args.length:0;let o=di(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=ti),o)return o.arity;let s=Si(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,ii.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(di(n,c)!==void 0||Si(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=_(wi(i,t===`-.`?`-`:t));if(!Ei(t)){r.errors.push({location:l,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:l,message:`Could not find declaration or definition of symbol '${t}'.`});let u=Ti(e);u&&i.range&&r.errors.push({location:_(i.range),message:`Couldn't resolve ${u} operator symbol \`${t}'.`})},Ki=(e,t,n)=>(e.forEach(e=>ea(e.set,t,n)),e.reduce((e,t)=>_i(e,yi(t.pattern),t.pattern.ranges,n),t)),qi=(e,t)=>e.kind===`Identifier`&&e.name===t&&X(e)||dr(e).some(e=>qi(e,t)),Ji=(e,t)=>{e.kind===`FunctionConstruction`&&qi(e.body,t)&&(e.isRecursive=!0),dr(e).forEach(e=>Ji(e,t))},Yi=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?bi(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:_(o),message:e})},c=e.kind===`Function`?Ki(e.bounds,t,i):vi(t,e.params,i),l=di(c,a)??fi(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(ea(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Ji(e.body,a)):ea(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:mi(a,di(t,a)??fi(a,i,o),{kind:`Definition`,arity:ci(e),range:o},i)},Xi=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(di(e,t.name)?.isPending)return e;let n={name:t.name,arity:ci(t),params:li(t),kind:`Definition`,parent:e,isPending:!0};return r.add(n),n},t);return e.reduce((e,t)=>{let i={name:t.name,arity:ci(t),kind:`Definition`,range:t.location.range,parent:e};if(ui(t))return i;let a=n.isGenerated||t.isLocal||ai(t.name);return Yi(t,e,a?{...n,isGenerated:a}:n,r)?{...i,params:li(t)}:e},i)},Zi=(e,t,n)=>{let r=e.operator,i=Ci(r,t,n),a=Gi(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:_(e.argumentsRange??wi(e.location,r)),message:`The operator ${r} requires ${a} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Qi(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:_(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Gi(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else ea(i,t,n);return!0}if(i.kind===`Lambda`){ea(i,t,n);let o=i.params.length===c;return!o&&ni.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&s(e.selectorRanges?.at(-1)??wi(e.location,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return ea(i,t,n),!0;if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Ci(u,t,n)?.params??[],f=Gi(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(wi(i.location,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Qi=(e,t,n)=>{e.kind===`Identifier`?Gi(e,e.name,t,n):ea(e,t,n)},$i=(e,t,n)=>{let r=ri.get(e);return r?(r.args.forEach(e=>Qi(e,t,n)),n.errors.push(r.error),!0):!1},ea=(e,t,n)=>{if(ni.has(e)&&!n.isGenerated){ea(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>ea(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=e.name,i=Gi(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:_(wi(e.location,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Gi(e,e.operator,t,n);return;case`Apply`:Zi(e,t,n);return;case`Lambda`:ea(e.body,_i(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:ea(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&ea(e.other,t,n);return;case`Let`:ea(e.body,Xi(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:ea(e.body,Ki(e.bounds,t,n),i(bi(e.bounds)));return;case`UnboundedQuantifier`:ea(e.body,_i(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&ea(e.set,t,n),ea(e.body,_i(t,yi(e.pattern),e.pattern.ranges,n),i(yi(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:ea(e.predicate,Ki([e.bound],t,n),i(yi(e.bound.pattern)));return;case`SetMap`:ea(e.expression,Ki(e.bounds,t,n),i(bi(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:_(r.location.range??wi(r.location,r.name)),message:`Non-unique fields in constructor.`}),ea(r.value,t,n)});return;case`Except`:ea(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),ea(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:ea(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Hi(e,n))return;ea(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Ui(e,t,n);return;case`Subexpression`:if($i(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Qi(e,t,n)),Wi(e,t,n,!1)}},ta=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Wi(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;n.facts.has(r)||ea(e,t,n)}),na=(e,t,n)=>(e.set&&ea(e.set,t,n),hi(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),ra=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:na(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?ra(t,e.scope,e.unit,!0):ea(t,e.scope,e.unit),e),{scope:t,unit:n});return ea(e.conclusion,i.scope,i.unit),i.scope},ia=(e,t,n)=>e.kind===`AssumeProve`?ra(e,t,n):(ea(e,t,n),t),aa=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&ta(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>oa(t,e,r),t)},oa=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set};switch(r.kind){case`Assert`:{let a=ia(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return aa(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return aa(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 ta(r.facts,t,n),t;case`Define`:return Xi(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return ea(r.expression,t,i),aa(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>ea(e,t,i)),t;case`Take`:return _i(Ki(r.bounds,t,i),r.names,r.nameRanges,i);case`Pick`:{let a=_i(Ki(r.bounds,t,i),r.names,r.nameRanges,i);return ea(r.body,a,{...i,labelParams:[...i.labelParams,...bi(r.bounds),...r.names]}),aa(e.proof,t,n),a}default:return aa(e.proof,t,n),t}},sa=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ia(e.statement,void 0,t);e.name!==void 0&&gi(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),aa(e.proof,n,t),r&&(r.isInProof=!1)},ca={line:0,column:0},la=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),ua=(e,t)=>{let n=new Map([...oi,...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},da=(e,t,n,r)=>{let i=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),void 0),a=ua(n,r.imported),o={location:e.location,errors:[],warnings:[]};r.reports.push(o);let s={imported:a,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...a].map(([e,t])=>[e,{...t,position:ca}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1},c=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){ea(n,i,s);return}let r=Gi(n,n.name,i,s);if(r!==void 0&&r!==t.arity)throw new p(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},l=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){o.errors.push({location:_(e.nameRange),message:`Identifier '${n}' 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 i=e.expression;c(r,i);let a=i.location.range;l.has(n)?a&&o.errors.push({location:_(a),message:`Multiple substitutions for symbol '${n}' in substitution.`}):l.set(n,i)});let u=t.filter(e=>!l.has(e.name)),d=e=>!di(i,e.name)&&!Si(e.name,s);return u.filter(e=>!d(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};c(t,n),l.set(t.name,n)}),u.filter(d).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&o.errors.push({location:_(r),message:`Substitution missing for symbol ${t.name} declared at ${_(i)} \nand instantiated in module ${n.name}.`})}),l},fa=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>si(e.location,t.location)?-1:+!!si(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof p)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},pa=(e,t)=>{let n=ua(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...oi,...t.bound].map(([e,t])=>[e,{...t,position:ca}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>gi(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return fa([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.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=mi(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);la(e,t)?ea(t.body,void 0,i):Yi(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:ci(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);vi(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>gi(t,e,i)),e.name!==void 0&&gi(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);ea(e.expression,void 0,r),e.name!==void 0&&gi(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>sa(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>ta(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:_(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},ma=/* @__PURE__ */ new WeakSet,ha=/* @__PURE__ */ new WeakSet,ga=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Sa(e,(e,r)=>ga(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&X(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&X(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},_a=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),va=/* @__PURE__ */ new WeakMap,ya=e=>va.get(e)??e.name,ba=(e,t)=>(ya(t)!==e.name&&va.set(e,ya(t)),e),xa=(e,t)=>ba(e.kind===`Function`?{...e,bounds:_a(e.bounds,e=>t(e,[])),body:t(e.body,bi(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Sa=(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=>xa(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:_a(e.bounds,n),body:t(e.body,bi(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,yi(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,yi(e.bound.pattern))};case`SetMap`:return{...e,bounds:_a(e.bounds,n),expression:t(e.expression,bi(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`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)}}},Ca=`LAMBDA`,wa=(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 Sa(e,(e,n)=>(r.push(...wa(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Ta=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}},Ea=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Da=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Oa=(e,t)=>e.map(e=>({pattern:Da(e.pattern,t),set:e.set})),ka=(e,t)=>e.kind===`Function`?{...e,bounds:Oa(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Aa=(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=>ba({...ka(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Oa(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Da(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Da(e.bound.pattern,n),set:e.bound.set}};default:return e}},ja=e=>`${e}@ENABLED`,Ma=(e,t)=>e.modes.get(t)??e,Na=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!X(e)&&t.instantiation.variables.has(e.name),Pa=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Pa(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Na(e,t,n))return[e.name];let r=X(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Pa(r.body,t,/* @__PURE__ */ new Map):void 0},Fa=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Na(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ja(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ba(e.expression,Ma(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ba(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ba(e.subscript,Ma(t,`Primed`),n),location:r},Ba(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Pa(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:ja(r),location:e.location},location:e.location},Ba({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Ia=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),La=(e,t)=>e.map(e=>Ia(e.name,t)),Ra=(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:[...La(t,r),...i.map(e=>Ia(e,r))],location:r},location:r}},za=(e,t)=>e.instantiation.isParameterized(t)?Ha(e,t):void 0,Ba=(e,t,n)=>{let r=e=>Ba(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!X(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ba(e.expression,Ma(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Ba(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Ma(t,`Enabled`),n)};let s=Fa(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return ma.add(n),n;let r=za(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&ci(o)>0?Ra(r,a,ci(o),e.location):{kind:`Apply`,operator:r,args:La(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||ha.has(e),c=e=>(s&&ha.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Ca,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Ca,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new p(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=za(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...La(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=za(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Ra(n,a,ci(r),e.location):{...e,operator:n}}let c=Ta(t),l=Sa(e,(e,i)=>i.length===0?r(e):Ba(e,t,Ea(n,i,c)));return Aa(l,n,c)},Va=(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:Ia(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ha=(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=Ta(e),o=ka(xa(i,(t,n)=>Ba(t,e,Ea(/* @__PURE__ */ new Map,n,a))),a);return Va(o,r.params,i.location)}):t},Ua=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>wa(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=>za(i,e)??e,getQualifiedKey:t=>{let n=za(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Va(r,e.params,r.location)):t}}},Wa=e=>e.kind===`Let`&&e.instances!==void 0||dr(e).some(Wa),Ga=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Sa(e,e=>Ga(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>si(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions),body:i.body,location:i.location}},Ka=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,qa=(e,t)=>e.definitions.some(e=>Wa(e.body))||e.assumptions.some(e=>Wa(e.expression))||e.theorems.some(e=>{let t=Ka(e);return t!==void 0&&Wa(t)})?{...e,definitions:e.definitions.map(e=>xa(e,e=>Ga(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ga(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Ka(e);return n===void 0?e:{...e,statement:Ga(n,t,[])}})}:e,Ja=/* @__PURE__ */ new WeakMap,Ya=/* @__PURE__ */ new WeakMap,Xa=(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},Za=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Qa=(e,t,n)=>{if(typeof t==`boolean`)return t;throw new b(`In computing ${n?`initial`:`next`} states, TLC expected a boolean expression,\nbut instead found ${Y(t)}.\n${Go(e)}`)},$a=(t,r,i=_c(t,r))=>{if(r.next!==void 0&&t.kind===`Number`)throw n(new b(`The next state relation is not a boolean expression.\n${t.text??t.value}`),e.error);return Qa(t,i,r.next===void 0)},eo=e=>e===`=`||e===`\\in`||e===`\\subseteq`,to=/* @__PURE__ */ new WeakMap,no=(e,t)=>{if(!e.trace)return t?Ja:Ya;let n=to.get(e)??[/* @__PURE__ */ new WeakMap,/* @__PURE__ */ new WeakMap];return to.set(e,n),n[+!t]},ro=(e,t,n)=>{let r=no(t,n),i=r.get(e);if(i)return i;let a=Po(e,t,n),o=t.trace,s=o?(t,n,r,i,s,c)=>{let l=o.length;o.push(e),a(t,n,r,i,s,c),o.length=l}:a;return r.set(e,s),s},io=(e,t)=>{if(t.constants.has(e))return;let n=os(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},ao=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return ao(e.expression,t,!1,r);if(e.kind!==`Identifier`||X(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=io(e.name,t);if(a&&!r.has(a))return r.add(a),ao(a.body,t,n,r)},oo=(e,t,n)=>ao(e,t,!n),so=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return so(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Bs(e.definitions,Xa(r,t,n));return so(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ts(t,e.name);if(a?.kind===`Thunk`)return so(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=io(e.name,r.environment);if(s)return so(s.body,void 0,n,r,i)},co=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||X(e))||!t&&e.kind===`Prime`,lo=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>lo(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=io(e.name,t);if(i)return n.add(e.name),lo(i.body,t,n)},uo=(e,t)=>{if(e.kind===`Tuple`)return[e,...e.elements.flatMap(e=>uo(e,t))];let n=e.kind===`Identifier`&&!t.variableIndex.has(e.name)?io(e.name,t):void 0;return n?[e,...uo(n.body,t)]:[e]},fo=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),po=(e,t,n)=>fo.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||eo(e.operator)&&(co(e.args[0],n)||oo(e.args[0],t,n)!==void 0)||X(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,mo=/* @__PURE__ */ new Set,ho=(e,t)=>{if(X(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Sa(e,(e,i)=>{let a=r.isReadOnly?ho(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},go=(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||X(e)?void 0:os(r,t);return i&&!n.has(i)&&(n.add(i),go(i.body,t,n))?!0:dr(e).some(e=>go(e,t,n))},_o=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=oo(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=lo(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return po(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:ro(e,t,n)}},vo=(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(Xc(e,t)===void 0||go(e,t,/* @__PURE__ */ new Set))return!0;let n=ho(e,mo);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)}},yo=(e,t,n)=>{let r=e.map(e=>_o(e,t,n)),i=r.map(()=>void 0),a=t.trace,o=(e,n,s,c,l,u)=>{let d=c,f;for(let c=e;c<r.length;c++){if(c>0&&n.isInit&&Ro(d)){f??=Xa(n,s,d);for(let e=c;e<r.length;e++)if(!bo(r[e].expression,f))return;u(d,l);return}let e=r[c];if(a&&(a.push(e.expression),e.expression.kind===`Unchanged`&&a.push(...uo(e.expression.expression,t))),e.kind===`Guard`){f??=Xa(n,s,d);let r=i[c]??=gc(e.expression,t);if(!$a(e.expression,f,r(f)))return;continue}if(e.kind===`Assign`){f??=Xa(n,s,d);let r=(i[c]??=gc(e.value,t))(f),a=d[e.index];if(a===void 0)d=Za(d,e.index,r),f=void 0;else if(!et(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=d[n];if(e===void 0)d=Za(d,n,t[n]),f=void 0;else if(!et(e,t[n]))return}continue}let p=c+1;e.runner(n,s,d,l,!0,(e,t)=>o(p,n,s,e,t,u));return}u(d,l)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},bo=(e,t)=>Qa(e,_c(e,t),!0),xo=e=>(t,n,r,i,a,o)=>{$a(e,Xa(t,n,r))&&o(r,i)},So=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Xa(r,i,a);if(a[l]!==void 0){$a(e,u)&&c(a,o);return}let d=_c(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Yt(f))throw new b(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${Go(e)}`);let p=sn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Za(a,l,p[e]),o)}},Co=/* @__PURE__ */ new WeakMap,wo=e=>{let t=Co.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(wo),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Co.set(e,n),n},To=(e,t)=>{let n=e.args[0],r=xo(e),i=(e,r,i)=>so(n,r,i,e,!t)??-1,a=So(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=_c(e.args[1],Xa(t,n,o));l(Za(o,u,d),s)}},Eo=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=ts(t,e.name);if(i?.kind===`Thunk`)return Eo(i.expression,i.scope,n,r);let a=i?void 0:os(e.name,r.environment);if(a?.kind!==`Function`)return;let o=_c(e,Xa(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:ns(void 0,a.name,o)}},Do=(e,t,n)=>{let r=xo(e);return(i,a,o,s,c,l)=>{let u=Eo(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=Xa(i,a,o),f=e.args.map(e=>_c(e,d)),p=f.length===1?f[0]:Ut(f),m=fs(u.bounds,Xa(i,u.scope,o));if(!yn(p,m))throw new b(`Attempted to apply a function to ${Y(p)}, which is not in its domain at ${Wo(e)}`);ro(u.body,t,n)(i,ps(u.bounds,u.scope,p),o,s,c,l)}},Oo=(e,t)=>{if(lo(e,t))return yo([wo(e)],t,!1);if(e.kind===`Tuple`)return ro(wo(e),t,!1);let n=wo(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ts(i,e.name):void 0;l?.kind===`Thunk`?ro(wo(l.expression),t,!1)(r,l.scope,a,o,s,c):$a(n,Xa(r,i,a))&&c(a,o)}},ko=(e,t,n)=>{let r=e.operator,i=xo(e),a=X(e)?void 0:ws(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Dc(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=ro(a.body,t,n),o.body(e,i(Xa(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Xa(a,o,s),f=Es(e,d);f?.kind===`Closure`?ro(f.body,t,n)(a,Rs(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Ao=(e,t,n)=>{let r=xo(e),i=X(e)?void 0:io(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ts(s,e.name);f?.kind===`Thunk`?ro(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=ro(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},jo=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||X(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!X(a))return;let o=ao(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>jo(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||X(e))return;let r=ws(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=jo(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`&&X(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Mo=(e,t,n)=>{let r=ts(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},No=(e,t,n)=>{let r=e.map(e=>ro(e,t,n)),i=n?[]:e.map(e=>jo(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Mo(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Po=(e,t,n)=>{let r=e=>ro(e,t,n);switch(e.kind){case`And`:return yo(e.operands,t,n);case`Or`:return No(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(t,n,r,o,s,c)=>{let l=us(_c(a.set,Xa(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,ns(n,e,l[a]),r,o,s,c)}}let o=n||t.trace?void 0:vo(e,t);if(o){let r=yo(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=Xa(t,n,i),u=e.bounds.map(e=>us(_c(e.set,l),e.set));if(u.some(e=>e.length===0))return;let d=(e,n)=>{if(e<0)r(t,n,i,a,s,c);else for(let r of u[e]){if(t.isStopped)return;let a=ns(n,o.names[e],r);if(e===u.length-1){let e=Xa(t,a,i);if(!o.guards.every(t=>$a(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{ds(e.bounds,Xa(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Xc(e,t)!==void 0&&!go(e.body,t,/* @__PURE__ */ new Set)?ho(e,mo):void 0;return(t,n,r,o,s,c)=>{let l=[];ds(e.bounds,Xa(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ts(n,e)?.kind===`Value`)){u.every(n=>$a(e.body,Xa(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ro(r)?u.slice(n).every(n=>bo(e.body,Xa(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=_c(e.condition,Xa(r,i,a));(as(l,`an IF condition`)?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Xa(r,i,a),u=t.find(e=>as(_c(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new b(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${Go(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Xs(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Bs(e.definitions,Xa(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new b(`UNCHANGED appears in an initial predicate at ${Wo(e)}`)}:Oo(e.expression,t);case`AngleAction`:{let t=r(e.action),n=wo(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{try{$a(n,Xa(e,r,t))||s(t,i)}catch(t){throw!e.isEnabled||!(t instanceof S)?t:new b(`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`)}})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,wo(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Ao(e,t,n);case`FunctionApplication`:return Do(e,t,n);case`Apply`:{let i=e.args;if(eo(e.operator)){let r=oo(i[0],t,n);if(r!==void 0)return e.operator===`=`?yo([e],t,n):So(e,()=>r);if(co(i[0],n))return To(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=_c(i[0],Xa(t,n,r));(typeof c==`boolean`?c:as(c,`the left side of => at ${Wo(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return ko(e,t,n)}default:return xo(e)}},Fo=/* @__PURE__ */ new WeakMap,Io=e=>{let t=Fo.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Fo.set(e,n),n},Lo=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Ro=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},zo=(e,t)=>{let n=t.state;if(!n||!Ro(n))throw new b(`ENABLED needs a complete state at ${Wo(e)}`);let r=t.environment,i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return ro(e,r,!1)(i,t.scope,Io(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Bo=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};ro(t,r,!0)(o,a,Io(r),void 0,!1,t=>{if(!o.isStopped){if(!Ro(t))throw n(new w(t),e.error);o.isStopped=i(t)}})},Vo=(e,t,n)=>{let r=[];return Bo(e,t,e=>(r.push(e),!1),n),r},Ho=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return ro(e,n,!1)(a,i,Io(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Ro(e))throw new C(e,t,Lo(e,n).sort());o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Uo=(e,t,n,r)=>{let i=[];return Ho(e,t,n,e=>(i.push(e),!1),r),i},Wo=e=>`line ${e.location.line}, column ${e.location.column}`,Go=e=>{let t=e.location.range;return t?_(t):Wo(e)},Ko=(e,t)=>new b(`A non-boolean expression (${Pr(t)}) was used as the condition of an IF.\n${Go(e)}`),qo=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r){let r=e.operands[t],i=r.kind===`Number`?String(r.value):Go(r);return new b(`A non-boolean expression (${Pr(n)}) was used as a formula in a conjunction.\n${i}`)}let i=e.operands[Math.max(t,1)].location.range?.end??r.end;return new b(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${Pr(n)}.\n${Go({...e,location:{...e.location,range:{...r,end:i}}})}`)},Jo=e=>t=>On(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${Y(t)}\n${Go(e)}`:Dn(t,e.field),Yo=e=>t=>`A non-function (${Pr(t)}) was applied as a function.\n${Go(e)}`,Xo=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${Y(t)}\n${Go(e)}`,Zo=e=>t=>{if(!P(t))throw new b(`Attempted to apply the operator DOMAIN to a non-function\n(${Pr(t)})\n${Go(e)}`);return Nn(t)},Qo=(e,t)=>(n,r)=>{if(!Me(n)||We(n))throw new b(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Go(e)}`);return t.evaluate([n,r])},$o=t=>n(new b(`TLC can't handle real numbers: ${t.text} at ${Wo(t)}`),e.configParseError),es=t=>n(new b(`TLC can't handle a number this big: ${t.text??t.value} at ${Wo(t)}`),e.error),ts=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},ns=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),rs=(e,t,n)=>{if(t.kind===`Name`)return ns(e,t.name,n);let r=hn(n);if(!r||r.length!==t.names.length)throw new b(`Cannot bind <<${t.names.join(`, `)}>> to ${Y(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>ns(e,t,r[n]),e)},is=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),as=(e,t)=>{if(typeof e!=`boolean`)throw new b(`Expected ${t} to be a boolean but found ${Y(e)}`);return e},os=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),ss=(e,t)=>{if(e.kind===`Prime`||e.kind===`Unchanged`||e.kind===`Enabled`)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=os(n,t);if(e&&!t.constants.has(n)&&!cs(e,t))return!0}return dr(e).some(e=>ss(e,t))},cs=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!ss(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>ss(e.set,t)));return t.constantLevels.set(e,r),r},ls=(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.`},us=(e,t)=>{if(!Me(e)||We(e)){let n=Y(e),r=ls(e,n);throw new b(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${Go(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${Go(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?zt(e):$t(e)??q(e).elements},ds=(e,t,n)=>{let r=e.map(e=>us(_c(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,rs(a,e[t].pattern,n)));return i(e.length-1,t.scope)},fs=(e,t)=>{let n=e.map(e=>_c(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},ps=(e,t,n)=>{if(e.length===1)return rs(t,e[0].pattern,n);let r=hn(n)??[];return e.reduce((e,t,n)=>rs(e,t.pattern,r[n]),t)},ms=/* @__PURE__ */ new WeakMap,hs=(e,t)=>{let n=ms.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:_(r)};return ms.set(t,i),i},gs=(e,t,n)=>{let r=hs(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}},_s=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Un(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(nt(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},vs=(e,t)=>{let n=fs(e.bounds,t),r=_s(n,(n,r)=>_c(e.body,is(t,ps(e.bounds,ns(void 0,e.name,r),n))),gs(e.bounds,e.body,n));return e.bounds.length===1?Cn(r):r},ys=(e,t)=>e.kind===`Function`?vs(e,t):_c(e.body,t),bs=(e,t)=>{let n=cs(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new b(`Operator ${e.name} requires ${e.params.length} arguments`);let i=is(t,void 0);if(!n)return ys(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>ys(e,i));return t.environment.definitionValues.set(e,a),a},xs=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=_c(e.expression,is(t,e.scope));return n&&(e.cache=r),r},Ss=/* @__PURE__ */ new WeakMap,Cs=e=>{let t=Ss.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Ss.set(e,n),n},ws=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return ws(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Cs(r):t.builtins.get(e)},Ts=/* @__PURE__ */ new WeakMap,Es=(e,t)=>{if(X(e))return Ds(e.operator,t);let n=Ts.get(e),r=n===void 0?ws(e.operator,t.environment)??null:n;return n===void 0&&Ts.set(e,r),r??Ds(e.operator,t)},Ds=(e,t)=>{let n=ts(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return ws(e,t.environment)},Os=e=>e.kind===`Closure`?e.params.length:e.arity,ks=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Ds(n,t);if(!r)throw new b(`Expected an operator argument at ${Wo(e)}`);return r},As=(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)=>ns(e,n.name,t[r]),e.scope);return _c(e.body,is(n,r))},js=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Os(e),call:n=>As(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Ms=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ds(e.name,t);return n!==void 0&&Os(n)>0},Ns=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),Ps=(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 Ps(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([])}},Fs=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Hs(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=X(e)?void 0:Ps(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ts(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Ns(e,t)}}return t=>Ns(e,t)},Is=/* @__PURE__ */ new WeakMap,Ls=(e,t)=>{let n=Is.get(e);if(n)return n;let r=Fs(e,t);return Is.set(e,r),r},Rs=(e,t,n)=>{if(t.length!==e.params.length)throw new b(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:ks(t[i],n)}:Ls(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},zs=(e,t,n)=>e.kind===`Closure`?_c(e.body,is(n,Rs(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>_c(e,n))):e.isLazy?e.evaluate(Cc(t,n),n):e.evaluate(t.map(e=>Ms(e,n)?js(ks(e,n),n):_c(e,n)),n),Bs=(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},i):r.params.length>0||n?.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},i)},t.scope),Vs=(e,t,n)=>{let r=ts(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return xs(r,n);if(r?.kind===`Operator`){if(Os(r.operator)===0)return As(r.operator,[],n);throw new b(`Operator ${e} is used without arguments`)}let i=Ps(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Wc(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return bs(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new b(`Unknown identifier ${e} at ${Wo(t)}`)},Hs=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Us=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Ws=(e,t)=>Us.has(e)||t.builtins.get(e)?.isStateLevel===!0,Gs={builtins:Us,definitions:/* @__PURE__ */ new WeakMap},Ks={builtins:new Set([...Us].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},qs=(e,t)=>e.kind===`Operator`&&e.params.length===0&&cs(e,t),Js=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!X(e)){let e=os(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!qs(e,t)&&Ys(e,t,n))return!0}return dr(e).some(e=>Js(e,t,n))},Ys=(e,t,n=Gs)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Js(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Js(e.set,t,n));return n.definitions.set(e,i),i},Xs=(e,t)=>new Set(e.filter(e=>Ys(e,t))),Zs=e=>[...e.definitions.values()].some(t=>Ys(t,e)),Qs=e=>[...e.definitions.values()].some(t=>Ys(t,e,Ks)),$s=/* @__PURE__ */ new WeakMap,ec=(e,t)=>{let n=$s.get(e);if(n!==void 0)return n;let r=ic(e,t,nc);return $s.set(e,r),r},tc=/* @__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`]),nc=/* @__PURE__ */ new Set,rc=(e,t,n)=>n.size===0?ec(e,t):ic(e,t,n),ic=(e,t,n)=>{if(!tc.has(e.kind))return!1;if(e.kind===`Identifier`&&X(e))return n.has(e.name);if(X(e))return!1;if(e.kind===`Identifier`){let n=Ps(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&qs(n.definition,t)}if(e.kind===`Apply`){if(Ws(e.operator,t)||e.operator===`~>`)return!1;let r=ws(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=os(e.operator,t);if(!n||!cs(n,t)||Ys(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`&&rc(e,t,n))}let r={value:!0};return Sa(e,(e,i)=>(r.value&&=rc(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},ac=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,oc=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}},sc=(e,t)=>{if(e.kind===`Identifier`&&X(e))return!t.has(e.name);if(X(e))return!0;let n={value:!1};return Sa(e,(e,r)=>(n.value||=sc(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},cc=(e,t)=>ma.has(e)&&ac(e)&&Xc(e,t)!==void 0&&!sc(e,nc),lc=/* @__PURE__ */ new WeakMap,uc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetMap`,`SetFilter`,`Tuple`,`Record`,`RecordSet`,`FunctionSet`,`Product`]),dc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),fc=(e,t)=>uc.has(e.kind)||e.kind===`Apply`&&dc.has(e.operator)&&!X(e)&&ws(e.operator,t)?.kind===`Builtin`,pc=(e,t,n,r)=>{try{return e(t)}catch(e){throw n.length===r+1&&n.push(...Ae(e)??[]),e}},mc=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=qc(e,t),i=ac(e)&&ec(e,t)?oc(r):cc(e,t)?bc(r):r,a=t.trace,o=a!==void 0&&fc(e,t),s=a?n=>{let r=a.length;a.push(e);let s=pc(i,n,a,r);a.length=r,o&&typeof s==`object`&&s.kind!==`FilteredSet`&&ke.current?.set(s,e);let c=typeof s==`object`&&s.kind===`FilteredSet`?lc.get(s):void 0;return c?c(t):s}:i;return t.evaluators.set(e,s),s},hc=/* @__PURE__ */ new WeakMap,gc=(e,t)=>{if(t.trace)return mc(e,t);let n=hc.get(e);if(n)return n;let r=(ac(e)&&ec(e,t)?void 0:ei(e,t))??mc(e,t);return hc.set(e,r),r},_c=(e,t)=>gc(e,t.environment)(t),vc=(e,t)=>{let n=e.name,r=X(e)?void 0:Ps(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Wc(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&&cs(e,t))return t=>bs(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=gc(e.body,t),n.body(is(r,void 0)));return yc(e,t)?bc(r):r}return t=>bs(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>bs(e,t);return cs(e,t)||!yc(e,t)?n:bc(n)}return t=>Vs(n,e,t)},yc=(e,t)=>Xc(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Xc(e.set,t)!==void 0)),bc=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}},xc=(e,t)=>{let n=ws(e,t);return n!==void 0&&Os(n)>0},Sc=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!X(e)&&xc(e.name,t)),Cc=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>_c(e,t),expression:e})),wc=/* @__PURE__ */ new Set([`=`,`#`,`\\in`,`\\notin`,`\\cup`,`\\cap`,`\\`]),Tc=(e,t,n)=>e===`\\in`||e===`\\notin`||(e===`\\cup`||e===`\\cap`)&&!Ne(t)?n:t,Ec=(e,t,n)=>{if(n.trace&&wc.has(e.name)&&t.length===2){let r=mc(t[0],n),i=mc(t[1],n);return t=>{let n=r(t),a=i(t);return je(Tc(e.name,n,a),()=>e.evaluate([n,a],t))}}if(e.isLazy)return n=>e.evaluate(Cc(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Sc(t[0],n)){let e=mc(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Sc(t[0],n)&&Sc(t[1],n);if(i&&a){let e=mc(t[0],n),r=mc(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>Ms(e,n)?js(ks(e,n),n):_c(e,n)),n)},Dc=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new b(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Ls(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:ks(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Oc=/* @__PURE__ */ new WeakMap,kc=e=>{let t=Oc.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Oc.set(e,n),n},Ac=(e,t)=>{let n=[];for(let r=e;n.length<t;r=r?.parent){if(r?.binding.kind!==`Value`)return;n.push(r.binding.value)}return n},jc=(e,t)=>e.every((e,n)=>nt(e,t[n])),Mc=(e,t)=>{let n=os(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&cs(n,t)&&!Ys(n,t)},Nc=(e,t,n,r)=>{let i=Dc(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=gc(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next}));if(!r)return e=>o(i(e),e);let s=kc(e);return e=>{let n=i(e),r=Ac(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=Ln(a,Un(e));let c=s.calls.get(a),l=c?.find(e=>jc(e.args,r));if(l)return l.value;let u=o(n,e);return s.size<65536&&(s.size++,c?c.push({args:r,value:u}):s.calls.set(a,[{args:r,value:u}])),u}},Pc=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=mc(n[0],t),r=mc(n[1],t);return t=>!as(e(t),`the left side of =>`)||as(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new b(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=X(e)?void 0:ws(e.operator,t);if(r?.kind===`Closure`)return Nc(r,n,t,Mc(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=mc(n[0],t),i=Zo(e);return t.trace?e=>{let t=i(r(e));return typeof t==`object`&&t.kind===`Interval`?{...t}:t}:e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=mc(n[0],t);return ha.has(e)||ss(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=mc(n[0],t),a=mc(n[1],t),o=Qo(e,r);return t.trace?e=>{let t=i(e),n=a(e);return je(t,()=>o(t,n))}:e=>o(i(e),a(e))}return r?.kind===`Builtin`?Ec(r,n,t):r=>{let i=Ds(e.operator,r);if(i)return zs(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new b(`${e.operator} is a function; apply it with brackets`):e.operator===`\\cdot`?new b(`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.`):new b(`Unknown operator ${e.operator} at ${Wo(e)}`)}},Fc=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=mc(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=mc(a.set,t);return t=>{let s=us(o(t),a.set);for(let a=0;a<s.length;a++){let o=as(i(is(t,ns(t.scope,e,s[a]))),r);if(o!==n)return o}return 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=>mc(e.set,t));return t=>{let s=a.map((e,n)=>us(e(t),o[n].set)),c=(a,o)=>{if(a<0)return as(i(is(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,ns(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>ds(o,e,t=>as(i(is(e,t)),r)!==n)?!n:n},Ic=(e,t)=>{if(e.kind===`Tuple`)return Ut(e.names.map(e=>{let n=ts(t,e);return n?.kind===`Value`&&n.value}));let n=ts(t,e.name);return n?.kind===`Value`?n.value:void 0},Lc=/* @__PURE__ */ new WeakSet,Rc=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Lc.add(e)},zc=(e,t)=>{let n=Lc.has(e),r=mc(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=mc(a.set,t);return t=>{let c=o?s(t):fs(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(Ne)){let n=_s(c,e=>r(is(t,ps(i,t.scope,e))),gs(i,e.body,c));return i.length===1?Cn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Vt(c);return Cn($e(n,n.map(n=>r(is(t,ns(t.scope,e,n))))))}let u=[];return ds(i,t,e=>{let n=i.length===1?Ic(a.pattern,e)??!1:Ut(i.map(t=>Ic(t.pattern,e)??!1));return u.push([n,r(is(t,e))]),!1}),Nt(u)}},Bc=(e,t)=>{let n=Lc.has(e);n&&Rc(e.function);let r=mc(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=>mc(e,t))}),value:mc(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Ut(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(is(i,ns(i.scope,`@`,e))):Pn(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return e=>{let t=r(e);for(let n of i)t=o(t,n.path,0,e,n.value);return t}},Vc=(e,t)=>{if(e.kind===`SetFilter`){let n=mc(e.predicate,t),r=mc(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>n=>as(e(is(t,rs(t.scope,i,n))),`a set filter predicate`),s=o(n);if(!Ne(a)){if(Me(a)){let t={kind:`FilteredSet`,base:a,test:s};return lc.set(t,n=>({...t,test:o(mc(e.predicate,n))})),t}throw new b(`TLC encountered a non-enumerable quantifier bound ${Y(a)} at ${Wo(e.bound.set)}`)}return Qe(q(a).elements.filter(s))}}if(e.kind===`SetMap`){let n=mc(e.expression,t);return t=>{let r=[];return ds(e.bounds,t,e=>(r.push(n(is(t,e))),!1)),Ot(r)}}let n=e.set;if(!n)return()=>{throw new b(`TLC cannot evaluate an unbounded CHOOSE at ${Wo(e)}`)};let r=mc(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(ds([i],t,i=>as(r(is(t,i)),`the body of CHOOSE`)?(n.value=Ic(e.pattern,i),!0):!1),n.value===void 0)throw new b(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Go(e)}`);return n.value}},Hc=e=>[...e].sort((e,t)=>Ye(e.name,t.name)),Uc=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Wc=(t,n)=>a(new S(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Go(n)}`,t),e.configParseError),Gc=e=>new b(`A primed expression appears outside an action at ${Wo(e)}`),Kc=(e,t)=>{let n=Hc(e),r=Uc(n),i=n.map(e=>mc(e.value,t));if(r)return e=>Nt(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=>L(a,i.map(t=>t(e)),o):e=>$e(a,i.map(t=>t(e)))},qc=(e,t)=>{let n=e=>mc(e,t);switch(e.kind){case`Number`:{let t=e.value;return Hs(t)?()=>t:()=>{throw es(e)}}case`Decimal`:return()=>{throw $o(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return vc(e,t);case`Apply`:return Pc(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new b(`An operator cannot be used as a value at ${Wo(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw qo(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return e=>{for(let n=0;n<t.length;n++)if(as(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Gc(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>et(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Ko(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t)if(as(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new b(`Attempted to evaluate a CASE with no conditions true.\n${Go(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(is(n,Bs(e.definitions,n)))}case`Forall`:case`Exists`:return Fc(e,t);case`UnboundedQuantifier`:return()=>{throw new b(`TLC cannot evaluate an unbounded quantifier at ${Wo(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Vc(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Ot(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Ut(t.map(t=>t(e)))}case`FunctionConstruction`:return zc(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return Kc(e.fields,t);case`RecordSet`:{let t=Hc(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return Bc(e,t);case`ExceptAt`:return t=>{let n=ts(t.scope,`@`);if(n?.kind!==`Value`)throw new b(`@ appears outside an EXCEPT at ${Wo(e)}`);return n.value};case`FunctionApplication`:{Rc(e.function);let r=n(e.function),i=e.args.map(n),a=Yo(e);if(i.length===1&&t.trace){let e=i[0];return t=>{let n=r(t),i=e(t),o=()=>jn(n,i,void 0,a);return P(n)?je(n,o):o()}}if(i.length===1){let e=i[0];return t=>jn(r(t),e(t),void 0,a)}return e=>jn(r(e),Ut(i.map(t=>t(e))),void 0,a)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Jo(e),a=Xo(e);return e=>jn(t(e),r,i,a)}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?as(t(e),`an action`)||r(e):as(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>zo(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new b(`The subexpression reference at ${Wo(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new b(`TLC cannot evaluate a temporal formula in a state at ${Wo(e)}`)}}},Jc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Yc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Xc=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Jc.has(e.kind))return!1;let a=Yc(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&Ws(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 dr(e).every(i)};return i(e)?[...n]:void 0},Zc=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
32
34
  (***************************************************************************)
33
35
  (* This module provides dummy definitions of the operators that are *)
34
36
  (* defined by the real Reals module. It is expected that any tool that *)
@@ -97,9 +99,17 @@ _TEPosition ==
97
99
  THEN _TETraceLength
98
100
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
99
101
 
100
- =============================================================================`]]),mc=`tlc2/value/impl/`,hc=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)}},gc=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,_c=e=>{let t=hc(e);if(t.readUint32()!==3405691582)throw new p(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16(),t.readUint16(),t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let a=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,o={name:r,arity:gc(i),code:void 0};for(let e=t.readUint16();e>0;e--){let e=n[t.readUint16()].text,r=t.readBytes(t.readUint32());if(e===`Code`){let e=new DataView(r.buffer,r.byteOffset+4,4).getUint32(0);o.code=r.subarray(8,8+e)}}e&1&&e&8&&a.push(o)}return{pool:n,methods:a}},vc=(e,t)=>e[e[t].first].text,yc=(e,t)=>{let n=e[t],r=e[n.second];return{className:vc(e,n.first),name:e[r.first].text}},bc=(e,t,n,r)=>{let i=()=>new te(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=yc(t,l());if(n.className!==`${mc}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=yc(t,l()),a=s();if(n.className!==`${mc}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:vc(t,l()),value:void 0}),e+=3;else if(n===183){let n=yc(t,l()),a=s(),o=s();if(!(n.className===`${mc}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},xc=(e,t)=>{if(!t)return e;let n=_c(t),r=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let r=n.methods.find(e=>e.name===t.name&&e.arity===t.params.length);return r?{...t,body:bc(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},Z=(e,t,n)=>({low:e,high:t,isAssociative:n}),Sc=new Map([[`=>`,Z(1,1,!1)],[`<=>`,Z(2,2,!1)],[`~>`,Z(2,2,!1)],[`-+->`,Z(2,2,!1)],[`/\\`,Z(3,3,!0)],[`\\/`,Z(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,Z(5,5,!1)]),[`\\cdot`,Z(5,14,!0)],[`@@`,Z(6,6,!0)],[`:>`,Z(7,7,!1)],[`<:`,Z(7,7,!1)],[`\\cup`,Z(8,8,!0)],[`\\cap`,Z(8,8,!0)],[`\\`,Z(8,8,!1)],[`..`,Z(9,9,!1)],[`...`,Z(9,9,!1)],[`##`,Z(9,13,!0)],[`$`,Z(9,13,!0)],[`$$`,Z(9,13,!0)],[`??`,Z(9,13,!0)],[`!!`,Z(9,13,!1)],[`\\sqcap`,Z(9,13,!0)],[`\\sqcup`,Z(9,13,!0)],[`\\uplus`,Z(9,13,!0)],[`\\wr`,Z(9,14,!1)],[`+`,Z(10,10,!0)],[`++`,Z(10,10,!0)],[`(+)`,Z(10,10,!0)],[`\\oplus`,Z(10,10,!0)],[`%`,Z(10,11,!1)],[`%%`,Z(10,11,!0)],[`|`,Z(10,11,!0)],[`||`,Z(10,11,!0)],[`\\X`,Z(10,13,!1)],[`-`,Z(11,11,!0)],[`--`,Z(11,11,!0)],[`(-)`,Z(11,11,!0)],[`\\ominus`,Z(11,11,!0)],[`*`,Z(13,13,!0)],[`**`,Z(13,13,!0)],[`/`,Z(13,13,!1)],[`//`,Z(13,13,!1)],[`\\div`,Z(13,13,!1)],[`\\o`,Z(13,13,!0)],[`(.)`,Z(13,13,!0)],[`\\odot`,Z(13,13,!0)],[`(/)`,Z(13,13,!1)],[`\\oslash`,Z(13,13,!1)],[`(\\X)`,Z(13,13,!0)],[`\\otimes`,Z(13,13,!0)],[`&`,Z(13,13,!0)],[`&&`,Z(13,13,!0)],[`\\star`,Z(13,13,!0)],[`\\bullet`,Z(13,13,!0)],[`\\bigcirc`,Z(13,13,!0)],[`^`,Z(14,14,!1)],[`^^`,Z(14,14,!1)]]),Cc=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),wc=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Tc=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Ec=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Dc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Cc]),Oc=e=>Sc.has(e)||Cc.has(e)||e===`-.`,kc=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},Ac=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),jc=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Mc=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Nc=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Pc=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Fc=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Ic=/* @__PURE__ */ new Set([``,`*`,`-`]),Lc=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Rc=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),zc=/* @__PURE__ */ new Set([`NEW`,...Rc.keys()]),Bc=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Vc=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Hc=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Uc=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),Wc=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>Uc(t).test(e));if(r===-1)return;let i=n.findIndex((e,t)=>t>r&&e.startsWith(`====`));return n.slice(r,i===-1?void 0:i+1).join(`
101
- `)},Gc=(e,t)=>{let n=ue(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},c=[],l=e=>i[i.length-1].has(e),u=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),d=[],f=[],g=[],_=e=>{let t=r.index-1,i=e===t?g[e]:void 0;if(i)return i;let a=n[t];d[e]??=u(n[e]),f[t]??={line:a.line,column:a.endColumn};let o={module:c[c.length-1].name,start:d[e],end:f[t]};return e===t&&(g[e]=o),o},v=(e,t)=>(e.location.range=_(t),e),y=(e=0)=>n[Math.min(r.index+e,n.length-1)],b=(e=0)=>{let t=y(e),n=r.offsideColumns[r.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},x=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ee={index:0},te=e=>{let t=n.slice(ee.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>t&&(e.kind===`Keyword`||Hc.has(e.text)),re=e=>{let t=n.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},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Fc.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,S=(e,t=y(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new p(`${e} at line ${t.line}, column ${t.column}`,void 0,C(e,t,a,r))},C=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...te(re(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},ae=(e,t=y())=>S(e,t,t),oe=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!ne(e),w=(e,t=0)=>{let n=b(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=b();if(e.kind===`End`)throw S(`Unexpected end of expression`);return r.index++,e},E=e=>w(e)?(r.index++,!0):!1,D=e=>{if(!w(e))throw ae(`Expected ${JSON.stringify(e)} but found ${x(b())}`);return T()},O=()=>{let e=b();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${x(e)}`);if(ne(e))throw ae(`Unexpected keyword ${e.text}`);return r.index++,e.text},ce=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},k=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},le=()=>{if(w(`<<`)){let e={value:1};for(;b(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;b(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},de=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;b(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return b(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},fe=()=>{if(!E(`<<`))return{kind:`Name`,name:O()};let e=k(O);return D(`>>`),{kind:`Tuple`,names:e}},A=()=>k(()=>{let e=k(fe);D(`\\in`);let t=N();return e.map(e=>({pattern:e,set:t}))}).flat(),pe=()=>{let e=b();if(e.kind===`Identifier`){let t=r.index,n=[T().text];for(;w(`!`)&&b(1).kind===`Identifier`;)T(),n.push(O());return v({kind:`Identifier`,name:n.join(`!`),location:u(e)},t)}if(w(`<<`)||w(`(`))return M();throw ae(`Expected a subscript but found ${x(e)}`)},me=e=>{let t=b(1),n=b(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`&&w(`==`,Cc.has(n.text)?3:4))},he=e=>{if(!Tc.has(e.text))return!0;let t=b(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&jc.has(t.text)||me(e)},ge=()=>{let e=b(),n=e.kind===`Operator`&&(Sc.has(e.text)||wc.has(e.text))&&he(e);if(t&&e.kind!==`String`&&(wc.has(e.text)||Dc.has(e.text)&&e.text!==`'`&&!Cc.has(e.text)||Ec.has(e.text)&&b(-1).text===`(`&&b(-1).line===e.line&&b(-1).endColumn+1===e.column&&b(1).text===`)`&&b(1).line===e.line&&b(1).column===e.endColumn+1)&&he(e))throw S(`incomplete expression`,e);if(n)return r.index++,v({kind:`OperatorReference`,operator:e.text,location:u(e)},r.index-1);if(e.kind!==`String`&&Dc.has(e.text)&&he(e)){r.index++;let t=u(e);if(Cc.has(e.text))return{kind:`OperatorReference`,operator:e.text,location:t};let n={kind:`Identifier`,name:`argument`,location:t};return{kind:`Lambda`,params:[n.name],body:kc(e.text,n,t),location:t}}if(w(`LAMBDA`)){let t=r.index;T();let n=k(O);D(`:`);let i=N();return v({kind:`Lambda`,params:n,body:i,location:u(e)},t)}return N()},_e={range:void 0},j=()=>ce(()=>{let e=r.index;D(`(`);let t=k(ge);return D(`)`),_e.range=_(e),t}),ve=()=>{let e=T();r.offsideColumns.push(e.column);let t=[N()];for(;y().text===e.text&&y().column===e.column;)r.index++,t.push(N());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:u(e)}},ye=e=>ce(()=>{let t=u(e);if(b().kind===`Identifier`&&(w(`|->`,1)||w(`:`,1))){let e=w(`|->`,1)?`Record`:`RecordSet`,n=k(()=>{let t=r.index,n=u(b()),i=O();return n.range=_(t),D(e===`Record`?`|->`:`:`),{name:i,value:N(),location:n}});return D(`]`),{kind:e,fields:n,location:t}}if(le()){let e=A();D(`|->`);let n=N();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=N();if(E(`->`)){let e=N();return D(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(E(`EXCEPT`)){let e=k(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!oe(b()))throw ae(`Expected a field name but found ${x(b())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:k(()=>N())}),D(`]`);return D(`=`),{path:e,value:N()}});return D(`]`),{kind:`Except`,function:n,updates:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:n,subscript:pe(),location:t}}),be=e=>ce(()=>{let t=u(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(le()&&(b(1).text===`\\in`||w(`<<`))){let e=r.index,n=fe();D(`\\in`);let i=N();if(E(`:`)){let e=N();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=N();if(E(`:`)){let e=A();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;E(`,`);)i.push(N());return D(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),xe=e=>{let t=u(e),n=ce(()=>w(`>>`)||w(`>>_`)?[]:k(()=>N()));if(E(`>>_`)){if(n.length!==1)throw S(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:pe(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},Se=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&le()){let e=A();return D(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=k(O);return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i,body:N(),isTemporal:r,location:t}},Ce=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:N(),location:u(e)};let n=N();D(`->`),t.push({condition:n,body:N()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:u(e)}},we=()=>{let e=b(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Ac.has(e.text)||e.kind===`Operator`&&(Sc.has(e.text)||Cc.has(e.text)||wc.has(e.text)))},Te=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:se(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return r.index--,{kind:`Bound`,args:j()}}return{kind:`Name`,name:e.text,args:w(`(`)?j():[]}},M=()=>{let e=r.index===s.index,n=T(),a=u(n);if(t&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=k(O);return D(`:`),{kind:`Lambda`,params:e,body:N(),location:a}}if(n.kind===`Number`){if(t&&/^\\[BOH]/.test(n.text))throw S(`incomplete expression`,n);return{kind:`Number`,value:se(n.text),text:n.text,location:a}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:a};if(n.kind===`String`)return{kind:`String`,value:n.text,location:a};let o=n.kind===`Step`&&ze(n);if(o&&Le()<0&&Ie.length<=1)throw S(`Step number used outside proof`,n);if(o&&n.text[1]===`+`)throw S(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||o){let r=o?Be(n)??n.text:n.text;if(de()){let e=E(`(`)?k(O):[];return e.length>0&&D(`)`),D(`::`),{kind:`Label`,name:r,params:e,body:N(),location:a}}let i=w(`(`),s=i?j():[];if(!we())return i?{kind:`Apply`,operator:r,args:s,argumentsRange:_e.range,location:a}:{kind:`Identifier`,name:r,location:a};let l=c.flatMap(e=>e.instances).find(e=>e.name===r);if(l&&!e&&!t&&l.params.length!==s.length)throw S(`The operator ${r} requires ${l.params.length} arguments`,n);let u=[{kind:`Name`,name:r,args:s}];for(;we();)T(),u.push(Te());let d=u.flatMap(e=>e.kind===`Name`?[e.name]:[]);if(d.length<u.length)return{kind:`Subexpression`,selectors:u,location:a};let f=d.join(`!`),p=u.flatMap(e=>`args`in e?e.args:[]);if(p.length===0)return{kind:`Identifier`,name:f,location:a};let m=u.map(e=>`args`in e?e.args.length:0),h=_e.range;return m.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:f,args:p,argumentCounts:m,argumentsRange:h,location:a}:{kind:`Apply`,operator:f,args:p,argumentsRange:h,location:a}}if(n.kind===`Operator`&&Oc(n.text)&&w(`(`))return{kind:`Apply`,operator:n.text,args:j(),location:a};switch(n.text){case`(`:{let e=ce(()=>N());return D(`)`),e}case`[`:return ye(n);case`{`:return be(n);case`<<`:return xe(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Se(n);case`IF`:{let e=N();D(`THEN`);let t=N();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:a}}case`CASE`:return Ce(n);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!E(`IN`);){if(t&&w(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,te(y()));if(E(`RECURSIVE`)){Ne();continue}let r=Oe(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=N();return n.length===0?{kind:`Let`,definitions:e,body:r,location:a}:{kind:`Let`,definitions:e,instances:n,body:r,location:a}}case`CHOOSE`:{let e=fe(),t=E(`\\in`)?N():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=pe(),t=ce(()=>{D(`(`);let e=N();return D(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw ae(`Unexpected ${x(n)}`,n)},Ee=()=>{let e=b(),t=u(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return ve();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[N(5)],location:t};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[N(13)],location:t};case`[]`:return T(),{kind:`Always`,expression:N(16),location:t};case`<>`:return T(),{kind:`Eventually`,expression:N(16),location:t};case`ENABLED`:return T(),{kind:`Enabled`,expression:N(16),location:t};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:N(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:e.text,args:[N(9)],location:t}}return M()},N=(e=0)=>{let t=r.index,n=Ee(),i={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=b();if(n.kind!==`Operator`)break;let r=u(n);if(n.text===`'`&&e<=15){T(),i.left=v({kind:`Prime`,expression:i.left,location:r},t);continue}if(Cc.has(n.text)&&e<=15){T(),i.left=v({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){T();let e=ce(()=>k(()=>N()));ce(()=>D(`]`)),i.left=v({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&oe(b(1))){T();let e=T().text;i.left=v({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=Sc.get(n.text);if(!a||a.low<e)break;let o=i.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 S(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(T(),a.low>12&&w(`-`))throw S(`Precedence conflict between ${n.text} and -`,b());let s=N(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=v(i.left,t),i.previous={...a,text:n.text}}return i.left},P=()=>{if(!E(`(`))return[];let e=Me();return D(`)`),e},De=()=>{let e=u(b()),t=N(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[c.length-1].name,start:e,end:a}}},Oe=e=>{let t=r.index;return v(ke(e),t)},ke=e=>{let t=b(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...De(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&Sc.has(b(1).text)&&b(2).kind===`Identifier`&&w(`==`,3)){let e=O(),t=T().text,n=O();return D(`==`),i(t,[{name:e,arity:0},{name:n,arity:0}])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&Cc.has(b(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:b(1).text;r.index+=a?1:2;let n=a?O():t.text;return D(`==`),i(e,[{name:n,arity:0}])}let s=O();if(E(`[`)){let t=ce(()=>A());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,d=P();return D(`==`),w(`INSTANCE`)?{...Ae(s,d,e,n),definitionRange:_(c)}:i(s,d)},Ae=(e,t,n,i)=>{let a=r.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:O(),substitutions:E(`WITH`)?k(()=>{let e=T().text;return D(`<-`),{name:e,expression:ge()}}):[],isLocal:n,location:i,instanceRange:_(a)}},je=()=>{let e=u(b());if(w(`_`)&&b(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(b().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=O();if(!E(`(`))return{name:t,arity:0,location:e};let n=k(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Me=()=>k(je),Ne=()=>{let e=Me();return e.forEach(e=>i[i.length-1].add(e.name)),e},Pe=e=>{let t={value:0,offset:e};do{let e=b(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Bc.has(e.text)&&t.value++,e.kind===`Operator`&&Vc.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Fe=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Pe(1)):t.kind===`Operator`&&Cc.has(t.text)?w(`==`,2):t.kind===`Operator`&&Sc.has(t.text)?b(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):w(`-.`)&&t.kind===`Identifier`&&w(`==`,2)},Ie=[],Le=()=>Ie[Ie.length-1]??-1,F=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Re=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)},ze=e=>!e.text.endsWith(`.`)&&!Ic.has(Re(e)),Be=e=>{let t=Re(e);if(Ic.has(t))return;let n=F(e);if(n>=0)return`<${n}>${t}`;let r=Le(),i=Ie[Ie.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Ve=e=>{if(e.kind===`Keyword`)return Nc.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Ie.length===0;if(e.text[1]===`+`||Ie.length===0)return!0;let t=Le();return t>=0&&F(e)>t},He=e=>{let t=F(e),n=Ie.length-1,r=Ie[n-1]??-1,i=Ie[n]<0;return i&&(Ie[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Ie[n]===t},Ue=e=>!a.has(e)&&c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),We=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Hc.has(e.name)&&!Ue(e.name):!1,I=()=>{let e=b();return e.kind===`Step`?ze(e):e.kind===`Keyword`?Lc.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Fe()},Ge=()=>{let e=r.index;s.index=e;let t=b();return t.kind===`Operator`&&!Tc.has(t.text)&&Oc(t.text)?(r.index++,v({kind:`OperatorReference`,operator:t.text,location:u(t)},e)):E(`MODULE`)?v({kind:`ModuleFact`,name:O(),location:u(t)},e):N()},Ke=e=>o[o.length-1]?.add(e),qe=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},Je=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),L=()=>{let e=r.index,t=b(),n=k(()=>{let e=b();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${x(e)}`,e);return r.index++,e.text},`!`),i=u(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},Ye=()=>{if(t)return k(L);let e=k(Ge),n=e.find(e=>e.kind===`Identifier`&&Je(e.name));if(n)throw S(`DEF clause entry should describe a defined operator`,n.location);return e},Xe=()=>({facts:I()?k(Ge):[],defs:E(`DEF`)||E(`DEFS`)?Ye():[]}),Ze=()=>{let e=r.index,n=T(),i=n.text===`USE`&&E(`ONLY`),a=_(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Xe(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.filter(e=>!We(e)):[];if(s.length>0)throw m(s.map(t=>({location:h(t.location.range??_(e)),message:`The only expression allowed as a fact in a HIDE is
102
- the name of a theorem, assumption, or step.`})));return v(o,e)},Qe=()=>{let e=r.index,t=u(b()),n=E(`NEW`),i=b().kind===`Keyword`?Rc.get(b().text):void 0;if(!n&&i===void 0)throw ae(`Expected a declaration but found ${x(b())}`);if(i!==void 0&&T(),i===`Variable`){let n=O();return Ke(n),v({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=je();Ke(a.name);let o=(i??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw S(`declared symbol with arguments before \\in`);return o&&T(),v({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,location:t},e)},$e=()=>{let e=r.index,t=u(D(`ASSUME`)),n=k(()=>w(`ASSUME`)?qe($e):b().kind===`Keyword`&&zc.has(b().text)?Qe():N());return D(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},et=e=>{let t={value:0};for(;b(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return b(t.value).kind===`Identifier`&&w(e,t.value+1)},tt=(e,t)=>{e.forEach(Ke),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Ke))},nt=()=>{let e=b();if(w(`USE`)||w(`HIDE`))return Ze();if(w(`INSTANCE`))return v(Ae(void 0,[],!1,u(e)),r.index);if(w(`DEFINE`)||Fe()){let t=r.index;E(`DEFINE`);let n=[Oe(!1)];for(;Fe();)n.push(Oe(!1));let i={kind:`Define`,definitions:n,location:u(e)};return v(i,t)}if(E(`HAVE`))return{kind:`Have`,expression:N()};if(E(`TAKE`)){let e=le(),t=e?[]:k(O),n=e?A():[];return tt(t,n),{kind:`Take`,names:t,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:k(()=>N())};if(E(`PICK`)){let e=et(`:`),t=e?k(O):[],n=e?[]:A();return tt(t,n),D(`:`),{kind:`Pick`,names:t,bounds:n,body:N()}}return E(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?$e():N()}},rt=e=>{let t=b();if(t.kind!==`Step`)throw ae(`Expected a step number but found ${x(t)}`,t);if(!He(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(F(t)<0&&Be(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:Be(t),token:t.text,location:u(t)}},it=()=>{let e=r.index,t=rt(w(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=E(`QED`)?{kind:`Qed`}:nt(),a=_(e),s=Ve(b());if(s&&!Pc.has(i.kind))throw S(`Proof of a step that does not take a proof`);let c=s?ot():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(Ke),v({...t,body:i,head:a,proof:c},e)},at=()=>{let e=u(b());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=_(r.index-1);return{kind:`By`,isOnly:E(`ONLY`),...Xe(),keyword:t,location:e}}let t=b(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=_(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[it()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(it());return{kind:`Steps`,level:Le(),steps:n,location:e}},ot=()=>{let e=r.index;Ie.push(-1);let t=qe(at);return Ie.pop(),v(t,e)},st=e=>{let t=r.index,n=T(),i=b().kind===`Identifier`&&w(`==`,1)?O():void 0;i!==void 0&&(a.add(i),T());let o=qe(()=>({statement:w(`ASSUME`)?$e():N(),proof:Ve(b())?ot():void 0})),s=o.statement,c=v({name:i,statement:s,proof:o.proof,location:u(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(v({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:u(n)},t))},ct=()=>{let e=r.index;return v(lt(),e)},lt=()=>{let e=T(),t=u(e),n=e.text===`AXIOM`;if(b().kind===`Identifier`&&w(`==`,1)){let e=O();return a.add(e),T(),{name:e,expression:N(),isAxiom:n,location:t}}return{name:void 0,expression:N(),isAxiom:n,location:t}},ut=()=>{let e=u(D(`----`));D(`MODULE`);let t=O();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(c.push(n),i.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&k(()=>{let e=r.index;n.extends.push(O()),n.extendsRanges.push(_(e))});;){let a=r.index;ee.index=a;let o=b();if(o.kind===`ModuleEnd`||o.kind===`End`)return o.kind===`ModuleEnd`&&(e.range={module:t,start:{line:e.line,column:e.column},end:{line:o.line,column:o.endColumn}}),c.pop(),i.pop(),n;if(o.kind===`Separator`){if(w(`MODULE`,1)){let e=ut();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(o.text){case`CONSTANT`:case`CONSTANTS`:{T();let e=Me();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{T();let e=k(()=>{let e=r.index,t=u(b());return v({name:O(),arity:0,location:t},e)});n.variables.push(...e),n.units.push({kind:`Variables`,declarations:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=ct();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&n.definitions.push({kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{let e=Ze();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:Ne()});continue;case`INSTANCE`:dt(n,v(Ae(void 0,[],!1,u(o)),a));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){dt(n,v(Ae(void 0,[],!0,u(o)),a));continue}dt(n,Oe(!0));continue}o.kind===`Keyword`&&Mc.has(o.text)?st(n):dt(n,Oe(!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}))};return ut()},Kc=e=>Gc(e,!1),qc=e=>Gc(e,!0),Jc=25214903917n,Yc=(1n<<48n)-1n,Xc=2147483647,Zc=e=>{let t={value:(BigInt.asUintN(64,e)^Jc)&Yc},n=e=>(t.value=t.value*Jc+11n&Yc,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Jc)&Yc},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<=Xc)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Qc=10454148508367108822n,$c=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Qc);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),el=Int32Array.from($c,e=>Number(BigInt.asIntN(32,e>>32n))),tl=Int32Array.from($c,e=>Number(BigInt.asIntN(32,e))),nl=Number(BigInt.asIntN(32,Qc>>32n)),rl=Number(BigInt.asIntN(32,Qc));let il=nl,al=rl;const ol=e=>{let t=(e^al)&255;al=(al>>>8|il<<24)^tl[t],il=il>>>8^el[t]},sl=e=>{for(let t=0;t<32;t+=8)ol(e>>>t)},cl=e=>{if(typeof e==`boolean`)ol(0),ol(e?116:102);else if(typeof e==`number`)ol(1),sl(e);else if(typeof e==`string`){ol(3),sl(e.length);for(let t=0;t<e.length;t++)ol(e.charCodeAt(t))}else if(P(e))ol(21),sl(Ue(e.name)+1);else if(N(e)){let t=H(e);ol(9),sl(t.domain.length);for(let e=0;e<t.domain.length;e++)cl(t.domain[e]),cl(t.range[e])}else{let t=B(e).elements;ol(5),sl(t.length);for(let e of t)cl(e)}},ll=e=>{let t={high:il,low:al};il=nl,al=rl;for(let t of e)cl(t);let n=BigInt(il>>>0)<<32n|BigInt(al>>>0);return il=t.high,al=t.low,n},ul=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||P(e))return 5;if(typeof e==`string`)return 5+e.length;if(N(e)){let t=H(e);return t.domain.reduce((e,n,r)=>e+ul(n)+ul(t.range[r]),5)}return B(e).elements.reduce((e,t)=>e+ul(t),5)},dl=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){il=n<32?0:1<<n-32,al=n<32?1<<n:0;for(let t=0;t<e;t++)ol(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]^il,t[n+1]=t[a+1]^al}}return t},fl=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=ul(e);return il=0,al=0,cl(e),r.set(e,i.length),i.push(n,il,al),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=dl(e);return n.set(e,r),r};return(n,r)=>{let s={high:il,low:al},c={high:nl,low:rl};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}il=s.high,al=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},pl=[],ml=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},hl=()=>{for(let e=1277011;pl.length<1341;e++)ml(e)&&pl.push(e);return pl},gl=e=>{let t=hl(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},_l=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},vl=e=>{for(let t=Math.max(e,9);;t++){let e=_l(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)}}},yl=(e,t,n)=>{if(t<=0)return[];let r=vl(t),i={index:BigInt(n.nextInt(t))},a=BigInt(gl(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},bl=(1n<<63n)-1n-24n,xl=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(bl*BigInt(n)+i)%t;return r<0n?r+t:r})},Sl=(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,Cl=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Ht(e.domain),n=B(e.range).elements;return{lists:t.map(()=>n),create:e=>Qe(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>B(e).elements),create:t=>Wt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>B(e).elements),create:R}}},wl=(e,t,n)=>{if(V(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return yl(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=Cl(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Xc)?xl(e,t,n):yl(e,Number(t),n)).map(e=>r.create(Sl(r.lists,e)))}let i=B(t).elements;return yl(e,i.length,n).map(e=>i[Number(e)])},Tl=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new v(`RandomElement of the empty set`);return n},El=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Ht(e.domain)];return Qe(n,n.map(()=>El(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Wt(e.names.map((n,r)=>[n,El(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return R(e.factors.map(e=>El(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new v(`RandomElement of the empty set`);return e.low+r}return Tl(B(e).elements,t)},Dl=(e,t=0n)=>{let n=Zc(t),r={random:Zc(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Wt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:ll,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},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},Ol=e=>Pt([...e.possibleCounts].map(([e,t])=>[e,t])),kl=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Ol(e)]]),Al=(e,t,n)=>new y(`Applying ${e} to the following value,\nwhich is not ${t}:\n${U(n)}`),jl=(e,t,n,r)=>new y(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${U(r)}`),Ml=e=>N(e)?H(e):void 0,Nl=(e,t,n)=>{let r=G(e,t,n),i=Ml(r);if(!i)throw Al(n,`a function with a finite domain`,r);return i},Pl=(e,t,n)=>{let r=G(e,t,n),i=Ml(r);if(!i)throw jl(t===0?`first`:`second`,n,`bag`,r);return i},Fl=(e,t)=>{if(!M(e)||!z(e))throw t();return B(e).elements},Il=e=>e.range.every(e=>typeof e==`number`&&e>0),Ll=(e,t)=>{let n=e.domain.findIndex(e=>$e(e,t));return n===-1?void 0:e.range[n]},Rl=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,zl=Rl(`BagDiff`,`tlc2.value.impl.Value`,2),Bl=Rl(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Vl=Rl(`BagUnion`,`tlc2.value.impl.Value`,1),Hl=Rl(`BagOfAll`,`tlc2.value.impl.Value`,2),Ul=Rl(`BagCup`,`tlc2.value.impl.Value`,2),Wl=Rl(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Gl=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Er(e)}`;throw Or(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')`)},Kl=(e,t,n)=>{let r=Gl(e,n)+Gl(t,n);if(xr(r))throw Sr(`${e}+${t}`);return r},ql=(e,t,n,r)=>{let i=Ll(n,e.domain[t]),a=Gl(e.range[t],r);return i===void 0?a:a-Gl(i,r)|0},Jl=(e,t)=>Pt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>$e(e[0],r));a?a[1]=Kl(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Yl=Qe([],[]),Xl=[_r(`EmptyBag`,Yl),K(`IsABag`,1,e=>{let t=Ml(G(e,0,`IsABag`));return t!==void 0&&Il(t)}),K(`BagCardinality`,1,e=>{let t=G(e,0,`BagCardinality`);return Nl(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Al(`BagCardinality`,`a bag`,t);return Kl(e,n,Wl)},0)}),K(`BagIn`,2,e=>{let t=G(e,1,`BagIn`),n=Ll(Nl(e,1,`BagIn`),G(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw jl(`second`,`BagIn`,`bag`,t);return n>0}),K(`CopiesIn`,2,e=>{let t=G(e,1,`CopiesIn`),n=Ll(Nl(e,1,`CopiesIn`),G(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw jl(`second`,`CopiesIn`,`bag`,t);return n}),K(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Pl(e,t,`(+)`);if(!Il(n))throw jl(t===0?`first`:`second`,`(+)`,`bag`,G(e,t,`(+)`));return n});return Jl(t,Ul)}),K(`\\ominus`,2,e=>{let t=Pl(e,0,`(-)`),n=Pl(e,1,`(-)`);return Pt(t.domain.flatMap((e,r)=>{let i=ql(t,r,n,zl);return i>0?[[e,i]]:[]}))}),K(`BagUnion`,1,e=>{let t=G(e,0,`BagUnion`),n=Fl(t,()=>Al(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Yl;let r=n.map(e=>{let n=Ml(e);if(!n)throw new y(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${U(t)}`);return n});return Jl(r,Vl)}),K(`\\sqsubseteq`,2,e=>{let t=Nl(e,0,`\\sqsubseteq`),n=Nl(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>ql(t,r,n,Bl)<=0)}),vr(`BagOfAll`,2,e=>{let t=gr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new y(`The first argument of BagOfAll should be an operator, but instead it is:\n${U(t.literalBody)}`);let n=G(e,1,`BagOfAll`),r=Ml(n);if(!r)throw jl(`second`,`BagOfAll`,`function with a finite domain`,n);return Jl(r.domain.map((e,n)=>Qe([t.call([e])],[r.range[n]])),Hl)}),K(`SubBag`,1,e=>{let t=G(e,0,`SubBag`);if(!N(t))throw new v(`DOMAIN expects a function but received ${U(t)}`);let n=H(t),r=Ot(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new v(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${U(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new v(`Attempted to apply a function to ${U(n)}, which is not in its domain`);return Ot(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Qe(e.map(e=>e[0]),e.map(e=>e[1]))))}),K(`BagToSet`,1,e=>kn(Nl(e,0,`BagToSet`))),K(`SetToBag`,1,e=>{let t=G(e,0,`SetToBag`),n=Fl(t,()=>Al(`BagToSet`,`a function with a finite domain`,t));return Qe([...n],n.map(()=>1))})],Zl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Ql=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,$l=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,eu=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,tu=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,nu=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,ru=e=>{if(!N(e))return!1;let t=H(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},iu=(e,t)=>Or(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Er(t)}`),au=(e,t)=>Or(e,`Cannot cast tlc2.value.impl.${Er(t)} to tlc2.value.impl.StringValue`),ou=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),su=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw iu(t,e);return`[${B(e).elements.map(e=>lu(e,t)).join(`,`)}]`},cu=(e,t)=>{let n=H(e),r=fn(n);return r?`[${r.map(e=>lu(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${ou(typeof e==`string`?e:U(e))}:${lu(n.range[r],t)}`).join(`,`)}}`},lu=(e,t)=>typeof e==`string`?ou(e):typeof e==`object`?e.kind===`ModelValue`?ou(e.name):M(e)?su(e,t):cu(e,t):String(e),uu=e=>{if(M(e))return su(e,Zl);if(!N(e)||ru(e))throw iu(Zl,e);return cu(e,Zl)},du=e=>{if(!N(e))throw iu(Ql,e);return cu(e,Ql)},fu=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))},pu=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Ve(e);if(Array.isArray(e))return R(e.map(e=>pu(e,t)));if(typeof e==`object`&&e)return Wt(Object.entries(e).map(([e,n])=>[Ve(e),pu(n,t)]));throw Or(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},mu=(e,t)=>{if(e.trim()===``)return pu(null,t);try{return pu(JSON.parse(e,(e,t,n)=>typeof t==`number`?fu(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Or(t,e.message):e}},hu=(e,t)=>{if(typeof e!=`string`)throw au(t,e);return e},gu=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Or(n,`${t} (No such file or directory)`);return r},_u=e=>[yr(`ToJson`,1,e=>Ve(lu(G(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),yr(`ToJsonArray`,1,e=>Ve(uu(G(e,0,`ToJsonArray`)))),yr(`ToJsonObject`,1,e=>Ve(du(G(e,0,`ToJsonObject`)))),yr(`JsonSerialize`,2,t=>{let n=hu(G(t,0,`JsonSerialize`),$l),r=G(t,1,`JsonSerialize`);if(!fn(r)&&!ru(r))throw new y(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${U(r)}`);return e.writeFile?.(n,lu(r,$l)),!0}),yr(`ndJsonSerialize`,2,t=>{let n=hu(G(t,0,`ndJsonSerialize`),eu),r=G(t,1,`ndJsonSerialize`),i=fn(r);if(!i)throw new y(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${U(r)}`);return e.writeFile?.(n,i.map(e=>`${lu(e,eu)}\n`).join(``)),!0}),yr(`JsonDeserialize`,1,t=>{let n=hu(G(t,0,`JsonDeserialize`),tu);return mu(gu(e,n,tu),tu)}),yr(`ndJsonDeserialize`,1,t=>{let n=hu(G(t,0,`ndJsonDeserialize`),nu);return R(gu(e,n,nu).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>mu(e,nu)))})],vu=(e,t,n,r)=>new y(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),yu=(e,t,n)=>{if(typeof e!=`number`||e<0)throw vu(t,n,`nonnegative integer`,U(e));return e},bu=(e,t,n,r)=>{if(!M(e)||!z(e))throw vu(t,n,r,U(e));return B(e).elements},xu=(e,t,n,r)=>Ot(Array.from({length:t},()=>Ot(e.filter(()=>r.nextDouble()<n)))),Su=(e,t)=>{let n=`RandomSetOfSubsets`,r=yu(G(e,0,n),`first`,n),i=yu(G(e,1,n),`second`,n),a=bu(G(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw vu(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw vu(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return xu(a,r,a.length===0?0:i/a.length,t.getRandom())},Cu=e=>[yr(`RandomSubset`,2,t=>{let n=G(t,0,`RandomSubset`);if(typeof n!=`number`)throw vu(`first`,`RandomSubset`,`nonnegative integer`,U(n));if(n<0)throw new v(`Attempted to apply the operator overridden by the Java method\npublic static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value),\nbut it produced the following error:\n${n}`);let r=G(t,1,`RandomSubset`);if(!M(r)||!V(r)&&!z(r))throw vu(`second`,`RandomSubset`,`a finite set`,U(r));return Ot(wl(n,r,e.getRandom()))}),yr(`RandomSetOfSubsets`,3,t=>Su(t,e)),yr(`TestRandomSetOfSubsets`,3,t=>R(Array.from({length:5},()=>B(Su(t,e)).elements.length)))],wu=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Tu=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${wu})`,Eu=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${wu}) throws java.io.IOException`,Du=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${wu})`,Ou=()=>Wt([[`action`,Ot([])],[`state`,Ot([])]]),ku=()=>Wt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Au=e=>Wt([[`name`,e??`UnnamedAction`],[`location`,ku()]]),ju=(e,t)=>{let n=e.map((e,t)=>R([t+1,Wt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>R([n[r],Au(e[r+1].action),t])),i=t?[R([n[n.length-1],Au(t.action),n[t.start]])]:[];return Wt([[`action`,Ot([...r,...i])],[`state`,Ot(n)]])},Mu=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return kl(e).get(t)},Nu=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),U(r));else throw new y(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${U(n)}`)},Pu=e=>e.every(e=>e!==void 0),Fu=(e,t)=>Wt(t.variables.map((t,n)=>[t,e[n]])),Iu=(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&&!W(e)){if(t.variableIndex.has(r))return!0;let e=Ao(r,t);if(e&&!n.has(e)&&(n.add(e),Iu(e.body,t,n)))return!0}return ir(e).some(e=>Iu(e,t,n))},Lu=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[K(`AssertEq`,2,t=>{let n=G(t,0,`AssertEq`),r=G(t,1,`AssertEq`),i=$e(n,r);return i||(e(U(`Assertion failed`,!0)),e(U(n,!0)),e(U(r,!0))),i}),Fr(`AssertError`,2,e=>{let t=gr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Or(Tu,`In computing AssertError, a non-string expression (line ${t.location.line}, col ${t.location.column}) was used as the err of an AssertError(err, exp).`);let n=Ir(e,0,`AssertError`)();try{Ir(e,1,`AssertError`)()}catch(e){if(e instanceof v)return e.message===n;throw e}return!1}),yr(`TLCGetOrDefault`,2,e=>{let n=G(e,0,`TLCGetOrDefault`);return Mu(t,n)??G(e,1,`TLCGetOrDefault`)}),{...vr(`TLCGetAndSet`,4,n=>{let r=G(n,0,`TLCGetAndSet`),i=Mu(t,r)??G(n,3,`TLCGetAndSet`),a=gr(n,1,`TLCGetAndSet`);return Nu(t,e,r,a.call([i,G(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},yr(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Pu(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Or(Eu,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return R(t.getBehavior(r).map(e=>Fu(e,n.environment)))}),yr(`CounterExample`,0,()=>t.counterExample??Ou()),K(`ToTrace`,1,e=>{let t=G(e,0,`ToTrace`);if(!N(t)||!$e(kn(t),Ot([`action`,`state`])))throw new v(`The argument of ToTrace should be a CounterExample, but instead it is:\n${U(t)}`);let n=B(Dn(t,`state`)).elements.map(e=>fn(e)??[]);return R(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),K(`TLCModelValue`,1,e=>{let t=G(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new y(`The argument of ModelValue should be a string, but instead it is:\n${U(t)}`);return Xe(t)}),Fr(`TLCDefer`,1,()=>!0),K(`TLCNoOp`,1,e=>G(e,0,`TLCNoOp`)),Fr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Pu(r))throw Or(Du,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||ko(Ir(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new te(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Fr(`TLCCache`,2,(e,t)=>{let r=gr(e,0,`TLCCache`),a=qn(Ir(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Iu(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),K(`TLCFP`,1,e=>Number(BigInt.asIntN(32,ll([G(e,0,`TLCFP`)])))),yr(`TLCEvalDefinition`,1,(e,t)=>{let n=G(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?Ao(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new y(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${U(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new y(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return X({kind:`Identifier`,name:n,location:r.location},t)})]},Ru=(e,t)=>[yr(`_Track`,2,e=>{let n=String(G(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,G(e,0,`_Track`)===!0?r+1:r),!0}),yr(`_Counts`,0,()=>Ol(t)),yr(`_CheckName`,1,n=>{let r=String(G(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(U(Ol(t),!0)),!1)}),yr(`_PrintCounts`,0,()=>(e(U(Ol(t),!0)),!0))],zu=e=>String(e).padStart(2,`0`),Bu=e=>`${e.getUTCFullYear()}.${zu(e.getUTCMonth()+1)}.${zu(e.getUTCDate())}.${zu(e.getUTCHours())}${zu(e.getUTCMinutes())}${zu(e.getUTCSeconds())}`,Vu=e=>Pt([...e].map(([e,t])=>[e,R([t])])),Hu=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Uu=(e,t,n)=>{if(!e.isStarted&&Hu.has(t))throw new v(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Wt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Wt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Wt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Ve(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Ve(Bu(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Au(void 0);case`all`:return Vu(e.registers);case`all:named`:return Vu(kl(e))}if(t.startsWith(`s:`)){let n=kl(e).get(t);if(n===void 0)throw new v(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Ve(e.properties.get(t.slice(2))??t);throw new v(`TLCGet(${t}) was undefined.`)},Wu=e=>e.length===0?[[]]:e.flatMap((t,n)=>Wu([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Gu=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&B(e).elements.forEach(Gu),e.kind===`Function`&&e.range.forEach(Gu))},Ku=(t,n)=>[K(`Print`,2,e=>(t(`${Te(U(G(e,0,`Print`),!0,!0))} ${Te(U(G(e,1,`Print`),!0,!0))}`),G(e,1,`Print`))),K(`PrintT`,1,e=>(t(Te(U(G(e,0,`PrintT`),!0,!0))),!0)),K(`Assert`,2,t=>{if(G(t,0,`Assert`)!==!0)throw new y(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Te(U(G(t,1,`Assert`)))}`,e.assertViolation);return!0}),K(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),K(`:>`,2,e=>Pt([[G(e,0,`:>`),G(e,1,`:>`)]])),K(`@@`,2,e=>{let t=hr(e,0,`@@`),n=hr(e,1,`@@`);return Ft([...je(t),...je(n)])}),K(`ToString`,1,e=>Ve(U(G(e,0,`ToString`),!0))),K(`TLCEval`,1,e=>{let t=G(e,0,`TLCEval`);return Gu(t),t}),K(`Permutations`,1,e=>{let t=pr(e,0,`Permutations`);return Ot(Wu(t).map(e=>Pt(t.map((t,n)=>[t,e[n]]))))}),vr(`SortSeq`,2,e=>{let t=gr(e,1,`SortSeq`);return R(mr(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)]},[]))}),yr(`TLCGet`,1,(e,t)=>{let r=G(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new v(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new v(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${U(r)}`);return Uu(n,r,t?.state)}),yr(`TLCSet`,2,e=>{let r=G(e,0,`TLCSet`);return Nu(n,t,r,G(e,1,`TLCSet`)),!0}),_r(`Any`,qe),K(`RandomElement`,1,e=>El(dr(e,0,`RandomElement`),n.getRandom()))],qu=/* @__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(`,`),Ju=[[`\\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`,`≀`],[`^+`,`⁺`]],Yu=/* @__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(`,`),Xu=/* @__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(`.`),Zu=/* @__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(`.`),Qu=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
102
+ =============================================================================`]]),Qc=`tlc2/value/impl/`,$c=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)}},el=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,tl=e=>{let t=$c(e);if(t.readUint32()!==3405691582)throw new p(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16(),t.readUint16(),t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let a=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,o={name:r,arity:el(i),code:void 0};for(let e=t.readUint16();e>0;e--){let e=n[t.readUint16()].text,r=t.readBytes(t.readUint32());if(e===`Code`){let e=new DataView(r.buffer,r.byteOffset+4,4).getUint32(0);o.code=r.subarray(8,8+e)}}e&1&&e&8&&a.push(o)}return{pool:n,methods:a}},nl=(e,t)=>e[e[t].first].text,rl=(e,t)=>{let n=e[t],r=e[n.second];return{className:nl(e,n.first),name:e[r.first].text}},il=(e,t,n,r)=>{let i=()=>new te(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=rl(t,l());if(n.className!==`${Qc}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=rl(t,l()),a=s();if(n.className!==`${Qc}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:nl(t,l()),value:void 0}),e+=3;else if(n===183){let n=rl(t,l()),a=s(),o=s();if(!(n.className===`${Qc}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},al=(e,t)=>{if(!t)return e;let n=tl(t),r=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let r=n.methods.find(e=>e.name===t.name&&e.arity===t.params.length);return r?{...t,body:il(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),ol=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),sl=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),cl=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),ll=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),ul=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),dl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...sl]),fl=e=>ol.has(e)||sl.has(e)||e===`-.`,pl=(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}}},ml=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),hl=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),gl=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),_l=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),vl=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),yl=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),bl=/* @__PURE__ */ new Set([``,`*`,`-`]),xl=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Sl=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Cl=/* @__PURE__ */ new Set([`NEW`,...Sl.keys()]),wl=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Tl=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),El=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Dl=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),Ol=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>Dl(t).test(e));if(r===-1)return;let i=n.findIndex((e,t)=>t>r&&e.startsWith(`====`));return n.slice(r,i===-1?void 0:i+1).join(`
103
+ `)},kl=(e,t)=>{let n=fe(e),r={index:0,offsideColumns:[]},i=[],a=/* @__PURE__ */ new Set,o=[],s={index:-1},c=[],l=e=>i[i.length-1].has(e),u=e=>({line:e.line,column:t&&e.kind===`String`?e.endColumn:e.column,range:void 0}),d=[],f=[],h=[],g=(e,t=r.index-1)=>{let i=e===t?h[e]:void 0;if(i)return i;let a=n[t];d[e]??=u(n[e]),f[t]??={line:a.line,column:a.endColumn};let o={module:c[0].name,start:d[e],end:f[t]};return e===t&&(h[e]=o),o},v=(e,t)=>(e.location.range=g(t),e),y=(e=0)=>n[Math.min(r.index+e,n.length-1)],b=(e=0)=>{let t=y(e),n=r.offsideColumns[r.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},x=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),S={index:0},C=e=>{let t=n.slice(S.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},w=e=>t&&(e.kind===`Keyword`||El.has(e.text)),T=e=>{let t=n.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},ee=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:yl.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):w(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,te=(e,t=y(),r)=>{let i=n[n.length-1],a=t.line===i.line&&t.column===i.column;return new p(`${e} at line ${t.line}, column ${t.column}`,void 0,ne(e,t,a,r))},ne=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...C(T(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${ee(a)}`,...T(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},E=(e,t=y())=>te(e,t,t),re=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!w(e),D=(e,t=0)=>{let n=b(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=b();if(e.kind===`End`)throw te(`Unexpected end of expression`);return r.index++,e},k=e=>D(e)?(r.index++,!0):!1,A=e=>{if(!D(e))throw E(`Expected ${JSON.stringify(e)} but found ${x(b())}`);return O()},ie=()=>{let e=b();if(e.kind!==`Identifier`)throw E(`Expected an identifier but found ${x(e)}`);if(w(e))throw E(`Unexpected keyword ${e.text}`);return r.index++,e.text},ae=()=>{let e=r.index;return{name:ie(),range:g(e)}},oe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),se=e=>{r.offsideColumns.push(-1);let t=e();return r.offsideColumns.pop(),t},ce=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},le=()=>{if(D(`<<`)){let e={value:1};for(;b(e.value).kind===`Identifier`||D(`,`,e.value);)e.value++;return D(`>>`,e.value)&&D(`\\in`,e.value+1)}let e={value:0};for(;b(e.value).kind===`Identifier`;){if(D(`\\in`,e.value+1))return!0;if(!D(`,`,e.value+1))return!1;e.value+=2}return!1},ue=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e={value:1};for(;b(e.value).kind===`Identifier`&&D(`,`,e.value+1);)e.value+=2;return b(e.value).kind===`Identifier`&&D(`)`,e.value+1)&&D(`::`,e.value+2)},de=()=>{if(!k(`<<`)){let e=ae();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=oe(ce(ae));return A(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},pe=()=>ce(()=>{let e=ce(de);A(`\\in`);let t=N();return e.map(e=>({pattern:e,set:t}))}).flat(),M=()=>{let e=b();if(e.kind===`Identifier`){let t=r.index,n=[O().text];for(;D(`!`)&&b(1).kind===`Identifier`;)O(),n.push(ie());return v({kind:`Identifier`,name:n.join(`!`),location:u(e)},t)}if(D(`<<`)||D(`(`))return Oe();throw E(`Expected a subscript but found ${x(e)}`)},me=e=>{let t=b(1),n=b(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`&&D(`==`,sl.has(n.text)?3:4))},he=e=>{if(!ll.has(e.text))return!0;let t=b(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&hl.has(t.text)||me(e)},ge=()=>{let e=b(),n=e.kind===`Operator`&&(ol.has(e.text)||cl.has(e.text))&&he(e);if(t&&e.kind!==`String`&&(cl.has(e.text)||dl.has(e.text)&&e.text!==`'`&&!sl.has(e.text)||ul.has(e.text)&&b(-1).text===`(`&&b(-1).line===e.line&&b(-1).endColumn+1===e.column&&b(1).text===`)`&&b(1).line===e.line&&b(1).column===e.endColumn+1)&&he(e))throw te(`incomplete expression`,e);if(n)return r.index++,v({kind:`OperatorReference`,operator:e.text,location:u(e)},r.index-1);if(e.kind!==`String`&&dl.has(e.text)&&he(e)){r.index++;let t=u(e);if(sl.has(e.text))return{kind:`OperatorReference`,operator:e.text,location:t};let n={kind:`Identifier`,name:`argument`,location:t};return{kind:`Lambda`,params:[n.name],body:pl(e.text,n,t),location:t}}if(D(`LAMBDA`)){let t=r.index;O();let n=oe(ce(ae));A(`:`);let i=N();return v({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:i,location:u(e)},t)}let i=N();return i.kind===`Identifier`&&_e.delete(i),i},_e=/* @__PURE__ */ new Map,ve={range:void 0},ye=()=>se(()=>{let e=r.index;A(`(`);let t=ce(ge);return A(`)`),ve.range=g(e),t}),be=()=>{let e=O();r.offsideColumns.push(e.column);let t=[N()];for(;y().text===e.text&&y().column===e.column;)r.index++,t.push(N());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:u(e)}},xe=e=>se(()=>{let t=u(e);if(b().kind===`Identifier`&&(D(`|->`,1)||D(`:`,1))){let e=D(`|->`,1)?`Record`:`RecordSet`,n=ce(()=>{let t=r.index,n=u(b()),i=ie();return n.range=g(t),A(e===`Record`?`|->`:`:`),{name:i,value:N(),location:n}});return A(`]`),{kind:e,fields:n,location:t}}if(le()){let e=pe();A(`|->`);let n=N();return A(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let n=N();if(k(`->`)){let e=N();return A(`]`),{kind:`FunctionSet`,domain:n,range:e,location:t}}if(k(`EXCEPT`)){let e=ce(()=>{A(`!`);let e=[];for(;D(`.`)||D(`[`);)if(k(`.`)){if(!re(b()))throw E(`Expected a field name but found ${x(b())}`);e.push({kind:`Field`,name:O().text})}else A(`[`),e.push({kind:`Index`,args:ce(()=>N())}),A(`]`);return A(`=`),{path:e,value:N()}});return A(`]`),{kind:`Except`,function:n,updates:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:n,subscript:M(),location:t}}),Se=e=>se(()=>{let t=u(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(le()&&(b(1).text===`\\in`||D(`<<`))){let e=r.index,n=de();A(`\\in`);let i=N();if(k(`:`)){let e=N();return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:i},predicate:e,location:t}}r.index=e}let n=N();if(k(`:`)){let e=pe();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let i=[n];for(;k(`,`);)i.push(N());return A(`}`),{kind:`SetEnumeration`,elements:i,location:t}}),Ce=e=>{let t=u(e),n=se(()=>D(`>>`)||D(`>>_`)?[]:ce(()=>N()));if(k(`>>_`)){if(n.length!==1)throw te(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:M(),location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},we=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&le()){let e=pe();return A(`:`),{kind:n,bounds:e,body:N(),location:t}}let i=oe(ce(ae));return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:N(),isTemporal:r,location:t}},Te=e=>{let t=[];do{if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:N(),location:u(e)};let n=N();A(`->`),t.push({condition:n,body:N()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:u(e)}},Ee=()=>{let e=b(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||ml.has(e.text)||e.kind===`Operator`&&(ol.has(e.text)||sl.has(e.text)||cl.has(e.text)))},De=()=>{let e=O();if(e.kind===`Number`)return{kind:`Operand`,operand:j(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return r.index--,{kind:`Bound`,args:ye()}}return{kind:`Name`,name:e.text,args:D(`(`)?ye():[]}},Oe=()=>{let e=r.index,n=e===s.index,a=O(),o=u(a);if(t&&a.kind===`Keyword`&&a.text===`LAMBDA`){let e=ce(ie);return A(`:`),{kind:`Lambda`,params:e,body:N(),location:o}}if(a.kind===`Number`){if(t&&/^\\[BOH]/.test(a.text))throw te(`incomplete expression`,a);return{kind:`Number`,value:j(a.text),text:a.text,location:o}}if(a.kind===`Decimal`)return{kind:`Decimal`,text:a.text,location:o};if(a.kind===`String`)return{kind:`String`,value:a.text,location:o};let l=a.kind===`Step`&&V(a);if(l&&z()<0&&R.length<=1)throw te(`Step number used outside proof`,a);if(l&&a.text[1]===`+`)throw te(`<+> step number used in an expression`,a);if(a.kind===`Identifier`||l){let i=l?H(a)??a.text:a.text;if(ue()){let e=oe(k(`(`)?ce(ae):[]);return e.names.length>0&&A(`)`),A(`::`),{kind:`Label`,name:i,params:e.names,paramRanges:e.ranges,body:N(),location:o}}let s=D(`(`),u=s?ye():[],d=[s?ve.range:void 0];if(!Ee())return s?{kind:`Apply`,operator:i,args:u,argumentsRange:ve.range,location:o}:{kind:`Identifier`,name:i,location:o};let f=c.flatMap(e=>e.instances).find(e=>e.name===i),p=f!==void 0&&!n&&!t&&f.params.length!==u.length;if(p&&u.length>0)throw te(`The operator ${i} requires ${f.params.length} arguments`,a);let m=[{kind:`Name`,name:i,args:u}],h=[g(e,e)];for(;Ee();)O(),h.push(g(r.index,r.index)),ve.range=void 0,m.push(De()),d.push(ve.range);let v=m.flatMap(e=>e.kind===`Name`?[e.name]:[]),y=v.join(`!`),b=m.flatMap(e=>`args`in e?e.args:[]),x=m.map(e=>`args`in e?e.args.length:0),S=d.findLast(e=>e!==void 0),C=v.length<m.length?{kind:`Subexpression`,selectors:m,selectorRanges:h,argumentRanges:d,location:o}:b.length===0?{kind:`Identifier`,name:y,selectorRanges:h,location:o}:x.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:y,args:b,argumentCounts:x,argumentsRange:S,selectorRanges:h,argumentRanges:d,location:o}:{kind:`Apply`,operator:y,args:b,argumentsRange:S,selectorRanges:h,argumentRanges:d,location:o};return p&&_e.set(C,{location:_(g(e)),message:`The operator ${i} requires ${f.params.length} arguments.`}),C}if(a.kind===`Operator`&&fl(a.text)&&D(`(`))return{kind:`Apply`,operator:a.text,args:ye(),location:o};switch(a.text){case`(`:{let e=se(()=>N());return A(`)`),e}case`[`:return xe(a);case`{`:return Se(a);case`<<`:return Ce(a);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return we(a);case`IF`:{let e=N();A(`THEN`);let t=N();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:N(),location:o}}case`CASE`:return Te(a);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!k(`IN`);){if(t&&D(`RECURSIVE`))throw te(`Unexpected keyword RECURSIVE`,C(y()));if(k(`RECURSIVE`)){Le();continue}let r=Me(!1);r.kind===`Instance`?n.push(r):e.push(r)}i.pop();let r=N();return n.length===0?{kind:`Let`,definitions:e,body:r,location:o}:{kind:`Let`,definitions:e,instances:n,body:r,location:o}}case`CHOOSE`:{let e=de(),t=k(`\\in`)?N():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:o}}case`WF_`:case`SF_`:{let e=M(),t=se(()=>{A(`(`);let e=N();return A(`)`),e});return{kind:a.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:o}}}throw E(`Unexpected ${x(a)}`,a)},ke=()=>{let e=b(),t=u(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return be();if(e.kind===`Operator`||e.kind===`Keyword`)switch(e.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[N(5)],location:t};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[N(13)],location:t};case`[]`:return O(),{kind:`Always`,expression:N(16),location:t};case`<>`:return O(),{kind:`Eventually`,expression:N(16),location:t};case`ENABLED`:return O(),{kind:`Enabled`,expression:N(16),location:t};case`UNCHANGED`:return O(),{kind:`Unchanged`,expression:N(16),location:t};case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:e.text,args:[N(9)],location:t}}return Oe()},N=(e=0)=>{let t=r.index,n=ke(),i={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=b();if(n.kind!==`Operator`)break;let r=u(n);if(n.text===`'`&&e<=15){O(),i.left=v({kind:`Prime`,expression:i.left,location:r},t);continue}if(sl.has(n.text)&&e<=15){O(),i.left=v({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){O();let e=se(()=>ce(()=>N()));se(()=>A(`]`)),i.left=v({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&re(b(1))){O();let e=O().text;i.left=v({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=ol.get(n.text);if(!a||a.low<e)break;let o=i.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 te(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(O(),a.low>12&&D(`-`))throw te(`Precedence conflict between ${n.text} and -`,b());let s=N(a.high+1),c=i.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`;i.left=c.kind===e&&o?.text===n.text?{...c,operands:[...c.operands,s]}:{kind:e,operands:[c,s],location:r}}else i.left=n.text===`\\X`?c.kind===`Product`&&o?.text===`\\X`?{...c,factors:[...c.factors,s]}:{kind:`Product`,factors:[c,s],location:r}:{kind:`Apply`,operator:n.text,args:[c,s],location:r};i.left=v(i.left,t),i.previous={...a,text:n.text}}return i.left},Ae=()=>{if(!k(`(`))return[];let e=Ie();return A(`)`),e},je=()=>{let e=u(b()),t=N(),i=n[r.index-1],a={line:i.line,column:i.endColumn};return{body:t,bodyRange:{module:c[0].name,start:e,end:a}}},Me=e=>{let t=r.index;return v(P(e),t)},Ne=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),P=e=>{let t=b(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...je(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&ol.has(b(1).text)&&b(2).kind===`Identifier`&&D(`==`,3)){let e=ae(),t=O().text,n=ae();return A(`==`),i(t,[Ne(e),Ne(n)])}let a=t.kind===`Operator`&&t.text===`-.`,o=t.kind===`Identifier`&&sl.has(b(1).text)&&D(`==`,2);if(a||o){let e=a?t.text:b(1).text;a&&O();let n=ae();return o&&O(),A(`==`),i(e,[Ne(n)])}let s=ie();if(k(`[`)){let t=se(()=>pe());return A(`]`),A(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,d=Ae();return A(`==`),D(`INSTANCE`)?{...Pe(s,d,e,n),definitionRange:g(c)}:i(s,d)},Pe=(e,t,n,i)=>{let a=r.index;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ie(),substitutions:k(`WITH`)?ce(()=>{let e=r.index,t=O().text,n=g(e);return A(`<-`),{name:t,nameRange:n,expression:ge()}}):[],isLocal:n,location:i,instanceRange:g(a)}},Fe=()=>{let e=r.index;return v(F(),e)},F=()=>{let e=u(b());if(D(`_`)&&b(1).kind===`Operator`)return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(b().kind===`Operator`&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ie();if(!k(`(`))return{name:t,arity:0,location:e};let n=ce(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},Ie=()=>ce(Fe),Le=()=>{let e=Ie();return e.forEach(e=>i[i.length-1].add(e.name)),e},I=e=>{let t={value:0,offset:e};do{let e=b(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&wl.has(e.text)&&t.value++,e.kind===`Operator`&&Tl.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},L=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,I(1)):t.kind===`Operator`&&sl.has(t.text)?D(`==`,2):t.kind===`Operator`&&ol.has(t.text)?b(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):D(`-.`)&&t.kind===`Identifier`&&D(`==`,2)},R=[],z=()=>R[R.length-1]??-1,B=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Re=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)},V=e=>!e.text.endsWith(`.`)&&!bl.has(Re(e)),H=e=>{let t=Re(e);if(bl.has(t))return;let n=B(e);if(n>=0)return`<${n}>${t}`;let r=z(),i=R[R.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},U=e=>{if(e.kind===`Keyword`)return _l.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return R.length===0;if(e.text[1]===`+`||R.length===0)return!0;let t=z();return t>=0&&B(e)>t},W=e=>{let t=B(e),n=R.length-1,r=R[n-1]??-1,i=R[n]<0;return i&&(R[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:R[n]===t},ze=e=>!a.has(e)&&c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),Be=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!El.has(e.name)&&!ze(e.name):!1,Ve=()=>{let e=b();return e.kind===`Step`?V(e):e.kind===`Keyword`?xl.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!L()},He=()=>{let e=r.index;s.index=e;let t=b();return t.kind===`Operator`&&!ll.has(t.text)&&fl(t.text)?(r.index++,v({kind:`OperatorReference`,operator:t.text,location:u(t)},e)):k(`MODULE`)?v({kind:`ModuleFact`,name:ie(),location:u(t)},e):N()},Ue=e=>o[o.length-1]?.add(e),We=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},Ge=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ke=()=>{let e=r.index,t=b(),n=ce(()=>{let e=b();if((e.kind!==`Identifier`||w(e))&&e.kind!==`Operator`)throw E(`Expected a definition name but found ${x(e)}`,e);return r.index++,e.text},`!`),i=u(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},qe=()=>{if(t)return ce(Ke);let e=ce(He),n=e.find(e=>e.kind===`Identifier`&&Ge(e.name));if(n)throw te(`DEF clause entry should describe a defined operator`,n.location);return e},Je=()=>({facts:Ve()?ce(He):[],defs:k(`DEF`)||k(`DEFS`)?qe():[]}),Ye=()=>{let e=r.index,n=O(),i=n.text===`USE`&&k(`ONLY`),a=g(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Je(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.filter(e=>!Be(e)):[];if(s.length>0)throw m(s.map(t=>({location:_(t.location.range??g(e)),message:`The only expression allowed as a fact in a HIDE is
104
+ the name of a theorem, assumption, or step.`})));return v(o,e)},Xe=()=>{let e=r.index,t=u(b()),n=k(`NEW`),i=b().kind===`Keyword`?Sl.get(b().text):void 0;if(!n&&i===void 0)throw E(`Expected a declaration but found ${x(b())}`);if(i!==void 0&&O(),i===`Variable`){let n=ae();return Ue(n.name),v({kind:`NewSymbol`,name:n.name,arity:0,level:i,set:void 0,nameRange:n.range,location:t},e)}let a=Fe();Ue(a.name);let o=(i??`Constant`)===`Constant`&&D(`\\in`);if(o&&a.arity>0)throw te(`declared symbol with arguments before \\in`);return o&&O(),v({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,nameRange:a.location.range,location:t},e)},Ze=()=>{let e=r.index,t=u(A(`ASSUME`)),n=ce(()=>D(`ASSUME`)?We(Ze):b().kind===`Keyword`&&Cl.has(b().text)?Xe():N());return A(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},Qe=e=>{let t={value:0};for(;b(t.value).kind===`Identifier`&&D(`,`,t.value+1);)t.value+=2;return b(t.value).kind===`Identifier`&&D(e,t.value+1)},$e=(e,t)=>{e.forEach(Ue),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Ue))},et=()=>{let e=b();if(D(`USE`)||D(`HIDE`))return Ye();if(D(`INSTANCE`))return v(Pe(void 0,[],!1,u(e)),r.index);if(D(`DEFINE`)||L()){let t=r.index;k(`DEFINE`);let n=[Me(!1)];for(;L();)n.push(Me(!1));let i={kind:`Define`,definitions:n,location:u(e)};return v(i,t)}if(k(`HAVE`))return{kind:`Have`,expression:N()};if(k(`TAKE`)){let e=le(),t=oe(e?[]:ce(ae)),n=e?pe():[];return $e(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:ce(()=>N())};if(k(`PICK`)){let e=Qe(`:`),t=oe(e?ce(ae):[]),n=e?[]:pe();return $e(t.names,n),A(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:N()}}return k(`CASE`)?{kind:`Case`,expression:N()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?Ze():N()}},tt=e=>{let t=b();if(t.kind!==`Step`)throw E(`Expected a step number but found ${x(t)}`,t);if(!W(t))throw te(`${e?`QED step`:`step`}'s number has bad level`,t);if(B(t)<0&&H(t)!==void 0)throw te(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:H(t),token:t.text,location:u(t)}},nt=()=>{let e=r.index,t=tt(D(`QED`,1)),n=r.index,i=/* @__PURE__ */ new Set;o.push(i);let a=k(`QED`)?{kind:`Qed`}:et(),s=g(e),c=g(n),l=U(b());if(l&&!vl.has(a.kind))throw te(`Proof of a step that does not take a proof`);let u=l?G():void 0;return o.pop(),(a.kind!==`Assert`||a.isSuffices)&&i.forEach(Ue),v({...t,body:a,head:s,statement:c,proof:u},e)},rt=()=>{let e=u(b());if(D(`BY`)||D(`PROOF`)&&D(`BY`,1)){k(`PROOF`),O();let t=g(r.index-1);return{kind:`By`,isOnly:k(`ONLY`),...Je(),keyword:t,location:e}}let t=b(+!!D(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){k(`PROOF`),O();let n=g(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}k(`PROOF`);let n=[nt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(nt());return{kind:`Steps`,level:z(),steps:n,location:e}},G=()=>{let e=r.index;R.push(-1);let t=We(rt);return R.pop(),v(t,e)},K=e=>{let t=r.index,n=O(),i=b().kind===`Identifier`&&D(`==`,1)?ie():void 0;i!==void 0&&(a.add(i),O());let o=We(()=>({statement:D(`ASSUME`)?Ze():N(),proof:U(b())?G():void 0})),s=o.statement,c=v({name:i,statement:s,proof:o.proof,location:u(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&s.kind!==`AssumeProve`&&e.definitions.push(v({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:u(n)},t))},it=()=>{let e=r.index;return v(at(),e)},at=()=>{let e=O(),t=u(e),n=e.text===`AXIOM`;if(b().kind===`Identifier`&&D(`==`,1)){let e=ie();return a.add(e),O(),{name:e,expression:N(),isAxiom:n,location:t}}return{name:void 0,expression:N(),isAxiom:n,location:t}},ot=()=>{let e=u(A(`----`));A(`MODULE`);let t=ie();A(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(c.push(n),i.push(/* @__PURE__ */ new Set),k(`EXTENDS`)&&ce(()=>{let e=r.index;n.extends.push(ie()),n.extendsRanges.push(g(e))});;){let t=r.index;S.index=t;let a=b();if(a.kind===`ModuleEnd`||a.kind===`End`){if(a.kind===`ModuleEnd`&&(e.range={module:c[0].name,start:{line:e.line,column:e.column},end:{line:a.line,column:a.endColumn}}),_e.size>0)throw m([..._e.values()]);return c.pop(),i.pop(),n}if(a.kind===`Separator`){if(D(`MODULE`,1)){let e=ot();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(a.text){case`CONSTANT`:case`CONSTANTS`:{O();let e=Ie();n.constants.push(...e),n.units.push({kind:`Constants`,declarations:e});continue}case`VARIABLE`:case`VARIABLES`:{O();let e=ce(()=>{let e=r.index,t=u(b());return v({name:ie(),arity:0,location:t},e)});n.variables.push(...e),n.units.push({kind:`Variables`,declarations:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=it();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&n.definitions.push({kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{let e=Ye();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:O(),n.units.push({kind:`Recursive`,declarations:Le()});continue;case`INSTANCE`:st(n,v(Pe(void 0,[],!1,u(a)),t));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){st(n,v(Pe(void 0,[],!0,u(a)),t));continue}st(n,v(P(!0),t));continue}a.kind===`Keyword`&&gl.has(a.text)?K(n):st(n,Me(!1))}}},st=(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}))};return ot()},Al=e=>kl(e,!1),jl=e=>kl(e,!0),Ml=25214903917n,Nl=(1n<<48n)-1n,Pl=2147483647,Fl=e=>{let t={value:(BigInt.asUintN(64,e)^Ml)&Nl},n=e=>(t.value=t.value*Ml+11n&Nl,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Ml)&Nl},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<=Pl)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Il=10454148508367108822n,Ll=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Il);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Rl=Int32Array.from(Ll,e=>Number(BigInt.asIntN(32,e>>32n))),zl=Int32Array.from(Ll,e=>Number(BigInt.asIntN(32,e))),Bl=Number(BigInt.asIntN(32,Il>>32n)),Vl=Number(BigInt.asIntN(32,Il));let Hl=Bl,Ul=Vl;const Wl=e=>{let t=(e^Ul)&255;Ul=(Ul>>>8|Hl<<24)^zl[t],Hl=Hl>>>8^Rl[t]},Gl=e=>{for(let t=0;t<32;t+=8)Wl(e>>>t)},Kl=e=>{if(typeof e==`boolean`)Wl(0),Wl(e?116:102);else if(typeof e==`number`)Wl(1),Gl(e);else if(typeof e==`string`){Wl(3),Gl(e.length);for(let t=0;t<e.length;t++)Wl(e.charCodeAt(t))}else if(Pe(e))Wl(21),Gl(He(e.name)+1);else if(P(e)){let t=xn(e);Wl(9),Gl(t.domain.length);for(let e=0;e<t.domain.length;e++)Kl(t.domain[e]),Kl(t.range[e])}else{let t=q(e).elements;Wl(5),Gl(t.length);for(let e of t)Kl(e)}},ql=e=>{let t={high:Hl,low:Ul};Hl=Bl,Ul=Vl;for(let t of e)Kl(t);let n=BigInt(Hl>>>0)<<32n|BigInt(Ul>>>0);return Hl=t.high,Ul=t.low,n},Jl=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||Pe(e))return 5;if(typeof e==`string`)return 5+e.length;if(P(e)){let t=xn(e);return t.domain.reduce((e,n,r)=>e+Jl(n)+Jl(t.range[r]),5)}return q(e).elements.reduce((e,t)=>e+Jl(t),5)},Yl=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Hl=n<32?0:1<<n-32,Ul=n<32?1<<n:0;for(let t=0;t<e;t++)Wl(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]^Hl,t[n+1]=t[a+1]^Ul}}return t},Xl=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=Jl(e);return Hl=0,Ul=0,Kl(e),r.set(e,i.length),i.push(n,Hl,Ul),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=Yl(e);return n.set(e,r),r};return(n,r)=>{let s={high:Hl,low:Ul},c={high:Bl,low:Vl};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}Hl=s.high,Ul=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},Zl=[],Ql=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},$l=()=>{for(let e=1277011;Zl.length<1341;e++)Ql(e)&&Zl.push(e);return Zl},eu=e=>{let t=$l(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},tu=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},nu=e=>{for(let t=Math.max(e,9);;t++){let e=tu(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)}}},ru=(e,t,n)=>{if(t<=0)return[];let r=nu(t),i={index:BigInt(n.nextInt(t))},a=BigInt(eu(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},iu=(1n<<63n)-1n-24n,au=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(iu*BigInt(n)+i)%t;return r<0n?r+t:r})},ou=(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,su=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Vt(e.domain),n=q(e.range).elements;return{lists:t.map(()=>n),create:e=>$e(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>q(e).elements),create:t=>Wt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>q(e).elements),create:Ut}}},cu=(e,t,n)=>{if(cn(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return ru(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=su(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Pl)?au(e,t,n):ru(e,Number(t),n)).map(e=>r.create(ou(r.lists,e)))}let i=q(t).elements;return ru(e,i.length,n).map(e=>i[Number(e)])},lu=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new b(`RandomElement of the empty set`);return n},uu=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Vt(e.domain)];return $e(n,n.map(()=>uu(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Wt(e.names.map((n,r)=>[n,uu(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Ut(e.factors.map(e=>uu(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new b(`RandomElement of the empty set`);return e.low+r}return lu(q(e).elements,t)},du=(e,t=0n)=>{let n=Fl(t),r={random:Fl(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Wt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:ql,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},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},fu=e=>Nt([...e.possibleCounts].map(([e,t])=>[e,t])),pu=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,fu(e)]]),mu=[[38,[`ACTION`,`ACTIONS`]],[39,[`ASSUME`]],[40,[`[]ASSUME`]],[41,[`ASSUMPTION`,`AXIOM`]],[42,[`CASE`]],[43,[`CHOOSE`]],[44,[`CONSTANT`,`CONSTANTS`]],[45,[`ELSE`]],[46,[`EXCEPT`]],[47,[`\\E`,`\\exists`,`∃`]],[48,[`EXTENDS`]],[49,[`\\A`,`\\forall`,`∀`]],[50,[`IF`]],[51,[`INSTANCE`]],[52,[`LET`]],[53,[`IN`]],[54,[`LOCAL`]],[55,[`MODULE`]],[56,[`NEW`]],[57,[`OTHER`]],[58,[`PROPOSITION`,`LEMMA`,`COROLLARY`]],[59,[`SF_`]],[60,[`\\EE`]],[61,[`\\AA`]],[62,[`THEN`]],[63,[`BY`]],[64,[`ONLY`]],[65,[`DEFINE`]],[66,[`DEF`,`DEFS`]],[67,[`THEOREM`]],[68,[`USE`]],[69,[`HIDE`]],[70,[`HAVE`]],[71,[`OBVIOUS`]],[72,[`OMITTED`]],[73,[`LAMBDA`]],[74,[`TAKE`]],[75,[`PROOF`]],[76,[`PROVE`]],[77,[`[]PROVE`]],[78,[`QED`]],[79,[`RECURSIVE`]],[80,[`STATE`]],[81,[`TEMPORAL`,`TEMPORALS`]],[82,[`PICK`]],[83,[`WITNESS`]],[84,[`SUFFICES`]],[85,[`VARIABLE`,`VARIABLES`]],[86,[`WF_`]],[87,[`WITH`]],[88,[`,`]],[89,[`:`]],[90,[`::`,`∷`]],[91,[`.`]],[92,[`_`]],[93,[`==`,`≜`]],[94,[`(`]],[95,[`)`]],[96,[`-|-`]],[97,[`[`]],[98,[`]_`]],[99,[`]`]],[100,[`{`]],[101,[`}`]],[102,[`<<`,`⟨`]],[103,[`>>_`,`⟩_`]],[104,[`>>`,`⟩`]],[105,[`!`]],[106,[`->`,`→`]],[107,[`<-`,`←`]],[108,[`|->`,`↦`]],[113,[`'`]],[114,[`^+`,`⁺`]],[115,[`^*`]],[116,[`^#`]],[117,[`-.`]],[118,[`\\lnot`,`¬`]],[119,[`\\neg`]],[120,[`~`]],[121,[`[]`,`□`]],[122,[`<>`,`◇`]],[123,[`ENABLED`]],[124,[`UNCHANGED`]],[125,[`SUBSET`]],[126,[`UNION`]],[127,[`DOMAIN`]],...[`//`,`/\\`,`/=`,`/`,`\\/`,`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`,`\\in`,`\\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`,`\\`,`~>`,`=>`,`=<`,`=|`,`=`,`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`,`-`,`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`,`\\X`].map((e,t)=>[128+t,[e]]),[129,[`∧`]],[132,[`∨`]],[147,[`∈`]]],hu=(()=>{let e=/* @__PURE__ */ new Map;for(let t of mu)for(let n of t[1])e.set(n[0],[...e.get(n[0])??[],[t[0],n]]);return e})(),gu=/-{4,} *MODULE/y,_u=[/[0-9][A-Za-z0-9]*\.\/\\/y,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*\.\/\\/y,/[a-zA-RT-VX-Z][A-Za-z0-9]*\.\/\\/y],vu=[/[0-9][A-Za-z0-9]*\.\\\//y,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*\.\\\//y,/[a-zA-RT-VX-Z][A-Za-z0-9]*\.\\\//y],yu=[/_[A-Za-z0-9_]*[A-Za-z][A-Za-z0-9_]*/y,/[0-9][A-Za-z0-9_]*[A-Za-z][A-Za-z0-9_]*/y,/[WS](?:[a-zA-EG-Z_0-9][A-Za-z0-9_]*)?/y,/[WS]F(?:[A-Za-z0-9][A-Za-z0-9_]*)?/y,/[a-zA-RT-VX-Z][A-Za-z0-9_]*/y,/[@ℕℤℝ]/y],bu=[[35,[gu]],[36,[/-{4,}/y]],[37,[/={4,}/y]],[109,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[110,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[111,_u],[112,vu],[289,yu],[290,[/<[0-9]+>[A-Za-z0-9_]+/y]],[291,[/<[+*]>[A-Za-z0-9]+/y]],[292,[/<(?:[0-9]+|\+|\*)>[A-Za-z0-9_]+\.+/y]],[293,[/<(?:[0-9]+|\+|\*)>/y]],[294,[/<(?:[0-9]+|\+|\*)>(?:\*\.*|-\.*|\.+)/y]]],xu=[[20,[/[0-9]+/y]],[21,[gu]],[111,_u],[112,vu],[289,yu]],Su=(e,t,n)=>Math.max(0,...e.map(e=>(e.lastIndex=n,e.exec(t)?.[0].length??0))),Cu=(e,t,n,r)=>{let i=n.map(([n,r])=>[n,Su(r,e,t)]);if(r)for(let[n,r]of hu.get(e[t])??[])e.startsWith(r,t)&&i.push([n,r.length]);return i.reduce((e,t)=>t[1]>e[1]||t[1]===e[1]&&t[1]>0&&t[0]<e[0]?t:e,[0,0])},wu=(e,t)=>{if(e[t]===`?`)return 1;if(e[t]!==`"`)return 0;let n=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y;return n.lastIndex=t,n.exec(e)?.[0].length??0},Tu=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
105
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`],[`\0`,``]]),Eu=e=>e.split(``).map(e=>{let t=e.charCodeAt(0);return Tu.get(e)??(t<32||t>126?`\\u${t.toString(16).padStart(4,`0`)}`:e)}).join(``),Du=e=>{let t=[],n=[],r={line:1,column:0,isAfterCarriageReturn:!1,isAfterLineFeed:!1};for(let i of e.split(``))r.column++,r.isAfterLineFeed?(r.isAfterLineFeed=!1,r.line++,r.column=1):r.isAfterCarriageReturn&&(r.isAfterCarriageReturn=!1,i===`
106
+ `?r.isAfterLineFeed=!0:(r.line++,r.column=1)),i===`\r`&&(r.isAfterCarriageReturn=!0),i===`
107
+ `&&(r.isAfterLineFeed=!0),i===` `&&(r.column=r.column-1+(8-(r.column-1)%8)),t.push(r.line),n.push(r.column);let i={state:0,index:0,commentDepth:0},a=(r,i,a)=>({kind:r,image:e.slice(i,a),beginLine:t[i],beginColumn:n[i],endLine:t[a-1],endColumn:n[a-1],next:void 0}),o=(r,i,a)=>{if(a!==void 0&&a+1<e.length)throw new g(`Lexical error at line ${t[a]}, column ${n[a]}. Encountered: "${Eu(e[a])}" (${e.charCodeAt(a)}), after : "${Eu(i)}"`);let o=e.length-1,s=e[o]===`
108
+ `||e[o]===`\r`,c=`Lexical error at line ${s?t[o]+1:t[o]}, column ${s?0:n[o]+1}. Encountered: <EOF> after : "${Eu(i)}"`;throw new g(t[r]===t[o]?c:`Lexical {error: EOF reached, possibly open comment starting around line ${t[r]}`)},s=t=>{for(;;){if(i.index>=e.length)return o(t,``,void 0);let n=e.startsWith(`(*.`,i.index)?3:e.startsWith(`(*`,i.index)?2:0;if(i.state===5){let t=e.startsWith(`\r
109
+ `,i.index)?2:+(e[i.index]===`
110
+ `||e[i.index]===`\r`);if(t>0){i.index+=t,i.state=2;return}}else if(n>0){i.index+=n,i.commentDepth++,i.state=4;return}else if(e.startsWith(`*)`,i.index)){i.index+=2,i.state===3?i.state=2:(i.commentDepth--,i.commentDepth===0&&(i.state=3));return}i.index++}};return{getNextToken:()=>{for(;;){if(i.index>=e.length){let r=e.length-1;return{kind:0,image:``,beginLine:t[r]??0,beginColumn:n[r]??0,endLine:t[r]??0,endColumn:n[r]??0,next:void 0}}let r=i.index;if(i.state===0){let t=e.startsWith(`--->`,i.index)?4:0;gu.lastIndex=i.index;let n=gu.exec(e)?.[0].length??0;if(n>0&&n>=t)return i.index+=n,i.state=2,a(3,r,i.index);if(t>0)return i.index+=t,i.state=1,a(2,r,i.index);i.index++;continue}if(i.state===1){let[t,n]=Cu(e,i.index,xu,!1);if(n===0){i.index++;continue}return i.index+=n,t===21&&(i.state=2),a(t,r,i.index)}if(i.state!==2){s(r);continue}if(`
111
+ \r`.includes(e[i.index])){i.index++;continue}if(e.startsWith(`(*`,i.index)||e.startsWith(`\\*`,i.index)){i.state=e[i.index]===`(`?3:5,i.index+=e.startsWith(`(*.`,i.index)?3:2,s(r);continue}let[c,l]=Cu(e,i.index,bu,!0);if(l===0){let t=wu(e,i.index),n=i.index+t;return n<e.length?o(r,n+1<e.length||t===0?e.slice(r,n):e.slice(r,n+1),n):o(r,t<=1?``:e.slice(r),void 0)}return i.index+=l,a(c,r,i.index)}}}},Ou=2147483647,ku=-2147483648,Au=(e,t)=>Array.from({length:t-e+1},(t,n)=>e+n),ju=Au(118,127),Mu=Au(117,127),Nu=Au(128,288),Pu=Au(113,116),Fu=Au(290,294),Iu=[42,43,47,49,50,52,60,61],Lu=new Set(Au(113,291)),Ru=/* @__PURE__ */ new Set([59,86,94,97,100,102]),zu=/* @__PURE__ */ new Set([38,44,56,80,81,85]),Bu=/* @__PURE__ */ new Set([92,...Mu]),Vu=/* @__PURE__ */ new Set([`Tuple`,`ParenExpr`,`SetEnumerate`,`SubsetOf`,`SetOfAll`,`SetOfFcns`,`RcdConstructor`,`SetOfRcds`,`Except`,`FcnConst`,`ActionExpr`]),Hu=[[`[`,160,160,`left`,`postfix`],[`.`,170,170,`left`,`infix`],[`'`,150,150,`none`,`postfix`],[`^`,140,140,`none`,`infix`],[`/`,130,130,`none`,`infix`],[`*`,130,130,`left`,`infix`],[`-`,110,110,`left`,`infix`],[`-.`,120,120,`none`,`prefix`],[`+`,100,100,`left`,`infix`],[`=`,50,50,`none`,`infix`],[`\\lnot`,40,40,`left`,`prefix`],[`\\land`,30,30,`left`,`infix`],[`\\lor`,30,30,`left`,`infix`],[`~>`,20,20,`none`,`infix`],[`=>`,10,10,`none`,`infix`],[`[]`,40,150,`none`,`prefix`],[`<>`,40,150,`none`,`prefix`],[`ENABLED`,40,150,`none`,`prefix`],[`UNCHANGED`,40,150,`none`,`prefix`],[`SUBSET`,100,130,`none`,`prefix`],[`UNION`,100,130,`none`,`prefix`],[`DOMAIN`,100,130,`none`,`prefix`],[`^+`,150,150,`none`,`postfix`],[`^*`,150,150,`none`,`postfix`],[`^#`,150,150,`none`,`postfix`],[`\\cdot`,50,140,`left`,`infix`],[`\\equiv`,20,20,`none`,`infix`],[`-+->`,20,20,`none`,`infix`],[`/=`,50,50,`none`,`infix`],[`\\subseteq`,50,50,`none`,`infix`],[`\\in`,50,50,`none`,`infix`],[`\\notin`,50,50,`none`,`infix`],[`<`,50,50,`none`,`infix`],[`\\leq`,50,50,`none`,`infix`],[`>`,50,50,`none`,`infix`],[`\\geq`,50,50,`none`,`infix`],[`\\times`,100,130,`left`,`nfix`],[`\\`,80,80,`none`,`infix`],[`\\intersect`,80,80,`left`,`infix`],[`\\union`,80,80,`left`,`infix`],[`...`,90,90,`none`,`infix`],[`..`,90,90,`none`,`infix`],[`|`,100,110,`left`,`infix`],[`||`,100,110,`left`,`infix`],[`&&`,130,130,`left`,`infix`],[`&`,130,130,`left`,`infix`],[`$$`,90,130,`left`,`infix`],[`$`,90,130,`left`,`infix`],[`??`,90,130,`left`,`infix`],[`%%`,100,110,`left`,`infix`],[`%`,100,110,`none`,`infix`],[`##`,90,130,`left`,`infix`],[`++`,100,100,`left`,`infix`],[`--`,110,110,`left`,`infix`],[`**`,130,130,`left`,`infix`],[`//`,130,130,`none`,`infix`],[`^^`,140,140,`none`,`infix`],[`@@`,60,60,`left`,`infix`],[`!!`,90,130,`none`,`infix`],[`|-`,50,50,`none`,`infix`],[`|=`,50,50,`none`,`infix`],[`-|`,50,50,`none`,`infix`],[`=|`,50,50,`none`,`infix`],[`<:`,70,70,`none`,`infix`],[`:>`,70,70,`none`,`infix`],[`:=`,50,50,`none`,`infix`],[`::=`,50,50,`none`,`infix`],[`\\oplus`,100,100,`left`,`infix`],[`\\ominus`,110,110,`left`,`infix`],[`\\odot`,130,130,`left`,`infix`],[`\\oslash`,130,130,`none`,`infix`],[`\\otimes`,130,130,`left`,`infix`],[`\\uplus`,90,130,`left`,`infix`],[`\\sqcap`,90,130,`left`,`infix`],[`\\sqcup`,90,130,`left`,`infix`],[`\\div`,130,130,`none`,`infix`],[`\\wr`,90,140,`none`,`infix`],[`\\star`,130,130,`left`,`infix`],[`\\o`,130,130,`left`,`infix`],[`\\bigcirc`,130,130,`left`,`infix`],[`\\bullet`,130,130,`left`,`infix`],[`\\prec`,50,50,`none`,`infix`],[`\\succ`,50,50,`none`,`infix`],[`\\preceq`,50,50,`none`,`infix`],[`\\succeq`,50,50,`none`,`infix`],[`\\sim`,50,50,`none`,`infix`],[`\\simeq`,50,50,`none`,`infix`],[`\\ll`,50,50,`none`,`infix`],[`\\gg`,50,50,`none`,`infix`],[`\\asymp`,50,50,`none`,`infix`],[`\\subset`,50,50,`none`,`infix`],[`\\supset`,50,50,`none`,`infix`],[`\\supseteq`,50,50,`none`,`infix`],[`\\approx`,50,50,`none`,`infix`],[`\\cong`,50,50,`none`,`infix`],[`\\sqsubset`,50,50,`none`,`infix`],[`\\sqsubseteq`,50,50,`none`,`infix`],[`\\sqsupset`,50,50,`none`,`infix`],[`\\sqsupseteq`,50,50,`none`,`infix`],[`\\doteq`,50,50,`none`,`infix`],[`\\propto`,50,50,`none`,`infix`]].map(e=>({name:e[0],low:e[1],high:e[2],associativity:e[3],fix:e[4]})),Uu=[[`\\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`,`≀`],[`^+`,`⁺`]],Wu=(()=>{let e=new Map(Hu.map(e=>[e.name,e]));for(let t of Uu){let n=e.get(t[0]);if(n)for(let r of t.slice(1))e.set(r,n)}return e})(),Gu=Wu.get(`[`),Ku={name:`$$_void`,low:0,high:0,associativity:`none`,fix:`infix`},qu=e=>e.fix===`prefix`?e:Wu.get(`${e.name}.`),Ju=e=>e.fix===`infix`||e.fix===`nfix`,Yu=(e,t)=>e.low>t.high,Xu=(e,t)=>e.high<t.low,Zu=e=>e!==void 0&&e.kind>=113&&e.kind<=288,Qu=e=>e!==void 0&&e.kind>=128&&e.kind<=288,$u=(e,t)=>{let n=e[t];if(n.kind===95||n.kind===99){let n={index:t,depth:1};for(;n.index>0;){n.index--;let t=e[n.index].kind,r=t===94||t===97;if(r&&n.depth===1)break;r&&n.depth--,(t===95||t===99)&&n.depth++}return n.index>0&&e[n.index-1].kind===289?n.index-1:n.index}if(n.kind===289){let n=e[t-1];return!Zu(n)||n.kind>=113&&n.kind<=116||Qu(n)&&e[t-2]?.kind!==289||e[t-2]?.kind===107?t:Qu(n)?t-2:t-1}return Zu(n)?t-1:t},ed=e=>e.kind>=38&&e.kind<=46||e.kind===48||e.kind>=50&&e.kind<=59||e.kind===80||e.kind>=62&&e.kind<=87||e.kind===92||e.kind>=123&&e.kind<=127,td=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1,e.image.indexOf(`>`))),nd=e=>{let t=Du(e),n=[],r={kind:0,image:``,beginLine:0,beginColumn:0,endLine:0,endColumn:0,next:void 0},i={token:r,nextKind:-1,generation:0,expectedGeneration:-1,moduleName:void 0,expecting:``,lastOperator:void 0,fairnessHook:void 0,proofDepth:-1,operatorStack:void 0},a={scanPosition:r,lastPosition:r,remaining:0,isSucceeded:!1,isLookingAhead:!1,isRescanning:!1,endPosition:0,longestExpected:0},o=[],s=[],c=[],l=[],u=[],d=e=>e.next??=t.getNextToken(),f=e=>Array.from({length:e}).reduce(e=>d(e),a.isLookingAhead?a.scanPosition:i.token),p=()=>i.nextKind===-1?i.nextKind=d(i.token).kind:i.nextKind,m=()=>(i.expectedGeneration=i.generation,!1),h=e=>p()===e||m(),_=e=>`line ${e.location[0]}, col ${e.location[1]} to line ${e.location[2]}, col ${e.location[3]} of module ${i.moduleName??`null`}`,v=e=>new g(`***Parse Error***\n${i.expecting===``?``:`Was expecting "${i.expecting}"\n`}${e}\n\nResidual stack trace follows:\n${s.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``)}`),y=e=>{e>=100||(e===a.endPosition+1?a.endPosition++:a.endPosition!==0&&(a.longestExpected=Math.max(a.longestExpected,a.endPosition),e!==0&&(a.endPosition=e)))},b=(e,t)=>e===void 0||t>=100?void 0:e===a.scanPosition?t:b(e.next,t+1),x=e=>{a.scanPosition===a.lastPosition&&(a.remaining--,a.lastPosition=d(a.scanPosition)),a.scanPosition=d(a.scanPosition);let t=a.isRescanning?b(i.token,0):void 0;return t!==void 0&&y(t),e.has(a.scanPosition.kind)?(a.remaining===0&&a.scanPosition===a.lastPosition&&(a.isSucceeded=!0),!0):!1},S=e=>{if(typeof e!=`number`)return e;let t=/* @__PURE__ */ new Set([e]);return()=>x(t)},C=(...e)=>{let t=new Set(e);return()=>x(t)},w=(...e)=>{let t=e.map(S);return()=>{for(let e of t){if(!e())return!1;if(a.isSucceeded)return!0}return!0}},T=(...e)=>{let t=e.map(S);return()=>{let e=a.scanPosition;for(let n of t)if(a.scanPosition=e,n())return!0;return!1}},ee=e=>{let t=S(e);return()=>{let e=a.scanPosition;return t()||(a.scanPosition=e),!0}},te=e=>{let t=S(e);return()=>{for(;;){let e=a.scanPosition;if(!t())return a.scanPosition=e,!0;if(a.isSucceeded)return!0}}},ne=(e,t)=>{let n=S(t);return()=>{a.isLookingAhead=!0;let t=e();return a.isLookingAhead=!1,t&&n()}},E=e=>l.length===0||l[l.length-1].column<e,re=()=>E(f(1).beginColumn),D=()=>{let e=f(1),t=l.at(-1);return t!==void 0&&(e.kind===129||e.kind===132)&&t.column===e.beginColumn&&t.isConjunction===(e.kind===129)},O=()=>f(1).kind===39||f(1).kind===40,k=()=>O()||f(2).kind===90&&(f(3).kind===39||f(3).kind===40),A=()=>{let e=i.operatorStack?.at(-1)?.operator;return i.operatorStack===void 0||i.operatorStack.length===0||e!==void 0&&e.fix!==`postfix`},ie=()=>{let e=d(a.isLookingAhead?a.scanPosition:i.token);if(e.kind===102){let t={token:e,depth:1};for(;t.depth!==0;)if(t.token=d(t.token),t.token.kind===102&&t.depth++,t.token.kind===104&&t.depth--,t.token.kind===0)return!1;return d(t.token).kind===147}if(e.kind!==289)return!1;let t={token:d(e)};for(;t.token.kind===88;){let e=d(t.token);if(e.kind!==289)return!1;t.token=d(e)}return t.token.kind===147},j=()=>Me(),ae=()=>Te(),oe=w(102,ee(w(289,te(w(88,289)))),104),se=T(oe,289),ce=w(91,109),le=w(109,ee(ce)),ue=w(94,j),de=T(ne(ie,se),j,j,j),fe=w(100,ee(de),101),pe=w(97,T(ne(ie,se),289,ne(()=>f(2).kind===108&&ed(f(1)),289),289,j)),M=w(102,ee(j),C(104,103)),me=w(C(132,129),j),he=w(ee(54),96,C(289,...Mu)),ge=T(he,79),_e=w(289,ee(94)),ve=C(92,...Mu),ye=w(94,T(ne(re,C(...Mu,...Nu,...Pu)),ne(re,73),j)),be=w(56,44),xe=w(_e,ee(147)),Se=w(T(be,56,44),T(xe,ve)),Ce=w(ee(56),85,289),we=w(ee(56),C(80,38,81),T(_e,ve)),Te=w(ee(w(289,90,ae)),C(39,40),T(ne(k,ae),T(Se,Ce,we),j),te(88),C(76,77)),Ee=w(ee(96),289,93),De=w(289,93),Oe=S(75),ke=w(ee(84),T(j,ne(O,ae))),N=T(ne(re,110),ne(re,le),w(C(289,290,291,...Nu,...Pu,...Mu),ee(ye),te(105))),Ae=T(ne(re,C(...Pu)),ne(re,91),ne(re,pe)),je=T(ne(re,C(...Nu)),ne(re,90)),Me=w(te(C(...ju,...Nu)),T(ne(re,T(w(C(47,49),T(289,se)),w(C(60,61),289),w(50,j),w(42,j),w(52,ge,te(ge)),w(43,T(289,oe)))),ne(re,w(T(ne(A,T(me,me)),T(ue,fe,pe,M,w(C(86,59),T(289,ue,fe,pe,M))),N),te(Ae),ee(je))))),Ne={moduleUnit:[T(36,85,44,he,79,w(ee(54),51,289),w(C(41,39),ee(Ee),j),w(C(67,58),ee(De),T(ne(O,ae),j)),C(35,3,21),ne(()=>f(1).kind===68&&f(2).kind!==64||f(1).kind===69,T(w(ee(75),63),68,69))),1],unitDefinition:[he,2],unitInstance:[w(ee(54),51,289),2],unitAssumption:[w(C(41,39),ee(Ee),j),2],unitTheorem:[w(C(67,58),ee(De),T(ne(O,ae),j)),2],constantArguments:[w(94,92),2],definitionBody:[j,1],functionDefinition:[w(289,97),Ou],postfixDefinition:[w(289,C(...Pu)),Ou],infixDefinition:[w(289,C(...Nu)),Ou],identifierDefinition:[w(289,C(94,93)),Ou],nextSubstitution:[w(88,C(289,...Mu,...Nu,...Pu),107),3],assumptionName:[Ee,2],assumeExpression:[j,1],nextAssumeExpression:[j,1],newConstant:[be,2],constantDeclaration:[xe,2],constantSymbol:[Se,2],variableSymbol:[Ce,2],levelSymbol:[we,2],theoremName:[De,2],theoremAssumeProve:[ne(O,ae),3],theoremExpression:[j,1],proofKeyword:[Oe,2],terminalProof:[w(ee(75),C(71,72)),2],stepProof:[w(ee(Oe),te(C(...Fu)),C(...Fu)),1],usedExpression:[j,1],nextUsedExpression:[j,1],usedFacts:[T(55,j),1],definedExpression:[j,1],nextDefinedExpression:[j,1],assertStep:[ke,1],nextDefinition:[he,2],takeBounds:[T(w(289,te(w(88,289)),147),102),Ou],pickIdentifiers:[w(289,te(w(88,289)),89),Ou],assertedExpression:[j,1],decimalPart:[ce,2],operatorArgument:[w(C(...Mu,...Nu,...Pu),C(88,95,96,54,51,67,39,37,36,35,41,44,85,79)),2],lambdaArgument:[S(73),Ou],expressionArgument:[j,1],unboundQuantifier:[w(289,te(w(88,289)),89),Ou],setEnumeration:[w(se,88),Ou],setOfAll:[w(se,89),Ou],setExpression:[j,1],setContents:[de,1],recordFields:[w(289,108),Ou],recordSets:[w(289,89),Ou],bracketExpression:[j,1],tupleContents:[j,1],identifierArguments:[ye,2],fairnessArguments:[w(94,j),2],disjunctionList:[S(132),Ou],conjunctionList:[S(129),Ou],leadingOperator:[C(...ju,193),Ou],openExpression:[C(...Iu),Ou],junctionList:[C(129,132),Ou],primitiveExpression:[N,1],expressionSuffix:[Ae,1],postfixSuffix:[C(...Pu),Ou],recordSuffix:[S(91),Ou],applicationSuffix:[S(97),Ou],nextLeadingOperator:[C(...ju,193),Ou],nextOpenExpression:[C(...Iu),Ou],infixContinuation:[C(...Nu),Ou],labelContinuation:[S(90),Ou],expressionContinuation:[je,1],negativeOperator:[S(117),Ou],primitiveArguments:[ye,2],stringLiteral:[S(110),Ou],numberLiteral:[S(109),Ou],bangIdentifier:[S(289),Ou],bangArguments:[ye,2],bangOperand:[T(ne(()=>f(1).image!==`@`,289),C(...Mu),C(...Nu),C(...Pu)),1],structureOperator:[T(102,104,89,le,ne(()=>f(1).image===`@`,289)),1]},P=Object.keys(Ne),Pe=P.map(()=>[{generation:0,first:void 0,amount:0}]),Fe=(e,t,n)=>(a.remaining=n,a.scanPosition=t,a.lastPosition=t,a.isSucceeded=!1,e()),F=e=>{let t=Ne[e][1],n=Fe(Ne[e][0],i.token,t),r=Pe[P.indexOf(e)],o=r.find(e=>e.generation<=i.generation)??r[r.push({generation:0,first:void 0,amount:0})-1];return o.generation=i.generation+t-a.remaining,o.first=i.token,o.amount=t,n},Ie=(e,t)=>t===0?[]:e.kind===0?[`<EOF>`]:[e.image,...Ie(d(e),t-1)],Le=(e=-1)=>{a.longestExpected=+(e>=0||i.expectedGeneration===i.generation),a.endPosition=0,a.isRescanning=!0,Object.values(Ne).forEach((e,t)=>{for(let n of Pe[t])if(!(n.generation<=i.generation||n.first===void 0)&&(Fe(e[0],n.first,n.amount),a.isSucceeded))break}),a.isRescanning=!1,y(0);let t=d(i.token);return v(`Encountered "${Ie(t,a.longestExpected).join(` `)}" at line ${t.beginLine}, column ${t.beginColumn} and token "${Eu(i.token.image)}" `)},I=()=>(d(i.token),i.nextKind=-1,Le()),L=e=>{let t=i.token;if(i.token=d(i.token),i.nextKind=-1,i.token.kind===e)return i.generation++,i.token;throw i.token=t,Le(e)},R=e=>{if(e.includes(p()))return L(p());throw m(),I()},z=(e,t=e.kind)=>({kind:t,image:e.image,location:[e.beginLine,e.beginColumn,e.endLine,e.endColumn],heirs:[]}),B=(e,...t)=>{let n=t.flatMap(e=>e??[]),r=[Ou,Ou,ku,ku];for(let e of n)(e.location[0]<r[0]||e.location[0]===r[0]&&e.location[1]<r[1])&&(r[0]=e.location[0],r[1]=e.location[1]),(e.location[2]>r[2]||e.location[2]===r[2]&&e.location[3]>r[3])&&(r[2]=e.location[2],r[3]=e.location[3]);return{kind:e,image:e,location:r,heirs:n}},Re=()=>B(`IdPrefix`),V=e=>c.push(e),H=()=>{let e=c.lastIndexOf(void 0)+1;if(e!==c.length)return c.splice(e).filter(e=>e!==void 0)},U=e=>{c.push(void 0),s.push({name:e,token:f(1)}),i.expecting=``},W=()=>{s.pop(),c.pop(),i.expecting=``},ze=(e,t)=>{U(e);let n=t();return W(),n},Be=(e,t)=>ze(e,()=>{let e=t();return B(e,H())}),Ve=e=>{ed(e)&&(e.kind=289)},He=()=>{let e=[i.token,d(i.token)];for(;;){let t=e[e.length-1],n=d(t);if([0,67,58,41,37].includes(n.kind)||t.kind===67||t.kind===58)return;if(t.kind===93)break;e.push(n)}let t=$u(e,e.length-2);if(t<=0||e[t-1].kind===96)return;let n=e[t];e[t-1].next={kind:96,image:`Beginning of definition`,beginLine:n.beginLine,beginColumn:n.beginColumn,endLine:n.endLine,endColumn:n.endColumn,next:n}},Ue=(e,t)=>i.operatorStack?.push({node:e,operator:t}),We=()=>i.operatorStack??[],Ge=e=>We()[e].node??B(`Missing`),Ke=e=>{let t=We(),n=t.length-1;if(n<3)return;let r=Ge(n-2),i=Ge(n-3),a=Ge(n-1);t.splice(n-2,2);let o=e.fix===`nfix`&&i.kind===`Times`?B(`Times`,i.heirs,[r,a]):B(e.fix===`nfix`?`Times`:`InfixExpr`,[i,r,a]);t[n-3]={node:o,operator:void 0}},qe=()=>{let e=We(),t=e.length-1;if(t<2)return;let n=B(`PrefixExpr`,[Ge(t-2),Ge(t-1)]);e.splice(t-1,1),e[t-2]={node:n,operator:void 0}},Je=()=>{let e=We(),t=e.length-1;if(t<2)return;let n=Ge(t-1),r=e[t-1].operator===Gu?B(`FcnAppl`,[Ge(t-2)],n.heirs):B(`PostfixExpr`,[Ge(t-2),n]);e.splice(t-1,1),e[t-2]={node:r,operator:void 0}},Ye=()=>{let e=We();for(;;){let t=e.length-1,n=e[t],r=n.operator;if(r===void 0)return;let i=_(n.node??B(`Missing`));if(r.fix===`postfix`){if(t===0)throw v(`\n Encountered postfix op ${r.name} in block ${i} on empty stack`);let n=e[t-1];if(n.operator!==void 0){if(Ju(n.operator)||n.operator.fix===`prefix`)throw v(`\n Encountered postfix op ${r.name} in block ${i} following prefix or infix op ${n.operator.name}.`);Je()}else{if(t<=1)return;let n=e[t-2].operator;if(n===void 0)throw v(`Expression at location ${_(Ge(t-2))} and expression at location ${_(Ge(t-1))} follow each other without any intervening operator.`);if(Yu(n,r))Ju(n)?Ke(n):qe();else if(Xu(n,r))return;else throw v(`Precedence conflict between ops ${n.name} in block ${i} and ${r.name}.`)}}else if(r.fix===`prefix`){if(t===0)return;let n=e[t-1];if(n.operator===void 0)throw v(`\n Encountered prefix op ${r.name} in block ${i} following an expression.`);if(n.operator.fix===`postfix`)throw v(`\n Encountered prefix op ${r.name} in block ${i} following postfix op ${n.operator.name}.`);return}else if(t===0){if(qu(r)===void 0)throw v(`\n Encountered infix op ${r.name} in block ${i} on empty stack.`);return}else{let n=e[t-1];if(n.operator!==void 0){let e=n.operator;if(Ju(e)||e.fix===`prefix`){let n=qu(r),i=_(Ge(t-1));if(n===void 0)throw v(r===Ku?`\n Missing expression in block ${i} following prefix or infix op ${e.name}.`:`\n Encountered infix op ${r.name} in block ${i} following prefix or infix op ${e.name}.`);if(Yu(e,n)||e===n&&e.associativity===`left`)throw v(`\n Precedence conflict between ops ${e.name} in block ${i} and ${n.name}.`)}else Je()}else{if(t<=1)return;let n=e[t-2];if(n.operator===void 0)throw v(`Expression at location ${_(Ge(t-2))} and expression at location ${_(Ge(t-1))} follow each other without any intervening operator.`);let i=qu(n.operator),a=i!==void 0&&(t===2||e[t-3].operator!==void 0)?i:n.operator,o=_(Ge(t-2));if(Yu(a,r)||a===r&&a.associativity===`left`){if(Ju(a))Ke(a);else if(a.fix===`prefix`)qe();else if(Ge(t-2).location[0]<Ge(t-1).location[0]&&r.name===`=`)throw v(`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${a.name} in block ${o} and ${r.name}.`);else if(r===Ku)throw v(`\n Error following expression at ${o}, missing operator or separator.`);else throw v(`\n Illegal combination of operators ${a.name} in block ${o} and ${r.name}.`)}else if(Xu(a,r)||a===r&&a.associativity===`right`)return;else throw v(`\n Precedence conflict between ops ${a.name} in block ${o} and ${r.name}.`)}}if(t===e.length-1)return}},Xe=()=>{Ue(void 0,Ku),Ye();let e=We();if(e.length===2)return e[0].node;n.push(`Couldn't properly parse expression${e.slice(0,Math.max(e.length-1,1)).map((e,t)=>`-- incomplete expression at ${_(Ge(t))}.\n`).join(``)}`)},Ze=(e,t)=>{let n=We(),r=n.at(-1);if(r===void 0)throw v(`\n \`\`.'' has no left hand side at ${_(e)}.`);if(r.operator!==void 0){if(r.operator.fix!==`postfix`||n[n.length-2].operator!==void 0)throw v(`\n \`\`.'' follows operator ${_(r.node??B(`Missing`))}.`);n.push({node:void 0,operator:void 0}),Je(),n.pop()}let i=n.length-1;n[i]={node:B(`RecordComponent`,[Ge(i),e,t]),operator:void 0}},Qe=e=>{i.fairnessHook=e},$e=e=>e===void 0?!1:e.kind===`GeneralId`?e.heirs[0].heirs.length===0:e.kind===`OpApplication`&&e.heirs[1].heirs.filter((e,t)=>t%2==1).every(e=>e.kind===`GeneralId`&&e.heirs[0].heirs.length===0),et=(e,t)=>{for(let n of e.heirs)if(n.kind!==`ConjList`&&n.kind!==`DisjList`){if(!E(n.location[1]))throw v(`Item at ${_(n)} is not properly indented inside conjunction or disjunction list item at ${_(t)}`);et(n,t)}},tt=()=>i.proofDepth<0?i.proofDepth:o[i.proofDepth],nt=e=>e.image.length<2?!1:e.image[1]===`*`?i.proofDepth<0:e.image[1]===`+`?!0:[290,293,294,292].includes(e.kind)?i.proofDepth<0||o[i.proofDepth]>=0&&td(e)>o[i.proofDepth]:[63,75,71,72].includes(e.kind),rt=e=>{let t=td(e),n=i.proofDepth>0?o[i.proofDepth-1]:-1;return t===-1?(o[i.proofDepth]<0&&(o[i.proofDepth]=n+1),!0):o[i.proofDepth]>=0?t!==-2&&o[i.proofDepth]===t:(o[i.proofDepth]=t===-2?n+1:t,t===-2||t>n)},G=()=>z(L(289)),K=e=>V(z(L(e))),it=(e,t)=>{let n=R(e);return i.lastOperator=Wu.get(n.image),z(n,t)},at=()=>{U(`Infix Op`);let e=R(Nu);return i.lastOperator=Wu.get(e.image),W(),z(e,`InfixOp`)},ot=()=>{let e=R(Pu);return i.lastOperator=Wu.get(e.image),z(e,`PostfixOp`)},st=()=>it(Mu,`NonExpPrefixOp`),ct=()=>{U(`Module definition`),i.expecting=`---- MODULE`;let e=lt();i.expecting=`EXTENDS clause or module body`;let t=ut();i.expecting=`Module body`;let n=ft();i.expecting=`==== or more Module body`;let r=B(`EndModule`,[z(L(37))]);return W(),B(`Module`,[e,t,n,r])},lt=()=>{U(`Begin module`),i.expecting=`---- MODULE (beginning of module)`;let e=z(R([35,3,21]));i.expecting=`Identifier`,Ve(f(1));let t=G();i.moduleName??=t.image,i.expecting=`----`;let n=z(L(36));return W(),B(`BeginModule`,[e,t,n])},ut=()=>{if(U(`Extends`),h(48))for(K(48),i.expecting=`Identifier`,Ve(f(1)),V(G()),i.expecting=`comma or module body`;h(88);)K(88),i.expecting=`Identifier`,Ve(f(1)),V(G());let e=H();return W(),B(`Extends`,e)},dt=()=>{let e=p();if(e===36)return z(L(36));if(e===85)return pt();if(e===44)return mt();if(m(),F(`unitDefinition`))return yt();if(p()===79)return ht();if(m(),F(`unitInstance`))return Tt();if(F(`unitAssumption`))return Ot();if(F(`unitTheorem`))return Mt();if([35,3,21].includes(p())){let e=ct();return He(),e}if(m(),f(1).kind===68&&f(2).kind!==64||f(1).kind===69)return Ft();throw I()},ft=()=>{for(U(`Module body`),i.expecting=`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`;F(`moduleUnit`);)V(dt());let e=H();return W(),B(`Body`,e)},pt=()=>{U(`variable declaration`);let e=z(L(85));for(i.expecting=`Identifier`,V(G()),i.expecting=`comma or module body`;h(88);)K(88),i.expecting=`Identifier`,V(G());let t=H();return W(),B(`VariableDeclaration`,e,t)},mt=()=>{U(`Parameter declaration`),i.expecting=`CONSTANT`,U(`Parameter declaration item`);let e=B(`ConsDecl`,[z(L(44))]);for(W(),V(e),i.expecting=`Identifier, operator or _`,V(_t()),i.expecting=`,`;h(88);)K(88),i.expecting=`Identifier, operator or _`,V(_t());let t=H();return W(),B(`ParamDeclaration`,t)},ht=()=>{for(U(`Recursive`),i.expecting=`RECURSIVE`,K(79),i.expecting=`Identifier, operator or _`,V(_t()),i.expecting=`,`;h(88);)K(88),i.expecting=`Identifier, operator or _`,V(_t()),i.expecting="`,' or `)'";let e=H();return W(),B(`Recursive`,e)},gt=()=>{for(K(94),i.expecting=`_`,K(92),i.expecting=`comma or )`;h(88);)K(88),i.expecting=`_`,K(92),i.expecting=`comma or )`;K(95)},_t=()=>Be(`Constant declaration items`,()=>{i.expecting=`Identifier, _ or prefix op`;let e=p();if(e===289)return V(G()),i.expecting=`(, comma, or Module Body`,F(`constantArguments`)&&gt(),`IdentDecl`;if(Mu.includes(e)){let e=st();return i.expecting=`_`,V(e),K(92),`PrefixDecl`}if(e!==92)throw m(),I();let t=z(L(92));i.expecting=`prefix or postfix operator`;let n=p();if(Nu.includes(n)){let e=at();return i.expecting=`_`,V(t),V(e),K(92),`InfixDecl`}if(Pu.includes(n)){let e=ot();return V(t),V(e),`PostfixDecl`}throw m(),I()}),vt=e=>{let t=z(L(93));He(),V(t),i.expecting=e},yt=()=>Be(`Definition`,()=>{if(i.expecting=`LOCAL, Identifier or Operator Symbol`,h(54)&&K(54),L(96),i.expecting=`LOCAL, Identifier or Operator Symbol`,F(`functionDefinition`)){for(V(G()),i.expecting=`[`,K(97),i.expecting=`Identifier`,V(tn()),i.expecting=`COMMA or ]`;h(88);)K(88),i.expecting=`Identifier`,V(tn());let e=z(L(99));return i.expecting=`==`,V(e),vt(`Expression`),V(J()),`FunctionDefinition`}if(F(`postfixDefinition`)){U(`Postfix LHS`);let e=G(),t=z(R(Pu));return W(),V(B(`PostfixLHS`,[e,t])),i.expecting=`==`,vt(`Expression`),V(J()),`OperatorDefinition`}if(F(`infixDefinition`)){U(`Infix LHS`);let e=G(),t=z(R(Nu)),n=G();return W(),V(B(`InfixLHS`,[e,t,n])),i.expecting=`==`,vt(`Expression`),V(J()),`OperatorDefinition`}if(F(`identifierDefinition`)){if(V(St()),i.expecting=`==`,vt(`Expression or Instance`),F(`definitionBody`))return V(J()),`OperatorDefinition`;if(p()===51)return V(Et()),`ModuleDefinition`;throw m(),I()}if(!Mu.includes(p()))throw m(),I();U(`Prefix LHS`);let e=z(R(Mu));i.expecting=`Identifier`;let t=G();return W(),V(B(`PrefixLHS`,[e,t])),i.expecting=`==`,vt(`Expression`),V(J()),`OperatorDefinition`}),bt=()=>{if(U(`Identifier tuple`),K(102),i.expecting=`Identifier or >>`,h(289))for(V(G()),i.expecting=`COMMA or >>`;h(88);)K(88),i.expecting=`COMMA or >>`,V(G()),i.expecting=`COMMA or >>`;K(104);let e=H();return W(),B(`IdentifierTuple`,e)},xt=()=>{let e=p();if(e===289)return Ct();if(Bu.has(e))return wt();throw m(),I()},St=()=>{if(U(`Identifier LHS`),V(G()),i.expecting=`( or ==`,h(94)){for(K(94),i.expecting=`Identifier Declaration, prefix op, _ or )`,V(xt()),i.expecting=`COMMA or )`;h(88);)K(88),i.expecting=`Identifier Declaration, prefix op or _`,V(xt()),i.expecting=`COMMA or )`;K(95)}let e=H();return W(),B(`IdentLHS`,e)},Ct=()=>{if(U(`Identifier Declation`),V(G()),i.expecting=`( or ...`,h(94)){for(K(94),i.expecting=`_`,K(92),i.expecting=`COMMA or )`;h(88);)K(88),i.expecting=`_`,K(92),i.expecting=`COMMA or )`;K(95)}let e=H();return W(),B(`IdentDecl`,e)},wt=()=>Be(`Op. Symbol Declaration`,()=>{let e=p();if(Mu.includes(e))return V(st()),i.expecting=`_`,K(92),`PrefixDecl`;if(e!==92)throw m(),I();K(92),i.expecting=`infix or postfix operator`;let t=p();if(Nu.includes(t))return V(at()),i.expecting=`_`,K(92),`InfixDecl`;if(Pu.includes(t))return V(ot()),`PostfixDecl`;throw m(),I()}),Tt=()=>{U(`Instance`),i.expecting=`LOCAL or instance`;let e=h(54)?z(L(54)):void 0;V(Et()),i.expecting=`COMMA or Module Body`;let t=H();return W(),B(`Instance`,e,t)},Et=()=>{if(U(`NonLocalInstance`),K(51),i.expecting=`Module identifier`,Ve(f(1)),V(G()),i.expecting=`WITH or another definition.`,h(87))for(K(87),i.expecting=``,V(Dt()),i.expecting=``;F(`nextSubstitution`);)K(88),i.expecting=``,V(Dt()),i.expecting=``;let e=H();return W(),B(`NonLocalInstance`,e)},Dt=()=>{U(`Substitution`);let e=p(),t=e===289?G():Mu.includes(e)?st():Nu.includes(e)?at():Pu.includes(e)?ot():void 0;if(t===void 0)throw m(),I();i.expecting=`<-`;let n=z(L(107));i.expecting=`Expression or Op. Symbol`;let r=Zt();return W(),B(`Substitution`,[t,n,r])},Ot=()=>{U(`Assumption`),i.expecting=`ASSUM...`,V(z(R([41,39]))),F(`assumptionName`)&&(h(96)&&L(96),V(G()),i.expecting=`==`,K(93)),He(),i.expecting=`Expression`,V(J());let e=H();return W(),B(`Assumption`,e)},kt=e=>{if(k())return At();if(zu.has(p()))return jt();if(m(),F(e))return J();throw I()},At=()=>{if(U(`Assume-Prove`),h(289)){V(B(`GeneralId`,[Re(),G()])),K(90),V(At());let e=H();return W(),B(`Label`,e)}for(V(z(R([39,40]))),i.expecting=`Expression, Declaration, or AssumeProve`,V(kt(`assumeExpression`)),i.expecting="PROVE or `,'";h(88);)K(88),i.expecting=`Expression, Declaration, or AssumeProve`,V(kt(`nextAssumeExpression`)),i.expecting="PROVE or `,'";V(z(R([76,77]))),i.expecting=`Expression`,V(J());let e=H();return W(),B(`AssumeProve`,e)},jt=()=>{if(U(`NEW symbol declaration`),i.expecting=`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`,F(`constantSymbol`)){if(F(`newConstant`)?(K(56),K(44)):V(z(R([56,44]))),i.expecting=`Constant declaration`,F(`constantDeclaration`)){let e=Ct();if(V(e),h(147)){let t=L(147);if(e.heirs.length>1)throw v(`declared symbol with arguments before \\in at ${_(e)}`);V(z(t)),i.expecting=`Expression`,V(J())}}else if(Bu.has(p()))V(wt());else throw m(),I()}else if(F(`variableSymbol`))h(56)&&K(56),K(85),i.expecting=`Identifier`,V(B(`IdentDecl`,[G()]));else if(F(`levelSymbol`))h(56)&&K(56),V(z(R([80,38,81]))),i.expecting=`Declaration`,V(xt());else throw I();let e=H();return W(),B(`NewSymb`,e)},Mt=()=>{if(U(`Theorem`),i.expecting=`THEOREM, PROPOSITION`,V(z(R([67,58]))),i.expecting=`Identifier, Assume-Prove or Expression`,F(`theoremName`)&&(V(G()),i.expecting=`==`,K(93)),He(),F(`theoremAssumeProve`)){if(!O())throw I();V(At())}else if(F(`theoremExpression`))V(J());else throw I();nt(f(1))&&V(Nt());let e=H();return W(),B(`Theorem`,e)},Nt=()=>{if(i.proofDepth++,i.proofDepth>=100)throw v(`Proofs nested more than 100deep.`);o[i.proofDepth]=-1;let e=ze(`Proof`,()=>{if(f(1).kind===63||f(2).kind===63)return Ft();if(F(`terminalProof`)){let e=h(75)?z(L(75)):void 0;return B(`TerminalProof`,e,[z(R([71,72]))])}if(!F(`stepProof`))throw I();for(F(`proofKeyword`)&&K(75);f(2).kind!==78;)V(zt()),i.expecting=`a proof step`;return V(Lt()),B(`Proof`,H())});if(i.proofDepth<0)throw v(`Parser bug: an extra QED step found.`);return i.proofDepth--,e},Pt=e=>{if(p()===55)K(55),i.expecting=`identifier`,V(G());else{if(m(),!F(e))throw I();V(J())}},Ft=()=>{U(`UseOrHideOrBy`);let e=p(),t=e===63||e===75?`TerminalProof`:`UseOrHide`;if(t===`TerminalProof`)h(75)&&K(75),K(63),h(64)&&K(64);else if(e===68)K(68),h(64)&&K(64);else if(e===69)K(69);else throw m(),I();if(i.expecting="an expression, `MODULE' or `DEF'",F(`usedFacts`))for(Pt(`usedExpression`);h(88);)K(88),i.expecting=`MODULE or expression`,Pt(`nextUsedExpression`),i.expecting=t===`TerminalProof`?`comma, DEF, or [.]`:`comma, DEF, or proof step`;if(h(66))for(K(66),i.expecting=`MODULE or expression`,Pt(`definedExpression`);h(88);)K(88),i.expecting=`MODULE or expression`,Pt(`nextDefinedExpression`),i.expecting=t===`TerminalProof`?`comma or [.]`:`comma or proof step`;let n=H();return W(),B(t,n)},It=e=>{i.expecting=`Step number`;let t=z(R(Fu));if(!rt(i.token))throw v(`${_(t)}: ${e}`);V(t)},Lt=()=>{U(`QED step`),It(`QED step's number has bad level.`),i.expecting=`QED`,V(B(`QEDStep`,[z(L(78))])),nt(f(1))&&V(Nt());let e=H();return W(),B(`ProofStep`,e)},Rt=()=>{let e=f(1).kind;if(e===68||e===69)return[Ft(),!1];if(e===51)return[Et(),!1];if(e===96||e===65)return[Bt(),!1];let t=p();if(t===70)return[Vt(`HaveStep`,70),!1];if(t===74)return[Ut(),!1];if(t===83)return[Wt(),!1];if(t===82)return[Gt(),!0];if(t===42)return[Vt(`CaseStep`,42),!0];if(m(),F(`assertStep`))return[Kt(),!0];throw I()},zt=()=>{U(`Step`),It(`step's number has bad level.`),i.expecting=`proof step`;let e=Rt();if(V(e[0]),nt(f(1))){if(!e[1])throw v(`${_(e[0])}: proof of step that does not take a proof.`);V(Nt())}let t=H();return W(),B(`ProofStep`,t)},Bt=()=>{U(`DefStep`),h(65)&&K(65);do V(yt());while(F(`nextDefinition`));let e=H();return W(),B(`DefStep`,e)},Vt=(e,t)=>{U(e),K(t),i.expecting=`expression`,V(J());let n=H();return W(),B(e,n)},Ht=(e,t,n,r)=>{for(V(e()),i.expecting=t;h(88);)K(88),i.expecting=n,V(e()),i.expecting=r},Ut=()=>{if(U(`TakeStep`),K(74),i.expecting=`identifier`,F(`takeBounds`))Ht(tn,`comma or step`,`identifier or tuple of identifiers`,`comma or proof step`);else if(h(289))Ht(G,`comma or proof step`,`identifier`,`comma or proof step`);else throw I();let e=H();return W(),B(`TakeStep`,e)},Wt=()=>{for(U(`WitnessStep`),K(83),i.expecting=`expression`,V(J());h(88);)K(88),i.expecting=`expression`,V(J()),i.expecting=`comma or colon`;let e=H();return W(),B(`WitnessStep`,e)},Gt=()=>{if(U(`PickStep`),K(82),i.expecting=`identifier`,F(`pickIdentifiers`))Ht(G,`comma, or colon`,`identifier`,`comma or colon`);else if(p()===102||p()===289)Ht(tn,`comma or colon`,`identifier or tuple of identifiers`,`comma or colon`);else throw m(),I();K(89),i.expecting=`expression`,V(J());let e=H();return W(),B(`PickStep`,e)},Kt=()=>{if(U(`AssertStep`),h(84)&&(K(84),i.expecting=`expression or ASSUME/PROVE`),F(`assertedExpression`))V(J());else if(O())V(At());else throw I();let e=H();return W(),B(`AssertStep`,e)},qt=()=>{let e=p();if(e===94)return Qt();if(e===100)return nn();if(e===97)return on();if(e===102)return ln();if(e===59||e===86)return fn();throw m(),I()},Jt=()=>{let e=p();if(e===47||e===49)return $t();if(e===60||e===61)return en();if(e===50)return pn();if(e===42)return gn();if(e===52)return _n();if(e===43)return xn();throw m(),I()},Yt=()=>{let e=z(L(109));if(!F(`decimalPart`))return B(`Number`,[e]);let t=z(L(91));return B(`Real`,[e,t,z(L(109))])},Xt=()=>{for(U(`Optional Arguments`),K(94),V(Zt());h(88);)K(88),V(Zt());K(95);let e=H();return W(),B(`OpArgs`,e)},Zt=()=>{if(F(`operatorArgument`)&&re()){let e=p();if(Mu.includes(e))return B(`GenNonExpPrefixOp`,[Re(),st()]);if(Nu.includes(e)){let e=at();if(e.image===`\\X`||e.image===`\\times`)throw v(`${_(e)}: \\X may not be used as an infix operator.`);return B(`GenInfixOp`,[Re(),e])}if(Pu.includes(e))return B(`GenPostfixOp`,[Re(),ot()]);throw m(),I()}if(F(`lambdaArgument`)&&re())return Sn();if(F(`expressionArgument`))return J();throw I()},Qt=()=>B(`ParenExpr`,[z(L(94)),J(),z(L(95))]),$t=()=>{U(`Quantified form`),V(z(R([47,49])));let e=F(`unboundQuantifier`);if(e)for(V(G());h(88);)K(88),V(G());else if(p()===102||p()===289)for(V(tn());h(88);)K(88),V(tn());else throw m(),I();K(89),V(J());let t=H();return W(),B(e?`UnboundQuant`:`BoundQuant`,t)},en=()=>{for(U(`Bound Quantified Expression`),V(z(R([60,61]))),V(G());h(88);)K(88),V(G());K(89),V(J());let e=H();return W(),B(`UnboundQuant`,e)},tn=()=>{U(`Quant Bound`);let e=p();if(e===102)V(bt());else if(e===289)for(V(G());h(88);)K(88),V(G()),i.expecting=`, or \\in`;else throw m(),I();K(147),V(J());let t=H();return W(),B(`QuantBound`,t)},nn=()=>Be(`Some { } form`,()=>{K(100);let e=F(`setContents`)?rn():`SetEnumerate`;return K(101),e}),rn=()=>{if(ie()){let e=p(),t=e===102?bt():e===289?G():void 0;if(t===void 0)throw m(),I();i.expecting=`\\in`;let n=z(L(147)),r=J();if(i.expecting=`':', ',' or '}'`,p()===89){let e=z(L(89));return V(t),V(n),V(r),V(e),V(J()),`SubsetOf`}if(V(B(`InfixExpr`,[B(`GeneralId`,[Re(),t]),B(`GenInfixOp`,[Re(),n]),r])),p()!==88)return m(),`SetEnumerate`;do K(88),V(J());while(h(88));return`SetEnumerate`}if(F(`setEnumeration`)){for(V(J());h(88);)K(88),V(J());return`SetEnumerate`}if(F(`setOfAll`)){for(V(J()),K(89),V(tn());h(88);)K(88),V(tn());return`SetOfAll`}if(!F(`setExpression`))throw I();let e=J();V(e);let t=p();if(t===89){let t=L(89);if(e.heirs.length>1&&e.kind===`InfixExpr`&&e.heirs[1].heirs[1].image===`\\in`)throw v(`Form {a \\in b : c \\in d }, at line ${t.beginLine}, is not allowed`);for(V(z(t)),V(tn());h(88);)K(88),V(tn());return`SetOfAll`}if(t!==88)return m(),`SetEnumerate`;do K(88),V(J());while(h(88));return`SetEnumerate`},q=e=>{for(V(e());h(88);)K(88),V(e());K(99)},an=(e,t,n)=>()=>{U(e);let r=G(),i=z(L(n)),a=J();return W(),B(t,[r,i,a])},on=()=>Be(`Some [] Form`,()=>{if(K(97),ie()){for(V(tn());h(88);)K(88),V(tn());return K(108),V(J()),K(99),`FcnConst`}if(F(`recordFields`))return q(an(`Field Value`,`FieldVal`,108)),`RcdConstructor`;if(f(2).kind===108&&ed(f(1)))return f(1).kind=289,q(an(`Field Value`,`FieldVal`,108)),`RcdConstructor`;if(F(`recordSets`))return q(an(`Field Set`,`FieldSet`,89)),`SetOfRcds`;if(!F(`bracketExpression`))throw I();V(J());let e=p();if(e===88||e===99){for(;h(88);)K(88),V(J());return K(99),i.lastOperator=Gu,`FcnAppl`}if(e===106)return K(106),V(J()),K(99),`SetOfFcns`;if(e===46){for(K(46),V(sn());h(88);)K(88),V(sn());return K(99),`Except`}if(e===98)return K(98),V(dn()),`ActionExpr`;throw m(),I()}),sn=()=>{U(`Except Spec`),K(105);do V(cn()),i.expecting=`= or ,`;while(p()===91||p()===97||m());K(185),V(J());let e=H();return W(),B(`ExceptSpec`,e)},cn=()=>{U(`Except Component`);let e=p();if(e===91){K(91),Ve(f(1));let e=G();e.image===`@`&&n.push(`@ used in !.@`),V(e)}else if(e===97){for(K(97),V(J());h(88);)K(88),V(J());K(99)}else throw m(),I();let t=H();return W(),B(`ExceptComponent`,t)},ln=()=>Be(`Some << -- >> or >>_ Form`,()=>{if(K(102),F(`tupleContents`))for(V(J());h(88);)K(88),V(J());let e=p();if(e===104)return K(104),`Tuple`;if(e===103)return K(103),V(dn()),`ActionExpr`;throw m(),I()}),un=()=>{let e=G(),t=F(`identifierArguments`)?Xt():void 0;if(h(105)){let n=z(L(105));return V(B(`IdPrefixElement`,[e],t,[n])),un()}return Qe(t),B(`GeneralId`,[B(`IdPrefix`,H()),e])},dn=()=>{U(`restricted form of expression`);let e=p(),t=e===289?un():e===94?Qt():e===100?nn():e===97?on():e===102?ln():void 0;if(t===void 0)throw m(),I();return W(),t},fn=()=>{Qe(void 0),U(`Fairness Expression`);let e=z(R([86,59])),t=dn(),r=`${e.location[0]}`;if(F(`fairnessArguments`)){let a=z(L(94)),o=J(),s=z(L(95));return W(),t.kind===`GeneralId`&&i.fairnessHook!==void 0?B(`FairnessExpr`,[e,B(`OpApplication`,[t,i.fairnessHook]),a,o,s]):Vu.has(String(t.kind))?B(`FairnessExpr`,[e,t,a,o,s]):(n.push(`Error in fairness expression at ${r}: ${e.location[1]}: could not link arguments\n`),t)}if(W(),i.fairnessHook===void 0)throw v(`Ill-structured fairness expression at line ${r}, column ${e.location[1]}`);let a=i.fairnessHook.heirs;return a.length===3?B(`FairnessExpr`,[e,t,...a]):(n.push(`Error in fairness expression at ${r}: ${e.location[1]}\n`),t)},pn=()=>{U(`IF THEN ELSE`);let e=[z(L(50)),J(),z(L(62)),J(),z(L(45)),J()];return W(),B(`IfThenElse`,e)},mn=()=>{let e=f(1);return e.kind===121&&E(e.beginColumn)},hn=(e,t,n)=>{U(e);let r=[n(),z(L(106)),J()];return W(),B(t,r)},gn=()=>{for(U(`CASE Expression`),K(42),V(hn(`Case Arm`,`CaseArm`,J));mn()&&f(2).kind!==57;)K(121),V(hn(`Case Arm`,`CaseArm`,J));mn()&&(K(121),V(hn(`Case Other Arm`,`OtherArm`,()=>z(L(57)))));let e=H();return W(),B(`Case`,e)},_n=()=>{U(`Case Other Arm`);let e=[z(L(52)),vn(),z(L(53)),J()];return W(),B(`LetIn`,e)},vn=()=>{U(`Let Definitions`);do{let e=p();if(e===54||e===96)V(yt());else if(e===79)V(ht());else throw m(),I()}while([54,79,96].includes(p())||m());let e=H();return W(),B(`LetDefinitions`,e)},yn=e=>{U(`Junction Item`);let t=z(R([132,129])),n=J();W();let r=B(e,[t,n]);return et(n,r),r},bn=()=>{let e=f(1);return l.push({isConjunction:e.kind===129,column:e.beginColumn}),Be(`AND-OR Junction`,()=>{let e=F(`disjunctionList`)?`DisjList`:F(`conjunctionList`)?`ConjList`:void 0;if(e===void 0)throw I();let t=e===`DisjList`?`DisjItem`:`ConjItem`;for(V(yn(t));D();)V(yn(t));return l.pop(),e})},xn=()=>{U(`(Un)Bounded Choose`);let e=z(L(43)),t=p(),n=t===289?G():t===102?bt():void 0;if(n===void 0)throw m(),I();U(`Domain binding`),h(147)&&(K(147),i.expecting=`Expression`,V(J()));let r=B(`MaybeBound`,H());W();let a=[e,n,r,z(L(89)),J()];return W(),B(`UnboundOrBoundChoose`,a)},Sn=()=>{U(`Lambda`),K(73),i.expecting=`Identifier`,Ht(G,"`,' or `:'",`Identifier`,"`,' or `:'"),K(89),i.expecting=`Expression`,V(J());let e=H();return W(),B(`Lambda`,e)},Cn=(e,t)=>{Ue(B(e,[Re(),t]),i.lastOperator),We().length!==1&&Ye()},wn=()=>{let e=p();if(ju.includes(e))return Cn(`GenPrefixOp`,it(ju,`PrefixOp`));if(Nu.includes(e))return Cn(`GenInfixOp`,at());throw m(),I()},J=()=>{for(U(`Expression`),i.operatorStack=[],u.push(i.operatorStack);F(`leadingOperator`)&&re();)wn();if(F(`openExpression`)&&re())Ue(Jt());else if(re())Tn();else throw I();W();let e=Xe();if(e===void 0)throw v(` Couldn't reduce expression stack.`);return u.pop(),i.operatorStack=u.at(-1),e},Tn=()=>{if(U(`ExtendableExpr`),F(`junctionList`)&&A())Ue(bn());else if(Ru.has(p()))Ue(qt());else{if(m(),!F(`primitiveExpression`))throw I();Ue(On())}for(;F(`expressionSuffix`);)if(F(`postfixSuffix`)&&re())Cn(`GenPostfixOp`,ot());else if(F(`recordSuffix`)&&re()){let e=z(L(91));if(Ve(f(1)),!re())throw I();Ze(e,G())}else if(F(`applicationSuffix`)&&re()){i.expecting=`function argument`;let e=on();[`GenPrefixOp`,`GenNonExpPrefixOp`,`GenInfixOp`,`GenPostfixOp`,`FcnAppl`].includes(String(e.kind))?(Ue(e,i.lastOperator),We().length!==1&&Ye()):Ue(e)}else throw I();if(F(`expressionContinuation`)){if(F(`infixContinuation`)&&re()){for(Cn(`GenInfixOp`,at());F(`nextLeadingOperator`)&&re();)wn();if(F(`nextOpenExpression`)&&re())Ue(Jt());else if(re())Tn();else throw I()}else if(F(`labelContinuation`)&&re()){let e=z(L(90)),t=We().at(-1)?.node;if(!$e(t))throw v(`\`::' at ${_(e)} does not follow a label.`);We().pop();let n=J(),r=We().at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&We().length>0&&r!==void 0&&i.lastOperator!==void 0&&!Xu(r,i.lastOperator))throw v(`Removing label at ${_(t??B(`Missing`))} would change expression parsing.`);Ue(B(`Label`,[t??B(`Missing`),e,n]))}else throw I()}W()},En=()=>{let e=R([290,291]),t=z(e);if(tt()<0&&i.proofDepth<=0)throw v(`${_(t)}: Step number used outside proof.`);if(e.image[1]===`+`)throw v(`${_(t)}: <+> step number used in an expression.`);return t},Dn=()=>{let e=p();if(e===289)return G();if(e===290||e===291)return En();if(Nu.includes(e))return at();if(Pu.includes(e))return ot();if(m(),!F(`negativeOperator`))throw I();return st()},On=()=>ze(`Primitive expression`,()=>{if(F(`stringLiteral`)&&re())return ze(`String`,()=>z(L(110),`String`));if(F(`numberLiteral`)&&re())return Yt();if(!Lu.has(p()))throw m(),I();let e=Dn(),t=F(`primitiveArguments`)?Xt():void 0;for(;h(105);)V(kn());let n=H();if(n===void 0){let n=B(`GeneralId`,[B(`IdPrefix`,[]),e]);return t?B(`OpApplication`,[n,t]):n}let r=[B(`IdPrefixElement`,[e],t,[n[0].heirs[0]]),...n.slice(0,-1).map((e,t)=>B(`IdPrefixElement`,e.heirs.slice(1),[n[t+1].heirs[0]]))],i=n[n.length-1].heirs,a=B(`GeneralId`,[B(`IdPrefix`,r),i[1]]);return i.length===2?a:B(`OpApplication`,[a,i[2]])}),kn=()=>{if(U(`Bang Extension`),K(105),F(`bangOperand`)){if(F(`bangIdentifier`)&&f(1).image!==`@`)V(G());else{let e=p();if(Mu.includes(e))V(st());else if(Nu.includes(e))V(at());else if(Pu.includes(e))V(ot());else throw m(),I()}F(`bangArguments`)&&V(Xt())}else if(p()===94)V(Xt());else{if(m(),!F(`structureOperator`))throw I();V(An())}let e=B(`IdPrefixElement`,H());return W(),e},An=()=>{let e=ze(`StructOp`,()=>{i.expecting="`<<' , `>>' , `:' , `@' , or number";let e=p();if(e===102||e===104||e===89)return z(L(e),`StructOp`);if(e===109)return Yt();if(m(),f(1).image!==`@`)throw I();return z(L(289),`StructOp`)});if(e.kind===`Real`)throw v(`Illegal structural term at ${_(e)}`);return e.kind===`Number`?B(`StructOp`,[e]):e},jn=()=>{if(He(),h(2))for(L(2);;){let e=p();if(e!==20&&e!==289){m();break}L(e)}ct()};try{jn()}catch(e){if(!(e instanceof g))throw e;n.push(e.message)}return n.length===0?void 0:n.join(`
112
+ `)},rd=(e,t)=>{try{return Al(e)}catch(n){if(!(n instanceof p))throw n;let r=nd(e);throw r===void 0?n:m([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},id=(e,t,n)=>new x(`Applying ${e} to the following value,\nwhich is not ${t}:\n${Y(n)}`),ad=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${Y(r)}`),od=e=>P(e)?xn(e):void 0,sd=(e,t,n)=>{let r=Z(e,t,n),i=od(r);if(!i)throw id(n,`a function with a finite domain`,r);return i},cd=(e,t,n)=>{let r=Z(e,t,n),i=od(r);if(!i)throw ad(t===0?`first`:`second`,n,`bag`,r);return i},ld=(e,t)=>{if(!Me(e)||!Yt(e))throw t();return q(e).elements},ud=e=>e.range.every(e=>typeof e==`number`&&e>0),dd=(e,t)=>{let n=e.domain.findIndex(e=>et(e,t));return n===-1?void 0:e.range[n]},fd=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,pd=fd(`BagDiff`,`tlc2.value.impl.Value`,2),md=fd(`SqSubseteq`,`tlc2.value.IBoolValue`,2),hd=fd(`BagUnion`,`tlc2.value.impl.Value`,1),gd=fd(`BagOfAll`,`tlc2.value.impl.Value`,2),_d=fd(`BagCup`,`tlc2.value.impl.Value`,2),vd=fd(`BagCardinality`,`tlc2.value.impl.IntValue`,1),yd=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Nr(e)}`;throw Fr(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')`)},bd=(e,t,n)=>{let r=yd(e,n)+yd(t,n);if(Or(r))throw kr(`${e}+${t}`);return r},xd=(e,t,n,r)=>{let i=dd(n,e.domain[t]),a=yd(e.range[t],r);return i===void 0?a:a-yd(i,r)|0},Sd=(e,t)=>Nt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>et(e[0],r));a?a[1]=bd(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Cd=$e([],[]),wd=[wr(`EmptyBag`,Cd),Q(`IsABag`,1,e=>{let t=od(Z(e,0,`IsABag`));return t!==void 0&&ud(t)}),Q(`BagCardinality`,1,e=>{let t=Z(e,0,`BagCardinality`);return sd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw id(`BagCardinality`,`a bag`,t);return bd(e,n,vd)},0)}),Q(`BagIn`,2,e=>{let t=Z(e,1,`BagIn`),n=dd(sd(e,1,`BagIn`),Z(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw ad(`second`,`BagIn`,`bag`,t);return n>0}),Q(`CopiesIn`,2,e=>{let t=Z(e,1,`CopiesIn`),n=dd(sd(e,1,`CopiesIn`),Z(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw ad(`second`,`CopiesIn`,`bag`,t);return n}),Q(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=cd(e,t,`(+)`);if(!ud(n))throw ad(t===0?`first`:`second`,`(+)`,`bag`,Z(e,t,`(+)`));return n});return Sd(t,_d)}),Q(`\\ominus`,2,e=>{let t=cd(e,0,`(-)`),n=cd(e,1,`(-)`);return Nt(t.domain.flatMap((e,r)=>{let i=xd(t,r,n,pd);return i>0?[[e,i]]:[]}))}),Q(`BagUnion`,1,e=>{let t=Z(e,0,`BagUnion`),n=ld(t,()=>id(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Cd;let r=n.map(e=>{let n=od(e);if(!n)throw new x(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${Y(t)}`);return n});return Sd(r,hd)}),Q(`\\sqsubseteq`,2,e=>{let t=sd(e,0,`\\sqsubseteq`),n=sd(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>xd(t,r,n,md)<=0)}),Tr(`BagOfAll`,2,e=>{let t=Cr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new x(`The first argument of BagOfAll should be an operator, but instead it is:\n${Y(t.literalBody)}`);let n=Z(e,1,`BagOfAll`),r=od(n);if(!r)throw ad(`second`,`BagOfAll`,`function with a finite domain`,n);return Sd(r.domain.map((e,n)=>$e([t.call([e])],[r.range[n]])),gd)}),Q(`SubBag`,1,e=>{let t=Z(e,0,`SubBag`);if(!P(t))throw new b(`DOMAIN expects a function but received ${Y(t)}`);let n=xn(t),r=Dt(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new b(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${Y(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new b(`Attempted to apply a function to ${Y(n)}, which is not in its domain`);return Dt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>$e(e.map(e=>e[0]),e.map(e=>e[1]))))}),Q(`BagToSet`,1,e=>Nn(sd(e,0,`BagToSet`))),Q(`SetToBag`,1,e=>{let t=Z(e,0,`SetToBag`),n=ld(t,()=>id(`BagToSet`,`a function with a finite domain`,t));return $e([...n],n.map(()=>1))})],Td=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Ed=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Dd=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Od=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,kd=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Ad=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,jd=e=>{if(!P(e))return!1;let t=xn(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Md=(e,t)=>Fr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Nr(t)}`),Nd=(e,t)=>Fr(e,`Cannot cast tlc2.value.impl.${Nr(t)} to tlc2.value.impl.StringValue`),Pd=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Fd=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Md(t,e);return`[${q(e).elements.map(e=>Ld(e,t)).join(`,`)}]`},Id=(e,t)=>{let n=xn(e),r=hn(n);return r?`[${r.map(e=>Ld(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Pd(typeof e==`string`?e:Y(e))}:${Ld(n.range[r],t)}`).join(`,`)}}`},Ld=(e,t)=>typeof e==`string`?Pd(e):typeof e==`object`?e.kind===`ModelValue`?Pd(e.name):Me(e)?Fd(e,t):Id(e,t):String(e),Rd=e=>{if(Me(e))return Fd(e,Td);if(!P(e)||jd(e))throw Md(Td,e);return Id(e,Td)},zd=e=>{if(!P(e))throw Md(Ed,e);return Id(e,Ed)},Bd=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))},Vd=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Be(e);if(Array.isArray(e))return Ut(e.map(e=>Vd(e,t)));if(typeof e==`object`&&e)return Wt(Object.entries(e).map(([e,n])=>[Be(e),Vd(n,t)]));throw Fr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Hd=(e,t)=>{if(e.trim()===``)return Vd(null,t);try{return Vd(JSON.parse(e,(e,t,n)=>typeof t==`number`?Bd(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Fr(t,e.message):e}},Ud=(e,t)=>{if(typeof e!=`string`)throw Nd(t,e);return e},Wd=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Fr(n,`${t} (No such file or directory)`);return r},Gd=e=>[Er(`ToJson`,1,e=>Be(Ld(Z(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Er(`ToJsonArray`,1,e=>Be(Rd(Z(e,0,`ToJsonArray`)))),Er(`ToJsonObject`,1,e=>Be(zd(Z(e,0,`ToJsonObject`)))),Er(`JsonSerialize`,2,t=>{let n=Ud(Z(t,0,`JsonSerialize`),Dd),r=Z(t,1,`JsonSerialize`);if(!hn(r)&&!jd(r))throw new x(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${Y(r)}`);return e.writeFile?.(n,Ld(r,Dd)),!0}),Er(`ndJsonSerialize`,2,t=>{let n=Ud(Z(t,0,`ndJsonSerialize`),Od),r=Z(t,1,`ndJsonSerialize`),i=hn(r);if(!i)throw new x(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${Y(r)}`);return e.writeFile?.(n,i.map(e=>`${Ld(e,Od)}\n`).join(``)),!0}),Er(`JsonDeserialize`,1,t=>{let n=Ud(Z(t,0,`JsonDeserialize`),kd);return Hd(Wd(e,n,kd),kd)}),Er(`ndJsonDeserialize`,1,t=>{let n=Ud(Z(t,0,`ndJsonDeserialize`),Ad);return Ut(Wd(e,n,Ad).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Hd(e,Ad)))})],Kd=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),qd=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Kd(t,n,`nonnegative integer`,Y(e));return e},Jd=(e,t,n,r)=>{if(!Me(e)||!Yt(e))throw Kd(t,n,r,Y(e));return q(e).elements},Yd=(e,t,n,r)=>Dt(Array.from({length:t},()=>Dt(e.filter(()=>r.nextDouble()<n)))),Xd=(e,t)=>{let n=`RandomSetOfSubsets`,r=qd(Z(e,0,n),`first`,n),i=qd(Z(e,1,n),`second`,n),a=Jd(Z(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Kd(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Kd(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Yd(a,r,a.length===0?0:i/a.length,t.getRandom())},Zd=e=>[Er(`RandomSubset`,2,t=>{let n=Z(t,0,`RandomSubset`);if(typeof n!=`number`)throw Kd(`first`,`RandomSubset`,`nonnegative integer`,Y(n));if(n<0)throw new b(`Attempted to apply the operator overridden by the Java method\npublic static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value),\nbut it produced the following error:\n${n}`);let r=Z(t,1,`RandomSubset`);if(!Me(r)||!cn(r)&&!Yt(r))throw Kd(`second`,`RandomSubset`,`a finite set`,Y(r));return Dt(cu(n,r,e.getRandom()))}),Er(`RandomSetOfSubsets`,3,t=>Xd(t,e)),Er(`TestRandomSetOfSubsets`,3,t=>Ut(Array.from({length:5},()=>q(Xd(t,e)).elements.length)))],Qd=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,$d=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Qd})`,ef=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Qd}) throws java.io.IOException`,tf=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Qd})`,nf=()=>Wt([[`action`,Dt([])],[`state`,Dt([])]]),rf=()=>Wt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),af=e=>Wt([[`name`,e??`UnnamedAction`],[`location`,rf()]]),of=(e,t)=>{let n=e.map((e,t)=>Ut([t+1,Wt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>Ut([n[r],af(e[r+1].action),t])),i=t?[Ut([n[n.length-1],af(t.action),n[t.start]])]:[];return Wt([[`action`,Dt([...r,...i])],[`state`,Dt(n)]])},sf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return pu(e).get(t)},cf=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),Y(r));else throw new x(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${Y(n)}`)},lf=e=>e.every(e=>e!==void 0),uf=(e,t)=>Wt(t.variables.map((t,n)=>[t,e[n]])),df=(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&&!X(e)){if(t.variableIndex.has(r))return!0;let e=os(r,t);if(e&&!n.has(e)&&(n.add(e),df(e.body,t,n)))return!0}return dr(e).some(e=>df(e,t,n))},ff=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[Q(`AssertEq`,2,t=>{let n=Z(t,0,`AssertEq`),r=Z(t,1,`AssertEq`),i=et(n,r);return i||(e(Y(`Assertion failed`,!0)),e(Y(n,!0)),e(Y(r,!0))),i}),Hr(`AssertError`,2,e=>{let t=Cr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Fr($d,`In computing AssertError, a non-string expression (line ${t.location.line}, col ${t.location.column}) was used as the err of an AssertError(err, exp).`);let n=Ur(e,0,`AssertError`)();try{Ur(e,1,`AssertError`)()}catch(e){if(e instanceof b)return e.message===n;throw e}return!1}),Er(`TLCGetOrDefault`,2,e=>{let n=Z(e,0,`TLCGetOrDefault`);return sf(t,n)??Z(e,1,`TLCGetOrDefault`)}),{...Tr(`TLCGetAndSet`,4,n=>{let r=Z(n,0,`TLCGetAndSet`),i=sf(t,r)??Z(n,3,`TLCGetAndSet`),a=Cr(n,1,`TLCGetAndSet`);return cf(t,e,r,a.call([i,Z(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Er(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!lf(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Fr(ef,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Ut(t.getBehavior(r).map(e=>uf(e,n.environment)))}),Er(`CounterExample`,0,()=>t.counterExample??nf()),Q(`ToTrace`,1,e=>{let t=Z(e,0,`ToTrace`);if(!P(t)||!et(Nn(t),Dt([`action`,`state`])))throw new b(`The argument of ToTrace should be a CounterExample, but instead it is:\n${Y(t)}`);let n=q(jn(t,`state`)).elements.map(e=>hn(e)??[]);return Ut(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),Q(`TLCModelValue`,1,e=>{let t=Z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new x(`The argument of ModelValue should be a string, but instead it is:\n${Y(t)}`);return Ze(t)}),Hr(`TLCDefer`,1,()=>!0),Q(`TLCNoOp`,1,e=>Z(e,0,`TLCNoOp`)),Hr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!lf(r))throw Fr(tf,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||as(Ur(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new te(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Hr(`TLCCache`,2,(e,t)=>{let r=Cr(e,0,`TLCCache`),a=er(Ur(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=df(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),Q(`TLCFP`,1,e=>Number(BigInt.asIntN(32,ql([Z(e,0,`TLCFP`)])))),Er(`TLCEvalDefinition`,1,(e,t)=>{let n=Z(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?os(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new x(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${Y(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new x(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return _c({kind:`Identifier`,name:n,location:r.location},t)})]},pf=(e,t)=>[Er(`_Track`,2,e=>{let n=String(Z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,Z(e,0,`_Track`)===!0?r+1:r),!0}),Er(`_Counts`,0,()=>fu(t)),Er(`_CheckName`,1,n=>{let r=String(Z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(Y(fu(t),!0)),!1)}),Er(`_PrintCounts`,0,()=>(e(Y(fu(t),!0)),!0))],mf=e=>String(e).padStart(2,`0`),hf=e=>`${e.getUTCFullYear()}.${mf(e.getUTCMonth()+1)}.${mf(e.getUTCDate())}.${mf(e.getUTCHours())}${mf(e.getUTCMinutes())}${mf(e.getUTCSeconds())}`,gf=e=>Nt([...e].map(([e,t])=>[e,Ut([t])])),_f=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),vf=(e,t,n)=>{if(!e.isStarted&&_f.has(t))throw new b(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Wt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Wt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Wt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Be(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Be(hf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return af(void 0);case`all`:return gf(e.registers);case`all:named`:return gf(pu(e))}if(t.startsWith(`s:`)){let n=pu(e).get(t);if(n===void 0)throw new b(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Be(e.properties.get(t.slice(2))??t);throw new b(`TLCGet(${t}) was undefined.`)},yf=e=>e.length===0?[[]]:e.flatMap((t,n)=>yf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),bf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&q(e).elements.forEach(bf),e.kind===`Function`&&e.range.forEach(bf))},xf=(t,n)=>[Q(`Print`,2,e=>(t(`${Oe(Y(Z(e,0,`Print`),!0,!0))} ${Oe(Y(Z(e,1,`Print`),!0,!0))}`),Z(e,1,`Print`))),Q(`PrintT`,1,e=>(t(Oe(Y(Z(e,0,`PrintT`),!0,!0))),!0)),Q(`Assert`,2,t=>{if(Z(t,0,`Assert`)!==!0)throw new x(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Oe(Y(Z(t,1,`Assert`)))}`,e.assertViolation);return!0}),Q(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),Q(`:>`,2,e=>Nt([[Z(e,0,`:>`),Z(e,1,`:>`)]])),Q(`@@`,2,e=>{let t=Sr(e,0,`@@`),n=Sr(e,1,`@@`);return Pt([...I(t),...I(n)])}),Q(`ToString`,1,e=>Be(Y(Z(e,0,`ToString`),!0))),Q(`TLCEval`,1,e=>{let t=Z(e,0,`TLCEval`);return bf(t),t}),Q(`Permutations`,1,e=>{let t=br(e,0,`Permutations`);return Dt(yf(t).map(e=>Nt(t.map((t,n)=>[t,e[n]]))))}),Tr(`SortSeq`,2,e=>{let t=Cr(e,1,`SortSeq`);return Ut(xr(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)]},[]))}),Er(`TLCGet`,1,(e,t)=>{let r=Z(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new b(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new b(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${Y(r)}`);return vf(n,r,t?.state)}),Er(`TLCSet`,2,e=>{let r=Z(e,0,`TLCSet`);return cf(n,t,r,Z(e,1,`TLCSet`)),!0}),wr(`Any`,qe),Q(`RandomElement`,1,e=>uu(vr(e,0,`RandomElement`),n.getRandom()))],Sf=/* @__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(`,`),Cf=[[`\\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`,`≀`],[`^+`,`⁺`]],wf=/* @__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(`,`),Tf=/* @__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(`.`),Ef=/* @__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(`.`),Df=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
103
113
  Nat == { }
104
114
  a+b == {a, b}
105
115
  a-b == CHOOSE n : b + n = a
@@ -415,16 +425,15 @@ _CheckName(name) ==
415
425
  => (PrintT(counts) /\\ FALSE)
416
426
  _PrintCounts == PrintT(_Counts)
417
427
  =============================================================================
418
- `]]),$u=/* @__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)`],[`TLCGet`,`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)`],[`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)`]])]]),ed=(e,t)=>e.every(e=>hn(e,t)),td=Ot([!1,!0]),nd=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Nt(nd(e,t,r),nd(e,r,n))},rd=[`\\cup`,`\\cap`,`\\`],id=e=>typeof e==`object`&&e.kind===`MixedSet`,ad=e=>e.kind===`Interval`?B(e).elements:e.elements,od=(e,t,n)=>{let r=ad(t);if(e!==`\\cup`){let t=e===`\\cap`;return kt(r.filter(e=>hn(e,n)===t))}if(r.length===0)return n;if(!Ee(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=B(n).elements.filter(e=>!hn(e,t));return kt([...r,...i])},sd=[_r(`TRUE`,!0),_r(`FALSE`,!1),_r(`BOOLEAN`,td),_r(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),br(`=`,Et),br(`#`,(e,t)=>!Et(e,t)),K(`~`,1,e=>!lr(e,0,`~`)),K(`<=>`,2,e=>lr(e,0,`<=>`)===lr(e,1,`<=>`)),K(`/\\`,2,e=>lr(e,0,`/\\`)&&lr(e,1,`/\\`)),K(`\\/`,2,e=>lr(e,0,`\\/`)||lr(e,1,`\\/`)),K(`=>`,2,e=>!lr(e,0,`=>`)||lr(e,1,`=>`)),K(`\\in`,2,e=>hn(G(e,0,`\\in`),G(e,1,`\\in`))),K(`\\notin`,2,e=>!hn(G(e,0,`\\notin`),G(e,1,`\\notin`))),K(`\\subseteq`,2,e=>{let t=ur(e,0,`\\subseteq`),n=ur(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&z(t.base)?ed(B(t.base).elements,n.base):ed(B(t).elements,n)}),...rd.map(e=>K(e,2,t=>{let n=ur(t,0,e),r=ur(t,1,e);return Ee(n)&&Ee(r)&&!id(n)&&!id(r)?e===`\\cup`&&V(n)?r:(e===`\\cup`?Nt:e===`\\cap`?Mt:jt)(B(n),B(r)):Ee(n)?od(e,n,r):e!==`\\`&&Ee(r)?od(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),K(`SUBSET`,1,e=>({kind:`Subset`,base:ur(e,0,`SUBSET`)})),K(`UNION`,1,e=>{let t=ur(e,0,`UNION`),n=mt(t)?t.elements.filter(mt):[];if(!mt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(id(t)||n.some(id)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{hn(t,e)||e.elements.push(t)})),kt(e.elements)}return n.length===0?At:nd(n.map(B),0,n.length)}),K(`DOMAIN`,1,e=>{let t=G(e,0,`DOMAIN`);if(!N(t))throw new v(`DOMAIN expects a function but received ${U(t)}`);return kn(t)})],cd=jr(`DotDot`,`IntervalValue`,2),ld=jr(`Neg`,`IntValue`,1),ud=[_r(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),Mr(`+`,`Plus`,(e,t)=>e+t),Mr(`-`,`Minus`,(e,t)=>e-t),Mr(`*`,`Times`,(e,t)=>e*t),Mr(`^`,`Expt`,(e,t)=>{if(t<0)throw new y(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new y(`0^0 is undefined.`);return e**t}),Mr(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new y(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(xr(n))throw Sr(`${e} \\div ${t}`);return n}),Mr(`%`,`Mod`,(e,t)=>{if(t<=0)throw new y(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),Pr(`<`,(e,t)=>e<t),Pr(`>`,(e,t)=>e>t),Pr(`<=`,(e,t)=>e<=t),Pr(`>=`,(e,t)=>e>=t),K(`..`,2,e=>({kind:`Interval`,low:Ar(G(e,0,`..`),cd),high:Ar(G(e,1,`..`),cd)}))],dd=[_r(`Int`,{kind:`InfiniteSet`,name:`Int`}),K(`-.`,1,e=>{let t=Ar(G(e,0,`-`),ld);if(xr(-t))throw Sr(`-${t}`);return-t})],fd=(e,t,n)=>{let r=G(e,t,n),i=fn(r);if(!i)throw new y(`${n}\n${U(r)}`);return i},pd=(e,t,n)=>{let r=G(e,t,n);return typeof r==`string`?r:fd(e,t,n)},md=(e,t,n)=>typeof e==`string`?Ve(e.slice(t,n)):R(e.slice(t,n)),hd=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,gd=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,_d=(e,t)=>{let n=$u.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?kr(e,t):e}):t},vd=_d(`Sequences`,[K(`Seq`,1,e=>({kind:`SequenceSet`,base:G(e,0,`Seq`)})),K(`Len`,1,e=>pd(e,0,hd(``,`Len`)).length),K(`\\o`,2,e=>{let t=pd(e,0,gd(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=fd(e,1,gd(`t \\o s`,`sequence`));return R([...t,...n])}let n=G(e,1,`\\o`);if(typeof n!=`string`)throw new y(`${gd(`t \\o s`,`string`)}\n${U(n)}`);return Ve(t+n)}),K(`Append`,2,e=>R([...fd(e,0,gd(`Append(s, v)`,`sequence`)),G(e,1,`Append`)])),K(`Head`,1,e=>{let t=fd(e,0,hd(``,`Head`));if(t.length===0)throw new y(`Attempted to apply Head to the empty sequence.`);return t[0]}),K(`Tail`,1,e=>{let t=pd(e,0,hd(``,`Tail`));if(t.length===0)throw new y(`Attempted to apply Tail to the empty sequence.`);return md(t,1)}),K(`SubSeq`,3,e=>{let t=pd(e,0,hd(`first `,`SubSeq`)),n=cr(e,1,`SubSeq`),r=cr(e,2,`SubSeq`);if(n>r)return md(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new y(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${U(G(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return md(t,n-1,r)}),vr(`SelectSeq`,2,e=>{let t=gr(e,1,`SelectSeq`);return R(fd(e,0,hd(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new y(`The second argument of SelectSeq should be a operator, but instead it is:\n${U(n)}`);return n}))})]),yd=_d(`FiniteSets`,[K(`IsFiniteSet`,1,e=>{let t=G(e,0,`IsFiniteSet`);if(M(t))return un(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new v(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${U(t)}\nis a finite set.`:`Attempted to check if the ${De(t)} ${U(t)} is a finite set.`)}),K(`Cardinality`,1,e=>{let t=G(e,0,`Cardinality`);if(!M(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new y(`Attempted to compute cardinality of the value\n${U(t)}`);return cn(t)})]),bd=/* @__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`]]]),xd=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:ud};case`Integers`:return{extends:[`Naturals`],operators:dd};case`Sequences`:return{extends:[],operators:vd};case`FiniteSets`:return{extends:[],operators:yd};case`TLC`:return{extends:[],operators:_d(`TLC`,Ku(t,n))};case`Randomization`:return{extends:[],operators:Cu(n)};case`_Possible`:return{extends:[],operators:Ru(t,n)};case`Json`:return{extends:[],operators:_u(r)};case`Bags`:return{extends:[],operators:Xl};case`TLCExt`:return{extends:[],operators:Lu(t,n)};default:return}},Sd=`$subexpression`,Cd=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),wd=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Td=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Ed=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}},Dd=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:ai(e.bounds),body:e.body,sets:wd(e.bounds)};case`SetMap`:return{names:ai(e.bounds),body:e.expression,sets:wd(e.bounds)};case`SetFilter`:return{names:ii(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:ii(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}},Od=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Od(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ir(e)){let e=Od(r,t,n);if(e)return e}},kd=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,Ad=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),jd=(e,t)=>{let n=e.location,r=Ad(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 Cd(`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 Cd(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Sd,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Sd,args:e.args,location:n,resolution:Jr},location:n}},Md=(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:Jr})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Jr}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Jr};return jd({...t,params:[...t.params,...r]},a)},Nd=(e,t,n,r)=>{let i={params:[],args:[],lets:[],location:n},a={index:0,current:void 0},o=i=>{let o=[],s=[];for(;a.index<e.length;){let c=e[a.index];if(c.kind!==`Name`)throw Cd(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>Wi(e)===l):t(l);if(u)return{definition:u,args:kd(s,$r(u),r)};a.index++}throw Cd(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=$r(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw Cd(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw Cd(`Cannot select a subexpression of ${s.name}`,n);i.params.push(...s.params),i.args.push(...r.args),a.current=s.body,a.index++},c=()=>{for(;a.index<e.length;){let t=e[a.index];if(t.kind!==`Name`)return;let o=a.current&&Od(a.current,t.name,[]);if(!o)throw Cd(`Cannot find label ${t.name}`,n);i.lets.push(...o.lets),i.params.push(...o.label.params.map(e=>({name:e,arity:0}))),i.args.push(...kd(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw Cd(`Subexpression selection failed`,n);if(t.kind===`Colon`)return;if(o.kind===`Label`){a.current=o.body,l(t);return}if(o.kind===`Let`){if(t.kind!==`Operand`||Td(t.operand,1)!==0)throw Cd(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=Dd(o);if(s&&(t.kind===`Bound`||t.kind===`At`)){i.params.push(...s.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&i.args.push(...kd(t.args,s.names.length,r)),a.current=s.body;return}if(o.kind===`Case`&&t.kind===`Operand`){let r=[...o.arms,...o.other?[{condition:void 0,body:o.other}]:[]],i=r[Td(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw Cd(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=Td(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Cd(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw Cd(`Unexpected subexpression selector`,n);let c=s?s.sets:Ed(o),u=c?.[Td(t.operand,c.length)];if(!u)throw Cd(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return Md(u.definition,{...i,args:u.args});for(c();a.index<e.length;){let t=e[a.index];if(t.kind===`Name`){for(;a.current?.kind===`Label`;)a.current=a.current.body;if(a.current?.kind!==`Let`)throw Cd(`A name selector here must be from a LET clause`,n);i.lets.push(a.current.definitions);let e=s(a.current.definitions);if(e)return Md(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw Cd(`Subexpression selection failed`,n);return jd(i,a.current)},Pd=(e,t)=>{if(!e.includes(`!`)||t(e))return;let n=e.split(`!`),r=n.findIndex((e,r)=>t(n.slice(0,r+1).join(`!`)));if(r!==-1)return[{kind:`Name`,name:n.slice(0,r+1).join(`!`),args:[]},...n.slice(r+1).map(e=>({kind:`Name`,name:e,args:[]}))]},Fd=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ir(e).some(Fd),Id=(e,t)=>{if(!Fd(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return qi(e,e=>Id(e,n))}let n=qi(e,e=>Id(e,t));if(n.kind===`Subexpression`)return Nd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=Pd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=Nd(i,t,n.location,a);if(a.length>0)throw Cd(`Too many arguments for ${r}`,n.location);return o},Ld=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Rd=(e,t)=>{let n=Ld(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:Id(e.expression,n)}))}},zd=(e,t)=>{let n=Ld([...t,...e.definitions]);return e.definitions.some(e=>Fd(e.body))||e.assumptions.some(e=>Fd(e.expression))?{...e,definitions:e.definitions.map(e=>Ki(e,e=>Id(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:Id(e.expression,n)}))}:e},Bd=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}])),Vd=(e,t)=>`${e}${t}`,Hd=(e,t,n)=>`${e}${t}${n}`,Ud=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Wd=(e,t,n)=>`${e},${t},${n}`,Gd=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Kd=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),qd=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Jd=(e,t,n,r)=>({...Gd(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Yd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Xd=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Zd=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,{...Jd(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Qd=Jd(`$Set`,0,[2],[1]),$d=Jd(`$Junction`,0,[3],[1]),ef=Jd(`$Choose`,0,[2],[1]),tf=Jd(`$Function`,0,[3],[1]),nf=Jd(`$FcnApply`,0,[2,2],[1,1]),rf=Jd(`$RcdSelect`,0,[2,0],[1,1]),af=Jd(`'`,2,[1],[0]),of=Jd(`ENABLED`,1,[2],[0]),sf=Jd(`[]`,3,[3],[0]),cf=Jd(`$SquareAct`,2,[2,1],[0,0]),lf=Jd(`$WF`,3,[1,2],[0,0]),uf=Jd(`$TemporalExists`,3,[3],[0]),df=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),ff=e=>e.map(e=>({name:e,arity:0})),pf=(e,t)=>t.location.range?g(`${e}.`,t.location.range):new p(`${e} at line ${t.location.line}, column ${t.location.column}`),mf=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),hf=e=>e.kind!==`Let`&&e.kind!==`Label`,gf=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i)return{kind:`Defined`,levels:v(i,/* @__PURE__ */ new Map)};let a=Zd.get(t)??Bd.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Gd(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(Hd(e,n,t))}),t.data.constraints.forEach((e,t)=>Kd(r.constraints,t,e)),qd(r.argConstraints,Vd(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>qd(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Yd(e,n))throw new p(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new p(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Wd(t,n,r)),s=Gd(Math.max(e.level,...t.filter((t,n)=>Xd(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{Xd(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Kd(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Kd(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Kd(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Kd(s.constraints,t,Yd(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Kd(s.constraints,e,Yd(r,a)))}))}),e.argParams.forEach(e=>{let t=Ud(e),n=a(t.operator)?.operator;n&&Kd(s.constraints,t.param,Yd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>qd(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>qd(s.argConstraints,Vd(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&qd(s.argConstraints,Vd(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Ud(e),n=a(t.operator);n&&qd(s.argConstraints,Vd(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Ud(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Ud(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Hd(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(Hd(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Hd(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,ff(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,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=Gd();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=df(n,ff(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw pf(`Formula has both temporal formula and action as arguments`,t)},u=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw pf(`Action used where only temporal formula or state predicate allowed`,e);mf.has(e.operator)&&l(t,e)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&hf(n)&&n.kind!==r)throw pf(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},f=(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=v(e,n);t.constraints.forEach((e,t)=>Kd(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>qd(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof p)||t.sany?t:pf(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Gd();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return u(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i($d,n)}case`Prime`:case`Unchanged`:return s(af,[e.expression],t);case`Enabled`:return s(of,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(sf,[n])}case`If`:return s($d,[e.condition,e.consequent,e.alternative],t);case`Case`:return s($d,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return f(e,t);case`Forall`:case`Exists`:{let n=s($d,[e.body],t,e.bounds.map(e=>e.set),ai(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw pf(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?uf:$d,[e.body],t,[],e.names);case`Choose`:return s(ef,[e.body],t,e.set?[e.set]:[],ii(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Qd,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Qd,[e.predicate],t,[e.bound.set],ii(e.bound.pattern));case`SetMap`:return s(Qd,[e.expression],t,e.bounds.map(e=>e.set),ai(e.bounds));case`FunctionConstruction`:return s(tf,[e.body],t,e.bounds.map(e=>e.set),ai(e.bounds));case`Record`:return s(tf,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Qd,e.fields.map(e=>e.value),t);case`Except`:return s(Qd,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(nf,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Qd,e.args,t)}]);case`FieldAccess`:return i(rf,[a(e.record,t),{data:Gd()}]);case`BoxAction`:case`AngleAction`:return s(cf,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(lf,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Gd()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||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 ir(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,df(t,ff(e.names))),i;default:return qi(e,(e,n)=>(a(e,r,df(t,ff(n))),e)),i}},_=(e,t,n,r)=>{let i=df(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Gd(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(Vd(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(Hd(e.name,n,t.name))).map(e=>Wd(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(Ud(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Ud(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Gd(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},_f=(e,t,n)=>{let r=new Map(t);e.assumptions.forEach(e=>{e.kind===`NewSymbol`?(e.set&&n.analyze(e.set,r),r.set(e.name,{kind:`Formal`,arity:e.arity})):e.kind===`AssumeProve`?_f(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},vf=(e,t)=>{let n=gf(t);Li([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>n.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>n.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>e.statement.kind===`AssumeProve`?_f(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map)}))])},yf=(e,t)=>e.maxLevels[t]??3,bf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=gf({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=>Kd(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Kd(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>qd(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Ud(e);t(n.operator,n.param)&&c.argParams.add(e)})};return s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n))),a.assumptions.forEach(e=>l(o.analyze(e,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c},o=/* @__PURE__ */ new Set;if(e.forEach(e=>{let n=`at line ${e.location.line}, column ${e.location.column}`,i=e=>o.add(`${e} ${n}`),s=t(e.module),c=a(e.module),l=r(e.instancer),u=/* @__PURE__ */ new Map;e.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(t=>{let n=e.substitutions.get(t.name);if(!n)return[];if(t.arity===0){let e=l.analyze(n,u);return[{...t,level:e.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...t,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(t,n)=>`Level error in instantiating module '${e.module}': the level of the expression or operator substituted for '${t}' must be at most ${n}`;d.forEach(t=>{!c.isConstant&&t.level>t.maximumLevel&&i(f(t.name,t.maximumLevel)),t.isLeibniz||i(`Error in instantiating module '${e.module}': a non-Leibniz operator substituted for '${t.name}'`)}),d.forEach(t=>{let n=c.constraints.get(t.name);n!==void 0&&t.level>n&&i(f(t.name,n));let r=t.operator;r&&Array.from({length:t.arity},(n,a)=>{let o=c.argConstraints.get(Vd(t.name,a));o!==void 0&&yf(r,a)<o&&i(`Level error in instantiating module '${e.module}': the level of the argument ${a+1} of the operator ${r.name} must be at least ${o}`)})}),c.argParams.forEach(t=>{let n=Ud(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=yf(r,n.index);a.level>o&&i(`Level error when instantiating module '${e.module}': the level of the argument ${n.index} of the operator ${n.operator}' must be at most ${o}`)})}),o.size>0)throw new p([...o].join(`
419
- `))},xf=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Sf=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Cf=new Map(Ju.flatMap(e=>e.map(t=>[t,e[0]]))),wf=e=>Cf.get(e)??e,Tf=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Ef=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(Tf(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},Df=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),Of=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:wf(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:wf(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}},kf=(e,t)=>{let n=[];for(let r=t;;){let t=Of(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Af=e=>({line:e.line,column:e.column}),jf=(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(a.text===`EXTENDS`){let n=kf(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},Mf=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Nf={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Pf=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Mf(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Mf(e[n+1],e[n+2])?n+=Mf(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=>Nf[e])}"`:r.text)}return t},Ff=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},If=(e,t)=>e.find(e=>e.name===t)??e.map(e=>If(e.modules,t)).find(Boolean),Lf=(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:Qu.get(i)??t?.(i)??Wc(e,i),s=o===void 0?[]:ue(o),c=Ff(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Kc(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>If(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},Rf=(e,t,n)=>{let r=Lf(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=kf(t,e+1);r.push({location:Af(t[e]),apply:e=>i.forEach(t=>e.put(Df(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:Af(u),apply:t=>t.put(Df(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&kf(t,l+1).every(e=>s.has(e))&&a(l,`definition`),Sf.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(Af(u)),r.push({location:Af(u),apply:e=>e.put(Df(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(Df(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=wf(e.name);r.push({location:e.location,apply:n=>n.put(Df(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(Df(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Df(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Qr(e.location,t.location)?-1:+!!Qr(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=Ef();a.set(e??``,n),qu.toReversed().forEach(e=>n.put(Df(e,`builtin`,!1)));let s=r(e);return s.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||n.put(e)})),i(s).forEach(e=>e.apply(n)),n};return o(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse()},zf=(e,t,n)=>{let r=Lf(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Yu.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=jf(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;Pf(s(void 0)).forEach((e,t)=>{t===3&&Zu.forEach(a),a(e)});let b=u(void 0);for(;;){let e=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),Pf(s(n)).forEach(a))}xf.forEach(a);let x=/* @__PURE__ */ new Set,ee=e=>{if(x.has(e))return;x.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return ee(void 0),Xu.forEach(a),[...i]},Bf=t=>{switch(t.kind){case`Number`:try{return Oe(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Xe(t.name);case`Set`:return Ot(t.elements.map(Bf))}},Vf=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Hf=e=>new p(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Uf=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Jr},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Wf=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>U(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new v(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&$e(t,r)})});if(t)return t[1];throw new v(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:U(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Gf=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||ir(e).some(e=>Gf(e,t)),Kf=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(na(e),n.get(e)??n.size)),n},qf=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Jf=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Co(e);if(e.kind===`Number`&&!fs(e.value))throw wo(e);Jf(e.kind===`Let`?[...ir(e),...qf(e.instances??[])]:ir(e))}),Yf=(e,t)=>{let n=Kc(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(sd.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=Dl(e.checkDeadlock,t.seed),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=[],f=/* @__PURE__ */ new Map,h=[],g=[],b=(e,t)=>h.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),x={value:0},ee=e=>`${e}#${x.value++}`,te=[],ne=/* @__PURE__ */ new Map,re=e=>{let n=s.get(e);if(n)return n;let r=xd(e,t.print,c,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>re(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{o.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),s.set(e,i),i},ie=e=>{let t=re(e);return t&&b(e,bd.get(e)??[]),t},S=e=>(Jf([...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]),...qf(e.instances)]),e.modules.forEach(S),e);S(n);let C=(e,n)=>{let r=t.loadModule?.(e)??pc.get(e)??Wc(t.source,e);if(r===void 0)throw m([{location:`In module ${n}`,message:`Cannot find source file for module ${e} imported in module ${n}.`}],!0);let i=Kc(r);if(i.name!==e)throw m([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return S(i)},ae=e=>{let t=g.indexOf(e.name);if(t!==-1)throw new p(`Circular dependency among .tla files; dependency cycle is: ${[...g.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];g.push(e.name),h.push(n);let i=k(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});h.pop(),g.pop();let a=r.find(e=>n.has(e.name));if(a)throw Hf(a);return{linked:i,closure:n}},oe=(e,t)=>{let n=l.get(e);if(n)return b(e,f.get(e)??[]),n;let r=ae(C(e,t));return l.set(e,r.linked),f.set(e,r.closure),b(e,r.closure),r.linked},w=(e,t,n,o,s)=>{let c=s?void 0:ie(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??oe(e.module,t.name),u=Vf(l),d=`#${x.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=Ii(Rd(e,t),u,t,n);te.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=ma({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,Vi(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=ee(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:ee}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&ne.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&ne.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},se=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Jr})),T=(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:se(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),E=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),D=(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=E(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:se(r,n),location:n}}},O=(e,t,n,a)=>{let o=e.location,s=a?void 0:ie(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=E(n.arity);return T(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??oe(e.module,n),l=`#${x.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Vf(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};te.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Gf(f(e),p),h=d.map(t=>{let n=D(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=ma({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:se(e.params,o),location:o,resolution:Jr}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Jr}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:Uf(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=E(n.arity),a=[...e.params,...i];return T(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ce=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),k=(e,a)=>{let o=xc(e,t.loadClass?.(e.name)),s=new Map([...sd.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,f=[],p=[...o.constants],m=o.variables.map(e=>e.name),h=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:ie(e);if(n){g(n,!0);return}let r=t??oe(e,o.name);p.push(...r.constants.filter(e=>p.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{m.includes(e)||(m.push(e),h.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),f.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=p.length===0&&m.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,b=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),x=()=>new Map([...a.modules,...l]),ee=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Qr(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Qr(t.location,e)).map(e=>[e.name,{key:v(e),arity:$r(e)}])]),te=e=>{let t=x();if(t.has(e.name))throw Hf(e);a.nested.push(e);let n=k(e,{id:`${a.id}/${e.name}`,symbols:ee(e.location),modules:t,nested:a.nested});l.set(e.name,n),u.has(e.name)||u.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=w(e,o,b(o),_,x().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>te(e)}))].sort((e,t)=>Qr(e.location,t.location)?-1:1).forEach(e=>e.link()),Pi(o,b(o));let ne=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Qr(e.location,t.location)},re=e=>{let t=o.modules.find(t=>t.name===e.module);return t?ne(t)?l.get(t.name):void 0:x().get(e.module)},S=zd(va(o,(e,t)=>O(e,t,o.name,re(e))),ce(s));Ri(S,b(S)),S.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:$r(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),vf(S,{constants:new Set(p.map(e=>e.name)),variables:new Set(m),getDefinition:e=>r.get(s.get(e)?.key??e)});let C={module:S,constants:p,variables:m,variableLocations:h,visible:s,exported:c,modules:l,extended:f};return d.push(C),C},le=ae(n).linked,ue=e=>le.visible.get(e)?.key??e;le.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let de=[],fe=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>fe(e,t)),de.push(...e.module.assumptions))};fe(le,/* @__PURE__ */ new Set);let A=le.constants.map(e=>e.name),pe=le.variables,me=e=>e.module===void 0?[e.name,ue(e.name)]:e.module===n.name||A.includes(e.name)?[]:[(l.get(e.module)??u.get(e.module))?.visible.get(e.name)?.key??e.name],he=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:le.constants.find(t=>t.name===e)?.arity??0},ge=/* @__PURE__ */ new Map,_e=/* @__PURE__ */ new Set,j=(e,t)=>{o.set(e,t),r.delete(e),ge.delete(e),_e.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Bf(e.value);me(e).forEach(e=>{let n=he(e);n===0?ge.set(e,t):j(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ve=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=ve.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new _(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Bf),Bf(e.value)]),ve.set(t,n)}),ve.forEach(e=>me(e).forEach(t=>j(t,Wf(e.name,he(t)||e.rows[0][0].length,e.rows))));let ye=new Map(e.substitutions.flatMap(e=>me(e).map(t=>[t,ue(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!A.includes(n)&&!le.visible.has(n))throw new _(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new _(`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 a=ue(i),s=r.get(a);if(!(s!==void 0||o.has(a)||ge.has(a)||A.includes(i)||pe.includes(i)))throw new _(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(le.constants.find(e=>e.name===n)?.arity??le.visible.get(n)?.arity))throw new _(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let be=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(me)),xe=(e,t)=>{if(be.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&xe(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=xe(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=T(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),le.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Se=A.filter(e=>!ge.has(e)&&!ye.has(e)&&!_e.has(e));if(Se.length>0)throw new _(`The constant parameter ${Rf(t.source,t.loadModule,`constant`).find(e=>Se.includes(e))??Se[0]} is not assigned a value by the configuration file.`);let Ce={runtime:c,definitions:r,builtins:o,constants:ge,substitutions:ye,variables:pe,variableIndex:Kf(pe,d.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};bf(te,e=>{let t=l.get(e)??u.get(e)??le;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let we=gf({constants:new Set(ge.keys()),variables:/* @__PURE__ */ new Set([...pe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>Ao(e,Ce)}),Te=e=>{try{X(e,{environment:Ce,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof v)return e;throw e}};return ye.forEach((e,t)=>{let n=r.get(e),i=A.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&we.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Te(n.body):void 0;if(i)throw new _(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof y?``:` - specifically: ${i.message}`}`)}),c.isStarted=!0,{environment:Ce,assumptions:de,variableLocations:le.variableLocations,instanceActions:ne}},Xf={kind:`Boolean`,value:!0},Zf={kind:`Boolean`,value:!1},Qf=e=>e?Xf:Zf,$f=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,ep=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),tp=(e,t,n)=>({kind:e,operands:[t,n]}),np=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?np(e,t.operands).operands:[t])}),rp=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return rp(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,rp(t)),0)}},ip=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 ip(e.body);case`And`:case`Or`:return e.operands.some(ip)}},ap=/* @__PURE__ */ new WeakMap,op={count:0},sp=e=>{let t=ap.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`#${op.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(sp).join(`,`)})`;default:return`${e.kind}(${sp(e.body)})`}})();return ap.set(e,n),n},cp=(e,t)=>e===t||sp(e)===sp(t),lp=(e,t)=>{let n=sp(t);return e.some(e=>e===t||sp(e)===n)},up=e=>e===`And`?`Or`:`And`,dp=(e,t)=>{switch(e.kind){case`Boolean`:return t?Qf(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return dp(e.body,!t);case`And`:case`Or`:return np(t?up(e.kind):e.kind,e.operands.map(e=>dp(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,dp(e.body,t))}}},fp=e=>{switch(e.kind){case`Boolean`:return Qf(!e.value);case`Not`:return e.body;case`And`:case`Or`:return np(up(e.kind),e.operands.map(fp));case`Always`:return Q(`Eventually`,fp(e.body));case`Eventually`:return Q(`Always`,fp(e.body));default:return Q(`Not`,e)}},pp=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=pp(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Qf(t)}return n.length===0?Qf(!t):n.length===1?n[0]:np(e.kind,n)}case`Not`:{let t=pp(e.body);return t.kind===`Boolean`?Qf(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=pp(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},mp=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,hp=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=hp(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new v(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>np(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=hp(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=mp(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:np(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return np(`Or`,n)}case`Not`:return $f(e.body)?e:hp(fp(e.body));default:return e}},gp=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?gp(e.operands[0]):np(e.kind,e.operands.map(gp));case`Not`:return e.body.kind===`Not`?gp(e.body.body):Q(`Not`,gp(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,gp(e.body));default:return e}},_p=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return _p(e.operands[0]);let t=Math.floor(e.operands.length/2);return tp(e.kind,_p(np(e.kind,e.operands.slice(0,t))),_p(np(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,_p(e.body));default:return e}},vp=(e,t)=>{e.kind===`Eventually`&&!lp(t,e)&&t.push(e),`body`in e&&vp(e.body,t),`operands`in e&&e.operands.forEach(e=>vp(e,t))},yp=e=>{let t=e.filter(ep),n=e.flatMap(e=>e.kind===`Not`&&ep(e.body)?[e.body]:[]);return!t.some(e=>lp(n,e))},bp=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,Q(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new v(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},xp=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Q(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Sp=(e,t,n)=>e.flatMap(e=>{let r=xp(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Cp=e=>[...new Set(e.map(sp))].sort().join(`|`),wp=(e,t)=>{let n=new Set(t.map(Cp));return[...e.filter(e=>!n.has(Cp(e))),...t]},Tp=e=>{let t=bp(e),n=Sp(t,`Always`,`And`),r=Sp(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=xp(t,`Eventually`,`Or`);if(n&&!(lp(e,n.first)||lp(e,n.second)))return wp(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(lp(e,t.first)||lp(e,t.second))&&!lp(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!yp(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=xp(t[e],`Always`,`And`);n&&(lp(t,n.first)||t.push(n.first),lp(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)lp(t,e.first)&&lp(t,e.second)&&!lp(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!yp(t)?[]:i(t)};return a(e)},Ep=e=>({particle:e,successors:[],statePredicates:e.filter(e=>rp(e)<=1)}),Dp=e=>{let t=Tp([e]).map(Ep),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Cp(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 Tp(n)){let n=Cp(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Ep(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Op=(e,t)=>!lp(e,t)||lp(e,t.body),kp=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&rp(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=mp(e);if(n){let e=rp(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(ip(e))throw new v(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Ap=(e,t)=>{let n=e.findIndex(e=>cp(e,t));return n===-1?(e.push(t),e.length-1):n},jp=e=>{let t=hp(pp(dp(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=gp(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])kp(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:np(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:cp(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&_p(e.formula),n=[];t&&vp(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Ap(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Ap(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Ap(i,e))}));return{tableau:t&&Dp(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Mp=/* @__PURE__ */ new Set([`~>`,`-+->`]),Np=/* @__PURE__ */ new WeakMap,Pp=/* @__PURE__ */ new WeakSet,Fp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ip=(t,r)=>{try{return X(t,r)}catch(t){if(!(t instanceof v)||t instanceof y)throw t;let r=o(t);throw r===void 0?n(new v(`${l}${t.message}`,t),e.error):n(t,r)}},Lp=e=>new v(`TLC cannot handle the temporal formula at ${mo(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=To(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return $(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?$(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Ao(e,n);if(t)return Rp(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:W(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return qi(e,(e,a)=>(i.value=Math.max(i.value,$(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 Mp.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Rp=(e,t)=>{let n=Np.get(e);if(n!==void 0)return n;Np.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max($(e.body,void 0,t),...r.map(e=>$(e.set,void 0,t)));return Np.set(e,i),i},zp=`Temporal formula is a tautology (its negation is unsatisfiable).`,Bp=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>Bp(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,ho(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,Vp(t,r,i));if(t.kind===`Identifier`){let o=W(t)?To(r,t.name):void 0;if(o?.kind===`Thunk`)return c(o.expression,o.scope);let l=i.constants.has(t.name)?void 0:Ao(t.name,i);if(!o&&l?.kind===`Operator`&&l.params.length===0&&Rp(l,i)>0){if(s.has(l))throw n(new v(u),e.error);let r=c(l.body,void 0,t.name,/* @__PURE__ */ new Set([...s,l]));return!a&&Rp(l,i)<2?[{expression:l.body,scope:void 0,name:t.name}]:r}}let l=Fp(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=Xo(t,l),n=W(t)?void 0:Ao(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,cs(e,t.args,l),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>$(e.set,r,i)===0)){let r=[],i={count:0};if(Fo(t.bounds,l,e=>(i.count++,r.push(...c(t.body,e,ho(t.body))),!1)),i.count===0)throw n(new v(zp),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},Vp=(e,t,n)=>{let r=us(e.definitions,Fp(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Pp.add(e.binding);return r},Hp=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Up=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?$(e,t,i):n;if(r===0){let n=Ip(e,Fp(i,t));if(typeof n!=`boolean`)throw new v(`TLC expected a boolean in the temporal formula at ${mo(e)}`);return Qf(n)}return r===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(t,r,i,s)=>{if(o.depth>=100)throw n(new v(u),e.error);o.depth++;let c=f(t,r);o.depth--;let l=rp(c);return l>2?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=Fp(i,t),a=W(e)||Ao(n,i)===void 0?To(t,n):void 0;if(a?.kind===`Thunk`&&Pp.has(a))return s(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:W(e)?Zo(n,r):Jo(n,i);if(o?.kind!==`Closure`)throw Lp(e);let c=e.kind===`Apply`?e.args:[];return s(o.body,cs(o,c,r),e,t)},l=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,i)===0))throw Lp(e);let n=[];Fo(e.bounds,Fp(i,t),t=>(n.push(f(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return Qf(r);let o=np(r?`And`:`Or`,n),s=rp(o);return s>2?o:a(e,t,s)},d=(e,t)=>{switch(e.kind){case`Label`:f(e.body,t);return;case`Let`:f(e.body,Vp(e,t,i));return;case`And`:case`Or`:for(let n of e.operands)f(n,t);return;case`Apply`:if(e.operator===`=>`||e.operator===`~`&&!W(e))for(let n of e.args)f(n,t);return;case`If`:{let n=f(e.condition,t),r=n.kind===`Boolean`?[n.value?e.consequent:e.alternative]:[e.consequent,e.alternative];for(let e of r)f(e,t)}}},f=(e,t)=>{let n=$(e,t,i);if(n<=2)return d(e,t),a(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,Vp(e,t,i));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,tp(`Or`,Q(`Not`,f(n[0],t)),Q(`Eventually`,f(n[1],t)))):e.operator===`~`&&!W(e)?Q(`Not`,f(n[0],t)):e.operator===`=>`?tp(`Or`,Q(`Not`,f(n[0],t)),f(n[1],t)):c(e,t)}case`And`:case`Or`:return np(e.kind,e.operands.map(e=>f(e,t)));case`Forall`:case`Exists`:return l(e,t);case`If`:{if($(e.condition,t,i)===0){let n=Ip(e.condition,Fp(i,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return tp(`Or`,tp(`And`,n,f(e.consequent,t)),tp(`And`,Q(`Not`,n),f(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Hp(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Q(`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`?Q(`Always`,Q(`Eventually`,tp(`Or`,i,a))):tp(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw Lp(e)}};return f(t,r)},Wp=(e,t,n,r,i)=>{let a=e=>Wp(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?ko(X(e.expression,a),`a temporal property predicate`):co(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&ko(X(e.unchanged,a),`a subscript`)?!1:ko(X(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Wp(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new v(`TLC cannot evaluate a temporal formula in a single step`)}},Gp=(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)=>Gp(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 Wp(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Kp=(e,t)=>e.every((e,n)=>tt(e,t[n])),qp=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Jp=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.pending.push(void 0),e.offsets.push(-1),e.edgeOffsets.push(-1),e.nodeStates.length-1),Yp=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},Xp=(e,t)=>(e.offsets[t]??-1)!==-1,Zp=(e,t)=>e.pending[t]??=[],Qp=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},$p=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,em=2**53-1,tm=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>Up(e.expression,e.scope,i)),s=t.map(e=>Q(`Not`,Up(e.expression,e.scope,i))),c=s.length===1?s[0]:np(`Or`,s),l=o.length===0?c:np(`And`,[...o,c]),u=jp(l);if(u.length===0)throw n(new v(zp),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=sp(e),n=d.get(t)??d.size;return d.set(t,n),n}),nodeStates:[],nodeTableaux:[],pending:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},edgeOffsets:[],edges:{ids:/* @__PURE__ */ new Int32Array(1024),length:0},initial:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),p={multiplier:1},m=!Ss(i),h={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},g=e=>{let t=h.states.get(e)??/* @__PURE__ */ new Map;return h.states.set(e,t),t},_=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},y=(e,t)=>Wp(e,t,void 0,i,m?g(t):/* @__PURE__ */ new Map),b=(e,t,n)=>_(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!y(e,n))),x=(e,t,n,r)=>_(t,()=>{let t=e.solution.actionChecks;if(!m)return Uint8Array.from(t,e=>+!!Wp(e,n,r,i,/* @__PURE__ */ new Map));let a=g(n),o=h.actions.get(n)??/* @__PURE__ */ new Map;h.actions.set(n,o);let s=o.get(r)??new Int8Array(d.size).fill(-1);return o.set(r,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!Wp(t[o],n,r,i,a)),s[e]))}),ee=(e,t,n,r)=>_(n,()=>e.nodes[t].statePredicates.every(e=>y(e,r))),te=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},ne=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),re=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Yp(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ie=(e,t,n)=>{let r=Jp(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Yp(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Yp(i,t,n)),r},S=(e,t,n)=>t.nodes.flatMap((t,r)=>re(e,n,r)??[]).sort((e,t)=>e-t),C=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o;let s=e.pending[t]??[],c=e.edges,l=c.length;if(c.length+=s.length+1,c.length>c.ids.length){let e=new Int32Array(Math.max(2*c.ids.length,c.length));e.set(c.ids),c.ids=e}c.ids[l]=s.length,c.ids.set(s,l+1),e.edgeOffsets[t]=l,e.pending[t]=void 0},ae=(e,t,n)=>{let r={slots:Array.from({length:16*p.multiplier}),count:0},i=(e,t)=>{for(let n=(a.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Kp(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&i(r.slots,t)}i(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*p.multiplier&&p.multiplier++,r.slots.filter(e=>e!==void 0)},oe=(e,t,n,r,i)=>{let o=b(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=Zp(e,i),u=s.successors.length>0?x(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!ee(t,a,r,n))continue;if(te(t,a)&&e.errorNode===void 0&&ne(e)){e.errorNode=i;return}let o=re(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??ie(e,r,a);l.push(s),c.push(u),o===void 0&&oe(e,t,n,r,s)}for(let i of a.getSuccessors(n)){let a=x(e,r,n,i.state),o=e.isDone[i.index]===!0;for(let n of s.successors){if(!ee(t,n,r,i.state))continue;let s=re(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ie(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&oe(e,t,i.state,i.index,u)}}l.length>0&&C(e,i,c,o)},w=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ee(t,r,a,e.state)));e.isDone[a]=!0;for(let s of S(e,t,a)){let a=Zp(e,s),c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=re(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ie(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&oe(e,t,n.state,n.index,d)}}),C(e,s,c,i)}if(e.errorNode!==void 0)return qp(T(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Jp(e,e.nodeStates.length,-1);let a=Zp(e,i),o=[];t.forEach((t,r)=>{Xp(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),C(e,i,o,r)},T=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Xp(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of Qp(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Xp(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new v(`Couldn't re-create liveness trace (path) starting at: ${t}`)},E=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>Xp(e,t)),l=[],u=t=>{let n=Qp(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&Op(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=em;return}let c=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=f.get(e.nodeStates[t]);if(n?n.push(t):f.set(e.nodeStates[t],[t]),s[t]=em,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...c].some(n=>$p(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>Qp(e,n).some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>d(t,e)));if(m&&h&&g)return p(r,c,f)},p=(r,i,s)=>{let c=qp(T(e,r).reverse().map(t=>e.nodeStates[t])),l=[],u=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),p=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+p.length+h.length},_={node:r},y=e=>i.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&$p(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&d(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},i=g.count;if(Qp(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!p[t]&&a(_.node,c,e)&&(p[t]=!0,g.count--)})}return g.count<i?(b(r),u.clear(),!0):(y(r)&&!u.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),u.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new v(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=Qp(e,t).find(e=>y(e)&&!u.has(e))??-1}b(n.unvisited),u.add(n.unvisited)}}let x=m(r,_.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()]}},m=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Qp(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new v(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=f(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};Qp(e,a).forEach((t,r)=>{Xp(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{h.states.clear(),h.actions.clear();for(let n of f){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ee(r,i,void 0,t)&&n.initial.push(re(n,e,i)??ie(n,e,i))}},addState:(e,t,n)=>{h.states.clear(),h.actions.clear();let r=ae(e,t,n);for(let n of f){let i=r.map(r=>x(n,e,t,r.state)),a=b(n,e,t),o=n.solution.tableau,s=o?w(n,o,r,i,a,e):se(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=E(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!Gp(s[r].body,e,n,0,i)).map(e=>e.name))]}},nm=`UnnamedAction`,rm={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},im=e=>{let t=e.range??rm;return Wt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},am=e=>{let t=[[`name`,e.name],[`location`,im(e.location)]];return e.parameters.length===0?Wt(t):Wt([...t,[`context`,Wt(e.parameters)],[`parameters`,R(e.parameters.map(e=>e[0]))]])},om=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),sm=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),cm=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,lm=e=>e.kind===`Apply`?e.args:[],um=(e,t,n)=>{let r=cm(e);if(r===void 0)return;if(W(e)){let e=To(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=Jo(r,n);return i?.kind===`Closure`?i:void 0},dm=(e,t)=>{try{return X(e,sm(t,void 0)),!0}catch(e){if(e instanceof f)return!1;throw e}},fm=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Mo(e,t)&&dm(e.body,t),pm=(e,t)=>{let n=Ao(e.name,t);return n?.body===e.body&&fm(n,t)},mm=(e,t)=>{if(e.kind!==`Identifier`||!W(e))return;let n=To(t,e.name);return n?.kind===`Thunk`?n:void 0},hm=(e,t)=>(e?.params??[]).flatMap(e=>{let n=To(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),gm=(e,t)=>{try{return e()}catch(e){if(e instanceof f)return t();throw e}},_m=(e,t,n,r,i)=>{let a=lm(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>$(e,n,i)!==0)?o():gm(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,sm(i,n))]),expression:t,scope:n}],o)},vm=(e,t,n,r,i)=>{let a=()=>({name:n?.name??nm,location:e.location,parameters:hm(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return vm(e.body,us(e.definitions,sm(r,t)),n,r,i);case`Label`:return vm(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>vm(e,t,n,r,i));case`Exists`:return gm(()=>{let o=[];return Fo(e.bounds,sm(r,t),t=>(o.push(...vm(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=W(e)?void 0:i.get(cm(e)??``),s=um(e,t,r);if(o)return _m(o,e,t,s,r);if(!s)return[a()];let c=lm(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return pm(s,r)||c.some(e=>$(e,t,r)!==0)?l():gm(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,sm(r,t))},parent:e}),s.scope);return vm(s.body,e,s,r,i)},l)},ym=(e,t,n,r,i)=>{let a=(e,t)=>ym(e,t,n,r,i);if(e.kind===`Let`){a(e.body,us(e.definitions,sm(n,t)));return}let o=mm(e,t);if(o){a(o.expression,o.scope);return}let s=um(e,t,n);if(s&&pm(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(om(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,cs(s,e.args,sm(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(om(nm,e));return}let c=$(e,t,n);c<=1?r.inits.push(om(nm,e)):c===3&&r.temporals.push(om(nm,e))},bm=(e,t,n,r,i)=>{let a=(t,n)=>bm(e,t,n,r,i);if(t.kind===`Let`){a(t.body,us(t.definitions,sm(r,n)));return}let o=mm(t,n);if(o){a(o.expression,o.scope);return}let s=um(t,n,r);if(s&&pm(s,r))return;if(s&&s.params.length===lm(t).length){a(s.body,t.kind===`Apply`?cs(s,t.args,sm(r,n)):s.scope);return}if(t.kind===`Forall`&&gm(()=>(Fo(t.bounds,sm(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(om(e,a)):$(a,n,r)<2?i.invariants.push(om(e,a)):i.impliedTemporals.push(om(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(om(e,t)):c===3&&i.impliedTemporals.push(om(e,t))},xm=(e,t)=>{let n=Ao(e,t);return n?.kind===`Operator`&&!fm(n,t)?n:void 0},Sm=e=>Wt([[`name`,e.name],[`location`,im(e.location)]]),Cm=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:xm(e.specification,t);a&&(ym(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...vm(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Jo(e.init,t);o?.kind===`Closure`&&r.inits.push(om(e.init??``,o.body));let s=e.next===void 0?void 0:Jo(e.next,t);return s?.kind===`Closure`&&r.actions.push(...vm(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=xm(e,t);n&&r.invariants.push(om(e,n.body))}),e.properties.forEach(e=>{let n=xm(e,t);n&&bm(e,n.body,void 0,t,r)}),r},wm=(e,t,n)=>Cm(e,t,n).actions,Tm=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>U(e[1])).join(`,`)})`,Em=e=>`${e.name===nm?`Action`:e.name}${Tm(e)} ${h(e.location.range??rm)}`,Dm=e=>`${e.name}${Tm(e)}`,Om=(e,t,n,r)=>{let i=Cm(e,t,r),a=e=>Ot(e.map(am)),o=e=>Ot(e.flatMap(e=>{let n=xm(e,t);return n?[Sm(n)]:[]}));return Wt([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Ot(t.variables.map((e,t)=>Wt([[`name`,e],[`location`,im(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},km=`paired12`,Am=(e,t=16)=>e<=t*.75?t:Am(e,t*2),jm=(e,t)=>{let n=Am(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Mm=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Nm=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Pm=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Fm=e=>Pm(e).replaceAll(`
420
- `,`\\n`),Im=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},close:()=>t?.(e.path,n.join(``))}},Lm=(e,t)=>{let n=[`strict digraph DiskGraph {
428
+ `]]),Of=/* @__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)`],[`TLCGet`,`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)`],[`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)`]])]]),kf=(e,t)=>e.every(e=>yn(e,t)),Af=Dt([!1,!0]),jf=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Mt(jf(e,t,r),jf(e,r,n))},Mf=[`\\cup`,`\\cap`,`\\`],Nf=e=>typeof e==`object`&&e.kind===`MixedSet`,Pf=e=>e.kind===`Interval`?q(e).elements:e.elements,Ff=(e,t,n)=>{let r=Pf(t);if(e!==`\\cup`){let t=e===`\\cap`;return Ot(r.filter(e=>yn(e,n)===t))}if(r.length===0)return n;if(!Ne(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=q(n).elements.filter(e=>!yn(e,t));return Ot([...r,...i])},If=[wr(`TRUE`,!0),wr(`FALSE`,!1),wr(`BOOLEAN`,Af),wr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Dr(`=`,Tt),Dr(`#`,(e,t)=>!Tt(e,t)),Q(`~`,1,e=>!gr(e,0,`~`)),Q(`<=>`,2,e=>gr(e,0,`<=>`)===gr(e,1,`<=>`)),Q(`/\\`,2,e=>gr(e,0,`/\\`)&&gr(e,1,`/\\`)),Q(`\\/`,2,e=>gr(e,0,`\\/`)||gr(e,1,`\\/`)),Q(`=>`,2,e=>!gr(e,0,`=>`)||gr(e,1,`=>`)),Q(`\\in`,2,e=>yn(Z(e,0,`\\in`),Z(e,1,`\\in`))),Q(`\\notin`,2,e=>!yn(Z(e,0,`\\notin`),Z(e,1,`\\notin`))),Q(`\\subseteq`,2,e=>{let t=_r(e,0,`\\subseteq`),n=Z(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&Yt(t.base)?kf(q(t.base).elements,n.base):kf(q(t).elements,n)}),...Mf.map(e=>Q(e,2,t=>{let n=Z(t,0,e),r=Z(t,1,e);if(Ne(n)&&Ne(r)&&!Nf(n)&&!Nf(r)){if(e===`\\cup`&&cn(n))return r;let t=e===`\\cup`?Mt:e===`\\cap`?jt:At;try{return t(q(n),q(r))}catch(e){if(!(e instanceof b))throw e}}return Ne(n)?Ff(e,n,r):e!==`\\`&&Ne(r)?Ff(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),Q(`SUBSET`,1,e=>({kind:`Subset`,base:_r(e,0,`SUBSET`)})),Q(`UNION`,1,e=>{let t=_r(e,0,`UNION`),n=pt(t)?t.elements.filter(pt):[];if(!pt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Nf(t)||n.some(Nf)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{yn(t,e)||e.elements.push(t)})),Ot(e.elements)}return n.length===0?kt:jf(n.map(q),0,n.length)}),Q(`DOMAIN`,1,e=>{let t=Z(e,0,`DOMAIN`);if(!P(t))throw new b(`DOMAIN expects a function but received ${Y(t)}`);return Nn(t)})],Lf=Rr(`Integers`,`Neg`,`IntValue`,1),Rf=e=>{let t=Rr(e,`DotDot`,`IntervalValue`,2);return[zr(e,`+`,`Plus`,(e,t)=>e+t),zr(e,`-`,`Minus`,(e,t)=>e-t),zr(e,`*`,`Times`,(e,t)=>e*t),zr(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new x(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new x(`0^0 is undefined.`);return e**t}),zr(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new x(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(Or(n))throw kr(`${e} \\div ${t}`);return n}),zr(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new x(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),Q(`..`,2,e=>({kind:`Interval`,low:Lr(Z(e,0,`..`),t),high:Lr(Z(e,1,`..`),t)}))]},zf=[wr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Rf(`Naturals`),Vr(`<`,(e,t)=>e<t),Vr(`>`,(e,t)=>e>t),Vr(`<=`,(e,t)=>e<=t),Vr(`>=`,(e,t)=>e>=t)],Bf=[wr(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Rf(`Integers`),Q(`-.`,1,e=>{let t=Lr(Z(e,0,`-`),Lf);if(Or(-t))throw kr(`-${t}`);return-t})],Vf=(e,t,n)=>{let r=Z(e,t,n),i=hn(r);if(!i)throw new x(`${n}\n${Y(r)}`);return i},Hf=(e,t,n)=>{let r=Z(e,t,n);return typeof r==`string`?r:Vf(e,t,n)},Uf=(e,t,n)=>typeof e==`string`?Be(e.slice(t,n)):Ut(e.slice(t,n)),Wf=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Gf=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Kf=(e,t)=>{let n=Of.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ir(e,t):e}):t},qf=Kf(`Sequences`,[Q(`Seq`,1,e=>({kind:`SequenceSet`,base:Z(e,0,`Seq`)})),Q(`Len`,1,e=>Hf(e,0,Wf(``,`Len`)).length),Q(`\\o`,2,e=>{let t=Hf(e,0,Gf(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Vf(e,1,Gf(`t \\o s`,`sequence`));return Ut([...t,...n])}let n=Z(e,1,`\\o`);if(typeof n!=`string`)throw new x(`${Gf(`t \\o s`,`string`)}\n${Y(n)}`);return Be(t+n)}),Q(`Append`,2,e=>Ut([...Vf(e,0,Gf(`Append(s, v)`,`sequence`)),Z(e,1,`Append`)])),Q(`Head`,1,e=>{let t=Vf(e,0,Wf(``,`Head`));if(t.length===0)throw new x(`Attempted to apply Head to the empty sequence.`);return t[0]}),Q(`Tail`,1,e=>{let t=Hf(e,0,Wf(``,`Tail`));if(t.length===0)throw new x(`Attempted to apply Tail to the empty sequence.`);return Uf(t,1)}),Q(`SubSeq`,3,e=>{let t=Hf(e,0,Wf(`first `,`SubSeq`)),n=hr(e,1,`SubSeq`),r=hr(e,2,`SubSeq`);if(n>r)return Uf(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new x(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${Y(Z(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Uf(t,n-1,r)}),Tr(`SelectSeq`,2,e=>{let t=Cr(e,1,`SelectSeq`);return Ut(Vf(e,0,Wf(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new x(`The second argument of SelectSeq should be a operator, but instead it is:\n${Y(n)}`);return n}))})]),Jf=Kf(`FiniteSets`,[Q(`IsFiniteSet`,1,e=>{let t=Z(e,0,`IsFiniteSet`);if(Me(t))return pn(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new b(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${Y(t)}\nis a finite set.`:`Attempted to check if the ${Fe(t)} ${Y(t)} is a finite set.`)}),Q(`Cardinality`,1,e=>{let t=Z(e,0,`Cardinality`);if(!Me(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new x(`Attempted to compute cardinality of the value\n${Y(t)}`);return dn(t)})]),Yf=/* @__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`]]]),Xf=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:zf};case`Integers`:return{extends:[`Naturals`],operators:Bf};case`Sequences`:return{extends:[],operators:qf};case`FiniteSets`:return{extends:[],operators:Jf};case`TLC`:return{extends:[],operators:Kf(`TLC`,xf(t,n))};case`Randomization`:return{extends:[],operators:Zd(n)};case`_Possible`:return{extends:[],operators:pf(t,n)};case`Json`:return{extends:[],operators:Gd(r)};case`Bags`:return{extends:[],operators:wd};case`TLCExt`:return{extends:[],operators:ff(t,n)};default:return}},Zf=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}])),Qf={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]}},$f=(e,t)=>{let n=Qf[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},ep=`$subexpression`,tp=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),np=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return np(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of dr(e)){let e=np(r,t,n);if(e)return e}},rp=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),ip=(e,t)=>{let n=e.location,r=rp(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 tp(`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 tp(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:ep,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:ep,args:e.args,location:n,resolution:ti},location:n}},ap=(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:ti})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ti}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ti};return ip({...t,params:[...t.params,...r]},a)},op=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw tp(r,i);ri.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:_(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw tp(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>ya(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw tp(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=ci(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw tp(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&np(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw tp(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||Oi(t.operand,1)!==0)throw tp(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=Mi(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[Oi(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw tp(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=Oi(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw tp(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw tp(`Unexpected subexpression selector`,i);let s=r?r.sets:Ni(n),c=s?.[Oi(t.operand,s.length)];if(!c)throw tp(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return ap(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw tp(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return ap(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw tp(`Subexpression selection failed`,i);return ip(a,o.current)},sp=(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 ki(e,t,n)},cp=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||dr(e).some(cp),lp=(e,t,n,r=!1)=>{if(!cp(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n);return Sa(e,e=>lp(e,r,n))}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>lp(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Sa(e,e=>lp(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?sp(a.name,[],void 0,t):a.kind===`Apply`?sp(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n.has(s.name))return a;let c=op(o,t,a,r);return c!==a&&ni.add(c),c},up=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},dp=(e,t)=>{let n=up(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({...e,expression:lp(e.expression,n,/* @__PURE__ */ new Set,!0)}))}},fp=(e,t)=>{let n=up([...t,...e.definitions]);if(!(e.definitions.some(e=>cp(e.body))||e.assumptions.some(e=>cp(e.expression))))return e;let r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[]));return{...e,definitions:e.definitions.map(e=>xa(e,e=>lp(e,n,r))),assumptions:e.assumptions.map(e=>({...e,expression:lp(e.expression,n,r)}))}},pp=(e,t)=>`${e}${t}`,mp=(e,t,n)=>`${e}${t}${n}`,hp=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},gp=(e,t,n)=>`${e},${t},${n}`,_p=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),vp=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),yp=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),bp=(e,t,n,r)=>({..._p(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),xp=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Sp=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Cp=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,{...bp(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),wp=bp(`$Set`,0,[2],[1]),Tp=bp(`$Junction`,0,[3],[1]),Ep=bp(`$Choose`,0,[2],[1]),Dp=bp(`$Function`,0,[3],[1]),Op=bp(`$FcnApply`,0,[2,2],[1,1]),kp=bp(`$RcdSelect`,0,[2,0],[1,1]),Ap=bp(`'`,2,[1],[0]),jp=bp(`ENABLED`,1,[2],[0]),Mp=bp(`[]`,3,[3],[0]),Np=bp(`$SquareAct`,2,[2,1],[0,0]),Pp=bp(`$WF`,3,[1,2],[0,0]),Fp=bp(`$TemporalExists`,3,[3],[0]),Ip=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Lp=e=>e.map(e=>({name:e,arity:0})),Rp=(e,t)=>t.location.range?v(`${e}.`,t.location.range):new p(`${e} at line ${t.location.line}, column ${t.location.column}`),zp=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Bp=e=>e.kind!==`Let`&&e.kind!==`Label`,Vp=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Cp.get(t)??Zf.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=_p(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(mp(e,n,t))}),t.data.constraints.forEach((e,t)=>vp(r.constraints,t,e)),yp(r.argConstraints,pp(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>yp(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>xp(e,n))throw new p(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new p(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(gp(t,n,r)),s=_p(Math.max(e.level,...t.filter((t,n)=>Sp(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{Sp(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>vp(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||vp(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>vp(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||vp(s.constraints,t,xp(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>vp(s.constraints,e,xp(r,a)))}))}),e.argParams.forEach(e=>{let t=hp(e),n=a(t.operator)?.operator;n&&vp(s.constraints,t.param,xp(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>yp(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>yp(s.argConstraints,pp(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&yp(s.argConstraints,pp(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=hp(e),n=a(t.operator);n&&yp(s.argConstraints,pp(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(hp(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=hp(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(mp(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(mp(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(mp(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,Lp(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,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=_p();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=Ip(n,Lp(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Rp(`Formula has both temporal formula and action as arguments`,t)},u=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Rp(`Action used where only temporal formula or state predicate allowed`,e);zp.has(e.operator)&&l(t,e)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Bp(n)&&n.kind!==r)throw Rp(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},f=(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=v(e,n);t.constraints.forEach((e,t)=>vp(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>yp(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof p)||t.sany?t:Rp(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return _p();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return u(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(Tp,n)}case`Prime`:case`Unchanged`:return s(Ap,[e.expression],t);case`Enabled`:return s(jp,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(Mp,[n])}case`If`:return s(Tp,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Tp,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return f(e,t);case`Forall`:case`Exists`:{let n=s(Tp,[e.body],t,e.bounds.map(e=>e.set),bi(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Rp(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Fp:Tp,[e.body],t,[],e.names);case`Choose`:return s(Ep,[e.body],t,e.set?[e.set]:[],yi(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(wp,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(wp,[e.predicate],t,[e.bound.set],yi(e.bound.pattern));case`SetMap`:return s(wp,[e.expression],t,e.bounds.map(e=>e.set),bi(e.bounds));case`FunctionConstruction`:return s(Dp,[e.body],t,e.bounds.map(e=>e.set),bi(e.bounds));case`Record`:return s(Dp,e.fields.map(e=>e.value),t);case`RecordSet`:return s(wp,e.fields.map(e=>e.value),t);case`Except`:return s(wp,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Op,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(wp,e.args,t)}]);case`FieldAccess`:return i(kp,[a(e.record,t),{data:_p()}]);case`BoxAction`:case`AngleAction`:return s(Np,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Pp,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return _p()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||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 dr(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Ip(t,Lp(e.names))),i;default:return Sa(e,(e,n)=>(a(e,r,Ip(t,Lp(n))),e)),i}},_=(e,t,n,r)=>{let i=Ip(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={..._p(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(pp(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(mp(e.name,n,t.name))).map(e=>gp(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(hp(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=hp(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{..._p(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},Hp=(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`?Hp(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=_p(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>vp(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>yp(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Up=(e,t,n,r)=>{let i=Vp(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Hp(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=_(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:_(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=fa([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Hp(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw m(n)}})),...n],r);if(l.length>0)throw m(l,!1,void 0,r)},Wp=(e,t)=>e.maxLevels[t]??3,Gp=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Vp({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>vp(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>vp(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>yp(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=hp(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)&&vp(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(Hp(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=_(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(pp(e.name,i));a!==void 0&&Wp(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=hp(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=Wp(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw m([...r.values()])}},Kp=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],qp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Jp=new Map(Cf.flatMap(e=>e.map(t=>[t,e[0]]))),Yp=e=>Jp.get(e)??e,Xp=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Zp=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(Xp(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},Qp=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),$p=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Yp(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Yp(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}},em=(e,t)=>{let n=[];for(let r=t;;){let t=$p(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},tm=e=>({line:e.line,column:e.column}),nm=(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(a.text===`EXTENDS`){let n=em(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},rm=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,im={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},am=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&rm(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&rm(e[n+1],e[n+2])?n+=rm(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=>im[e])}"`:r.text)}return t},om=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},sm=(e,t)=>e.find(e=>e.name===t)??e.map(e=>sm(e.modules,t)).find(Boolean),cm=(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:Df.get(i)??t?.(i)??Ol(e,i),s=o===void 0?[]:fe(o),c=om(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Al(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>sm(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},lm=(e,t,n)=>{let r=cm(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=em(t,e+1);r.push({location:tm(t[e]),apply:e=>i.forEach(t=>e.put(Qp(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:tm(u),apply:t=>t.put(Qp(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&em(t,l+1).every(e=>s.has(e))&&a(l,`definition`),qp.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(tm(u)),r.push({location:tm(u),apply:e=>e.put(Qp(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(Qp(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=Yp(e.name);r.push({location:e.location,apply:n=>n.put(Qp(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(Qp(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Qp(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>si(e.location,t.location)?-1:+!!si(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=Zp();a.set(e??``,n),Sf.toReversed().forEach(e=>n.put(Qp(e,`builtin`,!1)));let s=r(e);return s.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||n.put(e)})),i(s).forEach(e=>e.apply(n)),n};return o(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse()},um=(e,t,n)=>{let r=cm(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),wf.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=nm(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;am(s(void 0)).forEach((e,t)=>{t===3&&Ef.forEach(a),a(e)});let b=u(void 0);for(;;){let e=g(b,/* @__PURE__ */ new Set)??_(b,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),am(s(n)).forEach(a))}Kp.forEach(a);let x=/* @__PURE__ */ new Set,S=e=>{if(x.has(e))return;x.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(S),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return S(void 0),Tf.forEach(a),[...i]},dm=t=>{switch(t.kind){case`Number`:try{return F(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Ze(t.name);case`Set`:return Dt(t.elements.map(dm))}},fm=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],pm=e=>new p(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),mm=(e,t)=>e.location.range&&t.location.range&&{location:_(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${_(t.location.range)}.`},hm=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,gm=e=>e===`Theorem`?`ThmOrAssumpDefNode`:hm(e),_m=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:ti},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),vm=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>Y(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new b(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&et(t,r)})});if(t)return t[1];throw new b(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:Y(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},ym=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||dr(e).some(e=>ym(e,t)),bm=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ja(e),n.get(e)??n.size)),n},xm=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Sm=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw $o(e);if(e.kind===`Number`&&!Hs(e.value))throw es(e);Sm(e.kind===`Let`?[...dr(e),...xm(e.instances??[])]:dr(e))}),Cm=(e,t)=>{let n=Al(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(If.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=du(e.checkDeadlock,t.seed),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Map,f=[],g=/* @__PURE__ */ new Map,v=[],S=[],C=(e,t)=>v.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),w={value:0},T=e=>`${e}#${w.value++}`,ee=[],te=[],ne=Gp(e=>{let t=d.get(e)??j(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),E=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,D=e=>{let n=s.get(e);if(n)return n;let r=Xf(e,t.print,c,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>D(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{o.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Zf.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:$f(e,t.name)??i.get(t.name)?.range})}),s.set(e,i),i},O=e=>{let t=D(e),n=Yf.get(e)??[];return t&&C(e,n),t&&n.includes(`Integers`)&&D(`Integers`),t},k=e=>(Sm([...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]),...xm(e.instances)]),e.modules.forEach(k),e);k(n);let A=(e,n)=>{let r=t.loadModule?.(e)??Zc.get(e)??Ol(t.source,e);if(r===void 0)throw m([{location:`In module ${n}`,message:`Cannot find source file for module ${e} imported in module ${n}.`}],!0);let i=rd(r,e);if(i.name!==e)throw m([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return k(i)},ie=e=>{let t=S.indexOf(e.name);if(t!==-1)throw new p(`Circular dependency among .tla files; dependency cycle is: ${[...S.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];S.push(e.name),v.push(n);let o=fe(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:te,levelChecks:a});if(v.pop(),S.pop(),i.length>0)throw m(i,!1,void 0,te);let s=r.find(e=>n.has(e.name)),c=s&&l.get(s.name),u=c&&mm(s,c.module);if(u)throw m([u],!1,void 0,te);if(s)throw pm(s);return a.forEach(e=>e()),{linked:o,closure:n}},j=(e,t)=>{let n=l.get(e);if(n)return C(e,g.get(e)??[]),n;let r=ie(A(e,t));return l.set(e,r.linked),g.set(e,r.closure),C(e,r.closure),r.linked},ae=(e,t,n,o,s)=>{let c=s?void 0:O(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}]));let l=s??j(e.module,t.name);l.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let u=fm(l),d=`#${w.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=da(dp(e,t),u,t,n);ee.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Ua({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,ga(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=T(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:T}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&E.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity,params:t.params,kind:t.kind,range:i.get(t.key)===!0?e.location.range:t.range});return}let r=m.getQualifiedKey(t.key);u.length>0&&E.set(r,{name:`${e.name}!${n}`,location:e.location}),re.set(r,`${e.name}!${n}`),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length,params:t.params&&[...e.params.map(e=>e.arity),...t.params],kind:t.kind})}),g},oe=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:ti})),se=(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:oe(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ce=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),le=(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=ce(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:oe(r,n),location:n}}},ue=(e,t,n,a)=>{let o=e.location,s=a?void 0:O(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ce(n.arity);return se(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??j(e.module,n),l=`#${w.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=fm(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ee.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>ym(f(e),p),h=d.map(t=>{let n=le(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Ua({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:oe(e.params,o),location:o,resolution:ti}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:ti}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:_m(a,i)),i},createName:T}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=ce(n.arity),a=[...e.params,...i];return se(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},de=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),fe=(e,a)=>{let o=al(e,t.loadClass?.(e.name)),s=ee.length,c=new Map([...If.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),l={location:ca,errors:[],warnings:[]},p=[l],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){c.set(t,e),h.set(t,e);return}if(!n.range||!e.range||_(n.range)===_(e.range))return;let r=_(e.range),i=_(n.range);gm(n.kind)===gm(e.kind)?l.warnings.push({location:r,message:`Warning: the ${hm(n.kind)} of '${t}' conflicts with \nits ${hm(n.kind)} at ${i}.`}):l.errors.push({location:r,message:`The ${hm(e.kind)} of '${t}' conflicts with \nits ${hm(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,v=/* @__PURE__ */ new Map,y=[],b=[...o.constants],x=o.variables.map(e=>e.name),S=o.variables.map(e=>e.location);o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:O(e);if(n){m(n);return}let r=t??j(e,o.name);b.push(...r.constants.filter(e=>b.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{x.includes(e)||(x.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>g.add(e)),r.modules.forEach((e,t)=>v.set(t,e)),y.push(r)});let C=new Map(c),w=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],T=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,T(e)));let E=e=>({key:k(e),arity:ci(e),params:li(e),kind:la(o,e)?`Theorem`:`Definition`,range:e.location.range}),D=b.length===0&&x.length===0,k=e=>o===n?e.name:`${e.name}@${a.id}`,A=/* @__PURE__ */ new Map,ie=e=>({imported:c,bound:C,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:k,instanced:A,facts:g,reports:p,warnings:a.warnings}),oe=()=>new Map([...a.modules,...v]),se=e=>new Map([...c,...w.filter(t=>si(t.location,e)).map(e=>[e.name,T(e)]),...o.definitions.filter(t=>si(t.location,e)).map(e=>[e.name,E(e)])]),ce=e=>{let t=oe(),n=t.get(e.name),r=n&&mm(e,n.module);if(n&&!r)throw pm(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=fe(e,{id:`${a.id}/${e.name}`,symbols:se(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||v.set(e.name,o),u.has(e.name)||u.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=ae(e,o,ie(o),D,oe().get(e.module));A.set(e,t),t.forEach((t,n)=>{c.has(n)||(c.set(n,t),e.isLocal||h.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>ce(e)}))].sort((e,t)=>si(e.location,t.location)?-1:1).forEach(e=>e.link());let le=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&si(e.location,t.location)},pe=e=>{let t=o.modules.find(t=>t.name===e.module);return t?le(t)?v.get(t.name):void 0:oe().get(e.module)},M=fp(qa(o,(e,t)=>ue(e,t,o.name,pe(e))),de(c));a.errors.push(...pa(M,ie(M))),M.definitions.forEach(e=>{let t=k(e);r.set(t,e),i.set(t,!D);let n=E(e);c.set(e.name,n),e.isLocal||h.set(e.name,n)});let me={module:M,constants:b,variables:x,variableLocations:S,visible:c,exported:h,modules:v,extended:y,facts:/* @__PURE__ */ new Set([...g,...[...M.theorems,...M.assumptions].flatMap(e=>e.name??[])])};d.has(o.name)||d.set(o.name,me);let he=ee.splice(s).map(e=>({location:e.location,check:()=>ne(e)}));return a.levelChecks.push(()=>Up(M,{constants:new Set(b.map(e=>e.name)),variables:new Set(x),getDefinition:e=>r.get(c.get(e)?.key??e),getQualifiedName:e=>re.get(c.get(e)?.key??e)},he,te)),f.push(me),me},pe=ie(n).linked;te.length>0&&t.print(h(te));let M=e=>pe.visible.get(e)?.key??e;pe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let me=[],he=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>he(e,t)),me.push(...e.module.assumptions))};he(pe,/* @__PURE__ */ new Set);let ge=pe.constants.map(e=>e.name),_e=pe.variables,ve=e=>e.module===void 0?[e.name,M(e.name)]:e.module===n.name||ge.includes(e.name)?[]:[(l.get(e.module)??u.get(e.module))?.visible.get(e.name)?.key??e.name],ye=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:pe.constants.find(t=>t.name===e)?.arity??0},be=/* @__PURE__ */ new Map,xe=/* @__PURE__ */ new Set,Se=(e,t)=>{o.set(e,t),r.delete(e),be.delete(e),xe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=dm(e.value);ve(e).forEach(e=>{let n=ye(e);n===0?be.set(e,t):Se(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ce=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ce.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new y(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(dm),dm(e.value)]),Ce.set(t,n)}),Ce.forEach(e=>ve(e).forEach(t=>Se(t,vm(e.name,ye(t)||e.rows[0][0].length,e.rows))));let we=new Map(e.substitutions.flatMap(e=>ve(e).map(t=>[t,M(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!ge.includes(n)&&!pe.visible.has(n))throw new y(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new y(`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 a=M(i),s=r.get(a);if(!(s!==void 0||o.has(a)||be.has(a)||ge.includes(i)||_e.includes(i)))throw new y(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(pe.constants.find(e=>e.name===n)?.arity??pe.visible.get(n)?.arity))throw new y(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Te=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(ve)),Ee=(e,t)=>{if(Te.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ee(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ee(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=se(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),pe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let De=ge.filter(e=>!be.has(e)&&!we.has(e)&&!xe.has(e));if(De.length>0)throw new y(`The constant parameter ${lm(t.source,t.loadModule,`constant`).find(e=>De.includes(e))??De[0]} is not assigned a value by the configuration file.`);let Oe={runtime:c,definitions:r,builtins:o,constants:be,substitutions:we,variables:_e,variableIndex:bm(_e,f.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap},ke=Vp({constants:new Set(be.keys()),variables:/* @__PURE__ */ new Set([..._e,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>os(e,Oe)}),N=e=>{try{_c(e,{environment:Oe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof b)return e;throw e}};return we.forEach((e,t)=>{let n=r.get(e),i=ge.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ke.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?N(n.body):void 0;if(i)throw new y(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof x?``:` - specifically: ${i.message}`}`)}),c.isStarted=!0,{environment:Oe,assumptions:me,variableLocations:pe.variableLocations,instanceActions:E}},wm={kind:`Boolean`,value:!0},Tm={kind:`Boolean`,value:!1},Em=e=>e?wm:Tm,Dm=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Om=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,km=(e,t)=>({kind:e,body:t}),Am=(e,t,n)=>({kind:e,operands:[t,n]}),jm=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?jm(e,t.operands).operands:[t])}),Mm=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return Mm(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,Mm(t)),0)}},Nm=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 Nm(e.body);case`And`:case`Or`:return e.operands.some(Nm)}},Pm=/* @__PURE__ */ new WeakMap,Fm={count:0},Im=e=>{let t=Pm.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`#${Fm.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Im).join(`,`)})`;default:return`${e.kind}(${Im(e.body)})`}})();return Pm.set(e,n),n},Lm=(e,t)=>e===t||Im(e)===Im(t),Rm=(e,t)=>{let n=Im(t);return e.some(e=>e===t||Im(e)===n)},zm=e=>e===`And`?`Or`:`And`,Bm=(e,t)=>{switch(e.kind){case`Boolean`:return t?Em(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?km(`Not`,e):e;case`Not`:return Bm(e.body,!t);case`And`:case`Or`:return jm(t?zm(e.kind):e.kind,e.operands.map(e=>Bm(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return km(n,Bm(e.body,t))}}},Vm=e=>{switch(e.kind){case`Boolean`:return Em(!e.value);case`Not`:return e.body;case`And`:case`Or`:return jm(zm(e.kind),e.operands.map(Vm));case`Always`:return km(`Eventually`,Vm(e.body));case`Eventually`:return km(`Always`,Vm(e.body));default:return km(`Not`,e)}},Hm=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Hm(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Em(t)}return n.length===0?Em(!t):n.length===1?n[0]:jm(e.kind,n)}case`Not`:{let t=Hm(e.body);return t.kind===`Boolean`?Em(!t.value):km(`Not`,t)}case`Always`:case`Eventually`:{let t=Hm(e.body);return km(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Um=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Wm=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Wm(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new b(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>jm(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Wm(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Um(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:jm(`Or`,t);n.push(km(`Always`,km(`Eventually`,e)))}return jm(`Or`,n)}case`Not`:return Dm(e.body)?e:Wm(Vm(e.body));default:return e}},Gm=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Gm(e.operands[0]):jm(e.kind,e.operands.map(Gm));case`Not`:return e.body.kind===`Not`?Gm(e.body.body):km(`Not`,Gm(e.body));case`Always`:case`Eventually`:case`Next`:return km(e.kind,Gm(e.body));default:return e}},Km=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Km(e.operands[0]);let t=Math.floor(e.operands.length/2);return Am(e.kind,Km(jm(e.kind,e.operands.slice(0,t))),Km(jm(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return km(e.kind,Km(e.body));default:return e}},qm=(e,t)=>{e.kind===`Eventually`&&!Rm(t,e)&&t.push(e),`body`in e&&qm(e.body,t),`operands`in e&&e.operands.forEach(e=>qm(e,t))},Jm=e=>{let t=e.filter(Om),n=e.flatMap(e=>e.kind===`Not`&&Om(e.body)?[e.body]:[]);return!t.some(e=>Rm(n,e))},Ym=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,km(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new b(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Xm=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:km(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Zm=(e,t,n)=>e.flatMap(e=>{let r=Xm(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Qm=e=>[...new Set(e.map(Im))].sort().join(`|`),$m=(e,t)=>{let n=new Set(t.map(Qm));return[...e.filter(e=>!n.has(Qm(e))),...t]},eh=e=>{let t=Ym(e),n=Zm(t,`Always`,`And`),r=Zm(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Xm(t,`Eventually`,`Or`);if(n&&!(Rm(e,n.first)||Rm(e,n.second)))return $m(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Rm(e,t.first)||Rm(e,t.second))&&!Rm(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Jm(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Xm(t[e],`Always`,`And`);n&&(Rm(t,n.first)||t.push(n.first),Rm(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Rm(t,e.first)&&Rm(t,e.second)&&!Rm(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Jm(t)?[]:i(t)};return a(e)},th=e=>({particle:e,successors:[],statePredicates:e.filter(e=>Mm(e)<=1)}),nh=e=>{let t=eh([e]).map(th),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Qm(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 eh(n)){let n=Qm(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(th(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},rh=(e,t)=>!Rm(e,t)||Rm(e,t.body),ih=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&Mm(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Um(e);if(n){let e=Mm(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Nm(e))throw new b(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},ah=(e,t)=>{let n=e.findIndex(e=>Lm(e,t));return n===-1?(e.push(t),e.length-1):n},oh=e=>{let t=Wm(Hm(Bm(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Gm(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])ih(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:jm(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Lm(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Km(e.formula),n=[];t&&qm(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>ah(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>ah(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>ah(i,e))}));return{tableau:t&&nh(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},sh=/* @__PURE__ */ new Set([`~>`,`-+->`]),ch=/* @__PURE__ */ new WeakMap,lh=/* @__PURE__ */ new WeakSet,uh=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),dh=(t,r)=>{try{return _c(t,r)}catch(t){if(!(t instanceof b)||t instanceof x)throw t;let r=o(t);throw r===void 0?n(new b(`${l}${t.message}`,t),e.error):n(t,r)}},fh=e=>new b(`TLC cannot handle the temporal formula at ${Wo(e)}`),ph=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ts(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return ph(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?ph(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=os(e,n);if(t)return mh(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:X(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Sa(e,(e,a)=>(i.value=Math.max(i.value,ph(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 sh.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},mh=(e,t)=>{let n=ch.get(e);if(n!==void 0)return n;ch.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(ph(e.body,void 0,t),...r.map(e=>ph(e.set,void 0,t)));return ch.set(e,i),i},hh=`Temporal formula is a tautology (its negation is unsatisfiable).`,gh=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>gh(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Go(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,_h(t,r,i));if(t.kind===`Identifier`){let o=X(t)?ts(r,t.name):void 0;if(o?.kind===`Thunk`)return c(o.expression,o.scope);let l=i.constants.has(t.name)?void 0:os(t.name,i);if(!o&&l?.kind===`Operator`&&l.params.length===0&&mh(l,i)>0){if(s.has(l))throw n(new b(u),e.error);let r=c(l.body,void 0,t.name,/* @__PURE__ */ new Set([...s,l]));return!a&&mh(l,i)<2?[{expression:l.body,scope:void 0,name:t.name}]:r}}let l=uh(i,r);if(t.kind===`Apply`&&(e=>a||ph(e,r,i)===3)(t)){let e=Es(t,l),n=X(t)?void 0:os(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Rs(e,t.args,l),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>ph(e.set,r,i)===0)){let r=[],i={count:0};if(ds(t.bounds,l,e=>(i.count++,r.push(...c(t.body,e,Go(t.body))),!1)),i.count===0)throw n(new b(hh),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},_h=(e,t,n)=>{let r=Bs(e.definitions,uh(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&lh.add(e.binding);return r},vh=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),yh=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?ph(e,t,i):n;if(r===0){let n=dh(e,uh(i,t));if(typeof n!=`boolean`)throw new b(`TLC expected a boolean in the temporal formula at ${Wo(e)}`);return Em(n)}return r===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(t,r,i,s)=>{if(o.depth>=100)throw n(new b(u),e.error);o.depth++;let c=f(t,r);o.depth--;let l=Mm(c);return l>2?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=uh(i,t),a=X(e)||os(n,i)===void 0?ts(t,n):void 0;if(a?.kind===`Thunk`&&lh.has(a))return s(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:X(e)?Ds(n,r):ws(n,i);if(o?.kind!==`Closure`)throw fh(e);let c=e.kind===`Apply`?e.args:[];return s(o.body,Rs(o,c,r),e,t)},l=(e,t)=>{if(!e.bounds.every(e=>ph(e.set,t,i)===0))throw fh(e);let n=[];ds(e.bounds,uh(i,t),t=>(n.push(f(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return Em(r);let o=jm(r?`And`:`Or`,n),s=Mm(o);return s>2?o:a(e,t,s)},d=(e,t)=>{switch(e.kind){case`Label`:f(e.body,t);return;case`Let`:f(e.body,_h(e,t,i));return;case`And`:case`Or`:for(let n of e.operands)f(n,t);return;case`Apply`:if(e.operator===`=>`||e.operator===`~`&&!X(e))for(let n of e.args)f(n,t);return;case`If`:{let n=f(e.condition,t),r=n.kind===`Boolean`?[n.value?e.consequent:e.alternative]:[e.consequent,e.alternative];for(let e of r)f(e,t)}}},f=(e,t)=>{let n=ph(e,t,i);if(n<=2)return d(e,t),a(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,_h(e,t,i));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?km(`Always`,Am(`Or`,km(`Not`,f(n[0],t)),km(`Eventually`,f(n[1],t)))):e.operator===`~`&&!X(e)?km(`Not`,f(n[0],t)):e.operator===`=>`?Am(`Or`,km(`Not`,f(n[0],t)),f(n[1],t)):c(e,t)}case`And`:case`Or`:return jm(e.kind,e.operands.map(e=>f(e,t)));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(ph(e.condition,t,i)===0){let n=dh(e.condition,uh(i,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return Am(`Or`,Am(`And`,n,f(e.consequent,t)),Am(`And`,km(`Not`,n),f(e.alternative,t)))}case`Always`:case`Eventually`:return km(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=vh(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=km(`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`?km(`Always`,km(`Eventually`,Am(`Or`,i,a))):Am(`Or`,km(`Eventually`,km(`Always`,i)),km(`Always`,km(`Eventually`,a)))}default:throw fh(e)}};return f(t,r)},bh=(e,t,n,r,i)=>{let a=e=>bh(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?as(_c(e.expression,a),`a temporal property predicate`):zo(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&as(_c(e.unchanged,a),`a subscript`)?!1:as(_c(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return bh(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new b(`TLC cannot evaluate a temporal formula in a single step`)}},xh=(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)=>xh(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 bh(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Sh=(e,t)=>e.every((e,n)=>nt(e,t[n])),Ch=e=>e.filter((t,n)=>n===0||e[n-1]!==t),wh=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.pending.push(void 0),e.offsets.push(-1),e.edgeOffsets.push(-1),e.nodeStates.length-1),Th=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},Eh=(e,t)=>(e.offsets[t]??-1)!==-1,Dh=(e,t)=>e.pending[t]??=[],Oh=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},kh=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,Ah=2**53-1,jh=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>yh(e.expression,e.scope,i)),s=t.map(e=>km(`Not`,yh(e.expression,e.scope,i))),c=s.length===1?s[0]:jm(`Or`,s),l=o.length===0?c:jm(`And`,[...o,c]),u=oh(l);if(u.length===0)throw n(new b(hh),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Im(e),n=d.get(t)??d.size;return d.set(t,n),n}),nodeStates:[],nodeTableaux:[],pending:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},edgeOffsets:[],edges:{ids:/* @__PURE__ */ new Int32Array(1024),length:0},initial:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),p={multiplier:1},m=!Qs(i),h={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},g=e=>{let t=h.states.get(e)??/* @__PURE__ */ new Map;return h.states.set(e,t),t},_=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},v=(e,t)=>bh(e,t,void 0,i,m?g(t):/* @__PURE__ */ new Map),y=(e,t,n)=>_(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!v(e,n))),x=(e,t,n,r)=>_(t,()=>{let t=e.solution.actionChecks;if(!m)return Uint8Array.from(t,e=>+!!bh(e,n,r,i,/* @__PURE__ */ new Map));let a=g(n),o=h.actions.get(n)??/* @__PURE__ */ new Map;h.actions.set(n,o);let s=o.get(r)??new Int8Array(d.size).fill(-1);return o.set(r,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!bh(t[o],n,r,i,a)),s[e]))}),S=(e,t,n,r)=>_(n,()=>e.nodes[t].statePredicates.every(e=>v(e,r))),C=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},w=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),T=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Th(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ee=(e,t,n)=>{let r=wh(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Th(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Th(i,t,n)),r},te=(e,t,n)=>t.nodes.flatMap((t,r)=>T(e,n,r)??[]).sort((e,t)=>e-t),ne=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o;let s=e.pending[t]??[],c=e.edges,l=c.length;if(c.length+=s.length+1,c.length>c.ids.length){let e=new Int32Array(Math.max(2*c.ids.length,c.length));e.set(c.ids),c.ids=e}c.ids[l]=s.length,c.ids.set(s,l+1),e.edgeOffsets[t]=l,e.pending[t]=void 0},E=(e,t,n)=>{let r={slots:Array.from({length:16*p.multiplier}),count:0},i=(e,t)=>{for(let n=(a.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Sh(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&i(r.slots,t)}i(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*p.multiplier&&p.multiplier++,r.slots.filter(e=>e!==void 0)},re=(e,t,n,r,i)=>{let o=y(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=Dh(e,i),u=s.successors.length>0?x(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!S(t,a,r,n))continue;if(C(t,a)&&e.errorNode===void 0&&w(e)){e.errorNode=i;return}let o=T(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??ee(e,r,a);l.push(s),c.push(u),o===void 0&&re(e,t,n,r,s)}for(let i of a.getSuccessors(n)){let a=x(e,r,n,i.state),o=e.isDone[i.index]===!0;for(let n of s.successors){if(!S(t,n,r,i.state))continue;let s=T(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ee(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&re(e,t,i.state,i.index,u)}}l.length>0&&ne(e,i,c,o)},D=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>S(t,r,a,e.state)));e.isDone[a]=!0;for(let s of te(e,t,a)){let a=Dh(e,s),c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=T(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ee(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&re(e,t,n.state,n.index,d)}}),ne(e,s,c,i)}if(e.errorNode!==void 0)return Ch(k(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},O=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)wh(e,e.nodeStates.length,-1);let a=Dh(e,i),o=[];t.forEach((t,r)=>{Eh(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ne(e,i,o,r)},k=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Eh(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of Oh(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Eh(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new b(`Couldn't re-create liveness trace (path) starting at: ${t}`)},A=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>Eh(e,t)),l=[],u=t=>{let n=Oh(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&rh(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=Ah;return}let c=/* @__PURE__ */ new Set,f=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=f.get(e.nodeStates[t]);if(n?n.push(t):f.set(e.nodeStates[t],[t]),s[t]=Ah,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...c].some(n=>kh(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>Oh(e,n).some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>d(t,e)));if(m&&h&&g)return p(r,c,f)},p=(r,i,s)=>{let c=Ch(k(e,r).reverse().map(t=>e.nodeStates[t])),l=[],u=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),p=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+p.length+h.length},_={node:r},v=e=>i.has(e),y=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&kh(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&d(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},i=g.count;if(Oh(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!o(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!p[t]&&a(_.node,c,e)&&(p[t]=!0,g.count--)})}return g.count<i?(y(r),u.clear(),!0):(v(r)&&!u.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){y(n.last),u.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new b(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=Oh(e,t).find(e=>v(e)&&!u.has(e))??-1}y(n.unvisited),u.add(n.unvisited)}}let x=m(r,_.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let S=c[c.length-1];return x[x.length-1]===S&&x.pop(),{prefix:c.slice(0,-1),cycle:[S,...x.reverse()]}},m=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Oh(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new b(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=f(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};Oh(e,a).forEach((t,r)=>{Eh(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{h.states.clear(),h.actions.clear();for(let n of f){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)S(r,i,void 0,t)&&n.initial.push(T(n,e,i)??ee(n,e,i))}},addState:(e,t,n)=>{h.states.clear(),h.actions.clear();let r=E(e,t,n);for(let n of f){let i=r.map(r=>x(n,e,t,r.state)),a=y(n,e,t),o=n.solution.tableau,s=o?D(n,o,r,i,a,e):O(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=A(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!xh(s[r].body,e,n,0,i)).map(e=>e.name))]}},Mh=`UnnamedAction`,Nh={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Ph=e=>{let t=e.range??Nh;return Wt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Fh=e=>{let t=[[`name`,e.name],[`location`,Ph(e.location)]];return e.parameters.length===0?Wt(t):Wt([...t,[`context`,Wt(e.parameters)],[`parameters`,Ut(e.parameters.map(e=>e[0]))]])},Ih=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Lh=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Rh=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,zh=e=>e.kind===`Apply`?e.args:[],Bh=(e,t,n)=>{let r=Rh(e);if(r===void 0)return;if(X(e)){let e=ts(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=ws(r,n);return i?.kind===`Closure`?i:void 0},Vh=(e,t)=>{try{return _c(e,Lh(t,void 0)),!0}catch(e){if(e instanceof f)return!1;throw e}},Hh=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&cs(e,t)&&Vh(e.body,t),Uh=(e,t)=>{let n=os(e.name,t);return n?.body===e.body&&Hh(n,t)},Wh=(e,t)=>{if(e.kind!==`Identifier`||!X(e))return;let n=ts(t,e.name);return n?.kind===`Thunk`?n:void 0},Gh=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ts(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Kh=(e,t)=>{try{return e()}catch(e){if(e instanceof f)return t();throw e}},qh=(e,t,n,r,i)=>{let a=zh(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>ph(e,n,i)!==0)?o():Kh(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),_c(e,Lh(i,n))]),expression:t,scope:n}],o)},Jh=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Mh,location:e.location,parameters:Gh(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Jh(e.body,Bs(e.definitions,Lh(r,t)),n,r,i);case`Label`:return Jh(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Jh(e,t,n,r,i));case`Exists`:return Kh(()=>{let o=[];return ds(e.bounds,Lh(r,t),t=>(o.push(...Jh(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=X(e)?void 0:i.get(Rh(e)??``),s=Bh(e,t,r);if(o)return qh(o,e,t,s,r);if(!s)return[a()];let c=zh(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Uh(s,r)||c.some(e=>ph(e,t,r)!==0)?l():Kh(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:_c(n,Lh(r,t))},parent:e}),s.scope);return Jh(s.body,e,s,r,i)},l)},Yh=(e,t,n,r,i)=>{let a=(e,t)=>Yh(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Bs(e.definitions,Lh(n,t)));return}let o=Wh(e,t);if(o){a(o.expression,o.scope);return}let s=Bh(e,t,n);if(s&&Uh(s,n))return;if(s&&s.params.length===0){if(ph(s.body,s.scope,n)===1){r.inits.push(Ih(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Rs(s,e.args,Lh(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(Ih(Mh,e));return}let c=ph(e,t,n);c<=1?r.inits.push(Ih(Mh,e)):c===3&&r.temporals.push(Ih(Mh,e))},Xh=(e,t,n,r,i)=>{let a=(t,n)=>Xh(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Bs(t.definitions,Lh(r,n)));return}let o=Wh(t,n);if(o){a(o.expression,o.scope);return}let s=Bh(t,n,r);if(s&&Uh(s,r))return;if(s&&s.params.length===zh(t).length){a(s.body,t.kind===`Apply`?Rs(s,t.args,Lh(r,n)):s.scope);return}if(t.kind===`Forall`&&Kh(()=>(ds(t.bounds,Lh(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Ih(e,a)):ph(a,n,r)<2?i.invariants.push(Ih(e,a)):i.impliedTemporals.push(Ih(e,t));return}let c=ph(t,n,r);c<=1?i.impliedInits.push(Ih(e,t)):c===3&&i.impliedTemporals.push(Ih(e,t))},Zh=(e,t)=>{let n=os(e,t);return n?.kind===`Operator`&&!Hh(n,t)?n:void 0},Qh=e=>Wt([[`name`,e.name],[`location`,Ph(e.location)]]),$h=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Zh(e.specification,t);a&&(Yh(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Jh(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:ws(e.init,t);o?.kind===`Closure`&&r.inits.push(Ih(e.init??``,o.body));let s=e.next===void 0?void 0:ws(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Jh(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Zh(e,t);n&&r.invariants.push(Ih(e,n.body))}),e.properties.forEach(e=>{let n=Zh(e,t);n&&Xh(e,n.body,void 0,t,r)}),r},eg=(e,t,n)=>$h(e,t,n).actions,tg=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>Y(e[1])).join(`,`)})`,ng=e=>`${e.name===Mh?`Action`:e.name}${tg(e)} ${_(e.location.range??Nh)}`,rg=e=>`${e.name}${tg(e)}`,ig=(e,t,n,r)=>{let i=$h(e,t,r),a=e=>Dt(e.map(Fh)),o=e=>Dt(e.flatMap(e=>{let n=Zh(e,t);return n?[Qh(n)]:[]}));return Wt([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Dt(t.variables.map((e,t)=>Wt([[`name`,e],[`location`,Ph(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},ag=`paired12`,og=(e,t=16)=>e<=t*.75?t:og(e,t*2),sg=(e,t)=>{let n=og(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},cg=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),lg=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),ug=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),dg=e=>ug(e).replaceAll(`
429
+ `,`\\n`),fg=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},close:()=>t?.(e.path,n.join(``))}},pg=(e,t)=>{let n=[`strict digraph DiskGraph {
421
430
  `,`node [shape=box,style=rounded]
422
- `,e.colorize?`edge [colorscheme="${km}"]\n`:``,`nodesep=0.35;
431
+ `,e.colorize?`edge [colorscheme="${ag}"]\n`:``,`nodesep=0.35;
423
432
  `,`subgraph cluster_graph {
424
433
  `,`color="white";
425
434
  `],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=r.get(e.level)??/* @__PURE__ */ new Set;r.set(e.level,t.add(e.fingerprint))},o=e=>{if(!e)return 1;let t=i.get(e.name)??i.size+2;return i.set(e.name,t),t},s=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
426
- `,`node [ labeljust="l",colorscheme="${km}",style=filled,shape=record ]\n`,...jm([...i.keys()],Nm).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...jm([...r],e=>e[0]).map(e=>`{rank = same; ${jm([...e[1]],Mm).map(e=>`${e};`).join(``)}}\n`),`}
427
- `,e.colorize&&i.size>1?s():``,`}`].join(``),l=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),n.join(``)+c())};return{writeInitialState:e=>{n.push(`${e.fingerprint} [label="${Fm(e.getLabel())}",style = filled]\n`),a(e),l()},writeSuccessor:(t,r,i,s)=>{let c=e.colorize?String(o(s)):`black`,u=e.actionLabels&&s?Pm(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${Fm(r.getLabel())}",tooltip="${Fm(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},Rm=(e,t)=>e.dot?Lm(e,t):Im(e,t),zm=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Bm=(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},Vm=t=>n(new v(`${l}${t}`),e.error),Hm=e=>{if(!N(e))throw Vm(`The symmetry values must be function records.`);let t=H(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!P(e)||!P(i))throw new _(`Symmetry function must have model values as domain and range`);e.name!==i.name&&n.set(e.name,i)}),n},Um=(e,t)=>{let n=t.definitions.get(e);if(n===void 0&&!t.constants.has(e))throw new _(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(n?.kind!==`Operator`||n.params.length>0)throw Vm(`The symmetry function ${e} must specify a set of permutations.`);let r=X(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!M(r)||!z(r))throw Vm(`The symmetry operator must specify a set of functions.`);let i=B(r).elements.map(Hm);if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(zm(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=Bm(n,e),r=zm(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},Wm=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=qm(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(qm(e[r],t));return a}},Gm=(e,t)=>{let n=[],r=[];for(let i of e){let e=qm(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(L);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(L(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},Km=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,qm=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Km(e);if(n===0||n>64)return Jm(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Jm(e,t),a=i!==e&&tt(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},Jm=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Gm(e.elements,t);return n?Ze(n):e}if(n===`Function`||n===`LazyFunction`&&z(e.domain)){let n=H(e),r=Wm(n.domain,t),i=Wm(n.range,t)??n.range;if(r){let e=Pt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Qe(n.domain,e.range):e}return i===n.range?n:Qe(n.domain,i)}if(n===`Interval`||!M(e)||!z(e))return e;let r=B(e),i=Wm(r.elements,t);return i?Ot(i):r},Ym=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(qm(e[r],n));return t},Xm=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=qm(e[o],n),c=L(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>qm(e,n)):Ym(e,i,n)}},Zm=(e,t,n)=>t.reduce((t,r)=>Xm(e,t,r,n)??t,e),Qm=(e,t)=>e*((t-e)/2**64),$m=e=>e.includes(`.`)?e:`${e}.0`,eh=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return $m(String(e));let[n,r]=e.toExponential().split(`e`);return`${$m(n)}E${r.replace(`+`,``)}`},th=e=>e!==void 0&&e>=`0`&&e<=`9`,nh=e=>{if(e===0)return`0.0`;let t=eh(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;th(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(;th(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;th(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(th(t[n.next])&&Number(t[n.next])>=5&&(n.result=rh(n.result));th(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},rh=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${rh(r)}.`:n===`9`?`${rh(r)}0`:`${r}${Number(n)+1}`},ih=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}`)},ah=(e,t,n)=>{if(Qm(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},oh=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}).`},sh={line:0,column:0},ch=`Failed to recover the initial state from its fingerprint.`,lh=`Failed to recover the next state from its fingerprint.`,uh=e=>({kind:`Identifier`,name:e,location:sh}),dh=/* @__PURE__ */ new Set([`name`,`property`]),fh=(e,t,n)=>{let r=Ao(t,n);if(!r)throw new _(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new _(dh.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},ph=(e,t,n)=>{let r=fh(e,t,n);if(Mo(r,n))throw new _(`The ${e} ${t} cannot be a constant.`);return r},mh=(e,t,n)=>{if(Mo(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(uh(e),Nh(n,void 0,void 0))}catch(e){if(e instanceof v||d(e))return;throw e}},hh=(e,t,n)=>{let r=fh(e,t,n),i=mh(t,r,n);if(i!==void 0&&i!==!0)throw new _(`The ${e} of ${t} is equal to ${U(i)}`);return i===void 0?r:void 0},gh=(t,r)=>{let i=gf({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>Ao(e,r)});return t.flatMap(t=>{let a=hh(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
435
+ `,`node [ labeljust="l",colorscheme="${ag}",style=filled,shape=record ]\n`,...sg([...i.keys()],lg).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...sg([...r],e=>e[0]).map(e=>`{rank = same; ${sg([...e[1]],cg).map(e=>`${e};`).join(``)}}\n`),`}
436
+ `,e.colorize&&i.size>1?s():``,`}`].join(``),l=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),n.join(``)+c())};return{writeInitialState:e=>{n.push(`${e.fingerprint} [label="${dg(e.getLabel())}",style = filled]\n`),a(e),l()},writeSuccessor:(t,r,i,s)=>{let c=e.colorize?String(o(s)):`black`,u=e.actionLabels&&s?ug(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${dg(r.getLabel())}",tooltip="${dg(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},mg=(e,t)=>e.dot?pg(e,t):fg(e,t),hg=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),gg=(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},_g=t=>n(new b(`${l}${t}`),e.error),vg=e=>{if(!P(e))throw _g(`The symmetry values must be function records.`);let t=xn(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Pe(e)||!Pe(i))throw new y(`Symmetry function must have model values as domain and range`);e.name!==i.name&&n.set(e.name,i)}),n},yg=(e,t)=>{let n=t.definitions.get(e);if(n===void 0&&!t.constants.has(e))throw new y(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(n?.kind!==`Operator`||n.params.length>0)throw _g(`The symmetry function ${e} must specify a set of permutations.`);let r=_c(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!Me(r)||!Yt(r))throw _g(`The symmetry operator must specify a set of functions.`);let i=q(r).elements.map(vg);if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(hg(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=gg(n,e),r=hg(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},bg=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Cg(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(Cg(e[r],t));return a}},xg=(e,t)=>{let n=[],r=[];for(let i of e){let e=Cg(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Ye);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Ye(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},Sg=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Cg=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Sg(e);if(n===0||n>64)return wg(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=wg(e,t),a=i!==e&&nt(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},wg=(e,t)=>{let n=e.kind;if(n===`Set`){let n=xg(e.elements,t);return n?Qe(n):e}if(n===`Function`||n===`LazyFunction`&&Yt(e.domain)){let n=xn(e),r=bg(n.domain,t),i=bg(n.range,t)??n.range;if(r){let e=Nt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?$e(n.domain,e.range):e}return i===n.range?n:$e(n.domain,i)}if(n===`Interval`||!Me(e)||!Yt(e))return e;let r=q(e),i=bg(r.elements,t);return i?Dt(i):r},Tg=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(Cg(e[r],n));return t},Eg=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=Cg(e[o],n),c=Ye(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>Cg(e,n)):Tg(e,i,n)}},Dg=(e,t,n)=>t.reduce((t,r)=>Eg(e,t,r,n)??t,e),Og=(e,t)=>e*((t-e)/2**64),kg=e=>e.includes(`.`)?e:`${e}.0`,Ag=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return kg(String(e));let[n,r]=e.toExponential().split(`e`);return`${kg(n)}E${r.replace(`+`,``)}`},jg=e=>e!==void 0&&e>=`0`&&e<=`9`,Mg=e=>{if(e===0)return`0.0`;let t=Ag(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;jg(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(;jg(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;jg(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(jg(t[n.next])&&Number(t[n.next])>=5&&(n.result=Ng(n.result));jg(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Ng=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ng(r)}.`:n===`9`?`${Ng(r)}0`:`${r}${Number(n)+1}`},Pg=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}`)},Fg=(e,t,n)=>{if(Og(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},Ig=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}).`},Lg={line:0,column:0},Rg=`Failed to recover the initial state from its fingerprint.`,zg=`Failed to recover the next state from its fingerprint.`,Bg=e=>({kind:`Identifier`,name:e,location:Lg}),Vg=/* @__PURE__ */ new Set([`name`,`property`]),Hg=(e,t,n)=>{let r=os(t,n);if(!r)throw new y(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new y(Vg.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},Ug=(e,t,n)=>{let r=Hg(e,t,n);if(cs(r,n))throw new y(`The ${e} ${t} cannot be a constant.`);return r},Wg=(e,t,n)=>{if(cs(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return _c(Bg(e),l_(n,void 0,void 0))}catch(e){if(e instanceof b||d(e))return;throw e}},Gg=(e,t,n)=>{let r=Hg(e,t,n),i=Wg(t,r,n);if(i!==void 0&&i!==!0)throw new y(`The ${e} of ${t} is equal to ${Y(i)}`);return i===void 0?r:void 0},Kg=(t,r)=>{let i=Vp({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>os(e,r)});return t.flatMap(t=>{let a=Gg(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
428
437
  Note that a bug can cause TLC to incorrectly report this error.
429
438
  If you believe your TLA+ or PlusCal specification to be correct,
430
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new _(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:uh(t),scope:void 0}]})},_h=(e,t)=>{if(!N(e))return;let n=H(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},vh=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>vh(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Ao(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return vh(n.body,t)}return[e]},yh=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,Nh(t,void 0,void 0,e.scope));if(i===!1)throw new _(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new _(`The operator ${r.name}, which equals ${U(i)},\ncannot be used as a ${n}`);return!0},bh=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=fh(t,e,r).body,i=uh(e);if(n.kind!==`Number`&&n.kind!==`String`&&$(i,void 0,r)===0)throw new _(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=fh(`name`,t.specification,r),c=mh(t.specification,s,r);if(c!==void 0)throw new _(`The value of ${t.specification} is equal to ${U(c)}`);if(Bp(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(yh(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new _(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,r)<2)throw n(new _(`TLC cannot handle the temporal formula ${ho(c.expression)}`),e.error);let l=$(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new _(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new _(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:sh},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},xh=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=hh(`property`,e,t);r&&Bp(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(yh(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new _(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},Sh=(e,t,n)=>t.flatMap(t=>hh(e,t,n)?[{name:t,expression:uh(t),scope:void 0}]:[]),Ch=(e,t)=>{let n=Ao(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},wh=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);ph(`possible`,n,t);let i=uh(n);if($(i,void 0,t)===3)throw new _(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Th=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||W(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Eh=(e,t)=>e.flatMap(e=>vh(e.expression,t).map(n=>{let r=e.scope===void 0?fc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Th(n,r,t)}})),Dh=(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},Oh=/[\u0100-\uffff]/,kh=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Ah=e=>e.kind===`String`?Oh.test(e.value):e.kind===`Set`&&e.elements.some(Ah),jh=e=>e.kind===`String`&&Oh.test(e.value)||e.kind===`Apply`&&kh.has(e.operator)||ir(e).some(jh),Mh=(e,t)=>e.constants.some(e=>Ah(e.value)||(e.args??[]).some(Ah))||[...t.definitions.values()].some(e=>jh(e.body)||e.kind===`Function`&&e.bounds.some(e=>jh(e.set))),Nh=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Ph=(e,t,n)=>ko(X(e,t),n),Fh=(e,t,n=Ih)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new v(n(e,t.environment));return r},Ih=(e,t)=>{let n=e.kind===`Identifier`?Ao(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. ${r.kind===`Number`?r.text??String(r.value):i?h(i):ho(r)}`},Lh=()=>{},Rh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Ph(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),zh=(e,t,n)=>{try{return Ph(e,Nh(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof v)return{message:e.message};throw e}},Bh=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=zh(n.expression,t,`an assumption`);if(e)return{name:ho(n.expression),trace:[],message:e.message}}},Vh=(t,r,i)=>{let a=gh(t.invariants,r),o=bh(t,r),s=xh(t,r),c=Eh([...a,...s.invariants],r),l=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(l||s.initialPredicates.length>0||r.variables.length>0))throw new _(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&l)throw new _(`The configuration file did not specify the next state predicate.`);let u=Eh(Sh(`constraint`,t.constraints,r),r),d=Sh(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&fh(`rlreward`,t.rlReward,r),t.periodic!==void 0&&fh(`periodic`,t.periodic,r);let f=wh(t.possible,r);if(r.variables.length===0)return;let p=t.symmetry===void 0?[]:Um(t.symmetry,r);t.view!==void 0&&fh(`view function`,t.view,r);let m=t.view===void 0?void 0:{name:t.view,expression:uh(t.view),scope:void 0},g=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:sh};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,r)>=2,y=f.filter(e=>!v(e)),b=f.filter(v),x=r.runtime,ee={indices:void 0},te=()=>{if(ee.indices)return ee.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ee.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ee.indices},ne=p.length>0?te():void 0,re=(e,t)=>X(e,Nh(r,t,void 0)),ie=e=>{let t=te(),n=p.length===0?e:Zm(e,p,t);return ll(m===void 0?t.map(e=>n[e]):[re(m.expression,n)])},S=Mh(t,r);x.getFingerprint=ie;let C=()=>{let e=f.find(e=>!x.possibleCounts.get(e.name));if(!e)return;let t=Ch(e.name,r),n=t?` at ${h(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} 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:Te(U(Ol(x),!0))}};return{properties:s,spec:o,isSymmetric:p.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(m!==void 0||S)return BigInt64Array.from(e,ie);let n=new BigInt64Array(t.length),r=fl(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(S)return[String(ie(e))];let t=p.length===0?e:Zm(e,p,ne);return m===void 0?t:[re(m.expression,t)]},findViolatedInvariant:(t,i)=>c.find(a=>{if(Dh(a,t,i))return!1;try{let e=Nh(r,t,void 0,a.scope),n=a.membership;return i&&n?!gn(t[n.variable],i[n.variable],X(n.set,e)):!Fh(a.expression,e)}catch(t){throw i?Gh(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>u.every(n=>{try{return Dh(n,e,t)||Fh(n.expression,Nh(r,e,void 0))}catch(e){throw t?Uh(e):e}}),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Fh(t.expression,Nh(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>g.find(n=>{try{return!Fh(n.action,Nh(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${ho(n.box)}`)&&!Ph(n.unchanged,Nh(r,e,t,n.scope),`a subscript`)}catch(e){throw Gh(Hh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>d.every(n=>{try{return Fh(n.expression,Nh(r,e,t))}catch(e){throw Uh(e)}}),trackStatePossible:y.length===0?Lh:e=>Rh(y,x,Nh(r,e,void 0)),trackActionPossible:b.length===0?Lh:(e,t)=>Rh(b,x,Nh(r,e,t)),findUnwitnessedPossible:C,findPostconditionViolation:()=>{let e=C();if(e)return e;for(let e of t.postconditions){let t=zh(uh(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},Hh=e=>e instanceof y?n(e,e.exitCode):e,Uh=e=>e instanceof v&&!(e instanceof y)&&!(e instanceof b)?n(new v(`${l}${e.message}`,e),ne(e)):Hh(e),Wh=(e,t)=>{try{e();return}catch(e){return e instanceof v?t.flatMap(e=>{let t=e.location.range;return t?[`Line ${t.start.line}, column ${t.start.column} to line ${t.end.line}, column ${t.end.column} in ${t.module}`]:[]}).filter((e,t,n)=>t===0||n[t-1]!==e):[]}},Gh=(e,t)=>e instanceof v?n(new v(`${t}\n${e.message}`,e),ne(e)):e,Kh=t=>{let r=t.dump&&Rm(t.dump,t.writeFile);try{return qh(t,r)}catch(t){throw d(t)?n(new v(u),e.error):t}finally{r?.close()}},qh=(t,r)=>{let i=typeof t.config==`string`?ye(t.config):t.config,a=t.onPrint??console.log,o={isMuted:!1,replayed:void 0},s=e=>{o.replayed?o.replayed.push(e):o.isMuted||a(e)},l=e=>{o.isMuted=!0;let t=e();return o.isMuted=!1,t};Be(zf(t.source,i,t.loadModule));let f=Yf(i,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:s,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed}),p=f.environment,m=p.runtime;m.pause=t.onPause??(()=>{}),m.getSpecification=()=>Om(i,p,f.variableLocations,f.instanceActions);let h={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:m.generatedStates,distinctStates:m.distinctStates,queuedStates:m.queueSize,depth:m.generatedStates===0?0:Math.max(h.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),x=Array.from({length:32},()=>0),ee={newStates:0},te=()=>Math.min(ee.newStates,31),re=()=>x.map((e,t)=>t===te()?e+1:e),ie=()=>({...g(`success`),outDegrees:[...x],fingerprintDistance:ah(m.distinctStates,m.generatedStates,()=>C?C.getStoredFingerprints(A,pe):BigInt64Array.from(A,m.getFingerprint))}),S=()=>Rf(t.source,t.loadModule,`variable`),C=Vh(i,p,S),ae=Bh(f.assumptions,p);if(ae)return g(`assumption-violation`,ae);if(!C)return ie();let oe=i.postconditions.length>0||i.possible.length>0,w=(e,t,n)=>{if(oe){let e=t.loopStart;m.counterExample=ju(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=C.findUnwitnessedPossible();return r||C.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},se=C.spec,T=C.getFingerprintState,E={value:void 0},D=(e,t)=>{if(!e.failure)return e;let n=[],r={...p,evaluators:/* @__PURE__ */ new WeakMap,trace:n},a=Vh(i,r,S);if(!a)return e;let s=[];o.replayed=s;let c=Wh(()=>t(a,r),n);return o.replayed=void 0,{...e,failure:{...e.failure,replay:{output:s,callStack:c}}}},O=e=>D(e,(e,t)=>{se.init!==void 0&&lo(se.init,t,t=>(e.satisfiesConstraints(t),e.findViolatedInvariant(t)!==void 0||e.findFailedInitialPredicate(t)!==void 0),se.scope)}),ce=e=>{let t=me[e];t===-1?we():(ce(t),Se(t,A[t],A[e]))},k=(e,t)=>D(e,(e,n)=>{ce(t);let r=A[t];E.value??=wm(i,p,f.instanceActions),E.value.find(t=>po(t.expression,r,n,t.scope).some(t=>!(e.satisfiesConstraints(t.state)&&e.satisfiesActionConstraints(r,t.state))&&e.findViolatedInvariant(t.state)!==void 0||e.findViolatedActionProperty(r,t.state)!==void 0))}),le=i.view!==void 0||i.symmetry!==void 0,ue=[],de=c(()=>tm(C.properties.liveness,se.temporals,p,{getFingerprint:e=>ue[e]??=Number(BigInt.asIntN(32,m.getFingerprint(A[e]))),getSuccessors:e=>{let t=[];return se.next===void 0||fo(se.next,e,p,n=>{if(j(n.state),!(C.satisfiesConstraints(n.state,e)&&C.satisfiesActionConstraints(e,n.state)))return!1;let r=T(n.state),i=Ne(Ae(r),r);return t.push({index:i,state:n.state}),!1},se.scope),t}})),fe=C.isSymmetric||de!==void 0,A=[],pe=[],me=[],he=[],ge=[],_e={slots:new Int32Array(1<<17),size:0,shift:16},j=rr(),ve=e=>Object.fromEntries(C.getTlcOrder().map(t=>[p.variables[t],e[t]])),be=(e,t,n,r)=>(m.getLevel=()=>n+1,m.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),xe(e,t[n].state,(t[n+1]??t[r??n]).state)),xe=(e,t,n)=>{try{let r=ph(`alias`,e,p).body,i=X(uh(e),Nh(p,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return _h(i,a)??ve(t)}catch(e){if(!(e instanceof _||e instanceof v))throw e;return{...ve(t),_ALIASEvalError:e.message}}},Se=(e,t,n)=>{E.value??=wm(i,p,f.instanceActions);let r={...F};Object.assign(F,{index:e,isExpanding:!0,candidate:void 0});let a=T(n),o=E.value.find(e=>po(e.expression,t,p,e.scope).some(e=>je(T(e.state),a)));return Object.assign(F,r),o&&Em(o)},Ce=(e,t,n)=>{let r=i.alias,a=l(()=>(e.length>1&&xs(p)&&we(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:Se(t[r-1],e[r-1].state,n.state))));return e.map((t,i)=>({action:t.action,label:a[i],state:r===void 0?ve(t.state):be(r,e,i,n)}))},we=()=>se.init===void 0?[]:uo(se.init,p,se.scope),Te=e=>se.next===void 0?[]:po(se.next,e,p,se.scope),M=(e,t)=>je(T(e),pe[t]),Ee=(e,t)=>Te(e).find(e=>M(e.state,t)),N=(e,t)=>{let n=le||xs(p)?we().find(t=>M(t,e[0])):A[e[0]];if(!n)throw new v(ch);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=Ee(i,e[n]);if(!a)throw new v(t);r.push(a)}return r},P=(e,t)=>{let n=[];for(let t=e;t!==-1;t=me[t])n.unshift(t);let r=le&&n.length>1?N(n,ch):n.map(e=>({state:A[e],action:he[e]}));if(!t)return Ce(r,n);let i=le?Te(A[e]).find(e=>je(e.state,t.state))?.action:t.action;return Ce([...r,{state:t.state,action:i}],n)},De=e=>me[e]===-1?[{action:void 0,label:void 0,state:ve(A[e])}]:P(e),Oe=(t,r,i,a)=>{if(d(t))return F.isExpanding?Oe(n(new v(u),e.error),De(F.index)):Oe(new v(u),r,i);if(!(t instanceof v))throw t;return{...g(`error`,void 0,{message:t.message,trace:r,initialState:i&&!(t instanceof y)?ve(i):void 0,exitCode:ne(t)}),outDegrees:a}},ke=(e,t)=>{let n=N(e,lh),r=n[n.length-1].state;if(le&&t!==void 0&&t!==e.length-1&&Ee(r,e[t])===void 0)throw new v(lh);return n},Ae=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Nn(t,Rn(e[n]));return t&1073741823},je=(e,t)=>{for(let n=0;n<t.length;n++)if(!tt(e[n],t[n]))return!1;return!0},Me=e=>Math.imul(e,2654435761)>>>_e.shift<<1,Ne=(e,t)=>{let n=_e.slots.length-1;for(let r=Me(e);;r=r+2&n){let n=_e.slots[r+1];if(n===0)return-1;if(_e.slots[r]===e&&je(pe[n-1],t))return n-1}},Pe=(e,t)=>{let n=_e.slots.length-1,r=Me(e);for(;_e.slots[r+1]!==0;)r=r+2&n;_e.slots[r]=e,_e.slots[r+1]=t},Fe=(e,t)=>{if(_e.size++,_e.size*4>_e.slots.length){let e=_e.slots;_e.slots=new Int32Array(e.length*2),_e.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&Pe(e[t],e[t+1])}Pe(e,t+1)},Ie=e=>{m.distinctStates=A.length+1,h.depth=Math.max(h.depth,e),m.diameter=Math.max(m.diameter,e)},Le=(e,t,n,r)=>{let i=n===-1?1:ge[n]+1;A.push(e),pe.push(t),me.push(n),he.push(r),ge.push(i)},F={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,isFingerprinting:!1,livenessSource:-1},Re=e=>e===-1?[]:[...Re(me[e]),A[e]];m.isSeen=e=>{let t=T(e);return Ne(Ae(t),t)!==-1},m.getBehavior=e=>{let t=e===F.candidate?-1:A.indexOf(e);return t===-1?[...Re(F.index),e]:Re(t)},m.getCurrentState=()=>F.index===-1?void 0:A[F.index],m.setLivenessSource=e=>{F.livenessSource=e??-1},m.getLevel=e=>{let t=F.livenessSource;return t===-1?e===F.candidate?F.candidateLevel:F.index===-1?0:e===A[F.index]?ge[F.index]:F.isExpanding?ge[F.index]+1:0:e===A[t]?ge[t]:ge[t]+1};let ze=(e,t)=>({fingerprint:BigInt.asIntN(64,m.getFingerprint(e)),level:t,getLabel:()=>tr(i.alias===void 0?ve(e):xe(i.alias,e,void 0)),getText:()=>tr(ve(e))}),Ve=e=>{j(e),m.generatedStates++,m.initialStates++,F.candidate=e,F.candidateLevel=1;let t=T(e),n=Ae(t),i=C.satisfiesConstraints(e);if(i&&C.trackStatePossible(e),i&&Ne(n,t)!==-1)return;i&&(Ie(1),m.queueSize++,de?.addInitialState(A.length,e),r?.writeInitialState(ze(e,1)));let a=C.findViolatedInvariant(e);if(a)return w(`invariant-violation`,{name:a.name,trace:Ce([{action:void 0,state:e}],[])});let o=C.findFailedInitialPredicate(e);if(o)return w(`liveness-violation`,{name:o.name,trace:Ce([{action:void 0,state:e}],[])});i&&(Fe(n,A.length),Le(e,t,-1,void 0))},He=(e,t,n,i,a)=>{let o=A[e];m.generatedStates++,F.candidate=t.state,F.candidateLevel=ge[e]+1,fe&&j(t.state),F.isFingerprinting=!0;let s=T(t.state),c=Ae(s);F.isFingerprinting=!1;let l=Ne(c,s),u=C.satisfiesConstraints(t.state,o);u&&C.trackStatePossible(t.state);let d=u&&C.satisfiesActionConstraints(o,t.state);d&&C.trackActionPossible(o,t.state);let f=d?l:-1;if(i&&d&&r?.writeSuccessor(i,ze(t.state,ge[e]+1),f!==-1,a&&{name:a.name,signature:Dm(a)}),f!==-1&&de){let e=A[f],r=e.every((e,n)=>e===t.state[n]);n.push({index:f,state:r?e:t.state})}let p=d&&f===-1;if(p&&(Ie(ge[e]+1),ee.newStates++),f===-1)try{let n=C.findViolatedInvariant(t.state,o);if(n)return w(`invariant-violation`,{name:n.name,trace:P(e,t)})}catch(n){return Oe(n,P(e,t),void 0,re())}let h=C.findViolatedActionProperty(o,t.state);if(h)return w(`liveness-violation`,{name:h.name,trace:P(e,t)});p&&(fe||j(t.state),Fe(c,A.length),de&&n.push({index:A.length,state:t.state}),Le(t.state,s,e,t.action),m.queueSize++)},Ue={result:void 0};if(se.init!==void 0)try{lo(se.init,p,e=>{try{Ue.result=Ve(e)}catch(t){Ue.result=Oe(t,[],e)}return Ue.result!==void 0},se.scope)}catch(e){return O(Oe(e,[]))}if(Ue.result)return O(Ue.result);let We=se.next;if(We===void 0){if(A.length>0)throw new v(`No next state actions defined to generate successor states from.`);return ie()}let I=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),Ge=(e,t)=>{if(!I)return fo(We,e,p,e=>t(e,void 0),se.scope);E.value??=wm(i,p,f.instanceActions);let n={isStopped:!1};return E.value.reduce((r,i)=>n.isStopped?r:r+fo(i.expression,e,p,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},Ke=e=>{let t=A[e],n=[],a=r&&ze(t,ge[e]),o=Ge(t,(t,r)=>{try{Ue.result=He(e,t,n,a,r)}catch(n){if(F.isFingerprinting)throw n;let r=Oe(n,P(e,t));Ue.result=d(n)?r:k(r,e)}return Ue.result!==void 0});if(F.isExpanding=!1,Ue.result)return Ue.result;if(o===0&&i.checkDeadlock)return w(`deadlock`,{name:`deadlock`,trace:De(e)});try{let r=de?.addState(e,t,n);if(!de||!r)return;let i=ke(r),a=de.getViolatedProperties(i.map(e=>e.state),i.length-1);return w(`property-violation`,{name:a[0],properties:a,trace:Ce(i,r)})}catch(t){return Oe(t,De(e),void 0,re())}},qe=(e,t)=>{E.value??=wm(i,p,f.instanceActions);let n=E.value,r=n.length===1?n[0]:n.find(t=>t.name===e.action),a=`variable${e.missing.length>1?`s are`:` is`} not defined: ${e.missing.join(`, `)}.\n`;return m.generatedStates++,Oe(n.length===1?e:new v(`Successor state is not completely specified by action ${e.action} of the next-state relation. The following ${a}`),[...De(t),{action:e.action,label:r&&Em(r),state:ve(e.state.map(e=>e??Xe(`null`)))}])},Je=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=ke(n,r),a=Ce(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),s=n[r],c=n[n.length-1],u=i[i.length-1].state,d=s===c?void 0:l(()=>Se(c,u,A[s]));return w(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>s===c?a[a.length-1].action:Ee(u,s)?.action)},L=de!==void 0&&t.livenessCheck!==`final`,Ye=performance.now(),Ze={at:Ye+3e3,size:1,time:0},Qe=e=>{let t=performance.now();if(Ze.at=t+6e4,!((e-Ze.size)/Ze.size>.1)||Ze.time>(t-Ye)*.2)return;Ze.size=e;let n=de?.findViolation();return Ze.time+=performance.now()-t,n};for(let e=0;e<A.length&&!m.isStopped;e++){F.index=e,F.candidate=void 0,m.queueSize=A.length-e-1,F.isExpanding=!0;try{Ue.result=Ke(e)}catch(t){let n=t instanceof b?qe(t,e):Oe(Uh(t),De(e));Ue.result=t instanceof b||d(t)?n:k(n,e)}if(Ue.result)return Ue.result;if(x[te()]++,ee.newStates=0,L&&performance.now()>=Ze.at){let t=Qe(e+1);if(de&&t)return Je(de,t)}}F.index=-1,F.candidate=void 0;let $e=de?.findViolation();if(de&&$e)return Je(de,$e);let et=C.findPostconditionViolation();return et?g(`postcondition-violation`,{...et,trace:[]}):ie()},Jh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Yh=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Rn(e[t]),16777619),r=Math.imul(r^Gn(e[t]),1540483477);t[0]=Jh(n)||1,t[1]=Jh(r)},Xh=()=>{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)}}},Zh=(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}},Qh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),$h=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Zh(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},eg=e=>Atomics.load(e.used,0)*2>=e.slots.length,tg=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Zh(t,n);return{slots:t,used:e.used}},ng=()=>{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=On(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),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})}},rg=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 Xe(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Ht({kind:`Interval`,low:e,high:e+t-1});return Qe(a,i(t))}let a=n[r.index++];if(e===5)return Ze(i(a));let o=i(a);return Qe(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{ye as A,ne as B,uo as C,U as D,tr as E,x as F,p as I,te as L,_ as M,f as N,He as O,v as P,ee as R,xs as S,rr as T,e as V,Yf as _,tg as a,Kc as b,Yh as c,Bh as d,nh as f,oh as g,Qm as h,Qh as i,ue as j,Be as k,Kh as l,ah as m,ng as n,$h as o,ih as p,Xh as r,eg as s,rg as t,Vh as u,Rf as v,po as w,qc as x,zf as y,m as z};
439
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new y(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Bg(t),scope:void 0}]})},qg=(e,t)=>{if(!P(e))return;let n=xn(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Jg=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Jg(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=os(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Jg(n.body,t)}return[e]},Yg=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||ph(r,e.scope,t)>0)return!1;let i=_c(r,l_(t,void 0,void 0,e.scope));if(i===!1)throw new y(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new y(`The operator ${r.name}, which equals ${Y(i)},\ncannot be used as a ${n}`);return!0},Xg=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Hg(t,e,r).body,i=Bg(e);if(n.kind!==`Number`&&n.kind!==`String`&&ph(i,void 0,r)===0)throw new y(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=Hg(`name`,t.specification,r),c=Wg(t.specification,s,r);if(c!==void 0)throw new y(`The value of ${t.specification} is equal to ${Y(c)}`);if(gh(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Yg(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new y(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&ph(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${Go(c.expression)}`),e.error);let l=ph(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new y(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new y(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:Lg},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Zg=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Gg(`property`,e,t);r&&gh(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Yg(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&ph(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=ph(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new y(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},Qg=(e,t,n)=>t.flatMap(t=>Gg(e,t,n)?[{name:t,expression:Bg(t),scope:void 0}]:[]),$g=(e,t)=>{let n=os(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},e_=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new y(`_POSSIBLE lists ${n} more than once`);Ug(`possible`,n,t);let i=Bg(n);if(ph(i,void 0,t)===3)throw new y(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),t_=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||X(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},n_=(e,t)=>e.flatMap(e=>Jg(e.expression,t).map(n=>{let r=e.scope===void 0?Xc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:t_(n,r,t)}})),r_=(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},i_=/[\u0100-\uffff]/,a_=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),o_=e=>e.kind===`String`?i_.test(e.value):e.kind===`Set`&&e.elements.some(o_),s_=e=>e.kind===`String`&&i_.test(e.value)||e.kind===`Apply`&&a_.has(e.operator)||dr(e).some(s_),c_=(e,t)=>e.constants.some(e=>o_(e.value)||(e.args??[]).some(o_))||[...t.definitions.values()].some(e=>s_(e.body)||e.kind===`Function`&&e.bounds.some(e=>s_(e.set))),l_=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),u_=(e,t,n)=>as(_c(e,t),n),d_=(e,t,n=f_)=>{let r=_c(e,t);if(typeof r!=`boolean`)throw new b(n(e,t.environment));return r},f_=(e,t)=>{let n=e.kind===`Identifier`?os(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. ${r.kind===`Number`?r.text??String(r.value):i?_(i):Go(r)}`},p_=()=>{},m_=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=u_(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),h_=(e,t,n)=>{try{return u_(e,l_(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof b)return{message:e.message};throw e}},g_=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=h_(n.expression,t,`an assumption`);if(e)return{name:Go(n.expression),trace:[],message:e.message}}},__=(t,r,i)=>{let a=Kg(t.invariants,r),o=Xg(t,r),s=Zg(t,r),c=n_([...a,...s.invariants],r),l=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(l||s.initialPredicates.length>0||r.variables.length>0))throw new y(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&l)throw new y(`The configuration file did not specify the next state predicate.`);let u=n_(Qg(`constraint`,t.constraints,r),r),d=Qg(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Hg(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Hg(`periodic`,t.periodic,r);let f=e_(t.possible,r);if(r.variables.length===0)return;let p=t.symmetry===void 0?[]:yg(t.symmetry,r);t.view!==void 0&&Hg(`view function`,t.view,r);let m=t.view===void 0?void 0:{name:t.view,expression:Bg(t.view),scope:void 0},h=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Lg};return{...e,unchanged:t}}),g=e=>ph(e.expression,void 0,r)>=2,v=f.filter(e=>!g(e)),b=f.filter(g),x=r.runtime,S={indices:void 0},C=()=>{if(S.indices)return S.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return S.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),S.indices},w=p.length>0?C():void 0,T=(e,t)=>_c(e,l_(r,t,void 0)),ee=e=>{let t=C(),n=p.length===0?e:Dg(e,p,t);return ql(m===void 0?t.map(e=>n[e]):[T(m.expression,n)])},te=c_(t,r);x.getFingerprint=ee;let ne=()=>{let e=f.find(e=>!x.possibleCounts.get(e.name));if(!e)return;let t=$g(e.name,r),n=t?` at ${_(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} 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:Oe(Y(fu(x),!0))}};return{properties:s,spec:o,isSymmetric:p.length>0,getTlcOrder:C,getStoredFingerprints:(e,t)=>{if(m!==void 0||te)return BigInt64Array.from(e,ee);let n=new BigInt64Array(t.length),r=Xl(C(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(te)return[String(ee(e))];let t=p.length===0?e:Dg(e,p,w);return m===void 0?t:[T(m.expression,t)]},findViolatedInvariant:(t,i)=>c.find(a=>{if(r_(a,t,i))return!1;try{let e=l_(r,t,void 0,a.scope),n=a.membership;return i&&n?!bn(t[n.variable],i[n.variable],_c(n.set,e)):!d_(a.expression,e)}catch(t){throw i?C_(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>u.every(n=>{try{return r_(n,e,t)||d_(n.expression,l_(r,e,void 0))}catch(e){throw t?y_(e):e}}),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!d_(t.expression,l_(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>h.find(n=>{try{return!d_(n.action,l_(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Go(n.box)}`)&&!u_(n.unchanged,l_(r,e,t,n.scope),`a subscript`)}catch(e){throw C_(v_(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>d.every(n=>{try{return d_(n.expression,l_(r,e,t))}catch(e){throw y_(e)}}),trackStatePossible:v.length===0?p_:e=>m_(v,x,l_(r,e,void 0)),trackActionPossible:b.length===0?p_:(e,t)=>m_(b,x,l_(r,e,t)),findUnwitnessedPossible:ne,findPostconditionViolation:()=>{let e=ne();if(e)return e;for(let e of t.postconditions){let t=h_(Bg(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},v_=e=>e instanceof x?n(e,e.exitCode):e,y_=e=>e instanceof b&&!(e instanceof x)&&!(e instanceof C)?n(new b(`${l}${e.message}`,e),ne(e)):v_(e),b_=(e,t,n)=>t>0&&n[t-1]===e,x_=e=>e.flatMap(e=>e.location.range?[_(e.location.range)]:[]).filter((e,t,n)=>!b_(e,t,n)).map((e,t)=>`${t}) ${e}`).reverse(),S_=(e,t)=>{try{return e(),{callStack:void 0}}catch(e){if(!(e instanceof b))return{callStack:[]};let n=t.flatMap(e=>{let t=e.location.range;return t?[`Line ${t.start.line}, column ${t.start.column} to line ${t.end.line}, column ${t.end.column} in ${t.module}`]:[]}).filter((e,t,n)=>!b_(e,t,n)),r=Ae(e);return{callStack:n,fingerprint:r&&{sources:x_(r),reason:e.message}}}},C_=(e,t)=>e instanceof b?n(new b(`${t}\n${e.message}`,e),ne(e)):e,w_=t=>{let r=t.dump&&mg(t.dump,t.writeFile);try{return T_(t,r)}catch(t){throw d(t)?n(new b(u),e.error):t}finally{r?.close()}},T_=(t,r)=>{let i=typeof t.config==`string`?Se(t.config):t.config,a=t.onPrint??console.log,o={isMuted:!1,replayed:void 0},s=e=>{o.replayed?o.replayed.push(e):o.isMuted||a(e)},l=e=>{o.isMuted=!0;let t=e();return o.isMuted=!1,t};ze(um(t.source,i,t.loadModule));let f=Cm(i,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:s,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed}),p=f.environment,m=p.runtime;m.pause=t.onPause??(()=>{}),m.getSpecification=()=>ig(i,p,f.variableLocations,f.instanceActions);let h={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:m.generatedStates,distinctStates:m.distinctStates,queuedStates:m.queueSize,depth:m.generatedStates===0?0:Math.max(h.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),v={newStates:0},S=()=>Math.min(v.newStates,31),T=()=>_.map((e,t)=>t===S()?e+1:e),ee=()=>({...g(`success`),outDegrees:[..._],fingerprintDistance:Fg(m.distinctStates,m.generatedStates,()=>E?E.getStoredFingerprints(M,me):BigInt64Array.from(M,m.getFingerprint))}),te=()=>lm(t.source,t.loadModule,`variable`),E=__(i,p,te),re=g_(f.assumptions,p);if(re)return g(`assumption-violation`,re);if(!E)return ee();let D=i.postconditions.length>0||i.possible.length>0,O=(e,t,n)=>{if(D){let e=t.loopStart;m.counterExample=of(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=E.findUnwitnessedPossible();return r||E.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},k=E.spec,A=E.getFingerprintState,ie={value:void 0},j=(e,t,n=!1)=>{if(!e.failure)return e;let r=[],a={...p,evaluators:/* @__PURE__ */ new WeakMap,trace:r},s=__(i,a,te);if(!s)return e;let c=[];o.replayed=c,ke.current=/* @__PURE__ */ new WeakMap;let l=S_(()=>t(s,a),r);return ke.current=void 0,o.replayed=void 0,{...e,failure:{...e.failure,replay:{output:c,...l,isBeforeError:n}}}},ae=(e,t)=>{try{Fe(A(e))}catch(e){throw t.trace&&Ae(e)&&(t.trace.length=0),e}},oe=e=>j(e,(e,t)=>{k.init!==void 0&&Bo(k.init,t,n=>(e.satisfiesConstraints(n)&&ae(n,t),e.findViolatedInvariant(n)!==void 0||e.findFailedInitialPredicate(n)!==void 0),k.scope)}),se=e=>{let t=he[e];t===-1?Ee():(se(t),we(t,M[t],M[e]))},ce=(e,t)=>j(e,(e,n)=>{se(t);let r=M[t];ie.value??=eg(i,p,f.instanceActions),ie.value.find(t=>Uo(t.expression,r,n,t.scope).some(t=>{let i=e.satisfiesConstraints(t.state)&&e.satisfiesActionConstraints(r,t.state);return i&&ae(t.state,n),!i&&e.findViolatedInvariant(t.state)!==void 0||e.findViolatedActionProperty(r,t.state)!==void 0}))}),le=i.view!==void 0||i.symmetry!==void 0,ue=[],de={getFingerprint:e=>ue[e]??=Number(BigInt.asIntN(32,m.getFingerprint(M[e]))),getSuccessors:e=>{let t=[];return k.next===void 0||Ho(k.next,e,p,n=>{if(ye(n.state),!(E.satisfiesConstraints(n.state,e)&&E.satisfiesActionConstraints(e,n.state)))return!1;let r=A(n.state),i=Le(Fe(r),r);return t.push({index:i,state:n.state}),!1},k.scope),t}},fe=c(()=>jh(E.properties.liveness,k.temporals,p,de)),pe=E.isSymmetric||fe!==void 0,M=[],me=[],he=[],ge=[],_e=[],ve={slots:new Int32Array(1<<17),size:0,shift:16},ye=ur(),be=e=>Object.fromEntries(E.getTlcOrder().map(t=>[p.variables[t],e[t]])),xe=(e,t,n,r)=>(m.getLevel=()=>n+1,m.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Ce(e,t[n].state,(t[n+1]??t[r??n]).state)),Ce=(e,t,n)=>{try{let r=Ug(`alias`,e,p).body,i=_c(Bg(e),l_(p,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return qg(i,a)??be(t)}catch(e){if(!(e instanceof y||e instanceof b))throw e;return{...be(t),_ALIASEvalError:e.message}}},we=(e,t,n)=>{ie.value??=eg(i,p,f.instanceActions);let r={...B};Object.assign(B,{index:e,isExpanding:!0,candidate:void 0});let a=A(n),o=ie.value.find(e=>Uo(e.expression,t,p,e.scope).some(e=>F(A(e.state),a)));return Object.assign(B,r),o&&ng(o)},Te=(e,t,n)=>{let r=i.alias,a=l(()=>(e.length>1&&Zs(p)&&Ee(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:we(t[r-1],e[r-1].state,n.state))));return e.map((t,i)=>({action:t.action,label:a[i],state:r===void 0?be(t.state):xe(r,e,i,n)}))},Ee=()=>k.init===void 0?[]:Vo(k.init,p,k.scope),De=e=>k.next===void 0?[]:Uo(k.next,e,p,k.scope),Oe=(e,t)=>F(A(e),me[t]),N=(e,t)=>De(e).find(e=>Oe(e.state,t)),je=(e,t)=>{let n=le||Zs(p)?Ee().find(t=>Oe(t,e[0])):M[e[0]];if(!n)throw new b(Rg);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=N(i,e[n]);if(!a)throw new b(t);r.push(a)}return r},Me=(e,t)=>{let n=[];for(let t=e;t!==-1;t=he[t])n.unshift(t);let r=le&&n.length>1?je(n,Rg):n.map(e=>({state:M[e],action:ge[e]}));if(!t)return Te(r,n);let i=le?De(M[e]).find(e=>F(e.state,t.state))?.action:t.action;return Te([...r,{state:t.state,action:i}],n)},Ne=e=>he[e]===-1?[{action:void 0,label:void 0,state:be(M[e])}]:Me(e),P=(t,r,i,a)=>{if(d(t))return B.isExpanding?P(n(new b(u),e.error),Ne(B.index)):P(new b(u),r,i);if(!(t instanceof b))throw t;return{...g(`error`,void 0,{message:t.message,trace:r,initialState:i&&!(t instanceof x)?be(i):void 0,exitCode:ne(t)}),outDegrees:a}},Pe=(e,t)=>{let n=je(e,zg),r=n[n.length-1].state;if(le&&t!==void 0&&t!==e.length-1&&N(r,e[t])===void 0)throw new b(zg);return n},Fe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Ln(t,Un(e[n]));return Gn(e),t&1073741823},F=(e,t)=>{for(let n=0;n<t.length;n++)if(!nt(e[n],t[n]))return!1;return!0},Ie=e=>Math.imul(e,2654435761)>>>ve.shift<<1,Le=(e,t)=>{let n=ve.slots.length-1;for(let r=Ie(e);;r=r+2&n){let n=ve.slots[r+1];if(n===0)return-1;if(ve.slots[r]===e&&F(me[n-1],t))return n-1}},I=(e,t)=>{let n=ve.slots.length-1,r=Ie(e);for(;ve.slots[r+1]!==0;)r=r+2&n;ve.slots[r]=e,ve.slots[r+1]=t},L=(e,t)=>{if(ve.size++,ve.size*4>ve.slots.length){let e=ve.slots;ve.slots=new Int32Array(e.length*2),ve.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&I(e[t],e[t+1])}I(e,t+1)},R=e=>{m.distinctStates=M.length+1,h.depth=Math.max(h.depth,e),m.diameter=Math.max(m.diameter,e)},z=(e,t,n,r)=>{let i=n===-1?1:_e[n]+1;M.push(e),me.push(t),he.push(n),ge.push(r),_e.push(i)},B={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,isFingerprinting:!1,livenessSource:-1},Re=e=>e===-1?[]:[...Re(he[e]),M[e]];m.isSeen=e=>{let t=A(e);return Le(Fe(t),t)!==-1},m.getBehavior=e=>{let t=e===B.candidate?-1:M.indexOf(e);return t===-1?[...Re(B.index),e]:Re(t)},m.getCurrentState=()=>B.index===-1?void 0:M[B.index],m.setLivenessSource=e=>{B.livenessSource=e??-1},m.getLevel=e=>{let t=B.livenessSource;return t===-1?e===B.candidate?B.candidateLevel:B.index===-1?0:e===M[B.index]?_e[B.index]:B.isExpanding?_e[B.index]+1:0:e===M[t]?_e[t]:_e[t]+1};let V=(e,t)=>({fingerprint:BigInt.asIntN(64,m.getFingerprint(e)),level:t,getLabel:()=>cr(i.alias===void 0?be(e):Ce(i.alias,e,void 0)),getText:()=>cr(be(e))}),H=e=>{ye(e),m.generatedStates++,m.initialStates++,B.candidate=e,B.candidateLevel=1;let t=A(e),n=Fe(t),i=E.satisfiesConstraints(e);if(i&&E.trackStatePossible(e),i&&Le(n,t)!==-1)return;i&&(R(1),m.queueSize++,fe?.addInitialState(M.length,e),r?.writeInitialState(V(e,1)));let a=E.findViolatedInvariant(e);if(a)return O(`invariant-violation`,{name:a.name,trace:Te([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return O(`liveness-violation`,{name:o.name,trace:Te([{action:void 0,state:e}],[])});i&&(L(n,M.length),z(e,t,-1,void 0))},U=(e,t,n,i,a)=>{let o=M[e];m.generatedStates++,B.candidate=t.state,B.candidateLevel=_e[e]+1,pe&&ye(t.state),B.isFingerprinting=!0;let s=A(t.state),c=Fe(s);B.isFingerprinting=!1;let l=Le(c,s),u=E.satisfiesConstraints(t.state,o);u&&E.trackStatePossible(t.state);let d=u&&E.satisfiesActionConstraints(o,t.state);d&&E.trackActionPossible(o,t.state);let f=d?l:-1;if(i&&d&&r?.writeSuccessor(i,V(t.state,_e[e]+1),f!==-1,a&&{name:a.name,signature:rg(a)}),f!==-1&&fe){let e=M[f],r=e.every((e,n)=>e===t.state[n]);n.push({index:f,state:r?e:t.state})}let p=d&&f===-1;if(p&&(R(_e[e]+1),v.newStates++),f===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return O(`invariant-violation`,{name:n.name,trace:Me(e,t)})}catch(n){return P(n,Me(e,t),void 0,T())}let h=E.findViolatedActionProperty(o,t.state);if(h)return O(`liveness-violation`,{name:h.name,trace:Me(e,t)});p&&(pe||ye(t.state),L(c,M.length),fe&&n.push({index:M.length,state:t.state}),z(t.state,s,e,t.action),m.queueSize++)},W={result:void 0};if(k.init!==void 0)try{Bo(k.init,p,e=>{try{W.result=H(e)}catch(t){W.result=P(t,[],e)}return W.result!==void 0},k.scope)}catch(e){if(!(e instanceof w))return oe(P(e,[]));let t=P(e,[],e.state.map(e=>e??Ze(`null`)));return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}if(W.result)return oe(W.result);let Be=k.next;if(Be===void 0){if(M.length>0)throw new b(`No next state actions defined to generate successor states from.`);return ee()}let Ve=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),He=(e,t)=>{if(!Ve)return Ho(Be,e,p,e=>t(e,void 0),k.scope);ie.value??=eg(i,p,f.instanceActions);let n={isStopped:!1};return ie.value.reduce((r,i)=>n.isStopped?r:r+Ho(i.expression,e,p,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},Ue=e=>{let t=M[e],n=[],a=r&&V(t,_e[e]),o=He(t,(t,r)=>{try{W.result=U(e,t,n,a,r)}catch(n){if(B.isFingerprinting)throw n;let r=P(n,Me(e,t));W.result=d(n)?r:ce(r,e)}return W.result!==void 0});if(B.isExpanding=!1,W.result)return W.result;if(o===0&&i.checkDeadlock)return O(`deadlock`,{name:`deadlock`,trace:Ne(e)});try{let r=fe?.addState(e,t,n);if(!fe||!r)return;let i=Pe(r),a=fe.getViolatedProperties(i.map(e=>e.state),i.length-1);return O(`property-violation`,{name:a[0],properties:a,trace:Te(i,r)})}catch(r){return j(P(y_(r),Ne(e),void 0,T()),(r,i)=>jh(E.properties.liveness,k.temporals,i,de)?.addState(e,t,n),!0)}},We=(e,t)=>{ie.value??=eg(i,p,f.instanceActions);let n=ie.value,r=n.length===1?n[0]:n.find(t=>t.name===e.action),a=`variable${e.missing.length>1?`s are`:` is`} not defined: ${e.missing.join(`, `)}.\n`;return m.generatedStates++,P(n.length===1?e:new b(`Successor state is not completely specified by action ${e.action} of the next-state relation. The following ${a}`),[...Ne(t),{action:e.action,label:r&&ng(r),state:be(e.state.map(e=>e??Ze(`null`)))}])},Ge=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=Pe(n,r),a=Te(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),s=n[r],c=n[n.length-1],u=i[i.length-1].state,d=s===c?void 0:l(()=>we(c,u,M[s]));return O(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>s===c?a[a.length-1].action:N(u,s)?.action)},Ke=fe!==void 0&&t.livenessCheck!==`final`,qe=performance.now(),Je={at:qe+3e3,size:1,time:0},Ye=e=>{let t=performance.now();if(Je.at=t+6e4,!((e-Je.size)/Je.size>.1)||Je.time>(t-qe)*.2)return;Je.size=e;let n=fe?.findViolation();return Je.time+=performance.now()-t,n};for(let e=0;e<M.length&&!m.isStopped;e++){B.index=e,B.candidate=void 0,m.queueSize=M.length-e-1,B.isExpanding=!0;try{W.result=Ue(e)}catch(t){let n=t instanceof C?We(t,e):P(y_(t),Ne(e));W.result=t instanceof C||d(t)?n:ce(n,e)}if(W.result)return W.result;if(_[S()]++,v.newStates=0,Ke&&performance.now()>=Je.at){let t=Ye(e+1);if(fe&&t)return Ge(fe,t)}}B.index=-1,B.candidate=void 0;let Xe=fe?.findViolation();if(fe&&Xe)return Ge(fe,Xe);let Qe=E.findPostconditionViolation();return Qe?g(`postcondition-violation`,{...Qe,trace:[]}):ee()},E_=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},D_=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Un(e[t]),16777619),r=Math.imul(r^Qn(e[t]),1540483477);Gn(e),t[0]=E_(n)||1,t[1]=E_(r)},O_=()=>{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)}}},k_=(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}},A_=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),j_=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return k_(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},M_=e=>Atomics.load(e.used,0)*2>=e.slots.length,N_=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&k_(t,n);return{slots:t,used:e.used}},P_=()=>{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=Mn(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),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})}},F_=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 Ze(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Vt({kind:`Interval`,low:e,high:e+t-1});return $e(a,i(t))}let a=n[r.index++];if(e===5)return Qe(i(a));let o=i(a);return $e(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{ze as A,m as B,Zs as C,cr as D,ur as E,b as F,ne as H,T as I,p as L,fe as M,y as N,Y as O,f as P,te as R,jl as S,Uo as T,e as U,h as V,Cm as _,N_ as a,rd as b,D_ as c,g_ as d,Mg as f,Ig as g,Og as h,A_ as i,Se as j,Ve as k,w_ as l,Fg as m,P_ as n,j_ as o,Pg as p,O_ as r,M_ as s,F_ as t,__ as u,lm as v,Vo as w,Al as x,um as y,ee as z};