tla-ts 0.0.3-dev.27a0c3a → 0.0.3-dev.2d84a88

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/dist/transfer.cjs CHANGED
@@ -13,20 +13,22 @@ 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;constructor(e,t,n){super(e,t),this.name=`TlaSyntaxError`,this.failure=n}},m=class extends f{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},h=class extends f{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}},g=class extends h{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},_=class extends h{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}},v=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)})`}},y=class extends v{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},b=class extends f{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const x=t=>r(t)??(t instanceof p?e.specParseError:t instanceof m?e.configParseError:t instanceof h?e.specEvaluationFailure:e.error),ee=/* @__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(`.`)),te=/* @__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`]]),ne=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),S=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),re=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),C=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,ie=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),ae=e=>e.startsWith(`\\`)?parseInt(e.slice(2),ie.get(e[1].toLowerCase())):Number(e),w=/-{4,}[ \t]*MODULE\b/,T=e=>/[A-Za-z0-9_]/.test(e),E=(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&&!te.has(n.slice(0,r.value));)r.value--;let i=te.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=re.get(n);if(r)return{text:r,length:n.length};let i=S.find(n=>e.startsWith(n,t));return i?{text:ne.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},D=e=>e!==void 0&&e>=`0`&&e<=`9`,O=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},oe=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:O(e,t+1,D);if(n===t+1||e[n]!==`>`)return 0;let r=O(e,n+1,T),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return O(e,i?r+1:r,e=>e===`.`)-t},k=(e,t)=>t===` `?e+8-e%8:e+1,se=e=>{let t=w.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(`
17
- `),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=k(o.width,e[o.position]);return k(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]===`
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(`
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{variable;constructor(e,t){super(e),this.name=`TlaEvaluationError`,this.variable=t}},x=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}},ee=class extends v{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},te=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)})`}},ne=class extends te{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},re=class extends f{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}};const ie=t=>r(t)??(t instanceof p?e.specParseError:t instanceof _?e.configParseError:t instanceof v?e.specEvaluationFailure:e.error),S=/* @__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(`.`)),ae=/* @__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`]]),C=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),oe=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),w=/* @__PURE__ */ new Map([[`∧`,`/\\`],[`∨`,`\\/`],[`¬`,`~`],[`⇒`,`=>`],[`⟹`,`=>`],[`≡`,`<=>`],[`⇔`,`<=>`],[`∈`,`\\in`],[`∉`,`\\notin`],[`⊆`,`\\subseteq`],[`⊂`,`\\subset`],[`⊇`,`\\supseteq`],[`⊃`,`\\supset`],[`∪`,`\\cup`],[`∩`,`\\cap`],[`×`,`\\X`],[`∀`,`\\A`],[`∃`,`\\E`],[`≠`,`#`],[`≤`,`<=`],[`≥`,`>=`],[`↦`,`|->`],[`→`,`->`],[`⟨`,`<<`],[`⟩`,`>>`],[`□`,`[]`],[`◇`,`<>`],[`≜`,`==`],[`′`,`'`],[`∘`,`\\o`],[`⋅`,`\\cdot`]]),T=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,E=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),se=e=>e.startsWith(`\\`)?parseInt(e.slice(2),E.get(e[1].toLowerCase())):Number(e),D=/-{4,}[ \t]*MODULE\b/,O=e=>/[A-Za-z0-9_]/.test(e),ce=(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&&!ae.has(n.slice(0,r.value));)r.value--;let i=ae.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=w.get(n);if(r)return{text:r,length:n.length};let i=oe.find(n=>e.startsWith(n,t));return i?{text:C.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},k=e=>e!==void 0&&e>=`0`&&e<=`9`,A=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},le=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:A(e,t+1,k);if(n===t+1||e[n]!==`>`)return 0;let r=A(e,n+1,O),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return A(e,i?r+1:r,e=>e===`.`)-t},ue=(e,t)=>t===` `?e+8-e%8:e+1,de=e=>{let t=D.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=ue(o.width,e[o.position]);return ue(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
20
  `&&(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===`
19
21
  `||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
20
- `,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=O(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`,`====`,O(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]===`
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=A(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`,`====`,A(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]===`
21
23
  `)throw u(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];i.push({n:`
22
- `,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=C.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(T(t)){let t=e.slice(a.index,O(e,a.index,T));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(ee.has(t)?`Keyword`:`Identifier`,n,t.length);continue}let o=oe(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let d=E(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},A=/* @__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`]),ce=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`],le={INIT:`init`,NEXT:`next`,SPECIFICATION:`specification`,VIEW:`view`,SYMMETRY:`symmetry`,ALIAS:`alias`,_PERIODIC:`periodic`,_RL_REWARD:`rlReward`},ue={INVARIANT:`invariants`,INVARIANTS:`invariants`,PROPERTY:`properties`,PROPERTIES:`properties`,CONSTRAINT:`constraints`,CONSTRAINTS:`constraints`,ACTION_CONSTRAINT:`actionConstraints`,ACTION_CONSTRAINTS:`actionConstraints`,POSTCONDITION:`postconditions`,POSTCONDITIONS:`postconditions`,_POSSIBLE:`possible`},de=e=>Object.hasOwn(le,e),fe=e=>Object.hasOwn(ue,e),pe=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(``),me=(e,t,n,r=``)=>new m(`TLC found an error in the configuration file:\nLexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${pe(n)}" (${n.codePointAt(0)}), `}after : "${pe(r)}"`),j=(e,t)=>new m(`TLC found an error in the configuration file at line ${e}\n${t}`),he=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(`
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=T.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(O(t)){let t=e.slice(a.index,A(e,a.index,O));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(S.has(t)?`Keyword`:`Identifier`,n,t.length);continue}let o=le(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let d=ce(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},fe=/* @__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`]),pe=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`],me={INIT:`init`,NEXT:`next`,SPECIFICATION:`specification`,VIEW:`view`,SYMMETRY:`symmetry`,ALIAS:`alias`,_PERIODIC:`periodic`,_RL_REWARD:`rlReward`},j={INVARIANT:`invariants`,INVARIANTS:`invariants`,PROPERTY:`properties`,PROPERTIES:`properties`,CONSTRAINT:`constraints`,CONSTRAINTS:`constraints`,ACTION_CONSTRAINT:`actionConstraints`,ACTION_CONSTRAINTS:`actionConstraints`,POSTCONDITION:`postconditions`,POSTCONDITIONS:`postconditions`,_POSSIBLE:`possible`},he=e=>Object.hasOwn(me,e),ge=e=>Object.hasOwn(j,e),_e=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(``),ve=(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> `:`"${_e(n)}" (${n.codePointAt(0)}), `}after : "${_e(r)}"`),M=(e,t)=>new _(`TLC found an error in the configuration file at line ${e}\n${t}`),ye=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(`
23
25
  `);i!==-1&&(r.line+=n.split(`
24
- `).length-1,r.lineStart=r.index+i+1),r.index+=e},a=e=>me(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(`
26
+ `).length-1,r.lineStart=r.index+i+1),r.index+=e},a=e=>ve(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(`
25
27
  `);continue}if(e.startsWith(`(*`)){let t=e.indexOf(`*)`);if(t===-1)throw r.line+=e.split(`
26
28
  `).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(`
27
- `);throw t===e.length-1?a(e):me(r.line,r.index+t-r.lineStart+1,`
28
- `,e.slice(0,t))}n.push({kind:`String`,text:t[1],line:r.line}),r.index+=t[0].length;continue}let l=ce.find(t=>e.startsWith(t));if(l){n.push({kind:`Symbol`,text:l,line:r.line}),r.index+=l.length;continue}let u=E(t,r.index);if(!u)throw me(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},ge=e=>{let t=he(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`&&A.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(de(e)){let n=a();if(n.kind===`End`)throw j(t,`The keyword ${e} was not followed by an identifier.`);let i=le[e];if(r[i]!==void 0)throw j(t,`The keyword ${e} appeared twice.`);r[i]=n.text,u=a()}else if(fe(e)){let t=r[ue[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 m(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);return r},_e={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},ve=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},ye=e=>e!==void 0&&/^\p{Nd}$/u.test(e),be=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),xe=e=>{let t=t=>{let n=O(e,t,ve);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=O(e,t,ye);if(e.startsWith(`..`,n)&&ye(e[n+2]))return{kind:`Constant`,first:t,last:O(e,n+2,ye)-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=ye(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:O(e,t+1,ye)-1,children:[]};if(be(n))return{kind:`Constant`,first:t,last:O(e,t,be)-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)},Se=e=>{let t=e.length===0?void 0:xe(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=_e[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},M=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ce=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`,we=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:M(e)?`set`:`function`,Te=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new g(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},Ee={isUsed:!1},De=(e,t)=>(Ee.isUsed=!0,e.writtenKeys=t,e),Oe=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[sn(e.domain,t)]]),ke=(e,t,n)=>De(Je(e,t),n),Ae=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(Ae);e.writtenKeys=void 0,e.range.forEach(Ae)}},je=e=>e.every(e=>typeof e==`string`),Me=(e,t)=>e.length>0&&t.length>0&&je(e)!==je(t),F=(e,t)=>{Ee.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Me(n,r)?mt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=R(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=R(i[e],a[e]);if(t!==0)return t}return 0},Ne=(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=R(n[e],r[e]);if(t!==0)return t}return 0},Pe=e=>P(e)?e.type:void 0,Fe=(e,t,n)=>{let r=Pe(e),i=Pe(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 h(`Attempted to ${a} the differently-typed model values ${W(e)} and ${W(t)}`)}throw r===void 0?new h(`Attempted to ${a} the typed model value ${W(t)} and the non-model value\n${W(e)}`):new h(`Attempted to ${a}${n?``:` the`} typed model value ${W(e)} and non-model value\n${W(t)}`)},Ie={ranks:Object.create(null),size:0},Le=e=>{Ie.ranks=Object.create(null),Ie.size=0,Ge.clear();for(let t of e)I(t)},I=e=>(Ie.ranks[e]===void 0&&(Ie.ranks[e]=Ie.size++),e),Re=()=>Ie.size,ze=e=>Ie.ranks[I(e)],Be=(e,t)=>{if(e===t)return 0;let n=Ie.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},L=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ve=(e,t)=>(L(e)||L(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),He=(e,t,n)=>{if(!L(e))throw new h(`Attempted to ${n} the set ${W(B(e)?V(e):e,!0)} with the value:\n${W(t,!0)}`);if(!L(t))throw new h(`Attempted to compare overridden value ${W(e,!0)} with non-overridden value:\n${W(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 h(`Attempted to compare ${W(e,!0)} with the value\n${W(t,!0)}`)},Ue={kind:`InfiniteSet`,name:`Any`},We=e=>{throw new h(`Attempted to compare ANY with the value\n${W(e)}`)},R=(e,t)=>{if(e===t)return Ee.isUsed&&Ae(e),e===Ue?We(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return F(e,t);if(n===`Set`&&r===`Set`)return Ne(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&&Fe(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Fe(e,t,!1),n===`ModelValue`?-1:1;if(e===Ue||t===Ue)return We(e===Ue?t:e);if(M(e)&&M(t)&&Ve(e,t))return He(e,t,`compare`);let i=M(e);if(i!==M(t))throw new h(`Attempted to compare ${we(e)} ${W(e)} with ${we(t)} ${W(t)}`);return i?Ne(V(e),$t(t)):F(U(e),U(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Be(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Fe(e,t,!1),P(e))return-1;if(P(t))return 1;throw new h(`Attempted to compare ${we(e)} ${W(e)} with ${we(t)} ${W(t)}`)},Ge=/* @__PURE__ */ new Map,Ke=e=>{let t=Ge.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:ze(e)};return Ge.set(e,n),n},qe=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),Je=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),Ye=(e,t)=>{if(e===t)return Ee.isUsed&&Ae(e),e!==Ue||We(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Fe(e,t,!0),R(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 F(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Ne(e,t)===0;if(P(e)||P(t))return Fe(e,t,!0),P(e)&&P(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Ye(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=H(e.domain),r=H(t.domain);if(n||r)return n===r;let i=H(e.range),a=H(t.range);return i||a?i===a:Ye(e.domain,t.domain)&&Ye(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(H(e))return H(t);if(H(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]&&Ye(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return H(e)?H(t):!H(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Ye(e,t.factors[n]));let n=M(e)&&M(t)&&!(B(e)&&B(t));if(n&&Ve(e,t))return He(e,t,`check equality of`)===0;if(n){if(!L(e)){let n=V(e);if(!L(t))return Ne(n,V(t))===0}return Un(e)===Un(t)}return R(e,t)===0},Xe=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>Ze(e,t[n])),Ze=(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)&&Xe(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&Xe(e.domain,t.domain)&&Xe(e.range,t.range):Un(e)===Un(t),Qe=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},$e=e=>{if(!N(e))return;let t=U(e);return{domain:t.domain,range:t.range,low:Qe(t.domain)}},et=e=>{if(!N(e))return;let t=U(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},tt=(e,t)=>{if(Pe(e)!==void 0)throw new h(`Attempted to compare the typed model value ${W(e)} and the non-model value\n${W(t)}`);return 1},nt=(e,t)=>{if(Pe(e)!==void 0)throw new h(`Attempted to check equality of the typed model value ${W(e)} and the non-model value\n${W(t)}`);return!1},rt=(e,t)=>{let n=Pe(e);if(n===void 0)return P(t)?e.rank-t.rank:-1;if(!P(t))throw new h(`Attempted to compare the typed model value ${W(e)} and non-model value\n${W(t)}`);let r=Pe(t);if(r!==void 0&&r!==n)throw new h(`Attempted to compare the differently-typed model values ${W(e)} and ${W(t)}`);return e.rank-t.rank},it=(e,t)=>{let n=Pe(e);if(n===void 0)return P(t)&&e.name===t.name;if(!P(t))throw new h(`Attempted to check equality of typed model value ${W(e)} and non-model value\n${W(t)}`);let r=Pe(t);if(r!==void 0&&r!==n)throw new h(`Attempted to check equality of the differently-typed model values ${W(e)} and ${W(t)}`);return e.name===t.name},at={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`}},ot=(e,t,n)=>{let r=at[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${W(e)} with ${r.other}:\n${W(t)}`},st=(e,t,n)=>{let r=$e(n);if(!r){if(P(n))return tt(n,t);throw new h(`Attempted to compare the function ${W(t)} with the value:\n${W(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>ct(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 ct(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 h(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${W(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},ct=(e,t)=>{for(let n=0;n<e.length;n++){let r=mt(e[n],t[n]);if(r!==0)return r}return 0},lt=(e,t)=>{let n=U(e);if(e.kind===`Function`&&cn(n)!==void 0){let r=N(t)?cn(t):void 0;return r?n.range.length-r.length||ct(n.range,r):st({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=et(t);if(!r){if(P(t))return tt(t,e);throw new h(`Attempted to compare record:\n${W(e)}\nwith non-record\n${W(t)}`)}return n.domain.length-r.domain.length||ct(n.domain,r.domain)||ct(n.range,r.range)}return st({...n,low:Qe(n.domain)},e,t)},ut=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),dt=(e,t)=>L(e)||L(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),ft=(e,t)=>{let n=ut(t)?t:V(t);return{elements:V(e).elements,otherElements:V(n).elements}},pt=(e,t)=>{if(dt(e,t))return R(e,t);if(!ut(e))return pt(V(e),t);if(!M(t)){if(P(t))return tt(t,e);throw new h(`Attempted to compare the set ${W(e)} with the value:\n${W(t)}`)}let n=ft(e,t);return n.elements.length-n.otherElements.length||ct(n.elements,n.otherElements)},mt=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return R(e,t);if(P(t))return tt(t,e);throw new h(ot(e,t,!1))}return e.kind===`ModelValue`?rt(e,t):N(e)?lt(e,t):pt(e,t)},ht=(e,t)=>e.every((e,n)=>yt(e,t[n])),gt=(e,t,n)=>{let r=$e(n);if(!r){if(P(n))return nt(n,t);throw new h(`Attempted to check equality of the function ${W(t)} with the value:\n${W(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)&&ht(e.range,r.range);let i=e.low??r.low;return i===void 0?ht(e.domain,r.domain)&&ht(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new h(`Attempted to compare an integer with non-integer:\n${W(e)}.`);return e===i+t})&&ht(e.range,r.range)},_t=(e,t)=>{let n=U(e);if(e.kind===`Function`&&cn(n)!==void 0){let r=N(t)?cn(t):void 0;return r?n.range.length===r.length&&ht(n.range,r):gt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=et(t);if(!r){if(P(t))return nt(t,e);throw new h(`Attempted to check equality of record:\n${W(e)}\nwith non-record\n${W(t)}`)}return n.domain.length===r.domain.length&&ht(n.domain,r.domain)&&ht(n.range,r.range)}return gt({...n,low:Qe(n.domain)},e,t)},vt=(e,t)=>{if(dt(e,t))return Ye(e,t);if(!ut(e))return vt(V(e),t);if(!M(t)){if(P(t))return nt(t,e);throw new h(`Attempted to check equality of the set ${W(e)} with the value:\n${W(t)}`)}let n=ft(e,t);return n.elements.length===n.otherElements.length&&ht(n.elements,n.otherElements)},yt=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(P(t))return nt(t,e);throw new h(ot(e,t,!0))}return e.kind===`ModelValue`?it(e,t):N(e)?_t(e,t):vt(e,t)},bt=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=mt(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},xt=(e,t)=>t.some(t=>yt(t,e)),St=(e,t)=>{try{return Ye(e,t)}catch(n){if(!(n instanceof h))throw n;return yt(e,t)}},Ct=e=>{for(let t=1;t<e.length;t++)if(R(e[t],e[t-1])<=0)return!1;return!0},wt=e=>{if(e.length<2||Ct(e))return qe(e);let t=[...e].sort(R),n=[t[0]];for(let e=1;e<t.length;e++)R(n[n.length-1],t[e])!==0&&n.push(t[e]);return qe(n)},Tt=e=>{try{return wt(e)}catch(t){if(!(t instanceof h))throw t;return{kind:`MixedSet`,elements:e}}},Et=qe([]),Dt=(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&&R(r[a],t)<0;)a++;a<r.length&&R(r[a],t)===0||i.push(t)}return i.length===n.length?e:qe(i)},Ot=(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&&R(r[a],t)<0;)a++;a<r.length&&R(r[a],t)===0&&i.push(t)}return i.length===n.length?e:qe(i)},kt=(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=R(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+jn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Rn(a[e])|0;c.fingerprint=t}return c},At=e=>{let t=e.length<2?e:[...e].sort((e,t)=>R(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&R(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Je(n,r)},jt=e=>{let t=At(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:De(t,e.map(e=>e[0]))},Mt=[],Nt=[],Pt=/* @__PURE__ */ new WeakMap,Ft=e=>{let t=Mt[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Mt[e]=n,n},It=e=>{if(rn(e),e.low===1&&e.high>=1)return Ft(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Lt=e=>e.length>0&&(e===Mt[e.length]||Pt.has(e)),Rt=e=>{let t=V(e).elements;return Lt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},zt=e=>{let t=Nt[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Nt[e]=n,n},z=e=>Je(Ft(e.length),e),Bt=e=>At(e),Vt=e=>M(e)&&!L(e),Ht=(e,t=!1)=>`UNION(${W(e.base,t)})`,Ut=(e,t=e=>V(e).elements)=>{if(!Vt(e.base))throw new h(`Attempted to enumerate the nonenumerable set:\n${Ht(e)}`);return t(e.base)},Wt=(e,t,n)=>{if(Vt(e))return e;throw new h(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${W(e)}\nwhen enumerating:\n${Ht(n)}`)},B=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 B(e.base);case`FunctionSet`:return B(e.domain)&&B(e.range)||Gt(e.domain)===!0||Gt(e)===!0;case`RecordSet`:return e.sets.every(B)||Gt(e)===!0;case`ProductSet`:return e.factors.every(B)||Gt(e)===!0;case`Union`:return B(e.base)&&en(e.base).every(B);case`SetOperation`:return e.operator===`\\cup`?B(e.left)&&B(e.right):e.operator===`\\cap`?B(e.left)||B(e.right):B(e.left);default:return!1}},Gt=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=Gt(e.domain);return t===void 0?void 0:!t&&Gt(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Gt(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return B(e)?V(e).elements.length===0:void 0;default:return}},Kt=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},Jt=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},Yt=e=>{if(typeof e!=`object`)throw new h(`Expected a set but found ${W(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return bt(e.elements);case`Interval`:{let t=It(e);return t!==Mt[t.length]&&Pt.set(t,e),t}case`Subset`:{L(e.base)&&rn(e.base);let t=V(e.base).elements;if(t.length>30)throw new h(nn(e));return Jt(t)}case`FunctionSet`:{if(H(e))return[];if(L(e.domain))throw new h(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${W(e.domain)}\ncannot be enumerated.`);let t=Rt(e.domain);if(t.length>0&&L(e.range))throw new h(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${W(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:V(e.range).elements;return Kt(t.map(()=>n)).map(e=>Je(t,e))}case`RecordSet`:{if(H(e))return[];let t=e.sets.map((t,n)=>{if(L(t))throw new h(`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${W(t)}`);return V(t).elements});return Kt(t).map(t=>Bt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(H(e))return[];let t=e.factors.map((e,t)=>{if(L(e))throw new h(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${W(e)}`);return V(e).elements});return Kt(t).map(z)}case`FilteredSet`:if(L(e.base))throw new h(`Attempted to enumerate { x \\in S : p(x) } when S:\n${W(e.base)}\nis not enumerable`);return V(e.base).elements.filter(e.test);case`Union`:{let t=Ut(e).flatMap((t,n)=>V(Wt(t,n,e)).elements);return V(Tt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(L(e.left)||L(e.right)))throw new h(`Attempted to enumerate S \\cup T when S:\n${W(e.left)}\nand T:\n${W(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&L(e.left)&&L(e.right))throw new h(`Attempted to enumerate S \\cap T when neither S:\n${W(e.left)}\nnor T:\n${W(e.right)}\nis enumerable`);if(e.operator===`\\`&&L(e.left))throw new h(`Attempted to enumerate S \\ T when S:\n${W(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return kt(V(e.left),V(e.right)).elements;let t=e.operator===`\\`||B(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return V(n).elements.filter(t=>dn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to enumerate the non-enumerable set ${W(e)}`);default:throw new h(`Expected a set but found ${W(e)}`)}},Xt=/* @__PURE__ */ new WeakMap,Zt=/* @__PURE__ */ new WeakMap,V=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return qe(Yt(e));let t=typeof e==`object`?Xt.get(e):void 0;if(t)return t;let n=(typeof e==`object`?Zt.get(e):void 0)??Qt(e);return typeof e==`object`&&Xt.set(e,n),n},Qt=e=>{let t=Yt(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):wt(t)},$t=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||Xt.has(e))return V(e);let t=Zt.get(e);if(t)return t;let n=Qt(e);return Zt.set(e,n),n},en=e=>{if(typeof e!=`object`||Xt.has(e))return V(e).elements;if(e.kind===`Union`)return Ut(e,en).flatMap((t,n)=>en(Wt(t,n,e)));if(e.kind===`FilteredSet`&&!L(e.base))return en(e.base).filter(e.test);if(e.kind!==`SetOperation`)return V(e).elements;if(e.operator===`\\cup`)return L(e.left)||L(e.right)?V(e).elements:[...en(e.left),...en(e.right)];let t=e.operator===`\\`||B(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return L(n)?V(e).elements:en(n).filter(t=>dn(t,r)===(e.operator===`\\cap`))},H=e=>{if(typeof e!=`object`||!M(e))throw new h(`Shouldn't call isEmpty() on value ${W(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 h(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(H);case`RecordSet`:return e.sets.some(H);case`FunctionSet`:return!H(e.domain)&&H(e.range);case`Union`:return Ut(e).every((t,n)=>H(Wt(t,n,e)));default:return V(e).elements.length===0}},tn=(e,t)=>e.reduce((e,n)=>{let r=e*rn(n);if(r>2147483647)throw new h(t());return r},1),nn=e=>`Overflow when computing the number of elements in:\n${W(e)}`,rn=e=>{if(typeof e!=`object`)return V(e).elements.length;switch(e.kind){case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new h(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to compute the number of elements in the overridden value ${W(e)}.`);case`Subset`:{let t=rn(e.base);if(t>=31)throw new h(nn(e));return 2**t}case`FunctionSet`:{if(H(e.domain))return 1;if(H(e.range))return 0;let t=rn(e.range);if(t===1)return 1;let n=rn(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new h(nn(e));return r.value}case`RecordSet`:return H(e)?0:tn(e.sets,()=>nn(e));case`ProductSet`:return H(e)?0:tn(e.factors,()=>`Overflow when computing the number of elements in ${W(e)}`);default:return V(e).elements.length}},an=e=>`Attempted to check if the set ${W(e)}is finite.`,on=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new h(`Attempted to check if the ${we(e)} ${W(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new h(`Attempted to check if the function:\n${W(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return on(e.base)&&H(e.base);case`Subset`:return on(e.base);case`FunctionSet`:{let t=on(e.domain);if(t&&H(e.domain))return!0;let n=on(e.range);return n&&H(e.range)?!0:n&&(t||rn(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(!on(e))n.isAllFinite=!1;else if(H(e))return!0;return n.isAllFinite}case`Union`:if(!Vt(e.base))throw new h(`Attempted to check if the nonenumerable set:\n${Ht(e)}\nis a finite set.`);return V(e.base).elements.every(on);case`SetOperation`:if(e.operator===`\\cup`)return on(e.left)&&on(e.right);if(e.operator===`\\cap`){if(!on(e.left)&&!on(e.right))throw new h(an(e));return!0}if(on(e.left))return!0;if(!on(e.right))throw new h(an(e));return!1;case`FilteredSet`:if(!on(e.base))throw new h(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${W(e.base)}\nis finite.`);return!0}},sn=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=R(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},cn=e=>{if(typeof e!=`object`||!N(e))return;let t=U(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},ln=(e,t)=>`Attempted to check if the value ${W(e)} is an element of ${W(t)}`,un=(e,t)=>{let n=`Attempted to check if the value:\n${W(e)}\nis an element of the`;if(!N(t))return`${n} ${we(t)} ${W(t)}`;let r=t.kind===`Function`||B(t.domain)?U(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${W(e)}\nis in the record:\n${W(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${W(t)}`},dn=(e,t)=>{if(!M(t))throw new h(un(e,t));switch(t.kind){case`Set`:try{return sn(t.elements,e)!==-1}catch(n){if(!(n instanceof h))throw n;return xt(e,t.elements)}case`MixedSet`:return xt(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 h(`Attempted to check if the value:\n${W(e)}\nis in the integer interval ${W(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 h(`Attempted to check if the value:\n${W(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!M(e))throw new h(ln(e,t));return V(e).elements.every(e=>dn(e,t.base));case`FunctionSet`:{if(!N(e)){if(P(e))return!1;throw new h(ln(e,t))}let n=U(e),r=Qe(n.domain);return(r===void 0?St(t.domain,qe(n.domain)):St({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>dn(e,t.range))}case`RecordSet`:{let n=N(e)?U(e):void 0;if(!n||!je(n.domain)){if(P(e))return!1;throw new h(`Attempted to check if non-record\n${W(e)}\nis in the set of records:\n${W(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=sn(n.domain,e);return i!==-1&&dn(n.range[i],t.sets[r])})}case`ProductSet`:{let n=N(e)?cn(e):void 0;if(n===void 0){if(N(e)&&U(e).domain.every(e=>typeof e==`number`)||P(e))return!1;throw new h(`Attempted to check if non-tuple\n${W(e)}\nis in the set of tuples:\n${W(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>dn(e,t.factors[n]))}case`FilteredSet`:return dn(e,t.base)&&t.test(e);case`Union`:if(!Vt(t.base))throw new h(`Attempted to check if:\n ${W(e)}\nis an element of the non-enumerable set:\n ${Ht(t)}`);return V(t.base).elements.some(t=>dn(e,t));case`SetOperation`:return t.operator===`\\cup`?dn(e,t.left)||dn(e,t.right):dn(e,t.left)&&dn(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=cn(e);if(n===void 0){if(P(e))return!1;throw new h(ln(e,t))}return n.every(e=>dn(e,t.base))}default:throw new h(un(e,t))}},fn=(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?dn(e,n):e.range.every((e,r)=>fn(e,t.range[r],n.range)),U=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){B(e.domain)||rn(e.domain);let t=Rt(e.domain);return Je(t,t.map(t=>e.apply(t)))}throw new h(`Expected a function but found ${W(e)}`)},pn=/* @__PURE__ */ new WeakSet,mn=e=>(pn.add(e),e),hn=e=>{let t=e.domain;return t.length===0?pn.has(e)?`FcnRcdValue`:`TupleValue`:t===Mt[t.length]?`TupleValue`:Pt.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},gn=(e,t)=>`Attempted to apply function:\n${Se(W(e))}\nto argument ${Se(W(t))}, which is not in the domain of the function.`,_n=e=>`Attempted to apply function with integer domain to the non-integer argument ${Se(W(e))}`,vn=(e,t)=>{if(pn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${Se(W(e))},\nthe first argument is:\n${Se(W(t))}\nwhich is not in its domain.\n`;let n=hn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${Se(W(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${Se(W(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${Se(W(e))}`:`Attempted to access record by a non-string argument: ${Se(W(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?_n(t):gn(e,t)},yn=(e,t)=>hn(e)===`FcnRcdValue`?gn(e,t):_n(t),bn=e=>hn(e)===`RecordValue`,xn=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===Mt[e.length]||Pt.has(e)):typeof n==`string`&&typeof t!=`string`},Sn=(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 sn(e,t)},Cn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!dn(t,e.domain))throw new h(pn.has(e)?vn(e,t):`Attempted to apply a function to ${W(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new h(r?.(e)??`Attempted to apply ${W(e)}, which is not a function`);let i=xn(e.domain,t)?-1:Sn(e.domain,t);if(i===-1)throw new h(n?.(e)??vn(e,t));return e.range[i]},wn=e=>Lt(e)?Pt.get(e)??zt(e.length):void 0,Tn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=U(e).domain;return wn(t)??qe(t)},En=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!B(e.domain))){if(!dn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>St(t,n)?r:e.apply(n),source:e.source}}let i=U(e),a=Sn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Je(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-Mn(e,s)+Mn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-zn(e,s)+zn(e,c)|0}return l},Dn=/* @__PURE__ */ new WeakMap,On=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},kn=(e,t)=>Math.imul(e^t,16777619),An=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return On(t)},jn=e=>On(Pn(e)+2654435769|0),Mn=(e,t)=>On(Math.imul(Pn(e),668265261)+Pn(t)|0),Nn=e=>{if(e.kind===`ModelValue`)return On(kn(An(e.name),109));if(M(e)){if(!B(e))return An(Un(e));let t=V(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+jn(t[e])|0;return n}let t=U(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+Mn(t.domain[e],t.range[e])|0;return n},Pn=e=>{if(typeof e==`number`)return On(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return An(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Nn(e)),e.hash;let t=Dn.get(e);if(t!==void 0)return t;let n=Nn(e);return Dn.set(e,n),n},Fn=/* @__PURE__ */ new WeakMap,In=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ln=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return In(t)},Rn=e=>In(Vn(e)+2135587861|0),zn=(e,t)=>In(Math.imul(Vn(e),374761393)+Vn(t)|0),Bn=e=>{if(e.kind===`ModelValue`)return In(Ln(e.name)^60);if(M(e)){if(!B(e))return Ln(Un(e));let t=V(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Rn(t[e])|0;return n}let t=U(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+zn(t.domain[e],t.range[e])|0;return n},Vn=e=>{if(typeof e==`number`)return In(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Ln(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Bn(e)),e.fingerprint;let t=Fn.get(e);if(t!==void 0)return t;let n=Bn(e);return Fn.set(e,n),n},Hn=/* @__PURE__ */ new WeakMap,Un=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=Hn.get(e);if(t!==void 0)return t;let n=Wn(e);return Hn.set(e,n),n},Wn=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Un(e.base)}>`;if(e.kind===`FilteredSet`&&!B(e))throw new h(`Attempted to compare the non-enumerable set ${W(e)} with another value`);if(M(e))return B(e)?`{${V(e).elements.map(Un).join(`,`)}}`:`<${e.kind} ${W(e)}>`;let t=U(e);return`(${t.domain.map((e,n)=>`${Un(e)}:${Un(t.range[n])}`).join(`,`)})`},Gn=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Kn=e=>e.reduce((e,t)=>e===0?0:e*rn(t),1),qn=e=>{if(e.kind===`Subset`)return rn(e.base)<=6?V(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return V(e);if(e.kind===`FunctionSet`&&B(e.domain)&&rn(e.domain)===0)return qe([Je([],[])]);let t=e.kind===`FunctionSet`?rn(e.range)**rn(e.domain):Kn(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Et:t<=1999?V(e):void 0},Jn=(e,t)=>{if(t)return qn(e);if(B(e))try{return qn(e)}catch(e){if(e instanceof h)return;throw e}},Yn=(e,t)=>{let n=e=>W(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 Ht(e,t)}},Xn=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),W=(e,t=!1,n=!1)=>{let r=e=>W(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Gn(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(V(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=Jn(e,t);return n?r(n):Yn(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!B(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${W(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=U(e),a=r=>W(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`&&Xn(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Oe(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Zn=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Se(W(n))}\n`).join(``)},Qn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},$n=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Pn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Ze(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Ze(i[e],n))return i[e]}return n.kind===`Set`?Qn(n.elements,t):(Qn(n.domain,t),Qn(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},er=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:[])}},G=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,tr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),nr=(e,t)=>tr.has(e)?new h(t):new g(t),rr=e=>typeof e==`object`&&e.kind===`Operator`,K=(e,t,n)=>{let r=e[t];if(r===void 0||rr(r))throw nr(n,`${n} expects a value as argument ${t+1}`);return r},ir=(e,t,n)=>{let r=K(e,t,n);if(typeof r!=`number`)throw nr(n,`${n} expects an integer but received ${W(r)}`);return r},ar=(e,t,n)=>{let r=K(e,t,n);if(typeof r!=`boolean`)throw nr(n,`${n} expects a boolean but received ${W(r)}`);return r},or=(e,t,n)=>{let r=K(e,t,n);if(!M(r))throw nr(n,`${n} expects a set but received ${W(r)}`);return r},sr=(e,t,n)=>{let r=or(e,t,n);if(!B(r))throw nr(n,`${n} cannot enumerate the non-enumerable set ${W(r)}`);return r},cr=(e,t,n)=>V(sr(e,t,n)),lr=(e,t,n)=>cr(e,t,n).elements,ur=(e,t,n)=>{let r=K(e,t,n),i=cn(r);if(!i)throw nr(n,`${n} expects a sequence but received ${W(r)}`);return i},dr=(e,t,n)=>{let r=K(e,t,n);if(!N(r))throw nr(n,`${n} expects a function but received ${W(r)}`);return U(r)},fr=(e,t,n)=>{let r=e[t];if(r===void 0||!rr(r))throw nr(n,`${n} expects an operator as argument ${t+1}`);return r},pr=(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}),mr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),hr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),gr=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(K(n,0,e),K(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),_r=e=>e>2147483647||e<-2147483648,vr=e=>new g(`Overflow when computing ${e}`),yr={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`},br={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},xr={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`},Sr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return br[e.operator];if(e.kind!==`Function`)return yr[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},Cr=e=>xr[Sr(e)],wr=(e,t)=>new h(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Tr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof h&&(e.isLazy===!0||!(n instanceof g))?wr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Er=(e,t)=>{if(typeof e!=`number`)throw wr(t,`Cannot cast tlc2.value.impl.${Sr(e)} to tlc2.value.impl.IntValue`);return e},Dr=(e,t,n)=>`public static tlc2.value.impl.${t} tlc2.module.Integers.${e}(${Array.from({length:n},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Or=(e,t,n)=>{let r=Dr(t,`IntValue`,2);return gr(e,(t,i)=>{let a=Er(t,r),o=Er(i,r),s=n(a,o);if(_r(s))throw vr(`${a}${e}${o}`);return s})},kr=(e,t,n)=>{if(typeof e!=`number`)throw new g(`The ${t} argument of ${n} should be an integer, but instead it is:\n${W(e)}`);return e},Ar=(e,t)=>gr(e,(n,r)=>t(kr(n,`first`,e),kr(r,`second`,e))),jr=(e,t,n)=>({...hr(e,t,n),isLazy:!0}),Mr=(e,t,n)=>{let r=fr(e,t,n);return()=>r.call([])},Nr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Pr=()=>({bool:bo,condition:(e,t)=>{if(typeof e!=`boolean`)throw oo(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw so(t,n,e);return e},apply:Cn,tuple:z,set:Tt,record:Je,writtenRecord:ke,equal:Ye,enumerate:To,unassigned:(e,t)=>{throw Xs(e,t)},primeOutsideAction:e=>{throw Zs(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)=>_o(e,t,n[r]),e.scope),state:e.state,next:e.next})}),Fr={value:void 0},Ir=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Lr=e=>`local${e.counter++}`,Rr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),er(e).forEach(e=>Rr(e,t)),t),zr=(e,t,n)=>{let r=Ir(e,X(t,e.environment)),i=Rr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Ir(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Br=(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(()=>Lr(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Hr(e,t.set,s)}, ${Ir(e,t.set)});`),u=t.bounds.map(t=>{let n=Lr(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Hr(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Lr(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})`},Vr=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Hr(e,r[0],n)}, "the left side of =>") ? bool(${Hr(e,r[1],n)}, "the right side of =>") : true)`;if(G(t))return zr(e,t,n);let i=zo(t.operator,e.environment);if(i?.kind!==`Builtin`)return zr(e,t,n);if(i.name===`DOMAIN`)return`${Ir(e,fo(t))}(${Hr(e,r[0],n)})`;if(i.name===`TLCEval`)return zr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Ir(e,po(t,i))}(${Hr(e,r[0],n)}, ${Hr(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&As(r[0],a))return`${Ir(e,i.evaluateUnary)}(${Hr(e,r[0],n)})`;let o=r.length===2&&As(r[0],a)&&As(r[1],a);return i.evaluateBinary&&o?`${Ir(e,i.evaluateBinary)}(${Hr(e,r[0],n)}, ${Hr(e,r[1],n)})`:zr(e,t,n)},Hr=(e,t,n)=>{let r=(t,r=n)=>Hr(e,t,r);if(bs(t)&&hs(t,e.environment))return zr(e,t,n);switch(t.kind){case`Number`:return rs(t.value)?String(t.value):zr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(G(t))return zr(e,t,n);let i=Yo(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Ir(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Ir(e,i.value):zr(e,t,n)}case`Apply`:return Vr(e,t,n);case`And`:{let n=Ir(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)}, ${Ir(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Ws(t.function);let n=r(t.function),i=Ir(e,lo(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)}, ${Ir(e,co(t))}, ${Ir(e,uo(t))})`;case`Record`:{let i=Js(t.fields);if(Ys(i))return zr(e,t,n);let a=Ir(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}, ${Ir(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=Ir(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`)?Br(e,t,n):zr(e,t,n);default:return zr(e,t,n)}},Ur=(e,t)=>{if(!Nr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Hr(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(`
29
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;Fr.value??=Pr();let o=Fr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Wr={kind:`Local`},Gr=/* @__PURE__ */ new WeakMap,Kr=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},qr=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2}])),Jr=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Yr=e=>e.kind===`Operator`?e.params.length:0,Xr=e=>e.name.includes(`!`),Zr=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Qr=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),$r=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),ei=e=>e.kind===`Name`?[e.name]:e.names,ti=e=>e.flatMap(e=>ei(e.pattern)),ni=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Jr(n.location,t.location))?n:void 0},ri=(e,t)=>{let n=ni(e,t);return n?{key:t.getKey(n),arity:Yr(n)}:t.imported.get(e)},ii=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),ai=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),oi=(e,t,n,r)=>{let i=e.location,a=Gr.get(e);if(a!==void 0)return a;if(Kr(t))return e.kind===`Apply`?e.args.length:0;if(ai(t))return 0;let o=Zr(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=Wr),o)return o.arity;let s=ri(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Gr.set(e,s.arity),s.arity;let c=t.slice(0,t.indexOf(`!`));if(c!==``&&(Zr(n,c)!==void 0||ri(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=`at line ${i.line}, column ${i.column}`;throw new p(ii(t)?`Could not find declaration or definition of symbol '${t}' ${l}`:`Unknown operator: \`${t}' ${l}`)},si=(e,t,n)=>(e.forEach(e=>J(e.set,t,n)),e.reduce((e,t)=>Qr(e,ei(t.pattern)),t)),ci=(e,t)=>e.kind===`Identifier`&&e.name===t&&G(e)||er(e).some(e=>ci(e,t)),li=(e,t)=>{e.kind===`FunctionConstruction`&&ci(e.body,t)&&(e.isRecursive=!0),er(e).forEach(e=>li(e,t))},ui=(e,t,n)=>{let r=Qr(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(J(e.body,si(e.bounds,r,n),n),li(e.body,e.name)):J(e.body,$r(r,e.params),n)},di=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:Yr(t),parent:e}),t);return e.reduce((e,t)=>(Xr(t)||ui(t,e,n),{name:t.name,arity:Yr(t),parent:e}),r)},fi=(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}`)},pi=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,mi=(e,t,n)=>{let r=Zr(t,e.operator)?void 0:ni(e.operator,n),i=oi(e,e.operator,t,n);if(i!==e.args.length)throw new p(`The operator ${e.operator} requires ${i} arguments at line ${e.location.line}, column ${e.location.column}`);e.args.forEach((e,i)=>{let a=pi(e),o=a===void 0||Zr(t,a)?void 0:ni(a,n),s=hi(e,t,n);r&&fi(r,i,e,s,o)})},hi=(e,t,n)=>e.kind===`Identifier`?oi(e,e.name,t,n):e.kind===`OperatorReference`?oi(e,e.operator,t,n):(J(e,t,n),e.kind===`Lambda`?e.params.length:0),J=(e,t,n)=>{let r=e=>e.forEach(e=>J(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=oi(e,e.name,t,n);if(r>0)throw new p(`The operator ${e.name} requires ${r} arguments at line ${e.location.line}, column ${e.location.column}`);return}case`OperatorReference`:oi(e,e.operator,t,n);return;case`Apply`:mi(e,t,n);return;case`Lambda`:J(e.body,Qr(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:J(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&&J(e.other,t,n);return;case`Let`:J(e.body,di(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:J(e.body,si(e.bounds,t,n),n);return;case`UnboundedQuantifier`:J(e.body,Qr(t,e.names),n);return;case`Choose`:e.set&&J(e.set,t,n),J(e.body,Qr(t,ei(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:J(e.predicate,si([e.bound],t,n),n);return;case`SetMap`:J(e.expression,si(e.bounds,t,n),n);return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:if(new Set(e.fields.map(e=>e.name)).size<e.fields.length)throw new p(`Non-unique fields in constructor at line ${e.location.line}, column ${e.location.column}`);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`:J(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`:J(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>hi(e,t,n))}},gi=(e,t,n)=>(e.set&&J(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),_i=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?gi(t,e,n):(t.kind===`AssumeProve`?_i(t,e,n):J(t,e,n),e),t);return J(e.conclusion,r,n),r},vi=(e,t,n)=>e.kind===`AssumeProve`?_i(e,t,n):(J(e,t,n),t),yi=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>bi(t,e,n),t)},bi=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=vi(r.statement,t,n);return yi(e.proof,i,n),r.isSuffices?i:t}case`Define`:return di(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return J(r.expression,t,n),yi(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>J(e,t,n)),t;case`Take`:return Qr(si(r.bounds,t,n),r.names);case`Pick`:{let i=Qr(si(r.bounds,t,n),r.names);return J(r.body,i,n),yi(e.proof,t,n),i}default:return yi(e.proof,t,n),t}},xi=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:vi(e.statement,void 0,t);yi(e.proof,n,t)},Si=(e,t)=>new p(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),Ci=(e,t,n,r)=>t.reduce((e,t)=>{if(Zr(e,t)||n(t))throw Si(t,r);return{name:t,arity:0,parent:e}},e),wi=(e,t,n,r)=>(e.forEach(e=>Ei(e.set,t,n)),e.reduce((e,t)=>Ci(e,ei(t.pattern),n,r),t)),Ti=(e,t,n)=>{if(e.kind===`Function`){let r=Qr(t,[e.name]),i=wi(e.bounds,r,n,e.location);Ei(e.body,i,n);return}let r=Ci(t,e.params.map(e=>e.name),n,e.location);Ei(e.body,r,n)},Ei=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:Ei(e.body,Ci(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(Zr(e,t.name)||n(t.name))throw Si(t.name,t.location);return Ti(t,Qr(e,i),n),Qr(e,[t.name])},t);Ei(e.body,Ci(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:Ei(e.body,wi(e.bounds,t,n,r),n);return;case`SetFilter`:Ei(e.predicate,wi([e.bound],t,n,r),n);return;case`SetMap`:Ei(e.expression,wi(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:Ei(e.body,Ci(t,e.names,n,r),n);return;case`Choose`:e.set&&Ei(e.set,t,n),Ei(e.body,Ci(t,ei(e.pattern),n,r),n);return;default:er(e).forEach(e=>Ei(e,t,n))}},Di=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}))],Oi=(e,t)=>{let n=/* @__PURE__ */ new Map;Di(e).sort((e,t)=>Jr(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)&&!qr.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||Jr(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 Si(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||Jr(t.location,e))||r(t,e);e.definitions.forEach(e=>Ti(e,void 0,i(e.location))),e.assumptions.forEach(e=>Ei(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=Ci(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>Ei(e.expression,n,t))})},ki=(e,t)=>{let n=new Map([...qr,...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},Ai=(e,t,n,r)=>{let i=$r(void 0,e.params),a={imported:ki(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)&&!Zr(i,n)&&!ri(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 J(r,i,a),[n,r];if(oi(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]}))},ji=(e,t)=>{let n=ki(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});e.definitions.forEach(e=>ui(e,void 0,i(e.location,e))),e.assumptions.forEach(e=>J(e.expression,void 0,i(e.location,void 0))),e.theorems.forEach(e=>xi(e,i(e.location,void 0)))},Mi=/* @__PURE__ */ new WeakSet,Ni=/* @__PURE__ */ new WeakSet,Pi=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Bi(e,(e,r)=>Pi(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&G(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&G(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Fi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Ii=/* @__PURE__ */ new WeakMap,Li=e=>Ii.get(e)??e.name,Ri=(e,t)=>(Li(t)!==e.name&&Ii.set(e,Li(t)),e),zi=(e,t)=>Ri(e.kind===`Function`?{...e,bounds:Fi(e.bounds,e=>t(e,[])),body:t(e.body,ti(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Bi=(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=>zi(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Fi(e.bounds,n),body:t(e.body,ti(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,ei(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,ei(e.bound.pattern))};case`SetMap`:return{...e,bounds:Fi(e.bounds,n),expression:t(e.expression,ti(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=>({name:e.name,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)}}},Vi=`LAMBDA`,Hi=(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 Bi(e,(e,n)=>(r.push(...Hi(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Ui=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}},Wi=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Gi=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ki=(e,t)=>e.map(e=>({pattern:Gi(e.pattern,t),set:e.set})),qi=(e,t)=>e.kind===`Function`?{...e,bounds:Ki(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Ji=(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=>Ri({...qi(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ki(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Gi(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Gi(e.bound.pattern,n),set:e.bound.set}};default:return e}},Yi=e=>`${e}@ENABLED`,Xi=(e,t)=>e.modes.get(t)??e,Zi=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!G(e)&&t.instantiation.variables.has(e.name),Qi=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Qi(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Zi(e,t,n))return[e.name];let r=G(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Qi(r.body,t,/* @__PURE__ */ new Map):void 0},$i=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Zi(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Yi(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ia(e.expression,Xi(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ia(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ia(e.subscript,Xi(t,`Primed`),n),location:r},ia(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Qi(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:Yi(r),location:e.location},location:e.location},ia({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ea=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),ta=(e,t)=>e.map(e=>ea(e.name,t)),na=(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:[...ta(t,r),...i.map(e=>ea(e,r))],location:r},location:r}},ra=(e,t)=>e.instantiation.isParameterized(t)?oa(e,t):void 0,ia=(e,t,n)=>{let r=e=>ia(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!G(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:ia(e.expression,Xi(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:ia(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Xi(t,`Enabled`),n)};let s=$i(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Mi.add(n),n;let r=ra(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&&Yr(o)>0?na(r,a,Yr(o),e.location):{kind:`Apply`,operator:r,args:ta(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||Ni.has(e),c=e=>(s&&Ni.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:Vi,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Vi,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=ra(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...ta(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=ra(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?na(n,a,Yr(r),e.location):{...e,operator:n}}let c=Ui(t),l=Bi(e,(e,i)=>i.length===0?r(e):ia(e,t,Wi(n,i,c)));return Ji(l,n,c)},aa=(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:ea(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},oa=(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=Ui(e),o=qi(zi(i,(t,n)=>ia(t,e,Wi(/* @__PURE__ */ new Map,n,a))),a);return aa(o,r.params,i.location)}):t},sa=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Hi(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=>ra(i,e)??e,getQualifiedKey:t=>{let n=ra(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>aa(r,e.params,r.location)):t}}},ca=e=>e.kind===`Let`&&e.instances!==void 0||er(e).some(ca),la=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Bi(e,e=>la(e,t,r));return i.kind!==`Let`||!i.instances?i:{kind:`Let`,definitions:i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Jr(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}},ua=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,da=(e,t)=>e.definitions.some(e=>ca(e.body))||e.assumptions.some(e=>ca(e.expression))||e.theorems.some(e=>{let t=ua(e);return t!==void 0&&ca(t)})?{...e,definitions:e.definitions.map(e=>zi(e,e=>la(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:la(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ua(e);return n===void 0?e:{...e,statement:la(n,t,[])}})}:e,fa=/* @__PURE__ */ new WeakMap,pa=/* @__PURE__ */ new WeakMap,Y=(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},ma=(e,t,n)=>{let r=e.slice();return r[t]=n,r},ha=(e,t,n)=>{if(typeof t==`boolean`)return t;throw new h(`In computing ${n?`initial`:`next`} states, TLC expected a boolean expression,\nbut instead found ${W(t)}.\n${ao(e)}`)},ga=(t,r,i=Z(t,r))=>{if(r.next!==void 0&&t.kind===`Number`)throw n(new h(`The next state relation is not a boolean expression.\n${t.text??t.value}`),e.error);return ha(t,i,r.next===void 0)},_a=e=>e===`=`||e===`\\in`||e===`\\subseteq`,va=(e,t,n)=>{let r=n?fa:pa,i=r.get(e);if(i)return i;let a=qa(e,t,n);return r.set(e,a),a},ya=(e,t)=>{if(t.constants.has(e))return;let n=xo(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},ba=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return ba(e.expression,t,!1,r);if(e.kind!==`Identifier`||G(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=ya(e.name,t);if(a&&!r.has(a))return r.add(a),ba(a.body,t,n,r)},xa=(e,t,n)=>ba(e,t,!n),Sa=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Sa(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=ts(e.definitions,Y(r,t,n));return Sa(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=go(t,e.name);if(a?.kind===`Thunk`)return Sa(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=ya(e.name,r.environment);if(s)return Sa(s.body,void 0,n,r,i)},Ca=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||G(e))||!t&&e.kind===`Prime`,wa=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>wa(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=ya(e.name,t);if(i)return n.add(e.name),wa(i.body,t,n)},Ta=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ea=(e,t,n)=>Ta.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||_a(e.operator)&&(Ca(e.args[0],n)||xa(e.args[0],t,n)!==void 0)||G(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Da=/* @__PURE__ */ new Set,Oa=(e,t)=>{if(G(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Bi(e,(e,i)=>{let a=r.isReadOnly?Oa(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},ka=(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||G(e)?void 0:xo(r,t);return i&&!n.has(i)&&(n.add(i),ka(i.body,t,n))?!0:er(e).some(e=>ka(e,t,n))},Aa=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=xa(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=wa(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Ea(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:va(e,t,n)}},ja=(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(nc(e,t)===void 0||ka(e,t,/* @__PURE__ */ new Set))return!0;let n=Oa(e,Da);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)}},Ma=(e,t,n)=>{let r=e.map(e=>Aa(e,t,n)),i=r.map(()=>void 0),a=(e,n,o,s,c,l)=>{let u=s,d;for(let s=e;s<r.length;s++){if(s>0&&n.isInit&&Za(u)){d??=Y(n,o,u);for(let e=s;e<r.length;e++)if(!Na(r[e].expression,d))return;l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Y(n,o,u);let r=i[s]??=Ts(e.expression,t);if(!ga(e.expression,d,r(d)))return;continue}if(e.kind===`Assign`){d??=Y(n,o,u);let r=(i[s]??=Ts(e.value,t))(d),a=u[e.index];if(a===void 0)u=ma(u,e.index,r),d=void 0;else if(!Ye(a,r))return;continue}if(e.kind===`Unchanged`){let t=n.current;if(!t)return;for(let n of e.indices){let e=u[n];if(e===void 0)u=ma(u,n,t[n]),d=void 0;else if(!Ye(e,t[n]))return}continue}let f=s+1;e.runner(n,o,u,c,!0,(e,t)=>a(f,n,o,e,t,l));return}l(u,c)};return(e,t,n,r,i,o)=>a(0,e,t,n,r,o)},Na=(e,t)=>ha(e,Z(e,t),!0),Pa=e=>(t,n,r,i,a,o)=>{ga(e,Y(t,n,r))&&o(r,i)},Fa=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Y(r,i,a);if(a[l]!==void 0){ga(e,u)&&c(a,o);return}let d=Z(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!B(f))throw new h(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${ao(e)}`);let p=en(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(ma(a,l,p[e]),o)}},Ia=/* @__PURE__ */ new WeakMap,La=e=>{let t=Ia.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(La),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Ia.set(e,n),n},Ra=(e,t)=>{let n=e.args[0],r=Pa(e),i=(e,r,i)=>Sa(n,r,i,e,!t)??-1,a=Fa(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=Z(e.args[1],Y(t,n,o));l(ma(o,u,d),s)}},za=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=go(t,e.name);if(i?.kind===`Thunk`)return za(i.expression,i.scope,n,r);let a=i?void 0:xo(e.name,r.environment);if(a?.kind!==`Function`)return;let o=Z(e,Y(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:_o(void 0,a.name,o)}},Ba=(e,t,n)=>{let r=Pa(e);return(i,a,o,s,c,l)=>{let u=za(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=Y(i,a,o),f=e.args.map(e=>Z(e,d)),p=f.length===1?f[0]:z(f),m=Do(u.bounds,Y(i,u.scope,o));if(!dn(p,m))throw new h(`Attempted to apply a function to ${W(p)}, which is not in its domain at ${ro(e)}`);va(u.body,t,n)(i,Oo(u.bounds,u.scope,p),o,s,c,l)}},Va=(e,t)=>{if(wa(e,t))return Ma([La(e)],t,!1);if(e.kind===`Tuple`)return va(La(e),t,!1);let n=La(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?go(i,e.name):void 0;l?.kind===`Thunk`?va(La(l.expression),t,!1)(r,l.scope,a,o,s,c):ga(n,Y(r,i,a))&&c(a,o)}},Ha=(e,t,n)=>{let r=e.operator,i=Pa(e),a=G(e)?void 0:zo(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Ns(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=va(a.body,t,n),o.body(e,i(Y(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Y(a,o,s),f=Vo(e,d);f?.kind===`Closure`?va(f.body,t,n)(a,$o(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Ua=(e,t,n)=>{let r=Pa(e),i=G(e)?void 0:ya(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=go(s,e.name);f?.kind===`Thunk`?va(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=va(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Wa=(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!==`=`||G(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`||!G(a))return;let o=ba(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=>Wa(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`||G(e))return;let r=zo(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Wa(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`&&G(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Ga=(e,t,n)=>{let r=go(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},Ka=(e,t,n)=>{let r=e.map(e=>va(e,t,n)),i=n?[]:e.map(e=>Wa(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&&Ga(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)}},qa=(e,t,n)=>{let r=e=>va(e,t,n);switch(e.kind){case`And`:return Ma(e.operands,t,n);case`Or`:return Ka(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=To(Z(a.set,Y(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,_o(n,e,l[a]),r,o,s,c)}}let o=n?void 0:ja(e,t);if(o){let r=Ma(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=Y(t,n,i),u=e.bounds.map(e=>To(Z(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=_o(n,o.names[e],r);if(e===u.length-1){let e=Y(t,a,i);if(!o.guards.every(t=>ga(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{Eo(e.bounds,Y(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&nc(e,t)!==void 0&&!ka(e.body,t,/* @__PURE__ */ new Set)?Oa(e,Da):void 0;return(t,n,r,o,s,c)=>{let l=[];Eo(e.bounds,Y(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>go(n,e)?.kind===`Value`)){u.every(n=>ga(e.body,Y(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Za(r)?u.slice(n).every(n=>Na(e.body,Y(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=Z(e.condition,Y(r,i,a));(bo(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=Y(r,i,a),u=t.find(e=>bo(Z(e.condition,l),`a CASE guard`))?.body??n;if(!u)throw new h(`In computing ${r.isInit?`initial`:`next`} states, TLC encountered a CASE with no conditions true.\n${ao(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=ds(e.definitions,t);return(t,r,a,o,s,c)=>n(t,ts(e.definitions,Y(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new h(`UNCHANGED appears in an initial predicate at ${ro(e)}`)}:Va(e.expression,t);case`AngleAction`:{let t=r(e.action),n=La(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{ga(n,Y(e,r,t))||s(t,i)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,La(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Ua(e,t,n);case`FunctionApplication`:return Ba(e,t,n);case`Apply`:{let i=e.args;if(_a(e.operator)){let r=xa(i[0],t,n);if(r!==void 0)return e.operator===`=`?Ma([e],t,n):Fa(e,()=>r);if(Ca(i[0],n))return Ra(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=Z(i[0],Y(t,n,r));(typeof c==`boolean`?c:bo(c,`the left side of => at ${ro(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Ha(e,t,n)}default:return Pa(e)}},Ja=/* @__PURE__ */ new WeakMap,Ya=e=>{let t=Ja.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Ja.set(e,n),n},Xa=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Za=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Qa=(e,t)=>{let n=t.state;if(!n||!Za(n))throw new h(`ENABLED needs a complete state at ${ro(e)}`);let r=t.environment,i={environment:r,isInit:!1,current:n,isStopped:!1};return va(e,r,!1)(i,t.scope,Ya(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},$a=(t,r,i,a)=>{let o={environment:r,isInit:!0,current:void 0,isStopped:!1};va(t,r,!0)(o,a,Ya(r),void 0,!1,t=>{if(!o.isStopped){if(!Za(t))throw n(new h(`The initial predicate does not assign ${Xa(t,r).join(`, `)}`),e.error);o.isStopped=i(t)}})},eo=(e,t,n)=>{let r=[];return $a(e,t,e=>(r.push(e),!1),n),r},to=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,current:t,isStopped:!1},o={successors:0};return va(e,n,!1)(a,i,Ya(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Za(e))throw new _(e,t,Xa(e,n).sort());o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},no=(e,t,n,r)=>{let i=[];return to(e,t,n,e=>(i.push(e),!1),r),i},ro=e=>`line ${e.location.line}, column ${e.location.column}`,io=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,ao=e=>{let t=e.location.range;return t?io(t):ro(e)},oo=(e,t)=>new h(`A non-boolean expression (${Cr(t)}) was used as the condition of an IF.\n${ao(e)}`),so=(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):ao(r);return new h(`A non-boolean expression (${Cr(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 h(`Attempted to evaluate an expression of form P /\\ Q when ${t===0?`P`:`Q`} was\n${Cr(n)}.\n${ao({...e,location:{...e.location,range:{...r,end:i}}})}`)},co=e=>t=>bn(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${W(t)}\n${ao(e)}`:yn(t,e.field),lo=e=>t=>`A non-function (${Cr(t)}) was applied as a function.\n${ao(e)}`,uo=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${W(t)}\n${ao(e)}`,fo=e=>t=>{if(!N(t))throw new h(`Attempted to apply the operator DOMAIN to a non-function\n(${Cr(t)})\n${ao(e)}`);return Tn(t)},po=(e,t)=>(n,r)=>{if(!M(n)||L(n))throw new h(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${ao(e)}`);return t.evaluate([n,r])},mo=t=>n(new h(`TLC can't handle real numbers: ${t.text} at ${ro(t)}`),e.configParseError),ho=t=>n(new h(`TLC can't handle a number this big: ${t.text??t.value} at ${ro(t)}`),e.error),go=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},_o=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),vo=(e,t,n)=>{if(t.kind===`Name`)return _o(e,t.name,n);let r=cn(n);if(!r||r.length!==t.names.length)throw new h(`Cannot bind <<${t.names.join(`, `)}>> to ${W(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>_o(e,t,r[n]),e)},yo=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),bo=(e,t)=>{if(typeof e!=`boolean`)throw new h(`Expected ${t} to be a boolean but found ${W(e)}`);return e},xo=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),So=(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=xo(n,t);if(e&&!t.constants.has(n)&&!Co(e,t))return!0}return er(e).some(e=>So(e,t))},Co=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!So(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>So(e.set,t)));return t.constantLevels.set(e,r),r},wo=(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.`},To=(e,t)=>{if(!M(e)||L(e)){let n=W(e),r=wo(e,n);throw new h(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${ao(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${ao(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?It(e):V(e).elements},Eo=(e,t,n)=>{let r=e.map(e=>To(Z(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,vo(a,e[t].pattern,n)));return i(e.length-1,t.scope)},Do=(e,t)=>{let n=e.map(e=>Z(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Oo=(e,t,n)=>{if(e.length===1)return vo(t,e[0].pattern,n);let r=cn(n)??[];return e.reduce((e,t,n)=>vo(e,t.pattern,r[n]),t)},ko=/* @__PURE__ */ new WeakMap,Ao=(e,t)=>{let n=ko.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:io(r)};return ko.set(t,i),i},jo=(e,t,n)=>{let r=Ao(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}},Mo=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Pn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Ze(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},No=(e,t)=>{let n=Do(e.bounds,t),r=Mo(n,(n,r)=>Z(e.body,yo(t,Oo(e.bounds,_o(void 0,e.name,r),n))),jo(e.bounds,e.body,n));return e.bounds.length===1?mn(r):r},Po=(e,t)=>e.kind===`Function`?No(e,t):Z(e.body,t),Fo=(e,t)=>{let n=Co(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 h(`Operator ${e.name} requires ${e.params.length} arguments`);let i=yo(t,void 0);if(!n)return Po(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Po(e,i));return t.environment.definitionValues.set(e,a),a},Io=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=Z(e.expression,yo(t,e.scope));return n&&(e.cache=r),r},Lo=/* @__PURE__ */ new WeakMap,Ro=e=>{let t=Lo.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Lo.set(e,n),n},zo=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return zo(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Ro(r):t.builtins.get(e)},Bo=/* @__PURE__ */ new WeakMap,Vo=(e,t)=>{if(G(e))return Ho(e.operator,t);let n=Bo.get(e),r=n===void 0?zo(e.operator,t.environment)??null:n;return n===void 0&&Bo.set(e,r),r??Ho(e.operator,t)},Ho=(e,t)=>{let n=go(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return zo(e,t.environment)},Uo=e=>e.kind===`Closure`?e.params.length:e.arity,Wo=(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:Ho(n,t);if(!r)throw new h(`Expected an operator argument at ${ro(e)}`);return r},Go=(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)=>_o(e,n.name,t[r]),e.scope);return Z(e.body,yo(n,r))},Ko=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Uo(e),call:n=>Go(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},qo=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Ho(e.name,t);return n!==void 0&&Uo(n)>0},Jo=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),Yo=(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 Yo(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([])}},Xo=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&rs(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=G(e)?void 0:Yo(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=go(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Jo(e,t)}}return t=>Jo(e,t)},Zo=/* @__PURE__ */ new WeakMap,Qo=(e,t)=>{let n=Zo.get(e);if(n)return n;let r=Xo(e,t);return Zo.set(e,r),r},$o=(e,t,n)=>{if(t.length!==e.params.length)throw new h(`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:Wo(t[i],n)}:Qo(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},es=(e,t,n)=>e.kind===`Closure`?Z(e.body,yo(n,$o(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>Z(e,n))):e.isLazy?e.evaluate(js(t,n),n):e.evaluate(t.map(e=>qo(e,n)?Ko(Wo(e,n),n):Z(e,n)),n),ts=(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),ns=(e,t,n)=>{let r=go(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Io(r,n);if(r?.kind===`Operator`){if(Uo(r.operator)===0)return Go(r.operator,[],n);throw new h(`Operator ${e} is used without arguments`)}let i=Yo(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Xs(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Fo(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new h(`Unknown identifier ${e} at ${ro(t)}`)},rs=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,is=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),as=(e,t)=>is.has(e)||t.builtins.get(e)?.isStateLevel===!0,os={builtins:is,definitions:/* @__PURE__ */ new WeakMap},ss={builtins:new Set([...is].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},cs=(e,t)=>e.kind===`Operator`&&e.params.length===0&&Co(e,t),ls=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!G(e)){let e=xo(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!cs(e,t)&&us(e,t,n))return!0}return er(e).some(e=>ls(e,t,n))},us=(e,t,n=os)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=ls(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>ls(e.set,t,n));return n.definitions.set(e,i),i},ds=(e,t)=>new Set(e.filter(e=>us(e,t))),fs=e=>[...e.definitions.values()].some(t=>us(t,e)),ps=e=>[...e.definitions.values()].some(t=>us(t,e,ss)),ms=/* @__PURE__ */ new WeakMap,hs=(e,t)=>{let n=ms.get(e);if(n!==void 0)return n;let r=ys(e,t,_s);return ms.set(e,r),r},gs=/* @__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`]),_s=/* @__PURE__ */ new Set,vs=(e,t,n)=>n.size===0?hs(e,t):ys(e,t,n),ys=(e,t,n)=>{if(!gs.has(e.kind))return!1;if(e.kind===`Identifier`&&G(e))return n.has(e.name);if(G(e))return!1;if(e.kind===`Identifier`){let n=Yo(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&cs(n.definition,t)}if(e.kind===`Apply`){if(as(e.operator,t)||e.operator===`~>`)return!1;let r=zo(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=xo(e.operator,t);if(!n||!Co(n,t)||us(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`&&vs(e,t,n))}let r={value:!0};return Bi(e,(e,i)=>(r.value&&=vs(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},bs=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,xs=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}},Ss=(e,t)=>{if(e.kind===`Identifier`&&G(e))return!t.has(e.name);if(G(e))return!0;let n={value:!1};return Bi(e,(e,r)=>(n.value||=Ss(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Cs=(e,t)=>Mi.has(e)&&bs(e)&&nc(e,t)!==void 0&&!Ss(e,_s),X=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=$s(e,t),i=bs(e)&&hs(e,t)?xs(r):Cs(e,t)?Os(r):r;return t.evaluators.set(e,i),i},ws=/* @__PURE__ */ new WeakMap,Ts=(e,t)=>{let n=ws.get(e);if(n)return n;let r=(bs(e)&&hs(e,t)?void 0:Ur(e,t))??X(e,t);return ws.set(e,r),r},Z=(e,t)=>Ts(e,t.environment)(t),Es=(e,t)=>{let n=e.name,r=G(e)?void 0:Yo(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Xs(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&&Co(e,t))return t=>Fo(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Ts(e.body,t),n.body(yo(r,void 0)));return Ds(e,t)?Os(r):r}return t=>Fo(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Fo(e,t);return Co(e,t)||!Ds(e,t)?n:Os(n)}return t=>ns(n,e,t)},Ds=(e,t)=>nc(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>nc(e.set,t)!==void 0)),Os=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}},ks=(e,t)=>{let n=zo(e,t);return n!==void 0&&Uo(n)>0},As=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!G(e)&&ks(e.name,t)),js=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>Z(e,t),expression:e})),Ms=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(js(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&As(t[0],n)){let e=X(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&As(t[0],n)&&As(t[1],n);if(i&&a){let e=X(t[0],n),r=X(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>qo(e,n)?Ko(Wo(e,n),n):Z(e,n)),n)},Ns=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new h(`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:Qo(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:Wo(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Ps=/* @__PURE__ */ new WeakMap,Fs=e=>{let t=Ps.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return Ps.set(e,n),n},Is=(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},Ls=(e,t)=>e.every((e,n)=>Ze(e,t[n])),Rs=(e,t)=>{let n=xo(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&Co(n,t)&&!us(n,t)},zs=(e,t,n,r)=>{let i=Ns(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Ts(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=Fs(e);return e=>{let n=i(e),r=Is(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=kn(a,Pn(e));let c=s.calls.get(a),l=c?.find(e=>Ls(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}},Bs=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=X(n[0],t),r=X(n[1],t);return t=>!bo(e(t),`the left side of =>`)||bo(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new h(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=G(e)?void 0:zo(e.operator,t);if(r?.kind===`Closure`)return zs(r,n,t,Rs(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=X(n[0],t),i=fo(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=X(n[0],t);return Ni.has(e)||So(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=X(n[0],t),a=X(n[1],t),o=po(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?Ms(r,n,t):r=>{let i=Ho(e.operator,r);if(i)return es(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new h(`${e.operator} is a function; apply it with brackets`):e.operator===`\\cdot`?new h(`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 h(`Unknown operator ${e.operator} at ${ro(e)}`)}},Vs=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=X(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=X(a.set,t);return t=>{let s=To(o(t),a.set);for(let a=0;a<s.length;a++){let o=bo(i(yo(t,_o(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=>X(e.set,t));return t=>{let s=a.map((e,n)=>To(e(t),o[n].set)),c=(a,o)=>{if(a<0)return bo(i(yo(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,_o(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>Eo(o,e,t=>bo(i(yo(e,t)),r)!==n)?!n:n},Hs=(e,t)=>{if(e.kind===`Tuple`)return z(e.names.map(e=>{let n=go(t,e);return n?.kind===`Value`&&n.value}));let n=go(t,e.name);return n?.kind===`Value`?n.value:void 0},Us=/* @__PURE__ */ new WeakSet,Ws=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Us.add(e)},Gs=(e,t)=>{let n=Us.has(e),r=X(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=X(a.set,t);return t=>{let c=o?s(t):Do(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(Ce)){let n=Mo(c,e=>r(yo(t,Oo(i,t.scope,e))),jo(i,e.body,c));return i.length===1?mn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Rt(c);return mn(Je(n,n.map(n=>r(yo(t,_o(t.scope,e,n))))))}let u=[];return Eo(i,t,e=>{let n=i.length===1?Hs(a.pattern,e)??!1:z(i.map(t=>Hs(t.pattern,e)??!1));return u.push([n,r(yo(t,e))]),!1}),At(u)}},Ks=(e,t)=>{let n=Us.has(e);n&&Ws(e.function);let r=X(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>X(e,t))}),value:X(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):z(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(yo(i,_o(i.scope,`@`,e))):En(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}},qs=(e,t)=>{if(e.kind===`SetFilter`){let n=X(e.predicate,t),r=X(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>bo(n(yo(t,vo(t.scope,i,e))),`a set filter predicate`);if(!Ce(a)){if(M(a))return{kind:`FilteredSet`,base:a,test:o};throw new h(`TLC encountered a non-enumerable quantifier bound ${W(a)} at ${ro(e.bound.set)}`)}return qe(V(a).elements.filter(o))}}if(e.kind===`SetMap`){let n=X(e.expression,t);return t=>{let r=[];return Eo(e.bounds,t,e=>(r.push(n(yo(t,e))),!1)),Tt(r)}}let n=e.set;if(!n)return()=>{throw new h(`TLC cannot evaluate an unbounded CHOOSE at ${ro(e)}`)};let r=X(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(Eo([i],t,i=>bo(r(yo(t,i)),`the body of CHOOSE`)?(n.value=Hs(e.pattern,i),!0):!1),n.value===void 0)throw new h(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${ao(e)}`);return n.value}},Js=e=>[...e].sort((e,t)=>R(e.name,t.name)),Ys=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Xs=(t,n)=>a(new h(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${ao(n)}`),e.configParseError),Zs=e=>new h(`A primed expression appears outside an action at ${ro(e)}`),Qs=(e,t)=>{let n=Js(e),r=Ys(n),i=n.map(e=>X(e.value,t));if(r)return e=>At(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=>ke(a,i.map(t=>t(e)),o):e=>Je(a,i.map(t=>t(e)))},$s=(e,t)=>{let n=e=>X(e,t);switch(e.kind){case`Number`:{let t=e.value;return rs(t)?()=>t:()=>{throw ho(e)}}case`Decimal`:return()=>{throw mo(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Es(e,t);case`Apply`:return Bs(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new h(`An operator cannot be used as a value at ${ro(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 so(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(bo(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Zs(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=>Ye(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 oo(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(bo(e.condition(n),`a CASE guard`))return e.body(n);if(r)return r(n);throw new h(`Attempted to evaluate a CASE with no conditions true.\n${ao(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(yo(n,ts(e.definitions,n)))}case`Forall`:case`Exists`:return Vs(e,t);case`UnboundedQuantifier`:return()=>{throw new h(`TLC cannot evaluate an unbounded quantifier at ${ro(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return qs(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Tt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>z(t.map(t=>t(e)))}case`FunctionConstruction`:return Gs(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 Qs(e.fields,t);case`RecordSet`:{let t=Js(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 Ks(e,t);case`ExceptAt`:return t=>{let n=go(t.scope,`@`);if(n?.kind!==`Value`)throw new h(`@ appears outside an EXCEPT at ${ro(e)}`);return n.value};case`FunctionApplication`:{Ws(e.function);let t=n(e.function),r=e.args.map(n),i=lo(e);if(r.length===1){let e=r[0];return n=>Cn(t(n),e(n),void 0,i)}return e=>Cn(t(e),z(r.map(t=>t(e))),void 0,i)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=co(e),a=uo(e);return e=>Cn(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?bo(t(e),`an action`)||r(e):bo(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Qa(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new h(`The subexpression reference at ${ro(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new h(`TLC cannot evaluate a temporal formula in a state at ${ro(e)}`)}}},ec=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),tc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},nc=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(ec.has(e.kind))return!1;let a=tc(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&&as(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 er(e).every(i)};return i(e)?[...n]:void 0},rc=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
29
+ `);throw t===e.length-1?a(e):ve(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=pe.find(t=>e.startsWith(t));if(l){n.push({kind:`Symbol`,text:l,line:r.line}),r.index+=l.length;continue}let u=ce(t,r.index);if(!u)throw ve(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},be=e=>{let t=ye(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`&&fe.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 M(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 M(e.line,`It was expecting a value, but did not find it.`)},c=e=>{let t=a();if(t.kind===`End`)throw M(t.line,`Expected an identifier after ${e}[.`);let n=a();if(n.text!==`]`)throw M(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 M(t.line,`Expected an identifier after <-[mod].`);r.substitutions.push({name:n.text,target:t.text,module:e});continue}if(i.kind===`End`)throw M(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 M(e,``);i=a()}if(i.text!==`=`)throw M(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(he(e)){let n=a();if(n.kind===`End`)throw M(t,`The keyword ${e} was not followed by an identifier.`);let i=me[e];if(r[i]!==void 0)throw M(t,`The keyword ${e} appeared twice.`);r[i]=n.text,u=a()}else if(ge(e)){let t=r[j[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 M(t,`The keyword CHECK_DEADLOCK was not followed by an identifier.`);if(e.text!==`TRUE`&&e.text!==`FALSE`)throw M(e.line,`It was expecting TRUE or FALSE, but did not find it.`);if(i.isSet)throw M(t,`The keyword CHECK_DEADLOCK appeared twice.`);i.isSet=!0,r.checkDeadlock=e.text===`TRUE`,u=a()}else throw M(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},xe={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:` `}},Se=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},Ce=e=>e!==void 0&&/^\p{Nd}$/u.test(e),we=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Te=e=>{let t=t=>{let n=A(e,t,Se);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=A(e,t,Ce);if(e.startsWith(`..`,n)&&Ce(e[n+2]))return{kind:`Constant`,first:t,last:A(e,n+2,Ce)-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=Ce(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:A(e,t+1,Ce)-1,children:[]};if(we(n))return{kind:`Constant`,first:t,last:A(e,t,we)-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)},Ee=e=>{let t=e.length===0?void 0:Te(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=xe[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},N={current:void 0},De=/* @__PURE__ */ new WeakMap,Oe=e=>e instanceof v?De.get(e):void 0,ke=(e,t)=>{let n=N.current;if(!n||typeof e!=`object`)return t();try{return t()}catch(t){let r=n.get(e);throw r&&t instanceof v&&De.set(t,[r,...De.get(t)??[]]),t}},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ae=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),F=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),I=e=>typeof e==`object`&&e.kind===`ModelValue`,je=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,Me=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new y(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},Ne={isUsed:!1},Pe=(e,t)=>(Ne.isUsed=!0,e.writtenKeys=t,e),Fe=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[gn(e.domain,t)]]),Ie=(e,t,n)=>Pe(nt(e,t),n),Le=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(Le);e.writtenKeys=void 0,e.range.forEach(Le)}},Re=e=>e.every(e=>typeof e==`string`),ze=(e,t)=>e.length>0&&t.length>0&&Re(e)!==Re(t),Be=(e,t)=>{Ne.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return ze(n,r)?St(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=z(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=z(i[e],a[e]);if(t!==0)return t}return 0},L=(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=z(n[e],r[e]);if(t!==0)return t}return 0},Ve=e=>I(e)?e.type:void 0,He=(e,t,n)=>{let r=Ve(e),i=Ve(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(I(e)&&I(t)){if(r===void 0||i===void 0||r===i)return;throw new v(`Attempted to ${a} the differently-typed model values ${G(e)} and ${G(t)}`)}throw r===void 0?new v(`Attempted to ${a} the typed model value ${G(t)} and the non-model value\n${G(e)}`):new v(`Attempted to ${a}${n?``:` the`} typed model value ${G(e)} and non-model value\n${G(t)}`)},Ue={ranks:Object.create(null),size:0},We=e=>{Ue.ranks=Object.create(null),Ue.size=0,$e.clear();for(let t of e)Ge(t)},Ge=e=>(Ue.ranks[e]===void 0&&(Ue.ranks[e]=Ue.size++),e),Ke=()=>Ue.size,qe=e=>Ue.ranks[Ge(e)],Je=(e,t)=>{if(e===t)return 0;let n=Ue.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},R=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ye=(e,t)=>(R(e)||R(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Xe=(e,t,n)=>{if(!R(e))throw new v(`Attempted to ${n} the set ${G(V(e)?H(e):e,!0)} with the value:\n${G(t,!0)}`);if(!R(t))throw new v(`Attempted to compare overridden value ${G(e,!0)} with non-overridden value:\n${G(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 ${G(e,!0)} with the value\n${G(t,!0)}`)},Ze={kind:`InfiniteSet`,name:`Any`},Qe=e=>{throw new v(`Attempted to compare ANY with the value\n${G(e)}`)},z=(e,t)=>{if(e===t)return Ne.isUsed&&Le(e),e===Ze?Qe(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Be(e,t);if(n===`Set`&&r===`Set`)return L(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&&He(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return He(e,t,!1),n===`ModelValue`?-1:1;if(e===Ze||t===Ze)return Qe(e===Ze?t:e);if(P(e)&&P(t)&&Ye(e,t))return Xe(e,t,`compare`);let i=P(e);if(i!==P(t))throw new v(`Attempted to compare ${je(e)} ${G(e)} with ${je(t)} ${G(t)}`);return i?L(H(e),ln(t)):Be(W(e),W(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Je(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(He(e,t,!1),I(e))return-1;if(I(t))return 1;throw new v(`Attempted to compare ${je(e)} ${G(e)} with ${je(t)} ${G(t)}`)},$e=/* @__PURE__ */ new Map,et=e=>{let t=$e.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:qe(e)};return $e.set(e,n),n},tt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0}),nt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0}),rt=(e,t)=>{if(e===t)return Ne.isUsed&&Le(e),e!==Ze||Qe(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&He(e,t,!0),z(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 Be(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return L(e,t)===0;if(I(e)||I(t))return He(e,t,!0),I(e)&&I(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return rt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=U(e.domain),r=U(t.domain);if(n||r)return n===r;let i=U(e.range),a=U(t.range);return i||a?i===a:rt(e.domain,t.domain)&&rt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(U(e))return U(t);if(U(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]&&rt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return U(e)?U(t):!U(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>rt(e,t.factors[n]));let n=P(e)&&P(t)&&!(V(e)&&V(t));if(n&&Ye(e,t))return Xe(e,t,`check equality of`)===0;if(n){if(!R(e)){let n=H(e);if(!R(t))return L(n,H(t))===0}return nr(e)===nr(t)}return z(e,t)===0},it=(e,t)=>e===t||e.length===t.length&&e.every((e,n)=>at(e,t[n])),at=(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)&&it(e.elements,t.elements):e.kind===`Function`&&t.kind===`Function`?(e.hash===0||t.hash===0||e.hash===t.hash)&&it(e.domain,t.domain)&&it(e.range,t.range):nr(e)===nr(t),ot=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},st=e=>{if(!F(e))return;let t=W(e);return{domain:t.domain,range:t.range,low:ot(t.domain)}},ct=e=>{if(!F(e))return;let t=W(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},lt=(e,t)=>{if(Ve(e)!==void 0)throw new v(`Attempted to compare the typed model value ${G(e)} and the non-model value\n${G(t)}`);return 1},ut=(e,t)=>{if(Ve(e)!==void 0)throw new v(`Attempted to check equality of the typed model value ${G(e)} and the non-model value\n${G(t)}`);return!1},dt=(e,t)=>{let n=Ve(e);if(n===void 0)return I(t)?e.rank-t.rank:-1;if(!I(t))throw new v(`Attempted to compare the typed model value ${G(e)} and non-model value\n${G(t)}`);let r=Ve(t);if(r!==void 0&&r!==n)throw new v(`Attempted to compare the differently-typed model values ${G(e)} and ${G(t)}`);return e.rank-t.rank},ft=(e,t)=>{let n=Ve(e);if(n===void 0)return I(t)&&e.name===t.name;if(!I(t))throw new v(`Attempted to check equality of typed model value ${G(e)} and non-model value\n${G(t)}`);let r=Ve(t);if(r!==void 0&&r!==n)throw new v(`Attempted to check equality of the differently-typed model values ${G(e)} and ${G(t)}`);return e.name===t.name},pt={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`}},mt=(e,t,n)=>{let r=pt[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${G(e)} with ${r.other}:\n${G(t)}`},ht=(e,t,n)=>{let r=st(n);if(!r){if(I(n))return lt(n,t);throw new v(`Attempted to compare the function ${G(t)} with the value:\n${G(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>gt(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 gt(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${G(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},gt=(e,t)=>{for(let n=0;n<e.length;n++){let r=St(e[n],t[n]);if(r!==0)return r}return 0},_t=(e,t)=>{let n=W(e);if(e.kind===`Function`&&_n(n)!==void 0){let r=F(t)?_n(t):void 0;return r?n.range.length-r.length||gt(n.range,r):ht({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=ct(t);if(!r){if(I(t))return lt(t,e);throw new v(`Attempted to compare record:\n${G(e)}\nwith non-record\n${G(t)}`)}return n.domain.length-r.domain.length||gt(n.domain,r.domain)||gt(n.range,r.range)}return ht({...n,low:ot(n.domain)},e,t)},vt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),yt=(e,t)=>R(e)||R(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),bt=(e,t)=>{let n=vt(t)?t:H(t);return{elements:H(e).elements,otherElements:H(n).elements}},xt=(e,t)=>{if(yt(e,t))return z(e,t);if(!vt(e))return xt(H(e),t);if(!P(t)){if(I(t))return lt(t,e);throw new v(`Attempted to compare the set ${G(e)} with the value:\n${G(t)}`)}let n=bt(e,t);return n.elements.length-n.otherElements.length||gt(n.elements,n.otherElements)},St=(e,t)=>ke(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return z(e,t);if(I(t))return lt(t,e);throw new v(mt(e,t,!1))}return e.kind===`ModelValue`?dt(e,t):F(e)?_t(e,t):xt(e,t)}),Ct=(e,t)=>e.every((e,n)=>Dt(e,t[n])),wt=(e,t,n)=>{let r=st(n);if(!r){if(I(n))return ut(n,t);throw new v(`Attempted to check equality of the function ${G(t)} with the value:\n${G(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)&&Ct(e.range,r.range);let i=e.low??r.low;return i===void 0?Ct(e.domain,r.domain)&&Ct(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${G(e)}.`);return e===i+t})&&Ct(e.range,r.range)},Tt=(e,t)=>{let n=W(e);if(e.kind===`Function`&&_n(n)!==void 0){let r=F(t)?_n(t):void 0;return r?n.range.length===r.length&&Ct(n.range,r):wt({...n,low:1},e,t)}if(e.kind===`Function`&&n.domain.every(e=>typeof e==`string`)){let r=ct(t);if(!r){if(I(t))return ut(t,e);throw new v(`Attempted to check equality of record:\n${G(e)}\nwith non-record\n${G(t)}`)}return n.domain.length===r.domain.length&&Ct(n.domain,r.domain)&&Ct(n.range,r.range)}return wt({...n,low:ot(n.domain)},e,t)},Et=(e,t)=>{if(yt(e,t))return rt(e,t);if(!vt(e))return Et(H(e),t);if(!P(t)){if(I(t))return ut(t,e);throw new v(`Attempted to check equality of the set ${G(e)} with the value:\n${G(t)}`)}let n=bt(e,t);return n.elements.length===n.otherElements.length&&Ct(n.elements,n.otherElements)},Dt=(e,t)=>ke(e,()=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(I(t))return ut(t,e);throw new v(mt(e,t,!0))}return e.kind===`ModelValue`?ft(e,t):F(e)?Tt(e,t):Et(e,t)}),Ot=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=St(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},kt=(e,t)=>t.some(t=>Dt(t,e)),At=(e,t)=>{try{return rt(e,t)}catch(n){if(!(n instanceof v))throw n;return Dt(e,t)}},jt=e=>{for(let t=1;t<e.length;t++)if(z(e[t],e[t-1])<=0)return!1;return!0},Mt=e=>{if(e.length<2||jt(e))return tt(e);let t=[...e].sort(z),n=[t[0]];for(let e=1;e<t.length;e++)z(n[n.length-1],t[e])!==0&&n.push(t[e]);return tt(n)},Nt=e=>{try{return Mt(e)}catch(t){if(!(t instanceof v))throw t;return{kind:`MixedSet`,elements:e}}},Pt=tt([]),Ft=(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&&z(r[a],t)<0;)a++;a<r.length&&z(r[a],t)===0||i.push(t)}return i.length===n.length?e:tt(i)},It=(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&&z(r[a],t)<0;)a++;a<r.length&&z(r[a],t)===0&&i.push(t)}return i.length===n.length?e:tt(i)},Lt=(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=z(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=tt(i);if(e.hash!==0){let t=e.hash;for(let e=0;e<a.length;e++)t=t+Vn(a[e])|0;c.hash=t}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Zn(a[e])|0;c.fingerprint=t}return c},Rt=e=>{let t=e.length<2?e:[...e].sort((e,t)=>z(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&z(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return nt(n,r)},zt=e=>{let t=Rt(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Pe(t,e.map(e=>e[0]))},Bt=[],Vt=[],Ht=/* @__PURE__ */ new WeakMap,Ut=e=>{let t=Bt[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Bt[e]=n,n},Wt=e=>{if(pn(e),e.low===1&&e.high>=1)return Ut(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Gt=e=>e.length>0&&(e===Bt[e.length]||Ht.has(e)),Kt=e=>{let t=H(e).elements;return Gt(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},qt=e=>{let t=Vt[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Vt[e]=n,n},B=e=>nt(Ut(e.length),e),Jt=e=>Rt(e),Yt=e=>P(e)&&!R(e),Xt=(e,t=!1)=>`UNION(${G(e.base,t)})`,Zt=(e,t=e=>H(e).elements)=>{if(!Yt(e.base))throw new v(`Attempted to enumerate the nonenumerable set:\n${Xt(e)}`);return t(e.base)},Qt=(e,t,n)=>{if(Yt(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${G(e)}\nwhen enumerating:\n${Xt(n)}`)},V=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 V(e.base);case`FunctionSet`:return V(e.domain)&&V(e.range)||$t(e.domain)===!0||$t(e)===!0;case`RecordSet`:return e.sets.every(V)||$t(e)===!0;case`ProductSet`:return e.factors.every(V)||$t(e)===!0;case`Union`:return V(e.base)&&un(e.base).every(V);case`SetOperation`:return e.operator===`\\cup`?V(e.left)&&V(e.right):e.operator===`\\cap`?V(e.left)||V(e.right):V(e.left);default:return!1}},$t=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=$t(e.domain);return t===void 0?void 0:!t&&$t(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=$t(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return V(e)?H(e).elements.length===0:void 0;default:return}},en=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},tn=(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},nn=e=>{if(typeof e!=`object`||e.kind!==`Subset`||R(e.base))return;let t=H(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=[]:tn(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return tt(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)})},rn=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(tt(r.map(t=>e[t])));while(tn(r,e.length))}return t},an=e=>{if(typeof e!=`object`)throw new v(`Expected a set but found ${G(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Ot(e.elements);case`Interval`:{let t=Wt(e);return t!==Bt[t.length]&&Ht.set(t,e),t}case`Subset`:{R(e.base)&&pn(e.base);let t=H(e.base).elements;if(t.length>30)throw new v(fn(e));return rn(t)}case`FunctionSet`:{if(U(e))return[];if(R(e.domain))throw new v(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${G(e.domain)}\ncannot be enumerated.`);let t=Kt(e.domain);if(t.length>0&&R(e.range))throw new v(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${G(e.range)}\ncannot be enumerated.`);let n=t.length===0?[]:H(e.range).elements;return en(t.map(()=>n)).map(e=>nt(t,e))}case`RecordSet`:{if(U(e))return[];let t=e.sets.map((t,n)=>{if(R(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${G(t)}`);return H(t).elements});return en(t).map(t=>Jt(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(U(e))return[];let t=e.factors.map((e,t)=>{if(R(e))throw new v(`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${G(e)}`);return H(e).elements});return en(t).map(B)}case`FilteredSet`:if(R(e.base))throw new v(`Attempted to enumerate { x \\in S : p(x) } when S:\n${G(e.base)}\nis not enumerable`);return H(e.base).elements.filter(e.test);case`Union`:{let t=Zt(e).flatMap((t,n)=>H(Qt(t,n,e)).elements);return H(Nt(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(R(e.left)||R(e.right)))throw new v(`Attempted to enumerate S \\cup T when S:\n${G(e.left)}\nand T:\n${G(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&R(e.left)&&R(e.right))throw new v(`Attempted to enumerate S \\cap T when neither S:\n${G(e.left)}\nnor T:\n${G(e.right)}\nis enumerable`);if(e.operator===`\\`&&R(e.left))throw new v(`Attempted to enumerate S \\ T when S:\n${G(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Lt(H(e.left),H(e.right)).elements;let t=e.operator===`\\`||V(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return H(n).elements.filter(t=>xn(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new v(`Attempted to enumerate the non-enumerable set ${G(e)}`);default:throw new v(`Expected a set but found ${G(e)}`)}},on=/* @__PURE__ */ new WeakMap,sn=/* @__PURE__ */ new WeakMap,H=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return tt(an(e));let t=typeof e==`object`?on.get(e):void 0;if(t)return t;let n=(typeof e==`object`?sn.get(e):void 0)??(N.current?ke(e,()=>cn(e)):cn(e));return typeof e==`object`&&on.set(e,n),n},cn=e=>{let t=an(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`)?tt(t):Mt(t)},ln=e=>{if(typeof e!=`object`||e.kind!==`Union`&&e.kind!==`SetOperation`&&e.kind!==`FilteredSet`||on.has(e))return H(e);let t=sn.get(e);if(t)return t;let n=cn(e);return sn.set(e,n),n},un=e=>{if(typeof e!=`object`||on.has(e))return H(e).elements;if(e.kind===`Union`)return Zt(e,un).flatMap((t,n)=>un(Qt(t,n,e)));if(e.kind===`FilteredSet`&&!R(e.base))return un(e.base).filter(e.test);if(e.kind!==`SetOperation`)return H(e).elements;if(e.operator===`\\cup`)return R(e.left)||R(e.right)?H(e).elements:[...un(e.left),...un(e.right)];let t=e.operator===`\\`||V(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return R(n)?H(e).elements:un(n).filter(t=>xn(t,r)===(e.operator===`\\cap`))},U=e=>{if(typeof e!=`object`||!P(e))throw new v(`Shouldn't call isEmpty() on value ${G(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(U);case`RecordSet`:return e.sets.some(U);case`FunctionSet`:return!U(e.domain)&&U(e.range);case`Union`:return Zt(e).every((t,n)=>U(Qt(t,n,e)));default:return H(e).elements.length===0}},dn=(e,t)=>e.reduce((e,n)=>{let r=e*pn(n);if(r>2147483647)throw new v(t());return r},1),fn=e=>`Overflow when computing the number of elements in:\n${G(e)}`,pn=e=>{if(typeof e!=`object`)return H(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 ${G(e)}.`);case`Subset`:{let t=pn(e.base);if(t>=31)throw new v(fn(e));return 2**t}case`FunctionSet`:{if(U(e.domain))return 1;if(U(e.range))return 0;let t=pn(e.range);if(t===1)return 1;let n=pn(e.domain),r={value:1};for(let i=0;i<n;i++)if(r.value*=t,r.value>2147483647)throw new v(fn(e));return r.value}case`RecordSet`:return U(e)?0:dn(e.sets,()=>fn(e));case`ProductSet`:return U(e)?0:dn(e.factors,()=>`Overflow when computing the number of elements in ${G(e)}`);default:return H(e).elements.length}},mn=e=>`Attempted to check if the set ${G(e)}is finite.`,hn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new v(`Attempted to check if the ${je(e)} ${G(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${G(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return hn(e.base)&&U(e.base);case`Subset`:return hn(e.base);case`FunctionSet`:{let t=hn(e.domain);if(t&&U(e.domain))return!0;let n=hn(e.range);return n&&U(e.range)?!0:n&&(t||pn(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(!hn(e))n.isAllFinite=!1;else if(U(e))return!0;return n.isAllFinite}case`Union`:if(!Yt(e.base))throw new v(`Attempted to check if the nonenumerable set:\n${Xt(e)}\nis a finite set.`);return H(e.base).elements.every(hn);case`SetOperation`:if(e.operator===`\\cup`)return hn(e.left)&&hn(e.right);if(e.operator===`\\cap`){if(!hn(e.left)&&!hn(e.right))throw new v(mn(e));return!0}if(hn(e.left))return!0;if(!hn(e.right))throw new v(mn(e));return!1;case`FilteredSet`:if(!hn(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${G(e.base)}\nis finite.`);return!0}},gn=(e,t)=>{let n={low:0,high:e.length-1};for(;n.low<=n.high;){let r=n.low+n.high>>1,i=z(e[r],t);if(i===0)return r;i<0?n.low=r+1:n.high=r-1}return-1},_n=e=>{if(typeof e!=`object`||!F(e))return;let t=W(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},vn=(e,t)=>`Attempted to check if the value ${G(e)} is an element of ${G(t)}`,yn=(e,t)=>{let n=`Attempted to check if the value:\n${G(e)}\nis an element of the`;if(!F(t))return`${n} ${je(t)} ${G(t)}`;let r=t.kind===`Function`||V(t.domain)?W(t).domain:[];return r.length>0&&r.every(e=>typeof e==`string`)?`Attempted to check if element:\n${G(e)}\nis in the record:\n${G(t)}`:r.every((e,t)=>e===t+1)?`Attempted to check set membership in a tuple value.`:`${n} function ${G(t)}`},bn=(e,t)=>N.current?ke(t,()=>xn(e,t)):xn(e,t),xn=(e,t)=>{if(!P(t))throw new v(yn(e,t));switch(t.kind){case`Set`:try{return gn(t.elements,e)!==-1}catch(n){if(!(n instanceof v))throw n;return ke(t,()=>kt(e,t.elements))}case`MixedSet`:return ke(t,()=>kt(e,t.elements));case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!I(e))throw new v(`Attempted to check if the value:\n${G(e)}\nis in the integer interval ${G(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(I(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new v(`Attempted to check if the value:\n${G(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!Yt(e))throw new v(`Attempted to check if the non-enumerable value\n${Ee(G(e))}\nis element of\n${Ee(G(t))}`);return H(e).elements.every(e=>bn(e,t.base));case`FunctionSet`:{if(!F(e)){if(I(e))return!1;throw new v(`Attempted to check if \n${G(e)}\nwhich is not a TLC function value, is in the set of functions:\n${Ee(G(t))}`)}let n=W(e),r=ot(n.domain);return(r===void 0?At(t.domain,tt(n.domain)):At({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>bn(e,t.range))}case`RecordSet`:{let n=F(e)?W(e):void 0;if(!n||!Re(n.domain)){if(I(e))return!1;throw new v(`Attempted to check if non-record\n${G(e)}\nis in the set of records:\n${G(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=gn(n.domain,e);return i!==-1&&bn(n.range[i],t.sets[r])})}case`ProductSet`:{let n=F(e)?_n(e):void 0;if(n===void 0){if(F(e)&&W(e).domain.every(e=>typeof e==`number`)||I(e))return!1;throw new v(`Attempted to check if non-tuple\n${G(e)}\nis in the set of tuples:\n${G(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>bn(e,t.factors[n]))}case`FilteredSet`:return bn(e,t.base)&&t.test(e);case`Union`:if(!Yt(t.base))throw new v(`Attempted to check if:\n ${G(e)}\nis an element of the non-enumerable set:\n ${Xt(t)}`);return H(t.base).elements.some(t=>bn(e,t));case`SetOperation`:return t.operator===`\\cup`?bn(e,t.left)||bn(e,t.right):bn(e,t.left)&&bn(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=_n(e);if(n===void 0){if(I(e))return!1;throw new v(vn(e,t))}return n.every(e=>xn(e,t.base))}default:throw new v(yn(e,t))}},Sn=(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?xn(e,n):e.range.every((e,r)=>Sn(e,t.range[r],n.range)),W=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){V(e.domain)||pn(e.domain);let t=Kt(e.domain);return nt(t,t.map(t=>e.apply(t)))}throw new v(`Expected a function but found ${G(e)}`)},Cn=/* @__PURE__ */ new WeakSet,wn=e=>(Cn.add(e),e),Tn=e=>{let t=e.domain;return t.length===0?Cn.has(e)?`FcnRcdValue`:`TupleValue`:t===Bt[t.length]?`TupleValue`:Ht.has(t)?`IntervalFcnRcdValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},En=(e,t)=>`Attempted to apply function:\n${Ee(G(e))}\nto argument ${Ee(G(t))}, which is not in the domain of the function.`,Dn=e=>`Attempted to apply function with integer domain to the non-integer argument ${Ee(G(e))}`,On=(e,t)=>{if(Cn.has(e)||e.kind===`LazyFunction`)return`In applying the function\n${Ee(G(e))},\nthe first argument is:\n${Ee(G(t))}\nwhich is not in its domain.\n`;let n=Tn(e);return n===`TupleValue`?typeof t==`number`?`Attempted to access index ${t} of tuple\n${Ee(G(e))}\nwhich is out of bounds.`:`Attempted to access tuple at a non integral index: ${Ee(G(t))}`:n===`RecordValue`?typeof t==`string`?`Attempted to access nonexistent field '${t}' of record\n${Ee(G(e))}`:`Attempted to access record by a non-string argument: ${Ee(G(t))}`:n===`IntervalFcnRcdValue`&&typeof t!=`number`?Dn(t):En(e,t)},kn=(e,t)=>Tn(e)===`FcnRcdValue`?En(e,t):Dn(t),An=e=>Tn(e)===`RecordValue`,jn=(e,t)=>{let n=e[0];return typeof n==`number`?typeof t!=`number`&&(e===Bt[e.length]||Ht.has(e)):typeof n==`string`&&typeof t!=`string`},Mn=(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 gn(e,t)},Nn=(e,t,n,r)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!xn(t,e.domain))throw new v(Cn.has(e)?On(e,t):`Attempted to apply a function to ${G(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 ${G(e)}, which is not a function`);let i=jn(e.domain,t)?-1:Mn(e.domain,t);if(i===-1)throw new v(n?.(e)??On(e,t));return e.range[i]},Pn=e=>Gt(e)?Ht.get(e)??qt(e.length):void 0,Fn=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=W(e).domain;return Pn(t)??tt(t)},In=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!V(e.domain))){if(!xn(t,e.domain))return e;let r=n(e.apply(t));return{kind:`LazyFunction`,domain:e.domain,apply:n=>At(t,n)?r:e.apply(n),source:e.source}}let i=W(e),a=Mn(i.domain,t);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=nt(i.domain,o);if(l.writtenKeys=i.writtenKeys,i.hash!==0){let e=i.domain[a];l.hash=s===c?i.hash:i.hash-Hn(e,s)+Hn(e,c)|0}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Qn(e,s)+Qn(e,c)|0}return l},Ln=/* @__PURE__ */ new WeakMap,Rn=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},zn=(e,t)=>Math.imul(e^t,16777619),Bn=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Rn(t)},Vn=e=>Rn(Gn(e)+2654435769|0),Hn=(e,t)=>Rn(Math.imul(Gn(e),668265261)+Gn(t)|0),Un={isHashed:!1},Wn=e=>{if(e.kind===`ModelValue`)return Rn(zn(Bn(e.name),109));if(P(e)){if(!V(e))return Un.isHashed=!0,Bn(nr(e));let t=H(e).elements,n=1940243425;for(let e=0;e<t.length;e++)n=n+Vn(t[e])|0;return n}let t=W(e),n=1725019383;for(let e=0;e<t.domain.length;e++)n=n+Hn(t.domain[e],t.range[e])|0;return n},Gn=e=>{if(typeof e==`number`)return Rn(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Bn(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Wn(e)),e.hash;let t=Ln.get(e);if(t!==void 0)return t;let n=Wn(e);return Ln.set(e,n),n},Kn=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(R(e))throw new v(`TLC has found a state in which the value of a variable contains ${G(e)}`);if(P(e))return H(e).elements.forEach(Kn);let t=W(e);t.domain.forEach(Kn),t.range.forEach(Kn)},qn=e=>{Un.isHashed&&e.forEach(Kn)},Jn=/* @__PURE__ */ new WeakMap,Yn=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Xn=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Yn(t)},Zn=e=>Yn(er(e)+2135587861|0),Qn=(e,t)=>Yn(Math.imul(er(e),374761393)+er(t)|0),$n=e=>{if(e.kind===`ModelValue`)return Yn(Xn(e.name)^60);if(P(e)){if(!V(e))return Un.isHashed=!0,Xn(nr(e));let t=H(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Zn(t[e])|0;return n}let t=W(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Qn(t.domain[e],t.range[e])|0;return n},er=e=>{if(typeof e==`number`)return Yn(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Xn(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=$n(e)),e.fingerprint;let t=Jn.get(e);if(t!==void 0)return t;let n=$n(e);return Jn.set(e,n),n},tr=/* @__PURE__ */ new WeakMap,nr=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=tr.get(e);if(t!==void 0)return t;let n=rr(e);return tr.set(e,n),n},rr=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${nr(e.base)}>`;if(e.kind===`FilteredSet`&&!V(e))throw new v(`Attempted to compare the non-enumerable set ${G(e)} with another value`);if(P(e))return V(e)?`{${H(e).elements.map(nr).join(`,`)}}`:`<${e.kind} ${G(e)}>`;let t=W(e);return`(${t.domain.map((e,n)=>`${nr(e)}:${nr(t.range[n])}`).join(`,`)})`},ir=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,ar=e=>e.reduce((e,t)=>e===0?0:e*pn(t),1),or=e=>{if(e.kind===`Subset`)return pn(e.base)<=6?H(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return H(e);if(e.kind===`FunctionSet`&&V(e.domain)&&pn(e.domain)===0)return tt([nt([],[])]);let t=e.kind===`FunctionSet`?pn(e.range)**pn(e.domain):ar(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Pt:t<=1999?H(e):void 0},sr=(e,t)=>{if(t)return or(e);if(V(e))try{return or(e)}catch(e){if(e instanceof v)return;throw e}},cr=(e,t)=>{let n=e=>G(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 Xt(e,t)}},lr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),G=(e,t=!1,n=!1)=>{let r=e=>G(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ir(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(H(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=sr(e,t);return n?r(n):cr(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{if(e.kind===`LazyFunction`&&!V(e.domain)){let t=e.source;return t?`[${t.parameters.map(e=>`${e.name} \\in ${G(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}let i=W(e),a=r=>G(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`&&lr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Fe(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},ur=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Ee(G(n))}\n`).join(``)},dr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},fr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Gn(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||at(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||at(i[e],n))return i[e]}return n.kind===`Set`?dr(n.elements,t):(dr(n.domain,t),dr(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}},pr=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:[])}},K=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,mr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),hr=(e,t)=>mr.has(e)?new v(t):new y(t),gr=e=>typeof e==`object`&&e.kind===`Operator`,q=(e,t,n)=>{let r=e[t];if(r===void 0||gr(r))throw hr(n,`${n} expects a value as argument ${t+1}`);return r},_r=(e,t,n)=>{let r=q(e,t,n);if(typeof r!=`number`)throw hr(n,`${n} expects an integer but received ${G(r)}`);return r},vr=(e,t,n)=>{let r=q(e,t,n);if(typeof r!=`boolean`)throw hr(n,`${n} expects a boolean but received ${G(r)}`);return r},yr=(e,t,n)=>{let r=q(e,t,n);if(!P(r))throw hr(n,`${n} expects a set but received ${G(r)}`);return r},br=(e,t,n)=>{let r=yr(e,t,n);if(!V(r))throw hr(n,`${n} cannot enumerate the non-enumerable set ${G(r)}`);return r},xr=(e,t,n)=>H(br(e,t,n)),Sr=(e,t,n)=>xr(e,t,n).elements,Cr=(e,t,n)=>{let r=q(e,t,n),i=_n(r);if(!i)throw hr(n,`${n} expects a sequence but received ${G(r)}`);return i},wr=(e,t,n)=>{let r=q(e,t,n);if(!F(r))throw hr(n,`${n} expects a function but received ${G(r)}`);return W(r)},Tr=(e,t,n)=>{let r=e[t];if(r===void 0||!gr(r))throw hr(n,`${n} expects an operator as argument ${t+1}`);return r},Er=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),J=(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}),Dr=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Or=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),kr=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(q(n,0,e),q(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ar=e=>e>2147483647||e<-2147483648,jr=e=>new y(`Overflow when computing ${e}`),Mr={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`},Nr={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Pr={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`},Fr=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Nr[e.operator];if(e.kind!==`Function`)return Mr[e.kind];let t=e.domain;return t.every((e,t)=>e===t+1)?`TupleValue`:t.every(e=>typeof e==`string`)?`RecordValue`:`FcnRcdValue`},Ir=e=>Pr[Fr(e)],Lr=(e,t)=>new v(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Rr=(e,t)=>{let n=n=>(...r)=>{try{return n(...r)}catch(n){throw n instanceof v&&(e.isLazy===!0||!(n instanceof y))?Lr(t,n.message):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},zr=(e,t)=>{if(typeof e!=`number`)throw Lr(t,`Cannot cast tlc2.value.impl.${Fr(e)} to tlc2.value.impl.IntValue`);return e},Br=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Vr=(e,t,n,r)=>{let i=Br(e,n,`IntValue`,2);return kr(t,(e,n)=>{let a=zr(e,i),o=zr(n,i),s=r(a,o);if(Ar(s))throw jr(`${a}${t}${o}`);return s})},Hr=(e,t,n)=>{if(typeof e!=`number`)throw new y(`The ${t} argument of ${n} should be an integer, but instead it is:\n${G(e)}`);return e},Ur=(e,t)=>kr(e,(n,r)=>t(Hr(n,`first`,e),Hr(r,`second`,e))),Wr=(e,t,n)=>({...Or(e,t,n),isLazy:!0}),Gr=(e,t,n)=>{let r=Tr(e,t,n);return()=>r.call([])},Kr=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),qr=()=>({bool:zo,condition:(e,t)=>{if(typeof e!=`boolean`)throw Eo(t,e);return e},conjunct:(e,t,n)=>{if(typeof e!=`boolean`)throw Do(t,n,e);return e},apply:Nn,tuple:B,set:Nt,record:nt,writtenRecord:Ie,equal:rt,enumerate:Wo,unassigned:(e,t)=>{throw Sc(e,t)},primeOutsideAction:e=>{throw Cc(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)=>Io(e,t,n[r]),e.scope),state:e.state,next:e.next})}),Jr={value:void 0},Yr=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Xr=e=>`local${e.counter++}`,Zr=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),pr(e).forEach(e=>Zr(e,t)),t),Qr=(e,t,n)=>{let r=Yr(e,X(t,e.environment)),i=Zr(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Yr(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},$r=(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(()=>Xr(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${ti(e,t.set,s)}, ${Yr(e,t.set)});`),u=t.bounds.map(t=>{let n=Xr(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${ti(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Xr(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})`},ei=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${ti(e,r[0],n)}, "the left side of =>") ? bool(${ti(e,r[1],n)}, "the right side of =>") : true)`;if(K(t))return Qr(e,t,n);let i=is(t.operator,e.environment);if(i?.kind!==`Builtin`)return Qr(e,t,n);if(i.name===`DOMAIN`)return`${Yr(e,jo(t))}(${ti(e,r[0],n)})`;if(i.name===`TLCEval`)return Qr(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Yr(e,Mo(t,i))}(${ti(e,r[0],n)}, ${ti(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&ec(r[0],a))return`${Yr(e,i.evaluateUnary)}(${ti(e,r[0],n)})`;let o=r.length===2&&ec(r[0],a)&&ec(r[1],a);return i.evaluateBinary&&o?`${Yr(e,i.evaluateBinary)}(${ti(e,r[0],n)}, ${ti(e,r[1],n)})`:Qr(e,t,n)},ti=(e,t,n)=>{let r=(t,r=n)=>ti(e,t,r);if(zs(t)&&Ps(t,e.environment))return Qr(e,t,n);switch(t.kind){case`Number`:return Ss(t.value)?String(t.value):Qr(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(K(t))return Qr(e,t,n);let i=ms(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Yr(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Yr(e,i.value):Qr(e,t,n)}case`Apply`:return ei(e,t,n);case`And`:{let n=Yr(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)}, ${Yr(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{gc(t.function);let n=r(t.function),i=Yr(e,ko(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)}, ${Yr(e,Oo(t))}, ${Yr(e,Ao(t))})`;case`Record`:{let i=bc(t.fields);if(xc(i))return Qr(e,t,n);let a=Yr(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}, ${Yr(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=Yr(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`)?$r(e,t,n):Qr(e,t,n);default:return Qr(e,t,n)}},ni=(e,t)=>{if(!Kr.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=ti(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}; };`;Jr.value??=qr();let o=Jr.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ri={kind:`Local`},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}])),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.name.includes(`!`),ui=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},di=(e,t,n=0)=>t.reduce((e,t)=>({name:t,arity:n,parent:e}),e),fi=(e,t)=>t.reduce((e,t)=>({name:t.name,arity:t.arity,parent:e}),e),pi=e=>e.kind===`Name`?[e.name]:e.names,mi=e=>e.flatMap(e=>pi(e.pattern)),hi=(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},gi=(e,t)=>{let n=hi(e,t);return n?{key:t.getKey(n),arity:ci(n)}:t.imported.get(e)},_i=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),vi=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`}},yi=e=>e[0].toLowerCase()===e[0].toUpperCase()&&e[0]!==`_`&&(e[0]<`0`||e[0]>`9`),bi=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),xi=(e,t,n,r)=>{let i=e.location,a=ii.get(e);if(a!==void 0)return a;if(ai(t))return e.kind===`Apply`?e.args.length:0;if(bi(t))return 0;let o=ui(n,t);if(o&&e.kind!==`OperatorReference`&&(e.resolution=ri),o)return o.arity;let s=gi(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!==``&&(ui(n,c)!==void 0||gi(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=_i(i,t===`-.`?`-`:t);if(!yi(t))throw g(`Unknown operator: \`${t}'.`,l);let u={location:h(l),message:`Could not find declaration or definition of symbol '${t}'.`},d=vi(e);throw m(d&&i.range?[u,{location:h(i.range),message:`Couldn't resolve ${d} operator symbol \`${t}'.`}]:[u])},Si=(e,t,n)=>(e.forEach(e=>Y(e.set,t,n)),e.reduce((e,t)=>di(e,pi(t.pattern)),t)),Ci=(e,t)=>e.kind===`Identifier`&&e.name===t&&K(e)||pr(e).some(e=>Ci(e,t)),wi=(e,t)=>{e.kind===`FunctionConstruction`&&Ci(e.body,t)&&(e.isRecursive=!0),pr(e).forEach(e=>wi(e,t))},Ti=(e,t,n)=>{let r=di(t,e.kind===`Function`?[e.name]:[]);e.kind===`Function`?(Y(e.body,Si(e.bounds,r,n),n),wi(e.body,e.name)):Y(e.body,fi(r,e.params),n)},Ei=(e,t,n)=>{let r=e.filter(e=>e.isRecursive).reduce((e,t)=>({name:t.name,arity:ci(t),parent:e}),t);return e.reduce((e,t)=>(li(t)||Ti(t,e,n),{name:t.name,arity:ci(t),parent:e}),r)},Di=(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}`)},Oi=e=>e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:void 0,ki=(e,t,n)=>{let r=e.operator,i=ui(t,r)?void 0:hi(r,n),a=xi(e,r,t,n);if(a!==e.args.length)throw g(`The operator ${r} requires ${a} arguments.`,e.argumentsRange??_i(e.location,r));e.args.forEach((e,r)=>{let a=Oi(e),o=a===void 0||ui(t,a)?void 0:hi(a,n),s=Ai(e,t,n);i&&Di(i,r,e,s,o)})},Ai=(e,t,n)=>e.kind===`Identifier`?xi(e,e.name,t,n):e.kind===`OperatorReference`?xi(e,e.operator,t,n):(Y(e,t,n),e.kind===`Lambda`?e.params.length:0),Y=(e,t,n)=>{let r=e=>e.forEach(e=>Y(e,t,n));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{let r=e.name,i=xi(e,r,t,n);if(i>0)throw g(`The operator ${r} requires ${i} arguments.`,_i(e.location,r));return}case`OperatorReference`:xi(e,e.operator,t,n);return;case`Apply`:ki(e,t,n);return;case`Lambda`:Y(e.body,di(t,e.params),n);return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:Y(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&&Y(e.other,t,n);return;case`Let`:Y(e.body,Ei(e.definitions,t,n),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:Y(e.body,Si(e.bounds,t,n),n);return;case`UnboundedQuantifier`:Y(e.body,di(t,e.names),n);return;case`Choose`:e.set&&Y(e.set,t,n),Y(e.body,di(t,pi(e.pattern)),n);return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:Y(e.predicate,Si([e.bound],t,n),n);return;case`SetMap`:Y(e.expression,Si(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??_i(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`:Y(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`:Y(e.body,t,n);return;case`Subexpression`:e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Ai(e,t,n))}},ji=(e,t,n)=>(e.set&&Y(e.set,t,n),{name:e.name,arity:e.arity,parent:t}),Mi=(e,t,n)=>{let r=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?ji(t,e,n):(t.kind===`AssumeProve`?Mi(t,e,n):Y(t,e,n),e),t);return Y(e.conclusion,r,n),r},Ni=(e,t,n)=>e.kind===`AssumeProve`?Mi(e,t,n):(Y(e,t,n),t),Pi=(e,t,n)=>{e?.kind===`Steps`&&e.steps.reduce((e,t)=>Fi(t,e,n),t)},Fi=(e,t,n)=>{let r=e.body;switch(r.kind){case`Assert`:{let i=Ni(r.statement,t,n);return Pi(e.proof,i,n),r.isSuffices?i:t}case`Define`:return Ei(r.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),t,n);case`Have`:case`Case`:return Y(r.expression,t,n),Pi(e.proof,t,n),t;case`Witness`:return r.expressions.forEach(e=>Y(e,t,n)),t;case`Take`:return di(Si(r.bounds,t,n),r.names);case`Pick`:{let i=di(Si(r.bounds,t,n),r.names);return Y(r.body,i,n),Pi(e.proof,t,n),i}default:return Pi(e.proof,t,n),t}},Ii=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ni(e.statement,void 0,t);Pi(e.proof,n,t)},Li=(e,t)=>new p(`Multiply-defined symbol '${e}' at line ${t.line}, column ${t.column}`),Ri=(e,t,n,r)=>t.reduce((e,t)=>{if(ui(e,t)||n(t))throw Li(t,r);return{name:t,arity:0,parent:e}},e),zi=(e,t,n,r)=>(e.forEach(e=>Vi(e.set,t,n)),e.reduce((e,t)=>Ri(e,pi(t.pattern),n,r),t)),Bi=(e,t,n)=>{if(e.kind===`Function`){let r=di(t,[e.name]),i=zi(e.bounds,r,n,e.location);Vi(e.body,i,n);return}let r=Ri(t,e.params.map(e=>e.name),n,e.location);Vi(e.body,r,n)},Vi=(e,t,n)=>{let r=e.location;switch(e.kind){case`Lambda`:Vi(e.body,Ri(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(ui(e,t.name)||n(t.name))throw Li(t.name,t.location);return Bi(t,di(e,i),n),di(e,[t.name])},t);Vi(e.body,Ri(a,(e.instances??[]).flatMap(e=>e.name===void 0?[]:[e.name]),n,r),n);return}case`Forall`:case`Exists`:case`FunctionConstruction`:Vi(e.body,zi(e.bounds,t,n,r),n);return;case`SetFilter`:Vi(e.predicate,zi([e.bound],t,n,r),n);return;case`SetMap`:Vi(e.expression,zi(e.bounds,t,n,r),n);return;case`UnboundedQuantifier`:Vi(e.body,Ri(t,e.names,n,r),n);return;case`Choose`:e.set&&Vi(e.set,t,n),Vi(e.body,Ri(t,pi(e.pattern),n,r),n);return;default:pr(e).forEach(e=>Vi(e,t,n))}},Hi=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}))],Ui=(e,t)=>{let n=/* @__PURE__ */ new Map;Hi(e).sort((e,t)=>si(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)&&!oi.has(e))return!1;let r=t.importedAt.get(e);return r===void 0||si(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 Li(n.name,n.location)}));let i=e=>t=>(n.get(t)??[]).some(t=>t.isRecursive||si(t.location,e))||r(t,e);e.definitions.forEach(e=>Bi(e,void 0,i(e.location))),e.assumptions.forEach(e=>Vi(e.expression,void 0,i(e.location))),e.instances.forEach(e=>{let t=i(e.location),n=Ri(void 0,e.params.map(e=>e.name),t,e.location);e.substitutions.forEach(e=>Vi(e.expression,n,t))})},Wi=(e,t)=>{let n=new Map([...oi,...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},Gi=(e,t,n,r)=>{let i=fi(void 0,e.params),a={imported:Wi(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)&&!ui(i,n)&&!gi(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 Y(r,i,a),[n,r];if(xi(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]}))},Ki=e=>{let t=[];if(e.toSorted((e,t)=>si(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)},qi=(e,t)=>{let n=Wi(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});Ki([...e.definitions.map(e=>({location:e.location,check:()=>Ti(e,void 0,i(e.location,e))})),...e.assumptions.map(e=>({location:e.location,check:()=>Y(e.expression,void 0,i(e.location,void 0))})),...e.theorems.map(e=>({location:e.location,check:()=>Ii(e,i(e.location,void 0))}))])},Ji=/* @__PURE__ */ new WeakSet,Yi=/* @__PURE__ */ new WeakSet,Xi=(e,t,n=/* @__PURE__ */ new Set)=>{let r=na(e,(e,r)=>Xi(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&K(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&K(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Zi=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Qi=/* @__PURE__ */ new WeakMap,$i=e=>Qi.get(e)??e.name,ea=(e,t)=>($i(t)!==e.name&&Qi.set(e,$i(t)),e),ta=(e,t)=>ea(e.kind===`Function`?{...e,bounds:Zi(e.bounds,e=>t(e,[])),body:t(e.body,mi(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),na=(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=>ta(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Zi(e.bounds,n),body:t(e.body,mi(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,pi(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,pi(e.bound.pattern))};case`SetMap`:return{...e,bounds:Zi(e.bounds,n),expression:t(e.expression,mi(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)}}},ra=`LAMBDA`,ia=(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 na(e,(e,n)=>(r.push(...ia(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},aa=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}},oa=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),sa=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ca=(e,t)=>e.map(e=>({pattern:sa(e.pattern,t),set:e.set})),la=(e,t)=>e.kind===`Function`?{...e,bounds:ca(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ua=(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=>ea({...la(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ca(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:sa(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:sa(e.bound.pattern,n),set:e.bound.set}};default:return e}},da=e=>`${e}@ENABLED`,fa=(e,t)=>e.modes.get(t)??e,pa=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!K(e)&&t.instantiation.variables.has(e.name),ma=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ma(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(pa(e,t,n))return[e.name];let r=K(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?ma(r.body,t,/* @__PURE__ */ new Map):void 0},ha=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return pa(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:da(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ba(e.expression,fa(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,fa(t,`Primed`),n),location:r},ba(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=ma(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:da(r),location:e.location},location:e.location},ba({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ga=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),_a=(e,t)=>e.map(e=>ga(e.name,t)),va=(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:[..._a(t,r),...i.map(e=>ga(e,r))],location:r},location:r}},ya=(e,t)=>e.instantiation.isParameterized(t)?Sa(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)&&!K(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:ba(e.expression,fa(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},fa(t,`Enabled`),n)};let s=ha(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Ji.add(n),n;let r=ya(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?va(r,a,ci(o),e.location):{kind:`Apply`,operator:r,args:_a(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||Yi.has(e),c=e=>(s&&Yi.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:ra,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:ra,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=ya(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[..._a(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=ya(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?va(n,a,ci(r),e.location):{...e,operator:n}}let c=aa(t),l=na(e,(e,i)=>i.length===0?r(e):ba(e,t,oa(n,i,c)));return ua(l,n,c)},xa=(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:ga(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Sa=(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=aa(e),o=la(ta(i,(t,n)=>ba(t,e,oa(/* @__PURE__ */ new Map,n,a))),a);return xa(o,r.params,i.location)}):t},Ca=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ia(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=>ya(i,e)??e,getQualifiedKey:t=>{let n=ya(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>xa(r,e.params,r.location)):t}}},wa=e=>e.kind===`Let`&&e.instances!==void 0||pr(e).some(wa),Ta=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=na(e,e=>Ta(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}},Ea=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Da=(e,t)=>e.definitions.some(e=>wa(e.body))||e.assumptions.some(e=>wa(e.expression))||e.theorems.some(e=>{let t=Ea(e);return t!==void 0&&wa(t)})?{...e,definitions:e.definitions.map(e=>ta(e,e=>Ta(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ta(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Ea(e);return n===void 0?e:{...e,statement:Ta(n,t,[])}})}:e,Oa=/* @__PURE__ */ new WeakMap,ka=/* @__PURE__ */ new WeakMap,Aa=(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},ja=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Ma=(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 ${G(t)}.\n${To(e)}`)},Na=(t,r,i=Z(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 Ma(t,i,r.next===void 0)},Pa=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Fa=/* @__PURE__ */ new WeakMap,Ia=(e,t)=>{if(!e.trace)return t?Oa:ka;let n=Fa.get(e)??[/* @__PURE__ */ new WeakMap,/* @__PURE__ */ new WeakMap];return Fa.set(e,n),n[+!t]},La=(e,t,n)=>{let r=Ia(t,n),i=r.get(e);if(i)return i;let a=mo(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},Ra=(e,t)=>{if(t.constants.has(e))return;let n=Bo(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},za=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return za(e.expression,t,!1,r);if(e.kind!==`Identifier`||K(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Ra(e.name,t);if(a&&!r.has(a))return r.add(a),za(a.body,t,n,r)},Ba=(e,t,n)=>za(e,t,!n),Va=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Va(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=bs(e.definitions,Aa(r,t,n));return Va(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Fo(t,e.name);if(a?.kind===`Thunk`)return Va(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=Ra(e.name,r.environment);if(s)return Va(s.body,void 0,n,r,i)},Ha=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||K(e))||!t&&e.kind===`Prime`,Ua=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ua(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=Ra(e.name,t);if(i)return n.add(e.name),Ua(i.body,t,n)},Wa=(e,t)=>{if(e.kind===`Tuple`)return[e,...e.elements.flatMap(e=>Wa(e,t))];let n=e.kind===`Identifier`&&!t.variableIndex.has(e.name)?Ra(e.name,t):void 0;return n?[e,...Wa(n.body,t)]:[e]},Ga=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ka=(e,t,n)=>Ga.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Pa(e.operator)&&(Ha(e.args[0],n)||Ba(e.args[0],t,n)!==void 0)||K(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,qa=/* @__PURE__ */ new Set,Ja=(e,t)=>{if(K(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return na(e,(e,i)=>{let a=r.isReadOnly?Ja(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Ya=(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||K(e)?void 0:Bo(r,t);return i&&!n.has(i)&&(n.add(i),Ya(i.body,t,n))?!0:pr(e).some(e=>Ya(e,t,n))},Xa=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Ba(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=Ua(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Ka(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:La(e,t,n)}},Za=(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(Oc(e,t)===void 0||Ya(e,t,/* @__PURE__ */ new Set))return!0;let n=Ja(e,qa);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)}},Qa=(e,t,n)=>{let r=e.map(e=>Xa(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&&vo(d)){f??=Aa(n,s,d);for(let e=c;e<r.length;e++)if(!$a(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(...Wa(e.expression.expression,t))),e.kind===`Guard`){f??=Aa(n,s,d);let r=i[c]??=Ys(e.expression,t);if(!Na(e.expression,f,r(f)))return;continue}if(e.kind===`Assign`){f??=Aa(n,s,d);let r=(i[c]??=Ys(e.value,t))(f),a=d[e.index];if(a===void 0)d=ja(d,e.index,r),f=void 0;else if(!rt(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=ja(d,n,t[n]),f=void 0;else if(!rt(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)},$a=(e,t)=>Ma(e,Z(e,t),!0),eo=e=>(t,n,r,i,a,o)=>{Na(e,Aa(t,n,r))&&o(r,i)},to=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Aa(r,i,a);if(a[l]!==void 0){Na(e,u)&&c(a,o);return}let d=Z(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!V(f))throw new v(`In computing ${r.isInit?`initial`:`next`} states, the right side of \\IN is not enumerable.\n${To(e)}`);let p=un(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(ja(a,l,p[e]),o)}},no=/* @__PURE__ */ new WeakMap,ro=e=>{let t=no.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ro),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return no.set(e,n),n},io=(e,t)=>{let n=e.args[0],r=eo(e),i=(e,r,i)=>Va(n,r,i,e,!t)??-1,a=to(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=Z(e.args[1],Aa(t,n,o));l(ja(o,u,d),s)}},ao=(e,t,n,r)=>{if(e.kind===`FunctionConstruction`)return{bounds:e.bounds,body:e.body,scope:t};if(e.kind!==`Identifier`)return;let i=Fo(t,e.name);if(i?.kind===`Thunk`)return ao(i.expression,i.scope,n,r);let a=i?void 0:Bo(e.name,r.environment);if(a?.kind!==`Function`)return;let o=Z(e,Aa(r,void 0,n));return{bounds:a.bounds,body:a.body,scope:Io(void 0,a.name,o)}},oo=(e,t,n)=>{let r=eo(e);return(i,a,o,s,c,l)=>{let u=ao(e.function,a,o,i);if(!u){r(i,a,o,s,c,l);return}let d=Aa(i,a,o),f=e.args.map(e=>Z(e,d)),p=f.length===1?f[0]:B(f),m=Ko(u.bounds,Aa(i,u.scope,o));if(!xn(p,m))throw new v(`Attempted to apply a function to ${G(p)}, which is not in its domain at ${wo(e)}`);La(u.body,t,n)(i,qo(u.bounds,u.scope,p),o,s,c,l)}},so=(e,t)=>{if(Ua(e,t))return Qa([ro(e)],t,!1);if(e.kind===`Tuple`)return La(ro(e),t,!1);let n=ro(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Fo(i,e.name):void 0;l?.kind===`Thunk`?La(ro(l.expression),t,!1)(r,l.scope,a,o,s,c):Na(n,Aa(r,i,a))&&c(a,o)}},co=(e,t,n)=>{let r=e.operator,i=eo(e),a=K(e)?void 0:is(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=ac(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=La(a.body,t,n),o.body(e,i(Aa(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Aa(a,o,s),f=os(e,d);f?.kind===`Closure`?La(f.body,t,n)(a,vs(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},lo=(e,t,n)=>{let r=eo(e),i=K(e)?void 0:Ra(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Fo(s,e.name);f?.kind===`Thunk`?La(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=La(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},uo=(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!==`=`||K(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`||!K(a))return;let o=za(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=>uo(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`||K(e))return;let r=is(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=uo(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`&&K(o))return{variable:i.variable,argument:o.name,labels:i.labels}},fo=(e,t,n)=>{let r=Fo(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},po=(e,t,n)=>{let r=e.map(e=>La(e,t,n)),i=n?[]:e.map(e=>uo(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&&fo(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)}},mo=(e,t,n)=>{let r=e=>La(e,t,n);switch(e.kind){case`And`:return Qa(e.operands,t,n);case`Or`:return po(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=Wo(Z(a.set,Aa(t,n,r)),a.set);for(let a=0;a<l.length&&!t.isStopped;a++)i(t,Io(n,e,l[a]),r,o,s,c)}}let o=n||t.trace?void 0:Za(e,t);if(o){let r=Qa(o.rest,t,n);return(t,n,i,a,s,c)=>{let l=Aa(t,n,i),u=e.bounds.map(e=>Wo(Z(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=Io(n,o.names[e],r);if(e===u.length-1){let e=Aa(t,a,i);if(!o.guards.every(t=>Na(t,e)))continue}d(e-1,a)}};d(u.length-1,n)}}return(t,n,r,a,o,s)=>{Go(e.bounds,Aa(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Oc(e,t)!==void 0&&!Ya(e.body,t,/* @__PURE__ */ new Set)?Ja(e,qa):void 0;return(t,n,r,o,s,c)=>{let l=[];Go(e.bounds,Aa(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Fo(n,e)?.kind===`Value`)){u.every(n=>Na(e.body,Aa(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&vo(r)?u.slice(n).every(n=>$a(e.body,Aa(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=Z(e.condition,Aa(r,i,a));(zo(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=Aa(r,i,a),u=t.find(e=>zo(Z(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${To(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=As(e.definitions,t);return(t,r,a,o,s,c)=>n(t,bs(e.definitions,Aa(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new v(`UNCHANGED appears in an initial predicate at ${wo(e)}`)}:so(e.expression,t);case`AngleAction`:{let t=r(e.action),n=ro(e.subscript);return(e,r,i,a,o,s)=>t(e,r,i,a,o,(t,i)=>{try{Na(n,Aa(e,r,t))||s(t,i)}catch(t){throw!e.isEnabled||!(t instanceof b)?t:new v(`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,ro(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return lo(e,t,n);case`FunctionApplication`:return oo(e,t,n);case`Apply`:{let i=e.args;if(Pa(e.operator)){let r=Ba(i[0],t,n);if(r!==void 0)return e.operator===`=`?Qa([e],t,n):to(e,()=>r);if(Ha(i[0],n))return io(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=Z(i[0],Aa(t,n,r));(typeof c==`boolean`?c:zo(c,`the left side of => at ${wo(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return co(e,t,n)}default:return eo(e)}},ho=/* @__PURE__ */ new WeakMap,go=e=>{let t=ho.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return ho.set(e,n),n},_o=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),vo=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},yo=(e,t)=>{let n=t.state;if(!n||!vo(n))throw new v(`ENABLED needs a complete state at ${wo(e)}`);let r=t.environment,i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return La(e,r,!1)(i,t.scope,go(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};La(t,r,!0)(o,a,go(r),void 0,!1,t=>{if(!o.isStopped){if(!vo(t))throw n(new ee(t),e.error);o.isStopped=i(t)}})},xo=(e,t,n)=>{let r=[];return bo(e,t,e=>(r.push(e),!1),n),r},So=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return La(e,n,!1)(a,i,go(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!vo(e))throw new x(e,t,_o(e,n).sort());o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Co=(e,t,n,r)=>{let i=[];return So(e,t,n,e=>(i.push(e),!1),r),i},wo=e=>`line ${e.location.line}, column ${e.location.column}`,To=e=>{let t=e.location.range;return t?h(t):wo(e)},Eo=(e,t)=>new v(`A non-boolean expression (${Ir(t)}) was used as the condition of an IF.\n${To(e)}`),Do=(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):To(r);return new v(`A non-boolean expression (${Ir(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${Ir(n)}.\n${To({...e,location:{...e.location,range:{...r,end:i}}})}`)},Oo=e=>t=>An(t)?`Attempted to select nonexistent field "${e.field}" from the record\n${G(t)}\n${To(e)}`:kn(t,e.field),ko=e=>t=>`A non-function (${Ir(t)}) was applied as a function.\n${To(e)}`,Ao=e=>t=>`Attempted to select field "${e.field}" from a non-record value ${G(t)}\n${To(e)}`,jo=e=>t=>{if(!F(t))throw new v(`Attempted to apply the operator DOMAIN to a non-function\n(${Ir(t)})\n${To(e)}`);return Fn(t)},Mo=(e,t)=>(n,r)=>{if(!P(n)||R(n))throw new v(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${To(e)}`);return t.evaluate([n,r])},No=t=>n(new v(`TLC can't handle real numbers: ${t.text} at ${wo(t)}`),e.configParseError),Po=t=>n(new v(`TLC can't handle a number this big: ${t.text??t.value} at ${wo(t)}`),e.error),Fo=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Io=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Lo=(e,t,n)=>{if(t.kind===`Name`)return Io(e,t.name,n);let r=_n(n);if(!r||r.length!==t.names.length)throw new v(`Cannot bind <<${t.names.join(`, `)}>> to ${G(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Io(e,t,r[n]),e)},Ro=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next}),zo=(e,t)=>{if(typeof e!=`boolean`)throw new v(`Expected ${t} to be a boolean but found ${G(e)}`);return e},Bo=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Vo=(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=Bo(n,t);if(e&&!t.constants.has(n)&&!Ho(e,t))return!0}return pr(e).some(e=>Vo(e,t))},Ho=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Vo(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Vo(e.set,t)));return t.constantLevels.set(e,r),r},Uo=(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.`},Wo=(e,t)=>{if(!P(e)||R(e)){let n=G(e),r=Uo(e,n);throw new v(r===void 0?`TLC encountered a non-enumerable quantifier bound\n${n}.\n${To(t)}`:`TLC encountered the non-enumerable quantifier bound\n${n}\n${To(t)}\n${r}`)}return typeof e==`object`&&e.kind===`Interval`?Wt(e):nn(e)??H(e).elements},Go=(e,t,n)=>{let r=e.map(e=>Wo(Z(e.set,t),e.set)),i=(t,a)=>t<0?n(a):r[t].some(n=>i(t-1,Lo(a,e[t].pattern,n)));return i(e.length-1,t.scope)},Ko=(e,t)=>{let n=e.map(e=>Z(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},qo=(e,t,n)=>{if(e.length===1)return Lo(t,e[0].pattern,n);let r=_n(n)??[];return e.reduce((e,t,n)=>Lo(e,t.pattern,r[n]),t)},Jo=/* @__PURE__ */ new WeakMap,Yo=(e,t)=>{let n=Jo.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 Jo.set(t,i),i},Xo=(e,t,n)=>{let r=Yo(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}},Zo=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Gn(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(at(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Qo=(e,t)=>{let n=Ko(e.bounds,t),r=Zo(n,(n,r)=>Z(e.body,Ro(t,qo(e.bounds,Io(void 0,e.name,r),n))),Xo(e.bounds,e.body,n));return e.bounds.length===1?wn(r):r},$o=(e,t)=>e.kind===`Function`?Qo(e,t):Z(e.body,t),es=(e,t)=>{let n=Ho(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=Ro(t,void 0);if(!n)return $o(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>$o(e,i));return t.environment.definitionValues.set(e,a),a},ts=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=Z(e.expression,Ro(t,e.scope));return n&&(e.cache=r),r},ns=/* @__PURE__ */ new WeakMap,rs=e=>{let t=ns.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return ns.set(e,n),n},is=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return is(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?rs(r):t.builtins.get(e)},as=/* @__PURE__ */ new WeakMap,os=(e,t)=>{if(K(e))return ss(e.operator,t);let n=as.get(e),r=n===void 0?is(e.operator,t.environment)??null:n;return n===void 0&&as.set(e,r),r??ss(e.operator,t)},ss=(e,t)=>{let n=Fo(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return is(e,t.environment)},cs=e=>e.kind===`Closure`?e.params.length:e.arity,ls=(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:ss(n,t);if(!r)throw new v(`Expected an operator argument at ${wo(e)}`);return r},us=(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)=>Io(e,n.name,t[r]),e.scope);return Z(e.body,Ro(n,r))},ds=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:cs(e),call:n=>us(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},fs=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=ss(e.name,t);return n!==void 0&&cs(n)>0},ps=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),ms=(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 ms(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([])}},hs=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ss(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=K(e)?void 0:ms(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Fo(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:ps(e,t)}}return t=>ps(e,t)},gs=/* @__PURE__ */ new WeakMap,_s=(e,t)=>{let n=gs.get(e);if(n)return n;let r=hs(e,t);return gs.set(e,r),r},vs=(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:ls(t[i],n)}:_s(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},ys=(e,t,n)=>e.kind===`Closure`?Z(e.body,Ro(n,vs(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>Z(e,n))):e.isLazy?e.evaluate(tc(t,n),n):e.evaluate(t.map(e=>fs(e,n)?ds(ls(e,n),n):Z(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),xs=(e,t,n)=>{let r=Fo(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return ts(r,n);if(r?.kind===`Operator`){if(cs(r.operator)===0)return us(r.operator,[],n);throw new v(`Operator ${e} is used without arguments`)}let i=ms(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Sc(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return es(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 ${wo(t)}`)},Ss=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Cs=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),ws=(e,t)=>Cs.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ts={builtins:Cs,definitions:/* @__PURE__ */ new WeakMap},Es={builtins:new Set([...Cs].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Ds=(e,t)=>e.kind===`Operator`&&e.params.length===0&&Ho(e,t),Os=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!K(e)){let e=Bo(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Ds(e,t)&&ks(e,t,n))return!0}return pr(e).some(e=>Os(e,t,n))},ks=(e,t,n=Ts)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Os(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Os(e.set,t,n));return n.definitions.set(e,i),i},As=(e,t)=>new Set(e.filter(e=>ks(e,t))),js=e=>[...e.definitions.values()].some(t=>ks(t,e)),Ms=e=>[...e.definitions.values()].some(t=>ks(t,e,Es)),Ns=/* @__PURE__ */ new WeakMap,Ps=(e,t)=>{let n=Ns.get(e);if(n!==void 0)return n;let r=Rs(e,t,Is);return Ns.set(e,r),r},Fs=/* @__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`]),Is=/* @__PURE__ */ new Set,Ls=(e,t,n)=>n.size===0?Ps(e,t):Rs(e,t,n),Rs=(e,t,n)=>{if(!Fs.has(e.kind))return!1;if(e.kind===`Identifier`&&K(e))return n.has(e.name);if(K(e))return!1;if(e.kind===`Identifier`){let n=ms(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Ds(n.definition,t)}if(e.kind===`Apply`){if(ws(e.operator,t)||e.operator===`~>`)return!1;let r=is(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=Bo(e.operator,t);if(!n||!Ho(n,t)||ks(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`&&Ls(e,t,n))}let r={value:!0};return na(e,(e,i)=>(r.value&&=Ls(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},zs=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Bs=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}},Vs=(e,t)=>{if(e.kind===`Identifier`&&K(e))return!t.has(e.name);if(K(e))return!0;let n={value:!1};return na(e,(e,r)=>(n.value||=Vs(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Hs=(e,t)=>Ji.has(e)&&zs(e)&&Oc(e,t)!==void 0&&!Vs(e,Is),Us=/* @__PURE__ */ new WeakMap,Ws=/* @__PURE__ */ new Set([`SetEnumeration`,`SetMap`,`SetFilter`,`Tuple`,`Record`,`RecordSet`,`FunctionSet`,`Product`]),Gs=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Ks=(e,t)=>Ws.has(e.kind)||e.kind===`Apply`&&Gs.has(e.operator)&&!K(e)&&is(e.operator,t)?.kind===`Builtin`,qs=(e,t,n,r)=>{try{return e(t)}catch(e){throw n.length===r+1&&n.push(...Oe(e)??[]),e}},X=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Tc(e,t),i=zs(e)&&Ps(e,t)?Bs(r):Hs(e,t)?Qs(r):r,a=t.trace,o=a!==void 0&&Ks(e,t),s=a?n=>{let r=a.length;a.push(e);let s=qs(i,n,a,r);a.length=r,o&&typeof s==`object`&&s.kind!==`FilteredSet`&&N.current?.set(s,e);let c=typeof s==`object`&&s.kind===`FilteredSet`?Us.get(s):void 0;return c?c(t):s}:i;return t.evaluators.set(e,s),s},Js=/* @__PURE__ */ new WeakMap,Ys=(e,t)=>{if(t.trace)return X(e,t);let n=Js.get(e);if(n)return n;let r=(zs(e)&&Ps(e,t)?void 0:ni(e,t))??X(e,t);return Js.set(e,r),r},Z=(e,t)=>Ys(e,t.environment)(t),Xs=(e,t)=>{let n=e.name,r=K(e)?void 0:ms(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Sc(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&&Ho(e,t))return t=>es(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Ys(e.body,t),n.body(Ro(r,void 0)));return Zs(e,t)?Qs(r):r}return t=>es(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>es(e,t);return Ho(e,t)||!Zs(e,t)?n:Qs(n)}return t=>xs(n,e,t)},Zs=(e,t)=>Oc(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Oc(e.set,t)!==void 0)),Qs=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}},$s=(e,t)=>{let n=is(e,t);return n!==void 0&&cs(n)>0},ec=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!K(e)&&$s(e.name,t)),tc=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>Z(e,t),expression:e})),nc=/* @__PURE__ */ new Set([`=`,`#`,`\\in`,`\\notin`,`\\cup`,`\\cap`,`\\`]),rc=(e,t,n)=>e===`\\in`||e===`\\notin`||(e===`\\cup`||e===`\\cap`)&&!Ae(t)?n:t,ic=(e,t,n)=>{if(n.trace&&nc.has(e.name)&&t.length===2){let r=X(t[0],n),i=X(t[1],n);return t=>{let n=r(t),a=i(t);return ke(rc(e.name,n,a),()=>e.evaluate([n,a],t))}}if(e.isLazy)return n=>e.evaluate(tc(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&ec(t[0],n)){let e=X(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&ec(t[0],n)&&ec(t[1],n);if(i&&a){let e=X(t[0],n),r=X(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>fs(e,n)?ds(ls(e,n),n):Z(e,n)),n)},ac=(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:_s(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:ls(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},oc=/* @__PURE__ */ new WeakMap,sc=e=>{let t=oc.get(e);if(t)return t;let n={calls:/* @__PURE__ */ new Map,size:0};return oc.set(e,n),n},cc=(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},lc=(e,t)=>e.every((e,n)=>at(e,t[n])),uc=(e,t)=>{let n=Bo(e.operator,t);return n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&Ho(n,t)&&!ks(n,t)},dc=(e,t,n,r)=>{let i=ac(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Ys(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=sc(e);return e=>{let n=i(e),r=cc(n,t.length);if(!r)return o(n,e);let a=r.length;for(let e of r)a=zn(a,Gn(e));let c=s.calls.get(a),l=c?.find(e=>lc(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}},fc=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=X(n[0],t),r=X(n[1],t);return t=>!zo(e(t),`the left side of =>`)||zo(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=K(e)?void 0:is(e.operator,t);if(r?.kind===`Closure`)return dc(r,n,t,uc(e,t));if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=X(n[0],t),i=jo(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=X(n[0],t);return Yi.has(e)||Vo(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=X(n[0],t),a=X(n[1],t),o=Mo(e,r);return t.trace?e=>{let t=i(e),n=a(e);return ke(t,()=>o(t,n))}:e=>o(i(e),a(e))}return r?.kind===`Builtin`?ic(r,n,t):r=>{let i=ss(e.operator,r);if(i)return ys(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 ${wo(e)}`)}},pc=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=X(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=X(a.set,t);return t=>{let s=Wo(o(t),a.set);for(let a=0;a<s.length;a++){let o=zo(i(Ro(t,Io(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=>X(e.set,t));return t=>{let s=a.map((e,n)=>Wo(e(t),o[n].set)),c=(a,o)=>{if(a<0)return zo(i(Ro(t,o)),r)!==n;let l=s[a];for(let t=0;t<l.length;t++)if(c(a-1,Io(o,e[a],l[t])))return!0;return!1};return c(o.length-1,t.scope)?!n:n}}return e=>Go(o,e,t=>zo(i(Ro(e,t)),r)!==n)?!n:n},mc=(e,t)=>{if(e.kind===`Tuple`)return B(e.names.map(e=>{let n=Fo(t,e);return n?.kind===`Value`&&n.value}));let n=Fo(t,e.name);return n?.kind===`Value`?n.value:void 0},hc=/* @__PURE__ */ new WeakSet,gc=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&hc.add(e)},_c=(e,t)=>{let n=hc.has(e),r=X(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=X(a.set,t);return t=>{let c=o?s(t):Ko(i,t),l=typeof c==`object`&&c.kind===`ProductSet`&&i.length>1?c.factors:[c];if(e.isRecursive||n||!l.every(Ae)){let n=Zo(c,e=>r(Ro(t,qo(i,t.scope,e))),Xo(i,e.body,c));return i.length===1?wn(n):n}if(o&&a.pattern.kind===`Name`){let e=a.pattern.name,n=Kt(c);return wn(nt(n,n.map(n=>r(Ro(t,Io(t.scope,e,n))))))}let u=[];return Go(i,t,e=>{let n=i.length===1?mc(a.pattern,e)??!1:B(i.map(t=>mc(t.pattern,e)??!1));return u.push([n,r(Ro(t,e))]),!1}),Rt(u)}},vc=(e,t)=>{let n=hc.has(e);n&&gc(e.function);let r=X(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>X(e,t))}),value:X(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):B(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Ro(i,Io(i.scope,`@`,e))):In(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}},yc=(e,t)=>{if(e.kind===`SetFilter`){let n=X(e.predicate,t),r=X(e.bound.set,t),i=e.bound.pattern;return t=>{let a=r(t),o=e=>n=>zo(e(Ro(t,Lo(t.scope,i,n))),`a set filter predicate`),s=o(n);if(!Ae(a)){if(P(a)){let t={kind:`FilteredSet`,base:a,test:s};return Us.set(t,n=>({...t,test:o(X(e.predicate,n))})),t}throw new v(`TLC encountered a non-enumerable quantifier bound ${G(a)} at ${wo(e.bound.set)}`)}return tt(H(a).elements.filter(s))}}if(e.kind===`SetMap`){let n=X(e.expression,t);return t=>{let r=[];return Go(e.bounds,t,e=>(r.push(n(Ro(t,e))),!1)),Nt(r)}}let n=e.set;if(!n)return()=>{throw new v(`TLC cannot evaluate an unbounded CHOOSE at ${wo(e)}`)};let r=X(e.body,t),i={pattern:e.pattern,set:n};return t=>{let n={value:void 0};if(Go([i],t,i=>zo(r(Ro(t,i)),`the body of CHOOSE`)?(n.value=mc(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${To(e)}`);return n.value}},bc=e=>[...e].sort((e,t)=>z(e.name,t.name)),xc=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Sc=(t,n)=>a(new b(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${To(n)}`,t),e.configParseError),Cc=e=>new v(`A primed expression appears outside an action at ${wo(e)}`),wc=(e,t)=>{let n=bc(e),r=xc(n),i=n.map(e=>X(e.value,t));if(r)return e=>Rt(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=>Ie(a,i.map(t=>t(e)),o):e=>nt(a,i.map(t=>t(e)))},Tc=(e,t)=>{let n=e=>X(e,t);switch(e.kind){case`Number`:{let t=e.value;return Ss(t)?()=>t:()=>{throw Po(e)}}case`Decimal`:return()=>{throw No(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Xs(e,t);case`Apply`:return fc(e,t);case`OperatorReference`:case`Lambda`:return()=>{throw new v(`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 Do(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(zo(t[n](e),`a disjunct`))return!0;return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Cc(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=>rt(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 Eo(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(zo(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${To(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Ro(n,bs(e.definitions,n)))}case`Forall`:case`Exists`:return pc(e,t);case`UnboundedQuantifier`:return()=>{throw new v(`TLC cannot evaluate an unbounded quantifier at ${wo(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return yc(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Nt(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>B(t.map(t=>t(e)))}case`FunctionConstruction`:return _c(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 wc(e.fields,t);case`RecordSet`:{let t=bc(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 vc(e,t);case`ExceptAt`:return t=>{let n=Fo(t.scope,`@`);if(n?.kind!==`Value`)throw new v(`@ appears outside an EXCEPT at ${wo(e)}`);return n.value};case`FunctionApplication`:{gc(e.function);let r=n(e.function),i=e.args.map(n),a=ko(e);if(i.length===1&&t.trace){let e=i[0];return t=>{let n=r(t),i=e(t),o=()=>Nn(n,i,void 0,a);return F(n)?ke(n,o):o()}}if(i.length===1){let e=i[0];return t=>Nn(r(t),e(t),void 0,a)}return e=>Nn(r(e),B(i.map(t=>t(e))),void 0,a)}case`FieldAccess`:{let t=n(e.record),r=e.field,i=Oo(e),a=Ao(e);return e=>Nn(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?zo(t(e),`an action`)||r(e):zo(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>yo(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new v(`The subexpression reference at ${wo(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 ${wo(e)}`)}}},Ec=/* @__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},Oc=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Ec.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&&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 pr(e).every(i)};return i(e)?[...n]:void 0},kc=/* @__PURE__ */ new Map([[`Reals`,`-------------------------------- MODULE Reals -------------------------------
30
32
  (***************************************************************************)
31
33
  (* This module provides dummy definitions of the operators that are *)
32
34
  (* defined by the real Reals module. It is expected that any tool that *)
@@ -95,8 +97,9 @@ _TEPosition ==
95
97
  THEN _TETraceLength
96
98
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
97
99
 
98
- =============================================================================`]]),ic=`tlc2/value/impl/`,ac=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)}},oc=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,sc=e=>{let t=ac(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:oc(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}},cc=(e,t)=>e[e[t].first].text,lc=(e,t)=>{let n=e[t],r=e[n.second];return{className:cc(e,n.first),name:e[r.first].text}},uc=(e,t,n,r)=>{let i=()=>new b(`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=lc(t,l());if(n.className!==`${ic}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=lc(t,l()),a=s();if(n.className!==`${ic}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:cc(t,l()),value:void 0}),e+=3;else if(n===183){let n=lc(t,l()),a=s(),o=s();if(!(n.className===`${ic}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()},dc=(e,t)=>{if(!t)return e;let n=sc(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:uc(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),fc=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),pc=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),mc=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),hc=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),gc=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),_c=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...pc]),vc=e=>fc.has(e)||pc.has(e)||e===`-.`,yc=(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}}},bc=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),xc=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Sc=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Cc=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),wc=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Tc=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Ec=/* @__PURE__ */ new Set([``,`*`,`-`]),Dc=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Oc=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),kc=/* @__PURE__ */ new Set([`NEW`,...Oc.keys()]),Ac=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),jc=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Mc=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Nc=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),Pc=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>Nc(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(`
99
- `)},Fc=(e,t)=>{let n=se(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=[],m=[],h=e=>{let t=r.index-1,i=e===t?m[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&&(m[e]=o),o},g=(e,t)=>(e.location.range=h(t),e),_=(e=0)=>n[Math.min(r.index+e,n.length-1)],v=(e=0)=>{let t=_(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},y=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),b={index:0},x=e=>{let t=n.slice(b.index,r.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ee=e=>t&&(e.kind===`Keyword`||Mc.has(e.text)),te=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},ne=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Tc.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ee(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,S=(e,t=_(),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,re(e,t,a,r))},re=(e,r,i,a)=>{if(t&&i){let e=n[n.length-1];return{reason:`Unexpected EOF`,...x(te(e)),isEnd:i}}return t&&a?{reason:`Unexpected ${ne(a)}`,...te(a),isEnd:i}:{reason:e,line:r.line,column:r.column,isEnd:i}},C=(e,t=_())=>S(e,t,t),ie=e=>(e.kind===`Identifier`||e.kind===`Keyword`)&&!ee(e),w=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=v();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 C(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return T()},O=()=>{let e=v();if(e.kind!==`Identifier`)throw C(`Expected an identifier but found ${y(e)}`);if(ee(e))throw C(`Unexpected keyword ${e.text}`);return r.index++,e.text},oe=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},A=()=>{if(w(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},ce=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},le=()=>{if(!E(`<<`))return{kind:`Name`,name:O()};let e=k(O);return D(`>>`),{kind:`Tuple`,names:e}},ue=()=>k(()=>{let e=k(le);D(`\\in`);let t=N();return e.map(e=>({pattern:e,set:t}))}).flat(),de=()=>{let e=v();if(e.kind===`Identifier`){let t=r.index,n=[T().text];for(;w(`!`)&&v(1).kind===`Identifier`;)T(),n.push(O());return g({kind:`Identifier`,name:n.join(`!`),location:u(e)},t)}if(w(`<<`)||w(`(`))return M();throw C(`Expected a subscript but found ${y(e)}`)},fe=e=>{let t=v(1),n=v(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,pc.has(n.text)?3:4))},pe=e=>{if(!hc.has(e.text))return!0;let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&xc.has(t.text)||fe(e)},me=()=>{let e=v(),n=e.kind===`Operator`&&(fc.has(e.text)||mc.has(e.text))&&pe(e);if(t&&e.kind!==`String`&&(mc.has(e.text)||_c.has(e.text)&&e.text!==`'`&&!pc.has(e.text)||gc.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&pe(e))throw S(`incomplete expression`,e);if(n)return r.index++,g({kind:`OperatorReference`,operator:e.text,location:u(e)},r.index-1);if(e.kind!==`String`&&_c.has(e.text)&&pe(e)){r.index++;let t=u(e);if(pc.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:yc(e.text,n,t),location:t}}if(w(`LAMBDA`)){let t=r.index;T();let n=k(O);D(`:`);let i=N();return g({kind:`Lambda`,params:n,body:i,location:u(e)},t)}return N()},j=()=>oe(()=>{D(`(`);let e=k(me);return D(`)`),e}),he=()=>{let e=T();r.offsideColumns.push(e.column);let t=[N()];for(;_().text===e.text&&_().column===e.column;)r.index++,t.push(N());return r.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:u(e)}},ge=e=>oe(()=>{let t=u(e);if(v().kind===`Identifier`&&(w(`|->`,1)||w(`:`,1))){let e=w(`|->`,1)?`Record`:`RecordSet`,n=k(()=>{let t=O();return D(e===`Record`?`|->`:`:`),{name:t,value:N()}});return D(`]`),{kind:e,fields:n,location:t}}if(A()){let e=ue();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(!ie(v()))throw C(`Expected a field name but found ${y(v())}`);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:de(),location:t}}),_e=e=>oe(()=>{let t=u(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(A()&&(v(1).text===`\\in`||w(`<<`))){let e=r.index,n=le();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=ue();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}}),ve=e=>{let t=u(e),n=oe(()=>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:de(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},ye=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&A()){let e=ue();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}},be=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)}},xe=()=>{let e=v(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||bc.has(e.text)||e.kind===`Operator`&&(fc.has(e.text)||pc.has(e.text)||mc.has(e.text)))},Se=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:ae(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:ae(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`&&Ie(n);if(o&&Ne()<0&&F.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?Le(n)??n.text:n.text;if(ce()){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(!xe())return i?{kind:`Apply`,operator:r,args:s,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(;xe();)T(),u.push(Se());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);return m.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:f,args:p,argumentCounts:m,location:a}:{kind:`Apply`,operator:f,args:p,location:a}}if(n.kind===`Operator`&&vc(n.text)&&w(`(`))return{kind:`Apply`,operator:n.text,args:j(),location:a};switch(n.text){case`(`:{let e=oe(()=>N());return D(`)`),e}case`[`:return ge(n);case`{`:return _e(n);case`<<`:return ve(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return ye(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 be(n);case`LET`:{let e=[],n=[];for(i.push(/* @__PURE__ */ new Set);!E(`IN`);){if(t&&w(`RECURSIVE`))throw S(`Unexpected keyword RECURSIVE`,x(_()));if(E(`RECURSIVE`)){Ae();continue}let r=Te(!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=le(),t=E(`\\in`)?N():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:N(),location:a}}case`WF_`:case`SF_`:{let e=de(),t=oe(()=>{D(`(`);let e=N();return D(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:a}}}throw C(`Unexpected ${y(n)}`,n)},Ce=()=>{let e=v(),t=u(e);if(e.kind===`Operator`&&(e.text===`/\\`||e.text===`\\/`))return he();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=Ce(),i={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let r=u(n);if(n.text===`'`&&e<=15){T(),i.left=g({kind:`Prime`,expression:i.left,location:r},t);continue}if(pc.has(n.text)&&e<=15){T(),i.left=g({kind:`Apply`,operator:n.text,args:[i.left],location:r},t);continue}if(n.text===`[`){T();let e=oe(()=>k(()=>N()));oe(()=>D(`]`)),i.left=g({kind:`FunctionApplication`,function:i.left,args:e,location:r},t);continue}if(n.text===`.`&&ie(v(1))){T();let e=T().text;i.left=g({kind:`FieldAccess`,record:i.left,field:e,location:r},t);continue}let a=fc.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 -`,v());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=g(i.left,t),i.previous={...a,text:n.text}}return i.left},P=()=>{if(!E(`(`))return[];let e=ke();return D(`)`),e},we=()=>{let e=u(v()),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}}},Te=e=>{let t=r.index;return g(Ee(e),t)},Ee=e=>{let t=v(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...we(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&fc.has(v(1).text)&&v(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`&&pc.has(v(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:v(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=oe(()=>ue());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`)?{...De(s,d,e,n),definitionRange:h(c)}:i(s,d)},De=(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:me()}}):[],isLocal:n,location:i,instanceRange:h(a)}},Oe=()=>{let e=u(v());if(w(`_`)&&v(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(v().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}},ke=()=>k(Oe),Ae=()=>{let e=ke();return e.forEach(e=>i[i.length-1].add(e.name)),e},je=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Ac.has(e.text)&&t.value++,e.kind===`Operator`&&jc.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Me=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,je(1)):t.kind===`Operator`&&pc.has(t.text)?w(`==`,2):t.kind===`Operator`&&fc.has(t.text)?v(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):w(`-.`)&&t.kind===`Identifier`&&w(`==`,2)},F=[],Ne=()=>F[F.length-1]??-1,Pe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Fe=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)},Ie=e=>!e.text.endsWith(`.`)&&!Ec.has(Fe(e)),Le=e=>{let t=Fe(e);if(Ec.has(t))return;let n=Pe(e);if(n>=0)return`<${n}>${t}`;let r=Ne(),i=F[F.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},I=e=>{if(e.kind===`Keyword`)return Cc.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return F.length===0;if(e.text[1]===`+`||F.length===0)return!0;let t=Ne();return t>=0&&Pe(e)>t},Re=e=>{let t=Pe(e),n=F.length-1,r=F[n-1]??-1,i=F[n]<0;return i&&(F[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:F[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:!Mc.has(e.name)&&!ze(e.name):!1,L=()=>{let e=v();return e.kind===`Step`?Ie(e):e.kind===`Keyword`?Dc.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Me()},Ve=()=>{let e=r.index;s.index=e;let t=v();return t.kind===`Operator`&&!hc.has(t.text)&&vc(t.text)?(r.index++,g({kind:`OperatorReference`,operator:t.text,location:u(t)},e)):E(`MODULE`)?g({kind:`ModuleFact`,name:O(),location:u(t)},e):N()},He=e=>o[o.length-1]?.add(e),Ue=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},We=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),R=()=>{let e=r.index,t=v(),n=k(()=>{let e=v();if((e.kind!==`Identifier`||ee(e))&&e.kind!==`Operator`)throw C(`Expected a definition name but found ${y(e)}`,e);return r.index++,e.text},`!`),i=u(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:i}:{kind:`Identifier`,name:n.join(`!`),location:i},e)},Ge=()=>{if(t)return k(R);let e=k(Ve),n=e.find(e=>e.kind===`Identifier`&&We(e.name));if(n)throw S(`DEF clause entry should describe a defined operator`,n.location);return e},Ke=()=>({facts:L()?k(Ve):[],defs:E(`DEF`)||E(`DEFS`)?Ge():[]}),qe=()=>{let e=r.index,n=T(),i=n.text===`USE`&&E(`ONLY`),a=h(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Ke(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.find(e=>!Be(e)):void 0;if(s)throw S(`The only expression allowed as a fact in a HIDE is the name of a theorem, assumption, or step`,s.location);return g(o,e)},Je=()=>{let e=r.index,t=u(v()),n=E(`NEW`),i=v().kind===`Keyword`?Oc.get(v().text):void 0;if(!n&&i===void 0)throw C(`Expected a declaration but found ${y(v())}`);if(i!==void 0&&T(),i===`Variable`){let n=O();return He(n),g({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=Oe();He(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(),g({kind:`NewSymbol`,name:a.name,arity:a.arity,level:i??`Constant`,set:o?N():void 0,location:t},e)},Ye=()=>{let e=r.index,t=u(D(`ASSUME`)),n=k(()=>w(`ASSUME`)?Ue(Ye):v().kind===`Keyword`&&kc.has(v().text)?Je():N());return D(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},Xe=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&w(e,t.value+1)},Ze=(e,t)=>{e.forEach(He),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(He))},Qe=()=>{let e=v();if(w(`USE`)||w(`HIDE`))return qe();if(w(`INSTANCE`))return g(De(void 0,[],!1,u(e)),r.index);if(w(`DEFINE`)||Me()){let t=r.index;E(`DEFINE`);let n=[Te(!1)];for(;Me();)n.push(Te(!1));let i={kind:`Define`,definitions:n,location:u(e)};return g(i,t)}if(E(`HAVE`))return{kind:`Have`,expression:N()};if(E(`TAKE`)){let e=A(),t=e?[]:k(O),n=e?ue():[];return Ze(t,n),{kind:`Take`,names:t,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:k(()=>N())};if(E(`PICK`)){let e=Xe(`:`),t=e?k(O):[],n=e?[]:ue();return Ze(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`)?Ye():N()}},$e=e=>{let t=v();if(t.kind!==`Step`)throw C(`Expected a step number but found ${y(t)}`,t);if(!Re(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(Pe(t)<0&&Le(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:Le(t),token:t.text,location:u(t)}},et=()=>{let e=r.index,t=$e(w(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=E(`QED`)?{kind:`Qed`}:Qe(),a=h(e),s=I(v());if(s&&!wc.has(i.kind))throw S(`Proof of a step that does not take a proof`);let c=s?nt():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(He),g({...t,body:i,head:a,proof:c},e)},tt=()=>{let e=u(v());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=h(r.index-1);return{kind:`By`,isOnly:E(`ONLY`),...Ke(),keyword:t,location:e}}let t=v(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=h(r.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[et()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(et());return{kind:`Steps`,level:Ne(),steps:n,location:e}},nt=()=>{let e=r.index;F.push(-1);let t=Ue(tt);return F.pop(),g(t,e)},rt=e=>{let t=r.index,n=T(),i=v().kind===`Identifier`&&w(`==`,1)?O():void 0;i!==void 0&&(a.add(i),T());let o=Ue(()=>({statement:w(`ASSUME`)?Ye():N(),proof:I(v())?nt():void 0})),s=o.statement,c=g({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(g({kind:`Operator`,name:i,params:[],body:s,isLocal:!1,isRecursive:!1,location:u(n)},t))},it=()=>{let e=r.index;return g(at(),e)},at=()=>{let e=T(),t=u(e),n=e.text===`AXIOM`;if(v().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}},ot=()=>{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(h(e))});;){let a=r.index;b.index=a;let o=v();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=ot();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=ke();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(v());return g({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=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=qe();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:Ae()});continue;case`INSTANCE`:st(n,g(De(void 0,[],!1,u(o)),a));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){st(n,g(De(void 0,[],!0,u(o)),a));continue}st(n,Te(!0));continue}o.kind===`Keyword`&&Sc.has(o.text)?rt(n):st(n,Te(!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()},Ic=e=>Fc(e,!1),Lc=e=>Fc(e,!0),Rc=25214903917n,zc=(1n<<48n)-1n,Bc=2147483647,Vc=e=>{let t={value:(BigInt.asUintN(64,e)^Rc)&zc},n=e=>(t.value=t.value*Rc+11n&zc,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Rc)&zc},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<=Bc)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Hc=10454148508367108822n,Uc=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Hc);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Wc=Int32Array.from(Uc,e=>Number(BigInt.asIntN(32,e>>32n))),Gc=Int32Array.from(Uc,e=>Number(BigInt.asIntN(32,e))),Kc=Number(BigInt.asIntN(32,Hc>>32n)),qc=Number(BigInt.asIntN(32,Hc));let Jc=Kc,Yc=qc;const Xc=e=>{let t=(e^Yc)&255;Yc=(Yc>>>8|Jc<<24)^Gc[t],Jc=Jc>>>8^Wc[t]},Zc=e=>{for(let t=0;t<32;t+=8)Xc(e>>>t)},Qc=e=>{if(typeof e==`boolean`)Xc(0),Xc(e?116:102);else if(typeof e==`number`)Xc(1),Zc(e);else if(typeof e==`string`){Xc(3),Zc(e.length);for(let t=0;t<e.length;t++)Xc(e.charCodeAt(t))}else if(P(e))Xc(21),Zc(ze(e.name)+1);else if(N(e)){let t=U(e);Xc(9),Zc(t.domain.length);for(let e=0;e<t.domain.length;e++)Qc(t.domain[e]),Qc(t.range[e])}else{let t=V(e).elements;Xc(5),Zc(t.length);for(let e of t)Qc(e)}},$c=e=>{let t={high:Jc,low:Yc};Jc=Kc,Yc=qc;for(let t of e)Qc(t);let n=BigInt(Jc>>>0)<<32n|BigInt(Yc>>>0);return Jc=t.high,Yc=t.low,n},el=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=U(e);return t.domain.reduce((e,n,r)=>e+el(n)+el(t.range[r]),5)}return V(e).elements.reduce((e,t)=>e+el(t),5)},tl=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Jc=n<32?0:1<<n-32,Yc=n<32?1<<n:0;for(let t=0;t<e;t++)Xc(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]^Jc,t[n+1]=t[a+1]^Yc}}return t},nl=(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=el(e);return Jc=0,Yc=0,Qc(e),r.set(e,i.length),i.push(n,Jc,Yc),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=tl(e);return n.set(e,r),r};return(n,r)=>{let s={high:Jc,low:Yc},c={high:Kc,low:qc};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}Jc=s.high,Yc=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},rl=[],il=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},al=()=>{for(let e=1277011;rl.length<1341;e++)il(e)&&rl.push(e);return rl},ol=e=>{let t=al(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},sl=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},cl=e=>{for(let t=Math.max(e,9);;t++){let e=sl(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)}}},ll=(e,t,n)=>{if(t<=0)return[];let r=cl(t),i={index:BigInt(n.nextInt(t))},a=BigInt(ol(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},ul=(1n<<63n)-1n-24n,dl=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(ul*BigInt(n)+i)%t;return r<0n?r+t:r})},fl=(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,pl=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Rt(e.domain),n=V(e.range).elements;return{lists:t.map(()=>n),create:e=>Je(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>V(e).elements),create:t=>Bt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>V(e).elements),create:z}}},ml=(e,t,n)=>{if(H(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return ll(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=pl(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Bc)?dl(e,t,n):ll(e,Number(t),n)).map(e=>r.create(fl(r.lists,e)))}let i=V(t).elements;return ll(e,i.length,n).map(e=>i[Number(e)])},hl=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new h(`RandomElement of the empty set`);return n},gl=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Rt(e.domain)];return Je(n,n.map(()=>gl(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Bt(e.names.map((n,r)=>[n,gl(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return z(e.factors.map(e=>gl(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 h(`RandomElement of the empty set`);return e.low+r}return hl(V(e).elements,t)},_l=(e,t=0n)=>{let n=Vc(t),r={random:Vc(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Bt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:$c,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},vl=e=>At([...e.possibleCounts].map(([e,t])=>[e,t])),yl=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,vl(e)]]),bl=(e,t,n)=>new g(`Applying ${e} to the following value,\nwhich is not ${t}:\n${W(n)}`),xl=(e,t,n,r)=>new g(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${W(r)}`),Sl=e=>N(e)?U(e):void 0,Cl=(e,t,n)=>{let r=K(e,t,n),i=Sl(r);if(!i)throw bl(n,`a function with a finite domain`,r);return i},wl=(e,t,n)=>{let r=K(e,t,n),i=Sl(r);if(!i)throw xl(t===0?`first`:`second`,n,`bag`,r);return i},Tl=(e,t)=>{if(!M(e)||!B(e))throw t();return V(e).elements},El=e=>e.range.every(e=>typeof e==`number`&&e>0),Dl=(e,t)=>{let n=e.domain.findIndex(e=>Ye(e,t));return n===-1?void 0:e.range[n]},Ol=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,kl=Ol(`BagDiff`,`tlc2.value.impl.Value`,2),Al=Ol(`SqSubseteq`,`tlc2.value.IBoolValue`,2),jl=Ol(`BagUnion`,`tlc2.value.impl.Value`,1),Ml=Ol(`BagOfAll`,`tlc2.value.impl.Value`,2),Nl=Ol(`BagCup`,`tlc2.value.impl.Value`,2),Pl=Ol(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Fl=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Sr(e)}`;throw wr(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')`)},Il=(e,t,n)=>{let r=Fl(e,n)+Fl(t,n);if(_r(r))throw vr(`${e}+${t}`);return r},Ll=(e,t,n,r)=>{let i=Dl(n,e.domain[t]),a=Fl(e.range[t],r);return i===void 0?a:a-Fl(i,r)|0},Rl=(e,t)=>At(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Ye(e[0],r));a?a[1]=Il(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),zl=Je([],[]),Bl=[pr(`EmptyBag`,zl),q(`IsABag`,1,e=>{let t=Sl(K(e,0,`IsABag`));return t!==void 0&&El(t)}),q(`BagCardinality`,1,e=>{let t=K(e,0,`BagCardinality`);return Cl(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw bl(`BagCardinality`,`a bag`,t);return Il(e,n,Pl)},0)}),q(`BagIn`,2,e=>{let t=K(e,1,`BagIn`),n=Dl(Cl(e,1,`BagIn`),K(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw xl(`second`,`BagIn`,`bag`,t);return n>0}),q(`CopiesIn`,2,e=>{let t=K(e,1,`CopiesIn`),n=Dl(Cl(e,1,`CopiesIn`),K(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw xl(`second`,`CopiesIn`,`bag`,t);return n}),q(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=wl(e,t,`(+)`);if(!El(n))throw xl(t===0?`first`:`second`,`(+)`,`bag`,K(e,t,`(+)`));return n});return Rl(t,Nl)}),q(`\\ominus`,2,e=>{let t=wl(e,0,`(-)`),n=wl(e,1,`(-)`);return At(t.domain.flatMap((e,r)=>{let i=Ll(t,r,n,kl);return i>0?[[e,i]]:[]}))}),q(`BagUnion`,1,e=>{let t=K(e,0,`BagUnion`),n=Tl(t,()=>bl(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??zl;let r=n.map(e=>{let n=Sl(e);if(!n)throw new g(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${W(t)}`);return n});return Rl(r,jl)}),q(`\\sqsubseteq`,2,e=>{let t=Cl(e,0,`\\sqsubseteq`),n=Cl(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Ll(t,r,n,Al)<=0)}),mr(`BagOfAll`,2,e=>{let t=fr(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new g(`The first argument of BagOfAll should be an operator, but instead it is:\n${W(t.literalBody)}`);let n=K(e,1,`BagOfAll`),r=Sl(n);if(!r)throw xl(`second`,`BagOfAll`,`function with a finite domain`,n);return Rl(r.domain.map((e,n)=>Je([t.call([e])],[r.range[n]])),Ml)}),q(`SubBag`,1,e=>{let t=K(e,0,`SubBag`);if(!N(t))throw new h(`DOMAIN expects a function but received ${W(t)}`);let n=U(t),r=wt(n.range).elements,i=r.find(e=>typeof e!=`number`);if(i!==void 0){let e=typeof r[0]!=`number`;throw new h(`The ${e?`first`:`second`} argument of >= should be an integer, but instead it is:\n${W(e?r[0]:i)}`)}let a=n.range.filter(e=>typeof e==`number`);if(a.some(e=>e<1))throw new h(`Attempted to apply a function to ${W(n)}, which is not in its domain`);return wt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Je(e.map(e=>e[0]),e.map(e=>e[1]))))}),q(`BagToSet`,1,e=>Tn(Cl(e,0,`BagToSet`))),q(`SetToBag`,1,e=>{let t=K(e,0,`SetToBag`),n=Tl(t,()=>bl(`BagToSet`,`a function with a finite domain`,t));return Je([...n],n.map(()=>1))})],Vl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Hl=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Ul=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Wl=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Gl=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Kl=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,ql=e=>{if(!N(e))return!1;let t=U(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Jl=(e,t)=>wr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Sr(t)}`),Yl=(e,t)=>wr(e,`Cannot cast tlc2.value.impl.${Sr(t)} to tlc2.value.impl.StringValue`),Xl=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Zl=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Jl(t,e);return`[${V(e).elements.map(e=>$l(e,t)).join(`,`)}]`},Ql=(e,t)=>{let n=U(e),r=cn(n);return r?`[${r.map(e=>$l(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Xl(typeof e==`string`?e:W(e))}:${$l(n.range[r],t)}`).join(`,`)}}`},$l=(e,t)=>typeof e==`string`?Xl(e):typeof e==`object`?e.kind===`ModelValue`?Xl(e.name):M(e)?Zl(e,t):Ql(e,t):String(e),eu=e=>{if(M(e))return Zl(e,Vl);if(!N(e)||ql(e))throw Jl(Vl,e);return Ql(e,Vl)},tu=e=>{if(!N(e))throw Jl(Hl,e);return Ql(e,Hl)},nu=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))},ru=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return I(e);if(Array.isArray(e))return z(e.map(e=>ru(e,t)));if(typeof e==`object`&&e)return Bt(Object.entries(e).map(([e,n])=>[I(e),ru(n,t)]));throw wr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},iu=(e,t)=>{if(e.trim()===``)return ru(null,t);try{return ru(JSON.parse(e,(e,t,n)=>typeof t==`number`?nu(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?wr(t,e.message):e}},au=(e,t)=>{if(typeof e!=`string`)throw Yl(t,e);return e},ou=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw wr(n,`${t} (No such file or directory)`);return r},su=e=>[hr(`ToJson`,1,e=>I($l(K(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),hr(`ToJsonArray`,1,e=>I(eu(K(e,0,`ToJsonArray`)))),hr(`ToJsonObject`,1,e=>I(tu(K(e,0,`ToJsonObject`)))),hr(`JsonSerialize`,2,t=>{let n=au(K(t,0,`JsonSerialize`),Ul),r=K(t,1,`JsonSerialize`);if(!cn(r)&&!ql(r))throw new g(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${W(r)}`);return e.writeFile?.(n,$l(r,Ul)),!0}),hr(`ndJsonSerialize`,2,t=>{let n=au(K(t,0,`ndJsonSerialize`),Wl),r=K(t,1,`ndJsonSerialize`),i=cn(r);if(!i)throw new g(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${W(r)}`);return e.writeFile?.(n,i.map(e=>`${$l(e,Wl)}\n`).join(``)),!0}),hr(`JsonDeserialize`,1,t=>{let n=au(K(t,0,`JsonDeserialize`),Gl);return iu(ou(e,n,Gl),Gl)}),hr(`ndJsonDeserialize`,1,t=>{let n=au(K(t,0,`ndJsonDeserialize`),Kl);return z(ou(e,n,Kl).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>iu(e,Kl)))})],cu=(e,t,n,r)=>new g(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),lu=(e,t,n)=>{if(typeof e!=`number`||e<0)throw cu(t,n,`nonnegative integer`,W(e));return e},uu=(e,t,n,r)=>{if(!M(e)||!B(e))throw cu(t,n,r,W(e));return V(e).elements},du=(e,t,n,r)=>wt(Array.from({length:t},()=>wt(e.filter(()=>r.nextDouble()<n)))),fu=(e,t)=>{let n=`RandomSetOfSubsets`,r=lu(K(e,0,n),`first`,n),i=lu(K(e,1,n),`second`,n),a=uu(K(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw cu(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw cu(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return du(a,r,a.length===0?0:i/a.length,t.getRandom())},pu=e=>[hr(`RandomSubset`,2,t=>{let n=K(t,0,`RandomSubset`);if(typeof n!=`number`)throw cu(`first`,`RandomSubset`,`nonnegative integer`,W(n));if(n<0)throw new h(`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=K(t,1,`RandomSubset`);if(!M(r)||!H(r)&&!B(r))throw cu(`second`,`RandomSubset`,`a finite set`,W(r));return wt(ml(n,r,e.getRandom()))}),hr(`RandomSetOfSubsets`,3,t=>fu(t,e)),hr(`TestRandomSetOfSubsets`,3,t=>z(Array.from({length:5},()=>V(fu(t,e)).elements.length)))],mu=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,hu=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${mu})`,gu=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${mu}) throws java.io.IOException`,_u=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${mu})`,vu=()=>Bt([[`action`,wt([])],[`state`,wt([])]]),yu=()=>Bt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),bu=e=>Bt([[`name`,e??`UnnamedAction`],[`location`,yu()]]),xu=(e,t)=>{let n=e.map((e,t)=>z([t+1,Bt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>z([n[r],bu(e[r+1].action),t])),i=t?[z([n[n.length-1],bu(t.action),n[t.start]])]:[];return Bt([[`action`,wt([...r,...i])],[`state`,wt(n)]])},Su=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return yl(e).get(t)},Cu=(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),W(r));else throw new g(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${W(n)}`)},wu=e=>e.every(e=>e!==void 0),Tu=(e,t)=>Bt(t.variables.map((t,n)=>[t,e[n]])),Eu=(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&&!G(e)){if(t.variableIndex.has(r))return!0;let e=xo(r,t);if(e&&!n.has(e)&&(n.add(e),Eu(e.body,t,n)))return!0}return er(e).some(e=>Eu(e,t,n))},Du=(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=K(t,0,`AssertEq`),r=K(t,1,`AssertEq`),i=Ye(n,r);return i||(e(W(`Assertion failed`,!0)),e(W(n,!0)),e(W(r,!0))),i}),jr(`AssertError`,2,e=>{let t=fr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw wr(hu,`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=Mr(e,0,`AssertError`)();try{Mr(e,1,`AssertError`)()}catch(e){if(e instanceof h)return e.message===n;throw e}return!1}),hr(`TLCGetOrDefault`,2,e=>{let n=K(e,0,`TLCGetOrDefault`);return Su(t,n)??K(e,1,`TLCGetOrDefault`)}),{...mr(`TLCGetAndSet`,4,n=>{let r=K(n,0,`TLCGetAndSet`),i=Su(t,r)??K(n,3,`TLCGetAndSet`),a=fr(n,1,`TLCGetAndSet`);return Cu(t,e,r,a.call([i,K(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},hr(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!wu(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw wr(gu,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return z(t.getBehavior(r).map(e=>Tu(e,n.environment)))}),hr(`CounterExample`,0,()=>t.counterExample??vu()),q(`ToTrace`,1,e=>{let t=K(e,0,`ToTrace`);if(!N(t)||!Ye(Tn(t),wt([`action`,`state`])))throw new h(`The argument of ToTrace should be a CounterExample, but instead it is:\n${W(t)}`);let n=V(Cn(t,`state`)).elements.map(e=>cn(e)??[]);return z(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),q(`TLCModelValue`,1,e=>{let t=K(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new g(`The argument of ModelValue should be a string, but instead it is:\n${W(t)}`);return Ke(t)}),jr(`TLCDefer`,1,()=>!0),q(`TLCNoOp`,1,e=>K(e,0,`TLCNoOp`)),jr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!wu(r))throw wr(_u,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||bo(Mr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new b(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),jr(`TLCCache`,2,(e,t)=>{let r=fr(e,0,`TLCCache`),a=Un(Mr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Eu(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,$c([K(e,0,`TLCFP`)])))),hr(`TLCEvalDefinition`,1,(e,t)=>{let n=K(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?xo(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new g(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${W(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new g(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return Z({kind:`Identifier`,name:n,location:r.location},t)})]},Ou=(e,t)=>[hr(`_Track`,2,e=>{let n=String(K(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,K(e,0,`_Track`)===!0?r+1:r),!0}),hr(`_Counts`,0,()=>vl(t)),hr(`_CheckName`,1,n=>{let r=String(K(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(W(vl(t),!0)),!1)}),hr(`_PrintCounts`,0,()=>(e(W(vl(t),!0)),!0))],ku=e=>String(e).padStart(2,`0`),Au=e=>`${e.getUTCFullYear()}.${ku(e.getUTCMonth()+1)}.${ku(e.getUTCDate())}.${ku(e.getUTCHours())}${ku(e.getUTCMinutes())}${ku(e.getUTCSeconds())}`,ju=e=>At([...e].map(([e,t])=>[e,z([t])])),Mu=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Nu=(e,t,n)=>{if(!e.isStarted&&Mu.has(t))throw new h(`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 Bt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Bt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Bt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,I(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,I(Au(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return bu(void 0);case`all`:return ju(e.registers);case`all:named`:return ju(yl(e))}if(t.startsWith(`s:`)){let n=yl(e).get(t);if(n===void 0)throw new h(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return I(e.properties.get(t.slice(2))??t);throw new h(`TLCGet(${t}) was undefined.`)},Pu=e=>e.length===0?[[]]:e.flatMap((t,n)=>Pu([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Fu=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&V(e).elements.forEach(Fu),e.kind===`Function`&&e.range.forEach(Fu))},Iu=(t,n)=>[q(`Print`,2,e=>(t(`${Se(W(K(e,0,`Print`),!0,!0))} ${Se(W(K(e,1,`Print`),!0,!0))}`),K(e,1,`Print`))),q(`PrintT`,1,e=>(t(Se(W(K(e,0,`PrintT`),!0,!0))),!0)),q(`Assert`,2,t=>{if(K(t,0,`Assert`)!==!0)throw new g(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Se(W(K(t,1,`Assert`)))}`,e.assertViolation);return!0}),q(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),q(`:>`,2,e=>At([[K(e,0,`:>`),K(e,1,`:>`)]])),q(`@@`,2,e=>{let t=dr(e,0,`@@`),n=dr(e,1,`@@`);return jt([...Oe(t),...Oe(n)])}),q(`ToString`,1,e=>I(W(K(e,0,`ToString`),!0))),q(`TLCEval`,1,e=>{let t=K(e,0,`TLCEval`);return Fu(t),t}),q(`Permutations`,1,e=>{let t=lr(e,0,`Permutations`);return wt(Pu(t).map(e=>At(t.map((t,n)=>[t,e[n]]))))}),mr(`SortSeq`,2,e=>{let t=fr(e,1,`SortSeq`);return z(ur(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)]},[]))}),hr(`TLCGet`,1,(e,t)=>{let r=K(e,0,`TLCGet`);if(typeof r==`number`&&r>=0){let e=n.registers.get(r);if(e===void 0)throw new h(`TLCGet(${r}) was undefined.`);return e}if(typeof r!=`string`)throw new h(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${W(r)}`);return Nu(n,r,t?.state)}),hr(`TLCSet`,2,e=>{let r=K(e,0,`TLCSet`);return Cu(n,t,r,K(e,1,`TLCSet`)),!0}),pr(`Any`,Ue),q(`RandomElement`,1,e=>gl(sr(e,0,`RandomElement`),n.getRandom()))],Lu=/* @__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(`,`),Ru=[[`\\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`,`≀`],[`^+`,`⁺`]],zu=/* @__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(`,`),Bu=/* @__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(`.`),Vu=/* @__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(`.`),Hu=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
100
+ =============================================================================`]]),Ac=`tlc2/value/impl/`,jc=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)}},Mc=e=>[...e.slice(1,e.indexOf(`)`)).matchAll(/\[*(?:L[^;]*;|[BCDFIJSZ])/g)].length,Nc=e=>{let t=jc(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:Mc(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}},Pc=(e,t)=>e[e[t].first].text,Fc=(e,t)=>{let n=e[t],r=e[n.second];return{className:Pc(e,n.first),name:e[r.first].text}},Ic=(e,t,n,r)=>{let i=()=>new re(`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=Fc(t,l());if(n.className!==`${Ac}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=Fc(t,l()),a=s();if(n.className!==`${Ac}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:Pc(t,l()),value:void 0}),e+=3;else if(n===183){let n=Fc(t,l()),a=s(),o=s();if(!(n.className===`${Ac}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()},Lc=(e,t)=>{if(!t)return e;let n=Nc(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:Ic(r,n.pool,e.name,t.location)}:t});return{...e,definitions:r}},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Rc=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),zc=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Bc=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Vc=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Hc=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Uc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...zc]),Wc=e=>Rc.has(e)||zc.has(e)||e===`-.`,Gc=(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}}},Kc=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),qc=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Jc=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Yc=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Xc=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Zc=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Qc=/* @__PURE__ */ new Set([``,`*`,`-`]),$c=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),el=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),tl=/* @__PURE__ */ new Set([`NEW`,...el.keys()]),nl=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),rl=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),il=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),al=e=>RegExp(`^-{4,}\\s*MODULE\\s+${e}\\s*-{3,}$`),ol=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>al(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
+ `)},sl=(e,t)=>{let n=de(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`||il.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)?`====`:Zc.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,ae(e,t,a,r))},ae=(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}},C=(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 C(`Expected ${JSON.stringify(e)} but found ${x(b())}`);return T()},O=()=>{let e=b();if(e.kind!==`Identifier`)throw C(`Expected an identifier but found ${x(e)}`);if(ne(e))throw C(`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},A=()=>{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},le=()=>{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)},ue=()=>{if(!E(`<<`))return{kind:`Name`,name:O()};let e=k(O);return D(`>>`),{kind:`Tuple`,names:e}},fe=()=>k(()=>{let e=k(ue);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 Te();throw C(`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(`==`,zc.has(n.text)?3:4))},j=e=>{if(!Vc.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`&&qc.has(t.text)||me(e)},he=()=>{let e=b(),n=e.kind===`Operator`&&(Rc.has(e.text)||Bc.has(e.text))&&j(e);if(t&&e.kind!==`String`&&(Bc.has(e.text)||Uc.has(e.text)&&e.text!==`'`&&!zc.has(e.text)||Hc.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)&&j(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`&&Uc.has(e.text)&&j(e)){r.index++;let t=u(e);if(zc.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:Gc(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()},ge={range:void 0},_e=()=>ce(()=>{let e=r.index;D(`(`);let t=k(he);return D(`)`),ge.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)}},M=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(A()){let e=fe();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 C(`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}}),ye=e=>ce(()=>{let t=u(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(A()&&(b(1).text===`\\in`||w(`<<`))){let e=r.index,n=ue();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=fe();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}}),be=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}},xe=e=>{let t=u(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&A()){let e=fe();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}},Se=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)}},Ce=()=>{let e=b(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Kc.has(e.text)||e.kind===`Operator`&&(Rc.has(e.text)||zc.has(e.text)||Bc.has(e.text)))},we=()=>{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:_e()}}return{kind:`Name`,name:e.text,args:w(`(`)?_e():[]}},Te=()=>{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`&&Re(n);if(o&&Fe()<0&&Pe.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?ze(n)??n.text:n.text;if(le()){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?_e():[];if(!Ce())return i?{kind:`Apply`,operator:r,args:s,argumentsRange:ge.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(;Ce();)T(),u.push(we());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=ge.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`&&Wc(n.text)&&w(`(`))return{kind:`Apply`,operator:n.text,args:_e(),location:a};switch(n.text){case`(`:{let e=ce(()=>N());return D(`)`),e}case`[`:return M(n);case`{`:return ye(n);case`<<`:return be(n);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return xe(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 Se(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`)){je();continue}let r=ke(!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=ue(),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 C(`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 Te()},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(zc.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=Rc.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},De=()=>{if(!E(`(`))return[];let e=I();return D(`)`),e},Oe=()=>{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}}},ke=e=>{let t=r.index;return v(P(e),t)},P=e=>{let t=b(),n=u(t),i=(t,r)=>({kind:`Operator`,name:t,params:r,...Oe(),isLocal:e,isRecursive:l(t),location:n});if(t.kind===`Identifier`&&b(1).kind===`Operator`&&Rc.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`&&zc.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(()=>fe());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:N(),isLocal:e,isRecursive:l(s),location:n}}let c=r.index,d=De();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:he()}}):[],isLocal:n,location:i,instanceRange:_(a)}},F=()=>{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}},I=()=>k(F),je=()=>{let e=I();return e.forEach(e=>i[i.length-1].add(e.name)),e},Me=e=>{let t={value:0,offset:e};do{let e=b(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&nl.has(e.text)&&t.value++,e.kind===`Operator`&&rl.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ne=()=>{let e=b(),t=b(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Me(1)):t.kind===`Operator`&&zc.has(t.text)?w(`==`,2):t.kind===`Operator`&&Rc.has(t.text)?b(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):w(`-.`)&&t.kind===`Identifier`&&w(`==`,2)},Pe=[],Fe=()=>Pe[Pe.length-1]??-1,Ie=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Le=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)},Re=e=>!e.text.endsWith(`.`)&&!Qc.has(Le(e)),ze=e=>{let t=Le(e);if(Qc.has(t))return;let n=Ie(e);if(n>=0)return`<${n}>${t}`;let r=Fe(),i=Pe[Pe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Be=e=>{if(e.kind===`Keyword`)return Yc.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Pe.length===0;if(e.text[1]===`+`||Pe.length===0)return!0;let t=Fe();return t>=0&&Ie(e)>t},L=e=>{let t=Ie(e),n=Pe.length-1,r=Pe[n-1]??-1,i=Pe[n]<0;return i&&(Pe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Pe[n]===t},Ve=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)),He=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!il.has(e.name)&&!Ve(e.name):!1,Ue=()=>{let e=b();return e.kind===`Step`?Re(e):e.kind===`Keyword`?$c.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ne()},We=()=>{let e=r.index;s.index=e;let t=b();return t.kind===`Operator`&&!Vc.has(t.text)&&Wc(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()},Ge=e=>o[o.length-1]?.add(e),Ke=e=>{o.push(/* @__PURE__ */ new Set);let t=e();return o.pop(),t},qe=e=>o.some(t=>t.has(e))||c.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Je=()=>{let e=r.index,t=b(),n=k(()=>{let e=b();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw C(`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)},R=()=>{if(t)return k(Je);let e=k(We),n=e.find(e=>e.kind===`Identifier`&&qe(e.name));if(n)throw S(`DEF clause entry should describe a defined operator`,n.location);return e},Ye=()=>({facts:Ue()?k(We):[],defs:E(`DEF`)||E(`DEFS`)?R():[]}),Xe=()=>{let e=r.index,n=T(),i=n.text===`USE`&&E(`ONLY`),a=_(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:i,...Ye(),keyword:a,location:u(n)},s=o.kind===`Hide`&&!t?o.facts.filter(e=>!He(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)},Ze=()=>{let e=r.index,t=u(b()),n=E(`NEW`),i=b().kind===`Keyword`?el.get(b().text):void 0;if(!n&&i===void 0)throw C(`Expected a declaration but found ${x(b())}`);if(i!==void 0&&T(),i===`Variable`){let n=O();return Ge(n),v({kind:`NewSymbol`,name:n,arity:0,level:i,set:void 0,location:t},e)}let a=F();Ge(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)},Qe=()=>{let e=r.index,t=u(D(`ASSUME`)),n=k(()=>w(`ASSUME`)?Ke(Qe):b().kind===`Keyword`&&tl.has(b().text)?Ze():N());return D(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:N(),location:t},e)},z=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)},$e=(e,t)=>{e.forEach(Ge),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Ge))},et=()=>{let e=b();if(w(`USE`)||w(`HIDE`))return Xe();if(w(`INSTANCE`))return v(Ae(void 0,[],!1,u(e)),r.index);if(w(`DEFINE`)||Ne()){let t=r.index;E(`DEFINE`);let n=[ke(!1)];for(;Ne();)n.push(ke(!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=A(),t=e?[]:k(O),n=e?fe():[];return $e(t,n),{kind:`Take`,names:t,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:k(()=>N())};if(E(`PICK`)){let e=z(`:`),t=e?k(O):[],n=e?[]:fe();return $e(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`)?Qe():N()}},tt=e=>{let t=b();if(t.kind!==`Step`)throw C(`Expected a step number but found ${x(t)}`,t);if(!L(t))throw S(`${e?`QED step`:`step`}'s number has bad level`,t);if(Ie(t)<0&&ze(t)!==void 0)throw S(`<*> and <+> cannot be used for a named step`,t);return r.index++,{name:ze(t),token:t.text,location:u(t)}},nt=()=>{let e=r.index,t=tt(w(`QED`,1)),n=/* @__PURE__ */ new Set;o.push(n);let i=E(`QED`)?{kind:`Qed`}:et(),a=_(e),s=Be(b());if(s&&!Xc.has(i.kind))throw S(`Proof of a step that does not take a proof`);let c=s?it():void 0;return o.pop(),(i.kind!==`Assert`||i.isSuffices)&&n.forEach(Ge),v({...t,body:i,head:a,proof:c},e)},rt=()=>{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`),...Ye(),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=[nt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(nt());return{kind:`Steps`,level:Fe(),steps:n,location:e}},it=()=>{let e=r.index;Pe.push(-1);let t=Ke(rt);return Pe.pop(),v(t,e)},at=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=Ke(()=>({statement:w(`ASSUME`)?Qe():N(),proof:Be(b())?it():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))},ot=()=>{let e=r.index;return v(st(),e)},st=()=>{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}},ct=()=>{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=ct();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=I();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=ot();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=Xe();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:je()});continue;case`INSTANCE`:lt(n,v(Ae(void 0,[],!1,u(o)),a));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){lt(n,v(Ae(void 0,[],!0,u(o)),a));continue}lt(n,ke(!0));continue}o.kind===`Keyword`&&Jc.has(o.text)?at(n):lt(n,ke(!1))}}},lt=(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 ct()},cl=e=>sl(e,!1),ll=e=>sl(e,!0),ul=25214903917n,dl=(1n<<48n)-1n,fl=2147483647,pl=e=>{let t={value:(BigInt.asUintN(64,e)^ul)&dl},n=e=>(t.value=t.value*ul+11n&dl,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^ul)&dl},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<=fl)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},ml=10454148508367108822n,hl=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:ml);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),gl=Int32Array.from(hl,e=>Number(BigInt.asIntN(32,e>>32n))),_l=Int32Array.from(hl,e=>Number(BigInt.asIntN(32,e))),vl=Number(BigInt.asIntN(32,ml>>32n)),yl=Number(BigInt.asIntN(32,ml));let bl=vl,xl=yl;const Sl=e=>{let t=(e^xl)&255;xl=(xl>>>8|bl<<24)^_l[t],bl=bl>>>8^gl[t]},Cl=e=>{for(let t=0;t<32;t+=8)Sl(e>>>t)},wl=e=>{if(typeof e==`boolean`)Sl(0),Sl(e?116:102);else if(typeof e==`number`)Sl(1),Cl(e);else if(typeof e==`string`){Sl(3),Cl(e.length);for(let t=0;t<e.length;t++)Sl(e.charCodeAt(t))}else if(I(e))Sl(21),Cl(qe(e.name)+1);else if(F(e)){let t=W(e);Sl(9),Cl(t.domain.length);for(let e=0;e<t.domain.length;e++)wl(t.domain[e]),wl(t.range[e])}else{let t=H(e).elements;Sl(5),Cl(t.length);for(let e of t)wl(e)}},Tl=e=>{let t={high:bl,low:xl};bl=vl,xl=yl;for(let t of e)wl(t);let n=BigInt(bl>>>0)<<32n|BigInt(xl>>>0);return bl=t.high,xl=t.low,n},El=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||I(e))return 5;if(typeof e==`string`)return 5+e.length;if(F(e)){let t=W(e);return t.domain.reduce((e,n,r)=>e+El(n)+El(t.range[r]),5)}return H(e).elements.reduce((e,t)=>e+El(t),5)},Dl=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){bl=n<32?0:1<<n-32,xl=n<32?1<<n:0;for(let t=0;t<e;t++)Sl(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]^bl,t[n+1]=t[a+1]^xl}}return t},Ol=(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=El(e);return bl=0,xl=0,wl(e),r.set(e,i.length),i.push(n,bl,xl),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:bl,low:xl},c={high:vl,low:yl};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}bl=s.high,xl=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},kl=[],Al=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},jl=()=>{for(let e=1277011;kl.length<1341;e++)Al(e)&&kl.push(e);return kl},Ml=e=>{let t=jl(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Nl=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},Pl=e=>{for(let t=Math.max(e,9);;t++){let e=Nl(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)}}},Fl=(e,t,n)=>{if(t<=0)return[];let r=Pl(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Ml(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Il=(1n<<63n)-1n-24n,Ll=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Il*BigInt(n)+i)%t;return r<0n?r+t:r})},Rl=(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,zl=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Kt(e.domain),n=H(e.range).elements;return{lists:t.map(()=>n),create:e=>nt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>H(e).elements),create:t=>Jt(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>H(e).elements),create:B}}},Bl=(e,t,n)=>{if(U(t))return[];if(typeof t==`object`&&t.kind===`Interval`)return Fl(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let r=zl(t);if(r){let t=r.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(fl)?Ll(e,t,n):Fl(e,Number(t),n)).map(e=>r.create(Rl(r.lists,e)))}let i=H(t).elements;return Fl(e,i.length,n).map(e=>i[Number(e)])},Vl=(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},Hl=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Kt(e.domain)];return nt(n,n.map(()=>Hl(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Jt(e.names.map((n,r)=>[n,Hl(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return B(e.factors.map(e=>Hl(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 Vl(H(e).elements,t)},Ul=(e,t=0n)=>{let n=pl(t),r={random:pl(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Jt([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Tl,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},Wl=e=>Rt([...e.possibleCounts].map(([e,t])=>[e,t])),Gl=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Wl(e)]]),Kl=(e,t,n)=>new y(`Applying ${e} to the following value,\nwhich is not ${t}:\n${G(n)}`),ql=(e,t,n,r)=>new y(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${G(r)}`),Jl=e=>F(e)?W(e):void 0,Yl=(e,t,n)=>{let r=q(e,t,n),i=Jl(r);if(!i)throw Kl(n,`a function with a finite domain`,r);return i},Xl=(e,t,n)=>{let r=q(e,t,n),i=Jl(r);if(!i)throw ql(t===0?`first`:`second`,n,`bag`,r);return i},Zl=(e,t)=>{if(!P(e)||!V(e))throw t();return H(e).elements},Ql=e=>e.range.every(e=>typeof e==`number`&&e>0),$l=(e,t)=>{let n=e.domain.findIndex(e=>rt(e,t));return n===-1?void 0:e.range[n]},eu=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,tu=eu(`BagDiff`,`tlc2.value.impl.Value`,2),nu=eu(`SqSubseteq`,`tlc2.value.IBoolValue`,2),ru=eu(`BagUnion`,`tlc2.value.impl.Value`,1),iu=eu(`BagOfAll`,`tlc2.value.impl.Value`,2),au=eu(`BagCup`,`tlc2.value.impl.Value`,2),ou=eu(`BagCardinality`,`tlc2.value.impl.IntValue`,1),su=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Fr(e)}`;throw Lr(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')`)},cu=(e,t,n)=>{let r=su(e,n)+su(t,n);if(Ar(r))throw jr(`${e}+${t}`);return r},lu=(e,t,n,r)=>{let i=$l(n,e.domain[t]),a=su(e.range[t],r);return i===void 0?a:a-su(i,r)|0},uu=(e,t)=>Rt(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>rt(e[0],r));a?a[1]=cu(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),du=nt([],[]),fu=[Er(`EmptyBag`,du),J(`IsABag`,1,e=>{let t=Jl(q(e,0,`IsABag`));return t!==void 0&&Ql(t)}),J(`BagCardinality`,1,e=>{let t=q(e,0,`BagCardinality`);return Yl(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Kl(`BagCardinality`,`a bag`,t);return cu(e,n,ou)},0)}),J(`BagIn`,2,e=>{let t=q(e,1,`BagIn`),n=$l(Yl(e,1,`BagIn`),q(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw ql(`second`,`BagIn`,`bag`,t);return n>0}),J(`CopiesIn`,2,e=>{let t=q(e,1,`CopiesIn`),n=$l(Yl(e,1,`CopiesIn`),q(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw ql(`second`,`CopiesIn`,`bag`,t);return n}),J(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Xl(e,t,`(+)`);if(!Ql(n))throw ql(t===0?`first`:`second`,`(+)`,`bag`,q(e,t,`(+)`));return n});return uu(t,au)}),J(`\\ominus`,2,e=>{let t=Xl(e,0,`(-)`),n=Xl(e,1,`(-)`);return Rt(t.domain.flatMap((e,r)=>{let i=lu(t,r,n,tu);return i>0?[[e,i]]:[]}))}),J(`BagUnion`,1,e=>{let t=q(e,0,`BagUnion`),n=Zl(t,()=>Kl(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??du;let r=n.map(e=>{let n=Jl(e);if(!n)throw new y(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${G(t)}`);return n});return uu(r,ru)}),J(`\\sqsubseteq`,2,e=>{let t=Yl(e,0,`\\sqsubseteq`),n=Yl(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>lu(t,r,n,nu)<=0)}),Dr(`BagOfAll`,2,e=>{let t=Tr(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${G(t.literalBody)}`);let n=q(e,1,`BagOfAll`),r=Jl(n);if(!r)throw ql(`second`,`BagOfAll`,`function with a finite domain`,n);return uu(r.domain.map((e,n)=>nt([t.call([e])],[r.range[n]])),iu)}),J(`SubBag`,1,e=>{let t=q(e,0,`SubBag`);if(!F(t))throw new v(`DOMAIN expects a function but received ${G(t)}`);let n=W(t),r=Mt(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${G(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 ${G(n)}, which is not in its domain`);return Mt(n.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:a[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>nt(e.map(e=>e[0]),e.map(e=>e[1]))))}),J(`BagToSet`,1,e=>Fn(Yl(e,0,`BagToSet`))),J(`SetToBag`,1,e=>{let t=q(e,0,`SetToBag`),n=Zl(t,()=>Kl(`BagToSet`,`a function with a finite domain`,t));return nt([...n],n.map(()=>1))})],pu=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,mu=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,hu=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,gu=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,_u=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,vu=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,yu=e=>{if(!F(e))return!1;let t=W(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},bu=(e,t)=>Lr(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Fr(t)}`),xu=(e,t)=>Lr(e,`Cannot cast tlc2.value.impl.${Fr(t)} to tlc2.value.impl.StringValue`),Su=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Cu=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw bu(t,e);return`[${H(e).elements.map(e=>Tu(e,t)).join(`,`)}]`},wu=(e,t)=>{let n=W(e),r=_n(n);return r?`[${r.map(e=>Tu(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Su(typeof e==`string`?e:G(e))}:${Tu(n.range[r],t)}`).join(`,`)}}`},Tu=(e,t)=>typeof e==`string`?Su(e):typeof e==`object`?e.kind===`ModelValue`?Su(e.name):P(e)?Cu(e,t):wu(e,t):String(e),Eu=e=>{if(P(e))return Cu(e,pu);if(!F(e)||yu(e))throw bu(pu,e);return wu(e,pu)},Du=e=>{if(!F(e))throw bu(mu,e);return wu(e,mu)},Ou=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))},ku=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Ge(e);if(Array.isArray(e))return B(e.map(e=>ku(e,t)));if(typeof e==`object`&&e)return Jt(Object.entries(e).map(([e,n])=>[Ge(e),ku(n,t)]));throw Lr(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Au=(e,t)=>{if(e.trim()===``)return ku(null,t);try{return ku(JSON.parse(e,(e,t,n)=>typeof t==`number`?Ou(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Lr(t,e.message):e}},ju=(e,t)=>{if(typeof e!=`string`)throw xu(t,e);return e},Mu=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Lr(n,`${t} (No such file or directory)`);return r},Nu=e=>[Or(`ToJson`,1,e=>Ge(Tu(q(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Or(`ToJsonArray`,1,e=>Ge(Eu(q(e,0,`ToJsonArray`)))),Or(`ToJsonObject`,1,e=>Ge(Du(q(e,0,`ToJsonObject`)))),Or(`JsonSerialize`,2,t=>{let n=ju(q(t,0,`JsonSerialize`),hu),r=q(t,1,`JsonSerialize`);if(!_n(r)&&!yu(r))throw new y(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${G(r)}`);return e.writeFile?.(n,Tu(r,hu)),!0}),Or(`ndJsonSerialize`,2,t=>{let n=ju(q(t,0,`ndJsonSerialize`),gu),r=q(t,1,`ndJsonSerialize`),i=_n(r);if(!i)throw new y(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${G(r)}`);return e.writeFile?.(n,i.map(e=>`${Tu(e,gu)}\n`).join(``)),!0}),Or(`JsonDeserialize`,1,t=>{let n=ju(q(t,0,`JsonDeserialize`),_u);return Au(Mu(e,n,_u),_u)}),Or(`ndJsonDeserialize`,1,t=>{let n=ju(q(t,0,`ndJsonDeserialize`),vu);return B(Mu(e,n,vu).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Au(e,vu)))})],Pu=(e,t,n,r)=>new y(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Fu=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Pu(t,n,`nonnegative integer`,G(e));return e},Iu=(e,t,n,r)=>{if(!P(e)||!V(e))throw Pu(t,n,r,G(e));return H(e).elements},Lu=(e,t,n,r)=>Mt(Array.from({length:t},()=>Mt(e.filter(()=>r.nextDouble()<n)))),Ru=(e,t)=>{let n=`RandomSetOfSubsets`,r=Fu(q(e,0,n),`first`,n),i=Fu(q(e,1,n),`second`,n),a=Iu(q(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Pu(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Pu(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Lu(a,r,a.length===0?0:i/a.length,t.getRandom())},zu=e=>[Or(`RandomSubset`,2,t=>{let n=q(t,0,`RandomSubset`);if(typeof n!=`number`)throw Pu(`first`,`RandomSubset`,`nonnegative integer`,G(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=q(t,1,`RandomSubset`);if(!P(r)||!U(r)&&!V(r))throw Pu(`second`,`RandomSubset`,`a finite set`,G(r));return Mt(Bl(n,r,e.getRandom()))}),Or(`RandomSetOfSubsets`,3,t=>Ru(t,e)),Or(`TestRandomSetOfSubsets`,3,t=>B(Array.from({length:5},()=>H(Ru(t,e)).elements.length)))],Bu=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Vu=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Bu})`,Hu=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Bu}) throws java.io.IOException`,Uu=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Bu})`,Wu=()=>Jt([[`action`,Mt([])],[`state`,Mt([])]]),Gu=()=>Jt([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Ku=e=>Jt([[`name`,e??`UnnamedAction`],[`location`,Gu()]]),qu=(e,t)=>{let n=e.map((e,t)=>B([t+1,Jt(Object.entries(e.state))])),r=n.slice(1).map((t,r)=>B([n[r],Ku(e[r+1].action),t])),i=t?[B([n[n.length-1],Ku(t.action),n[t.start]])]:[];return Jt([[`action`,Mt([...r,...i])],[`state`,Mt(n)]])},Ju=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Gl(e).get(t)},Yu=(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),G(r));else throw new y(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${G(n)}`)},Xu=e=>e.every(e=>e!==void 0),Zu=(e,t)=>Jt(t.variables.map((t,n)=>[t,e[n]])),Qu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!K(e)){if(t.variableIndex.has(r))return!0;let e=Bo(r,t);if(e&&!n.has(e)&&(n.add(e),Qu(e.body,t,n)))return!0}return pr(e).some(e=>Qu(e,t,n))},$u=(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[J(`AssertEq`,2,t=>{let n=q(t,0,`AssertEq`),r=q(t,1,`AssertEq`),i=rt(n,r);return i||(e(G(`Assertion failed`,!0)),e(G(n,!0)),e(G(r,!0))),i}),Wr(`AssertError`,2,e=>{let t=Tr(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Lr(Vu,`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=Gr(e,0,`AssertError`)();try{Gr(e,1,`AssertError`)()}catch(e){if(e instanceof v)return e.message===n;throw e}return!1}),Or(`TLCGetOrDefault`,2,e=>{let n=q(e,0,`TLCGetOrDefault`);return Ju(t,n)??q(e,1,`TLCGetOrDefault`)}),{...Dr(`TLCGetAndSet`,4,n=>{let r=q(n,0,`TLCGetAndSet`),i=Ju(t,r)??q(n,3,`TLCGetAndSet`),a=Tr(n,1,`TLCGetAndSet`);return Yu(t,e,r,a.call([i,q(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Or(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Xu(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Lr(Hu,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return B(t.getBehavior(r).map(e=>Zu(e,n.environment)))}),Or(`CounterExample`,0,()=>t.counterExample??Wu()),J(`ToTrace`,1,e=>{let t=q(e,0,`ToTrace`);if(!F(t)||!rt(Fn(t),Mt([`action`,`state`])))throw new v(`The argument of ToTrace should be a CounterExample, but instead it is:\n${G(t)}`);let n=H(Nn(t,`state`)).elements.map(e=>_n(e)??[]);return B(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),J(`TLCModelValue`,1,e=>{let t=q(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new y(`The argument of ModelValue should be a string, but instead it is:\n${G(t)}`);return et(t)}),Wr(`TLCDefer`,1,()=>!0),J(`TLCNoOp`,1,e=>q(e,0,`TLCNoOp`)),Wr(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Xu(r))throw Lr(Uu,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||zo(Gr(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new re(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Wr(`TLCCache`,2,(e,t)=>{let r=Tr(e,0,`TLCCache`),a=nr(Gr(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Qu(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}),J(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Tl([q(e,0,`TLCFP`)])))),Or(`TLCEvalDefinition`,1,(e,t)=>{let n=q(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?Bo(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${G(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 Z({kind:`Identifier`,name:n,location:r.location},t)})]},ed=(e,t)=>[Or(`_Track`,2,e=>{let n=String(q(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,q(e,0,`_Track`)===!0?r+1:r),!0}),Or(`_Counts`,0,()=>Wl(t)),Or(`_CheckName`,1,n=>{let r=String(q(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(G(Wl(t),!0)),!1)}),Or(`_PrintCounts`,0,()=>(e(G(Wl(t),!0)),!0))],td=e=>String(e).padStart(2,`0`),nd=e=>`${e.getUTCFullYear()}.${td(e.getUTCMonth()+1)}.${td(e.getUTCDate())}.${td(e.getUTCHours())}${td(e.getUTCMinutes())}${td(e.getUTCSeconds())}`,rd=e=>Rt([...e].map(([e,t])=>[e,B([t])])),id=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),ad=(e,t,n)=>{if(!e.isStarted&&id.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 Jt([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Jt([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Jt([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Ge(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Ge(nd(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Ku(void 0);case`all`:return rd(e.registers);case`all:named`:return rd(Gl(e))}if(t.startsWith(`s:`)){let n=Gl(e).get(t);if(n===void 0)throw new v(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Ge(e.properties.get(t.slice(2))??t);throw new v(`TLCGet(${t}) was undefined.`)},od=e=>e.length===0?[[]]:e.flatMap((t,n)=>od([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),sd=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&H(e).elements.forEach(sd),e.kind===`Function`&&e.range.forEach(sd))},cd=(t,n)=>[J(`Print`,2,e=>(t(`${Ee(G(q(e,0,`Print`),!0,!0))} ${Ee(G(q(e,1,`Print`),!0,!0))}`),q(e,1,`Print`))),J(`PrintT`,1,e=>(t(Ee(G(q(e,0,`PrintT`),!0,!0))),!0)),J(`Assert`,2,t=>{if(q(t,0,`Assert`)!==!0)throw new y(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Ee(G(q(t,1,`Assert`)))}`,e.assertViolation);return!0}),J(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),J(`:>`,2,e=>Rt([[q(e,0,`:>`),q(e,1,`:>`)]])),J(`@@`,2,e=>{let t=wr(e,0,`@@`),n=wr(e,1,`@@`);return zt([...Fe(t),...Fe(n)])}),J(`ToString`,1,e=>Ge(G(q(e,0,`ToString`),!0))),J(`TLCEval`,1,e=>{let t=q(e,0,`TLCEval`);return sd(t),t}),J(`Permutations`,1,e=>{let t=Sr(e,0,`Permutations`);return Mt(od(t).map(e=>Rt(t.map((t,n)=>[t,e[n]]))))}),Dr(`SortSeq`,2,e=>{let t=Tr(e,1,`SortSeq`);return B(Cr(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)]},[]))}),Or(`TLCGet`,1,(e,t)=>{let r=q(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${G(r)}`);return ad(n,r,t?.state)}),Or(`TLCSet`,2,e=>{let r=q(e,0,`TLCSet`);return Yu(n,t,r,q(e,1,`TLCSet`)),!0}),Er(`Any`,Ze),J(`RandomElement`,1,e=>Hl(br(e,0,`RandomElement`),n.getRandom()))],ld=/* @__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(`,`),ud=[[`\\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`,`≀`],[`^+`,`⁺`]],dd=/* @__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(`,`),fd=/* @__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(`.`),pd=/* @__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(`.`),md=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
100
103
  Nat == { }
101
104
  a+b == {a, b}
102
105
  a-b == CHOOSE n : b + n = a
@@ -412,16 +415,16 @@ _CheckName(name) ==
412
415
  => (PrintT(counts) /\\ FALSE)
413
416
  _PrintCounts == PrintT(_Counts)
414
417
  =============================================================================
415
- `]]),Uu=/* @__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)`]])]]),Wu=(e,t)=>e.every(e=>dn(e,t)),Gu=wt([!1,!0]),Ku=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return kt(Ku(e,t,r),Ku(e,r,n))},qu=[`\\cup`,`\\cap`,`\\`],Ju=e=>typeof e==`object`&&e.kind===`MixedSet`,Yu=e=>e.kind===`Interval`?V(e).elements:e.elements,Xu=(e,t,n)=>{let r=Yu(t);if(e!==`\\cup`){let t=e===`\\cap`;return Tt(r.filter(e=>dn(e,n)===t))}if(r.length===0)return n;if(!Ce(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=V(n).elements.filter(e=>!dn(e,t));return Tt([...r,...i])},Zu=[pr(`TRUE`,!0),pr(`FALSE`,!1),pr(`BOOLEAN`,Gu),pr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),gr(`=`,St),gr(`#`,(e,t)=>!St(e,t)),q(`~`,1,e=>!ar(e,0,`~`)),q(`<=>`,2,e=>ar(e,0,`<=>`)===ar(e,1,`<=>`)),q(`/\\`,2,e=>ar(e,0,`/\\`)&&ar(e,1,`/\\`)),q(`\\/`,2,e=>ar(e,0,`\\/`)||ar(e,1,`\\/`)),q(`=>`,2,e=>!ar(e,0,`=>`)||ar(e,1,`=>`)),q(`\\in`,2,e=>dn(K(e,0,`\\in`),K(e,1,`\\in`))),q(`\\notin`,2,e=>!dn(K(e,0,`\\notin`),K(e,1,`\\notin`))),q(`\\subseteq`,2,e=>{let t=or(e,0,`\\subseteq`),n=or(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&B(t.base)?Wu(V(t.base).elements,n.base):Wu(V(t).elements,n)}),...qu.map(e=>q(e,2,t=>{let n=or(t,0,e),r=or(t,1,e);return Ce(n)&&Ce(r)&&!Ju(n)&&!Ju(r)?e===`\\cup`&&H(n)?r:(e===`\\cup`?kt:e===`\\cap`?Ot:Dt)(V(n),V(r)):Ce(n)?Xu(e,n,r):e!==`\\`&&Ce(r)?Xu(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),q(`SUBSET`,1,e=>({kind:`Subset`,base:or(e,0,`SUBSET`)})),q(`UNION`,1,e=>{let t=or(e,0,`UNION`),n=ut(t)?t.elements.filter(ut):[];if(!ut(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Ju(t)||n.some(Ju)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{dn(t,e)||e.elements.push(t)})),Tt(e.elements)}return n.length===0?Et:Ku(n.map(V),0,n.length)}),q(`DOMAIN`,1,e=>{let t=K(e,0,`DOMAIN`);if(!N(t))throw new h(`DOMAIN expects a function but received ${W(t)}`);return Tn(t)})],Qu=Dr(`DotDot`,`IntervalValue`,2),$u=Dr(`Neg`,`IntValue`,1),ed=[pr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),Or(`+`,`Plus`,(e,t)=>e+t),Or(`-`,`Minus`,(e,t)=>e-t),Or(`*`,`Times`,(e,t)=>e*t),Or(`^`,`Expt`,(e,t)=>{if(t<0)throw new g(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new g(`0^0 is undefined.`);return e**t}),Or(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new g(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(_r(n))throw vr(`${e} \\div ${t}`);return n}),Or(`%`,`Mod`,(e,t)=>{if(t<=0)throw new g(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),Ar(`<`,(e,t)=>e<t),Ar(`>`,(e,t)=>e>t),Ar(`<=`,(e,t)=>e<=t),Ar(`>=`,(e,t)=>e>=t),q(`..`,2,e=>({kind:`Interval`,low:Er(K(e,0,`..`),Qu),high:Er(K(e,1,`..`),Qu)}))],td=[pr(`Int`,{kind:`InfiniteSet`,name:`Int`}),q(`-.`,1,e=>{let t=Er(K(e,0,`-`),$u);if(_r(-t))throw vr(`-${t}`);return-t})],nd=(e,t,n)=>{let r=K(e,t,n),i=cn(r);if(!i)throw new g(`${n}\n${W(r)}`);return i},rd=(e,t,n)=>{let r=K(e,t,n);return typeof r==`string`?r:nd(e,t,n)},id=(e,t,n)=>typeof e==`string`?I(e.slice(t,n)):z(e.slice(t,n)),ad=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,od=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,sd=(e,t)=>{let n=Uu.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Tr(e,t):e}):t},cd=sd(`Sequences`,[q(`Seq`,1,e=>({kind:`SequenceSet`,base:K(e,0,`Seq`)})),q(`Len`,1,e=>rd(e,0,ad(``,`Len`)).length),q(`\\o`,2,e=>{let t=rd(e,0,od(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=nd(e,1,od(`t \\o s`,`sequence`));return z([...t,...n])}let n=K(e,1,`\\o`);if(typeof n!=`string`)throw new g(`${od(`t \\o s`,`string`)}\n${W(n)}`);return I(t+n)}),q(`Append`,2,e=>z([...nd(e,0,od(`Append(s, v)`,`sequence`)),K(e,1,`Append`)])),q(`Head`,1,e=>{let t=nd(e,0,ad(``,`Head`));if(t.length===0)throw new g(`Attempted to apply Head to the empty sequence.`);return t[0]}),q(`Tail`,1,e=>{let t=rd(e,0,ad(``,`Tail`));if(t.length===0)throw new g(`Attempted to apply Tail to the empty sequence.`);return id(t,1)}),q(`SubSeq`,3,e=>{let t=rd(e,0,ad(`first `,`SubSeq`)),n=ir(e,1,`SubSeq`),r=ir(e,2,`SubSeq`);if(n>r)return id(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new g(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${W(K(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return id(t,n-1,r)}),mr(`SelectSeq`,2,e=>{let t=fr(e,1,`SelectSeq`);return z(nd(e,0,ad(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new g(`The second argument of SelectSeq should be a operator, but instead it is:\n${W(n)}`);return n}))})]),ld=sd(`FiniteSets`,[q(`IsFiniteSet`,1,e=>{let t=K(e,0,`IsFiniteSet`);if(M(t))return on(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new h(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${W(t)}\nis a finite set.`:`Attempted to check if the ${we(t)} ${W(t)} is a finite set.`)}),q(`Cardinality`,1,e=>{let t=K(e,0,`Cardinality`);if(!M(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new g(`Attempted to compute cardinality of the value\n${W(t)}`);return rn(t)})]),ud=/* @__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`]]]),dd=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:ed};case`Integers`:return{extends:[`Naturals`],operators:td};case`Sequences`:return{extends:[],operators:cd};case`FiniteSets`:return{extends:[],operators:ld};case`TLC`:return{extends:[],operators:sd(`TLC`,Iu(t,n))};case`Randomization`:return{extends:[],operators:pu(n)};case`_Possible`:return{extends:[],operators:Ou(t,n)};case`Json`:return{extends:[],operators:su(r)};case`Bags`:return{extends:[],operators:Bl};case`TLCExt`:return{extends:[],operators:Du(t,n)};default:return}},fd=`$subexpression`,pd=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),md=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),hd=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,gd=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}},_d=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:ti(e.bounds),body:e.body,sets:md(e.bounds)};case`SetMap`:return{names:ti(e.bounds),body:e.expression,sets:md(e.bounds)};case`SetFilter`:return{names:ei(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:ei(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}},vd=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return vd(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of er(e)){let e=vd(r,t,n);if(e)return e}},yd=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,bd=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),xd=(e,t)=>{let n=e.location,r=bd(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 pd(`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 pd(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:fd,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:fd,args:e.args,location:n,resolution:Wr},location:n}},Sd=(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:Wr})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Wr}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Wr};return xd({...t,params:[...t.params,...r]},a)},Cd=(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 pd(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>Li(e)===l):t(l);if(u)return{definition:u,args:yd(s,Yr(u),r)};a.index++}throw pd(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=Yr(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw pd(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw pd(`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&&vd(a.current,t.name,[]);if(!o)throw pd(`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(...yd(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw pd(`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`||hd(t.operand,1)!==0)throw pd(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=_d(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(...yd(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[hd(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw pd(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=hd(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw pd(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw pd(`Unexpected subexpression selector`,n);let c=s?s.sets:gd(o),u=c?.[hd(t.operand,c.length)];if(!u)throw pd(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return Sd(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 pd(`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 Sd(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw pd(`Subexpression selection failed`,n);return xd(i,a.current)},wd=(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:[]}))]},Td=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||er(e).some(Td),Ed=(e,t)=>{if(!Td(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return Bi(e,e=>Ed(e,n))}let n=Bi(e,e=>Ed(e,t));if(n.kind===`Subexpression`)return Cd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=wd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=Cd(i,t,n.location,a);if(a.length>0)throw pd(`Too many arguments for ${r}`,n.location);return o},Dd=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Od=(e,t)=>{let n=Dd(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:Ed(e.expression,n)}))}},kd=(e,t)=>{let n=Dd([...t,...e.definitions]);return e.definitions.some(e=>Td(e.body))||e.assumptions.some(e=>Td(e.expression))?{...e,definitions:e.definitions.map(e=>zi(e,e=>Ed(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:Ed(e.expression,n)}))}:e},Ad=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}])),jd=(e,t)=>`${e}${t}`,Md=(e,t,n)=>`${e}${t}${n}`,Nd=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Pd=(e,t,n)=>`${e},${t},${n}`,Fd=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Id=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ld=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Rd=(e,t,n,r)=>({...Fd(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),zd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Bd=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Vd=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,{...Rd(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Hd=Rd(`$Set`,0,[2],[1]),Ud=Rd(`$Junction`,0,[3],[1]),Wd=Rd(`$Choose`,0,[2],[1]),Gd=Rd(`$Function`,0,[3],[1]),Kd=Rd(`$FcnApply`,0,[2,2],[1,1]),qd=Rd(`$RcdSelect`,0,[2,0],[1,1]),Jd=Rd(`'`,2,[1],[0]),Yd=Rd(`ENABLED`,1,[2],[0]),Xd=Rd(`[]`,3,[3],[0]),Zd=Rd(`$SquareAct`,2,[2,1],[0,0]),Qd=Rd(`$WF`,3,[1,2],[0,0]),$d=Rd(`$TemporalExists`,3,[3],[0]),ef=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),tf=e=>e.map(e=>({name:e,arity:0})),nf=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),rf=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),af=e=>e.kind!==`Let`&&e.kind!==`Label`,of=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:_(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:_(i,/* @__PURE__ */ new Map)};let a=Vd.get(t)??Ad.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Fd(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(Md(e,n,t))}),t.data.constraints.forEach((e,t)=>Id(r.constraints,t,e)),Ld(r.argConstraints,jd(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ld(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>zd(e,n))throw new p(`Level error in applying operator ${e.name}: The 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}: The 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(Pd(t,n,r)),s=Fd(Math.max(e.level,...t.filter((t,n)=>Bd(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)=>{Bd(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)=>Id(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Id(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Id(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Id(s.constraints,t,zd(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=>Id(s.constraints,e,zd(r,a)))}))}),e.argParams.forEach(e=>{let t=Nd(e),n=a(t.operator)?.operator;n&&Id(s.constraints,t.param,zd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ld(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Ld(s.argConstraints,jd(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Ld(s.argConstraints,jd(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Nd(e),n=a(t.operator);n&&Ld(s.argConstraints,jd(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Nd(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Nd(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Md(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(Md(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(Md(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,tf(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=Fd();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=ef(n,tf(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 nf(`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 nf(`Action used where only temporal formula or state predicate allowed`,e.location);rf.has(e.operator)&&l(t,e.location)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&af(n)&&n.kind!==r)throw nf(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e.location)},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=_(e,n);t.constraints.forEach((e,t)=>Id(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ld(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Fd();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.location),i(Ud,n)}case`Prime`:case`Unchanged`:return s(Jd,[e.expression],t);case`Enabled`:return s(Yd,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(Xd,[n])}case`If`:return s(Ud,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Ud,[...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(Ud,[e.body],t,e.bounds.map(e=>e.set),ti(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw nf(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?$d:Ud,[e.body],t,[],e.names);case`Choose`:return s(Wd,[e.body],t,e.set?[e.set]:[],ei(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Hd,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Hd,[e.predicate],t,[e.bound.set],ei(e.bound.pattern));case`SetMap`:return s(Hd,[e.expression],t,e.bounds.map(e=>e.set),ti(e.bounds));case`FunctionConstruction`:return s(Gd,[e.body],t,e.bounds.map(e=>e.set),ti(e.bounds));case`Record`:return s(Gd,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Hd,e.fields.map(e=>e.value),t);case`Except`:return s(Hd,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Kd,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Hd,e.args,t)}]);case`FieldAccess`:return i(qd,[a(e.record,t),{data:Fd()}]);case`BoxAction`:case`AngleAction`:return s(Zd,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Qd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Fd()}},h=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>h(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 er(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,ef(t,tf(e.names))),i;default:return Bi(e,(e,n)=>(a(e,r,ef(t,tf(n))),e)),i}},g=(e,t,n,r)=>{let i=ef(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...Fd(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(jd(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(Md(e.name,n,t.name))).map(e=>Pd(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(Nd(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Nd(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Fd(),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=g(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:a}},sf=(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`?sf(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},cf=(e,t)=>{let n=of(t);e.definitions.filter(e=>!e.name.includes(`!`)).forEach(e=>n.analyzeDefinition(e,/* @__PURE__ */ new Map)),e.assumptions.forEach(e=>n.analyze(e.expression,/* @__PURE__ */ new Map)),e.theorems.forEach(e=>e.statement.kind===`AssumeProve`?sf(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},lf=(e,t)=>e.maxLevels[t]??3,uf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=of({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=>Id(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Id(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ld(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Nd(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(jd(t.name,a));o!==void 0&&lf(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=Nd(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=lf(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(`
416
- `))},df=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],ff=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),pf=new Map(Ru.flatMap(e=>e.map(t=>[t,e[0]]))),mf=e=>pf.get(e)??e,hf=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},gf=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(hf(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()}},_f=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),vf=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:mf(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:mf(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}},yf=(e,t)=>{let n=[];for(let r=t;;){let t=vf(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},bf=e=>({line:e.line,column:e.column}),xf=(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=yf(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},Sf=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Cf={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},wf=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Sf(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Sf(e[n+1],e[n+2])?n+=Sf(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=>Cf[e])}"`:r.text)}return t},Tf=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},Ef=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Ef(e.modules,t)).find(Boolean),Df=(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:Hu.get(i)??t?.(i)??Pc(e,i),s=o===void 0?[]:se(o),c=Tf(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Ic(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>Ef(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},Of=(e,t,n)=>{let r=Df(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=yf(t,e+1);r.push({location:bf(t[e]),apply:e=>i.forEach(t=>e.put(_f(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:bf(u),apply:t=>t.put(_f(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`&&yf(t,l+1).every(e=>s.has(e))&&a(l,`definition`),ff.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(bf(u)),r.push({location:bf(u),apply:e=>e.put(_f(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(_f(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=mf(e.name);r.push({location:e.location,apply:n=>n.put(_f(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(_f(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(_f(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Jr(e.location,t.location)?-1:+!!Jr(t.location,e.location))},a=/* @__PURE__ */ new Map,o=e=>{let t=a.get(e??``);if(t)return t;let n=gf();a.set(e??``,n),Lu.toReversed().forEach(e=>n.put(_f(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()},kf=(e,t,n)=>{let r=Df(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)}),zu.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=xf(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;wf(s(void 0)).forEach((e,t)=>{t===3&&Vu.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),wf(s(n)).forEach(a))}df.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),Bu.forEach(a),[...i]},Af=t=>{switch(t.kind){case`Number`:try{return Te(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Ke(t.name);case`Set`:return wt(t.elements.map(Af))}},jf=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Mf=e=>new p(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Nf=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Wr},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),Pf=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>W(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 h(`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`)&&Ye(t,r)})});if(t)return t[1];throw new h(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:W(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Ff=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||er(e).some(e=>Ff(e,t)),If=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Yi(e),n.get(e)??n.size)),n},Lf=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Rf=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw mo(e);if(e.kind===`Number`&&!rs(e.value))throw ho(e);Rf(e.kind===`Let`?[...er(e),...Lf(e.instances??[])]:er(e))}),zf=(e,t)=>{let n=Ic(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Zu.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=_l(e.checkDeadlock,t.seed),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=[],f=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b={value:0},x=e=>`${e}#${b.value++}`,ee=[],te=/* @__PURE__ */ new Map,ne=e=>{let n=s.get(e);if(n)return n;let r=dd(e,t.print,c,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ne(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},S=e=>{let t=ne(e);return t&&y(e,ud.get(e)??[]),t},re=e=>(Rf([...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]),...Lf(e.instances)]),e.modules.forEach(re),e);re(n);let C=(e,n)=>{let r=t.loadModule?.(e)??rc.get(e)??Pc(t.source,e);if(r===void 0)throw new p(`Cannot find source file for module ${e} imported in module ${n}.`);let i=Ic(r);if(i.name!==e)throw new p(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return re(i)},ie=e=>{let t=v.indexOf(e.name);if(t!==-1)throw new p(`Circular dependency among .tla files; dependency cycle is: ${[...v.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];v.push(e.name),_.push(n);let i=se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});_.pop(),v.pop();let a=r.find(e=>n.has(e.name));if(a)throw Mf(a);return{linked:i,closure:n}},ae=(e,t)=>{let n=l.get(e);if(n)return y(e,f.get(e)??[]),n;let r=ie(C(e,t));return l.set(e,r.linked),f.set(e,r.closure),y(e,r.closure),r.linked},w=(e,t,n,o,s)=>{let c=s?void 0:S(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??ae(e.module,t.name),u=jf(l),d=`#${b.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=Ai(Od(e,t),u,t,n);ee.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=sa({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,Pi(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=x(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:x}),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&&te.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&&te.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},T=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Wr})),E=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:T(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),D=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),O=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=D(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:T(r,n),location:n}}},oe=(e,t,n,a)=>{let o=e.location,s=a?void 0:S(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=D(n.arity);return E(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ae(e.module,n),l=`#${b.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=jf(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=>Ff(f(e),p),h=d.map(t=>{let n=O(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=[],_=sa({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:T(e.params,o),location:o,resolution:Wr}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Wr}])),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}:Nf(a,i)),i},createName:x}),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=D(n.arity),a=[...e.params,...i];return E(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},k=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),se=(e,a)=>{let o=dc(e,t.loadClass?.(e.name)),s=new Map([...Zu.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:S(e);if(n){g(n,!0);return}let r=t??ae(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=>Jr(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Jr(t.location,e)).map(e=>[e.name,{key:v(e),arity:Yr(e)}])]),te=e=>{let t=x();if(t.has(e.name))throw Mf(e);a.nested.push(e);let n=se(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)=>Jr(e.location,t.location)?-1:1).forEach(e=>e.link()),Oi(o,b(o));let ne=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Jr(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)},C=kd(da(o,(e,t)=>oe(e,t,o.name,re(e))),k(s));ji(C,b(C)),C.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:Yr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),cf(C,{constants:new Set(p.map(e=>e.name)),variables:new Set(m),getDefinition:e=>r.get(s.get(e)?.key??e)});let ie={module:C,constants:p,variables:m,variableLocations:h,visible:s,exported:c,modules:l,extended:f};return d.push(ie),ie},A=ie(n).linked,ce=e=>A.visible.get(e)?.key??e;A.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let le=[],ue=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ue(e,t)),le.push(...e.module.assumptions))};ue(A,/* @__PURE__ */ new Set);let de=A.constants.map(e=>e.name),fe=A.variables,pe=e=>e.module===void 0?[e.name,ce(e.name)]:e.module===n.name||de.includes(e.name)?[]:[(l.get(e.module)??u.get(e.module))?.visible.get(e.name)?.key??e.name],me=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:A.constants.find(t=>t.name===e)?.arity??0},j=/* @__PURE__ */ new Map,he=/* @__PURE__ */ new Set,ge=(e,t)=>{o.set(e,t),r.delete(e),j.delete(e),he.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Af(e.value);pe(e).forEach(e=>{let n=me(e);n===0?j.set(e,t):ge(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let _e=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=_e.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new m(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Af),Af(e.value)]),_e.set(t,n)}),_e.forEach(e=>pe(e).forEach(t=>ge(t,Pf(e.name,me(t)||e.rows[0][0].length,e.rows))));let ve=new Map(e.substitutions.flatMap(e=>pe(e).map(t=>[t,ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!de.includes(n)&&!A.visible.has(n))throw new m(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new m(`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=ce(i),s=r.get(a);if(!(s!==void 0||o.has(a)||j.has(a)||de.includes(i)||fe.includes(i)))throw new m(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(A.constants.find(e=>e.name===n)?.arity??A.visible.get(n)?.arity))throw new m(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ye=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(pe)),be=(e,t)=>{if(ye.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&be(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=be(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=E(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),A.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let xe=de.filter(e=>!j.has(e)&&!ve.has(e)&&!he.has(e));if(xe.length>0)throw new m(`The constant parameter ${Of(t.source,t.loadModule,`constant`).find(e=>xe.includes(e))??xe[0]} is not assigned a value by the configuration file.`);let Se={runtime:c,definitions:r,builtins:o,constants:j,substitutions:ve,variables:fe,variableIndex:If(fe,d.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};uf(ee,e=>{let t=l.get(e)??u.get(e)??A;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 M=of({constants:new Set(j.keys()),variables:/* @__PURE__ */ new Set([...fe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>xo(e,Se)}),Ce=e=>{try{Z(e,{environment:Se,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof h)return e;throw e}};return ve.forEach((e,t)=>{let n=r.get(e),i=de.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&M.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ce(n.body):void 0;if(i)throw new m(`The configuration file substitutes constant ${t} with non-constant ${e}${i instanceof g?``:` - specifically: ${i.message}`}`)}),c.isStarted=!0,{environment:Se,assumptions:le,variableLocations:A.variableLocations,instanceActions:te}},Bf={kind:`Boolean`,value:!0},Vf={kind:`Boolean`,value:!1},Hf=e=>e?Bf:Vf,Uf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Wf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),Gf=(e,t,n)=>({kind:e,operands:[t,n]}),Kf=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Kf(e,t.operands).operands:[t])}),qf=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return qf(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,qf(t)),0)}},Jf=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 Jf(e.body);case`And`:case`Or`:return e.operands.some(Jf)}},Yf=/* @__PURE__ */ new WeakMap,Xf={count:0},Zf=e=>{let t=Yf.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`#${Xf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Zf).join(`,`)})`;default:return`${e.kind}(${Zf(e.body)})`}})();return Yf.set(e,n),n},Qf=(e,t)=>e===t||Zf(e)===Zf(t),$f=(e,t)=>{let n=Zf(t);return e.some(e=>e===t||Zf(e)===n)},ep=e=>e===`And`?`Or`:`And`,tp=(e,t)=>{switch(e.kind){case`Boolean`:return t?Hf(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return tp(e.body,!t);case`And`:case`Or`:return Kf(t?ep(e.kind):e.kind,e.operands.map(e=>tp(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,tp(e.body,t))}}},np=e=>{switch(e.kind){case`Boolean`:return Hf(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Kf(ep(e.kind),e.operands.map(np));case`Always`:return $(`Eventually`,np(e.body));case`Eventually`:return $(`Always`,np(e.body));default:return $(`Not`,e)}},rp=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=rp(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Hf(t)}return n.length===0?Hf(!t):n.length===1?n[0]:Kf(e.kind,n)}case`Not`:{let t=rp(e.body);return t.kind===`Boolean`?Hf(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=rp(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},ip=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,ap=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=ap(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new h(`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=>Kf(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=ap(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=ip(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Kf(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return Kf(`Or`,n)}case`Not`:return Uf(e.body)?e:ap(np(e.body));default:return e}},op=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?op(e.operands[0]):Kf(e.kind,e.operands.map(op));case`Not`:return e.body.kind===`Not`?op(e.body.body):$(`Not`,op(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,op(e.body));default:return e}},sp=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return sp(e.operands[0]);let t=Math.floor(e.operands.length/2);return Gf(e.kind,sp(Kf(e.kind,e.operands.slice(0,t))),sp(Kf(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,sp(e.body));default:return e}},cp=(e,t)=>{e.kind===`Eventually`&&!$f(t,e)&&t.push(e),`body`in e&&cp(e.body,t),`operands`in e&&e.operands.forEach(e=>cp(e,t))},lp=e=>{let t=e.filter(Wf),n=e.flatMap(e=>e.kind===`Not`&&Wf(e.body)?[e.body]:[]);return!t.some(e=>$f(n,e))},up=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new h(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},dp=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},fp=(e,t,n)=>e.flatMap(e=>{let r=dp(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),pp=e=>[...new Set(e.map(Zf))].sort().join(`|`),mp=(e,t)=>{let n=new Set(t.map(pp));return[...e.filter(e=>!n.has(pp(e))),...t]},hp=e=>{let t=up(e),n=fp(t,`Always`,`And`),r=fp(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=dp(t,`Eventually`,`Or`);if(n&&!($f(e,n.first)||$f(e,n.second)))return mp(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>($f(e,t.first)||$f(e,t.second))&&!$f(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!lp(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=dp(t[e],`Always`,`And`);n&&($f(t,n.first)||t.push(n.first),$f(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)$f(t,e.first)&&$f(t,e.second)&&!$f(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!lp(t)?[]:i(t)};return a(e)},gp=e=>({particle:e,successors:[],statePredicates:e.filter(e=>qf(e)<=1)}),_p=e=>{let t=hp([e]).map(gp),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=pp(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 hp(n)){let n=pp(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(gp(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},vp=(e,t)=>!$f(e,t)||$f(e,t.body),yp=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&qf(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=ip(e);if(n){let e=qf(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Jf(e))throw new h(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},bp=(e,t)=>{let n=e.findIndex(e=>Qf(e,t));return n===-1?(e.push(t),e.length-1):n},xp=e=>{let t=ap(rp(tp(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=op(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])yp(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Kf(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Qf(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&sp(e.formula),n=[];t&&cp(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>bp(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>bp(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>bp(i,e))}));return{tableau:t&&_p(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Sp=/* @__PURE__ */ new Set([`~>`,`-+->`]),Cp=/* @__PURE__ */ new WeakMap,wp=/* @__PURE__ */ new WeakSet,Tp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ep=(t,r)=>{try{return Z(t,r)}catch(t){if(!(t instanceof h)||t instanceof g)throw t;let r=o(t);throw r===void 0?n(new h(`${l}${t.message}`,t),e.error):n(t,r)}},Dp=e=>new h(`TLC cannot handle the temporal formula at ${ro(e)}`),Op=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=go(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Op(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Op(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=xo(e,n);if(t)return kp(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:G(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Bi(e,(e,a)=>(i.value=Math.max(i.value,Op(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 Sp.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},kp=(e,t)=>{let n=Cp.get(e);if(n!==void 0)return n;Cp.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Op(e.body,void 0,t),...r.map(e=>Op(e.set,void 0,t)));return Cp.set(e,i),i},Ap=`Temporal formula is a tautology (its negation is unsatisfiable).`,jp=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>jp(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,ao(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,Mp(t,r,i));if(t.kind===`Identifier`){let a=G(t)?go(r,t.name):void 0;if(a?.kind===`Thunk`)return c(a.expression,a.scope);let o=i.constants.has(t.name)?void 0:xo(t.name,i);if(!a&&o?.kind===`Operator`&&o.params.length===0&&kp(o,i)>0){if(s.has(o))throw n(new h(u),e.error);return c(o.body,void 0,t.name,/* @__PURE__ */ new Set([...s,o]))}}let l=Tp(i,r);if(t.kind===`Apply`&&(e=>a||Op(e,r,i)===3)(t)){let e=Vo(t,l),n=G(t)?void 0:xo(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,$o(e,t.args,l),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>Op(e.set,r,i)===0)){let r=[],i={count:0};if(Eo(t.bounds,l,e=>(i.count++,r.push(...c(t.body,e,ao(t.body))),!1)),i.count===0)throw n(new h(Ap),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},Mp=(e,t,n)=>{let r=ts(e.definitions,Tp(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&wp.add(e.binding);return r},Np=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Pp=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?Op(e,t,i):n;if(r===0){let n=Ep(e,Tp(i,t));if(typeof n!=`boolean`)throw new h(`TLC expected a boolean in the temporal formula at ${ro(e)}`);return Hf(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 h(u),e.error);o.depth++;let c=f(t,r);o.depth--;let l=qf(c);return l>2?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=Tp(i,t),a=G(e)||xo(n,i)===void 0?go(t,n):void 0;if(a?.kind===`Thunk`&&wp.has(a))return s(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:G(e)?Ho(n,r):zo(n,i);if(o?.kind!==`Closure`)throw Dp(e);let c=e.kind===`Apply`?e.args:[];return s(o.body,$o(o,c,r),e,t)},l=(e,t)=>{if(!e.bounds.every(e=>Op(e.set,t,i)===0))throw Dp(e);let n=[];Eo(e.bounds,Tp(i,t),t=>(n.push(f(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return Hf(r);let o=Kf(r?`And`:`Or`,n),s=qf(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,Mp(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===`~`&&!G(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=Op(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,Mp(e,t,i));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,Gf(`Or`,$(`Not`,f(n[0],t)),$(`Eventually`,f(n[1],t)))):e.operator===`~`&&!G(e)?$(`Not`,f(n[0],t)):e.operator===`=>`?Gf(`Or`,$(`Not`,f(n[0],t)),f(n[1],t)):c(e,t)}case`And`:case`Or`:return Kf(e.kind,e.operands.map(e=>f(e,t)));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(Op(e.condition,t,i)===0){let n=Ep(e.condition,Tp(i,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return Gf(`Or`,Gf(`And`,n,f(e.consequent,t)),Gf(`And`,$(`Not`,n),f(e.alternative,t)))}case`Always`:case`Eventually`:return $(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Np(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,Gf(`Or`,i,a))):Gf(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Dp(e)}};return f(t,r)},Fp=(e,t,n,r,i)=>{let a=e=>Fp(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`?bo(Z(e.expression,a),`a temporal property predicate`):Qa(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&&bo(Z(e.unchanged,a),`a subscript`)?!1:bo(Z(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 Fp(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new h(`TLC cannot evaluate a temporal formula in a single step`)}},Ip=(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)=>Ip(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 Fp(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Lp=(e,t)=>e.every((e,n)=>Ze(e,t[n])),Rp=e=>e.filter((t,n)=>n===0||e[n-1]!==t),zp=(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),Bp=(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}},Vp=(e,t)=>(e.offsets[t]??-1)!==-1,Hp=(e,t)=>e.pending[t]??=[],Up=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},Wp=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,Gp=2**53-1,Kp=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>Pp(e.expression,e.scope,i)),s=t.map(e=>$(`Not`,Pp(e.expression,e.scope,i))),c=s.length===1?s[0]:Kf(`Or`,s),l=o.length===0?c:Kf(`And`,[...o,c]),u=xp(l);if(u.length===0)throw n(new h(Ap),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Zf(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=!ps(i),g={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},_=e=>{let t=g.states.get(e)??/* @__PURE__ */ new Map;return g.states.set(e,t),t},v=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},y=(e,t)=>Fp(e,t,void 0,i,m?_(t):/* @__PURE__ */ new Map),b=(e,t,n)=>v(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!y(e,n))),x=(e,t,n,r)=>v(t,()=>{let t=e.solution.actionChecks;if(!m)return Uint8Array.from(t,e=>+!!Fp(e,n,r,i,/* @__PURE__ */ new Map));let a=_(n),o=g.actions.get(n)??/* @__PURE__ */ new Map;g.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]=+!!Fp(t[o],n,r,i,a)),s[e]))}),ee=(e,t,n,r)=>v(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),S=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Bp(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},re=(e,t,n)=>{let r=zp(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),Bp(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Bp(i,t,n)),r},C=(e,t,n)=>t.nodes.flatMap((t,r)=>S(e,n,r)??[]).sort((e,t)=>e-t),ie=(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&&Lp(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)},w=(e,t,n,r,i)=>{let o=b(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=Hp(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=S(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??re(e,r,a);l.push(s),c.push(u),o===void 0&&w(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=S(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??re(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&w(e,t,i.state,i.index,u)}}l.length>0&&ie(e,i,c,o)},T=(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 C(e,t,a)){let a=Hp(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=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??re(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&w(e,t,n.state,n.index,d)}}),ie(e,s,c,i)}if(e.errorNode!==void 0)return Rp(D(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},E=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)zp(e,e.nodeStates.length,-1);let a=Hp(e,i),o=[];t.forEach((t,r)=>{Vp(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ie(e,i,o,r)},D=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Vp(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 Up(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}Vp(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new h(`Couldn't re-create liveness trace (path) starting at: ${t}`)},O=(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=>Vp(e,t)),l=[],u=t=>{let n=Up(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&vp(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=Gp;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]=Gp,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...c].some(n=>Wp(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>Up(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=Rp(D(e,r).reverse().map(t=>e.nodeStates[t])),l=[],u=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),p=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:f.length+p.length+g.length},v={node:r},y=e=>i.has(e),b=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&Wp(e,v.node,t)&&(f[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&d(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},i=_.count;if(Up(e,v.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!p[t]&&a(v.node,c,e)&&(p[t]=!0,_.count--)})}return _.count<i?(b(r),u.clear(),!0):(y(r)&&!u.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){b(n.last),u.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new h(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=Up(e,t).find(e=>y(e)&&!u.has(e))??-1}b(n.unvisited),u.add(n.unvisited)}}let x=m(r,v.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 Up(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 h(`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++};Up(e,a).forEach((t,r)=>{Vp(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)=>{g.states.clear(),g.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(S(n,e,i)??re(n,e,i))}},addState:(e,t,n)=>{g.states.clear(),g.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?T(n,o,r,i,a,e):E(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=O(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!Ip(s[r].body,e,n,0,i)).map(e=>e.name))]}},qp=`UnnamedAction`,Jp={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Yp=e=>{let t=e.range??Jp;return Bt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Xp=e=>{let t=[[`name`,e.name],[`location`,Yp(e.location)]];return e.parameters.length===0?Bt(t):Bt([...t,[`context`,Bt(e.parameters)],[`parameters`,z(e.parameters.map(e=>e[0]))]])},Zp=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Qp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),$p=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,em=e=>e.kind===`Apply`?e.args:[],tm=(e,t,n)=>{let r=$p(e);if(r===void 0)return;if(G(e)){let e=go(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=zo(r,n);return i?.kind===`Closure`?i:void 0},nm=(e,t)=>{try{return Z(e,Qp(t,void 0)),!0}catch(e){if(e instanceof f)return!1;throw e}},rm=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Co(e,t)&&nm(e.body,t),im=(e,t)=>{let n=xo(e.name,t);return n?.body===e.body&&rm(n,t)},am=(e,t)=>{if(e.kind!==`Identifier`||!G(e))return;let n=go(t,e.name);return n?.kind===`Thunk`?n:void 0},om=(e,t)=>(e?.params??[]).flatMap(e=>{let n=go(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),sm=(e,t)=>{try{return e()}catch(e){if(e instanceof f)return t();throw e}},cm=(e,t,n,r,i)=>{let a=em(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=>Op(e,n,i)!==0)?o():sm(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),Z(e,Qp(i,n))]),expression:t,scope:n}],o)},lm=(e,t,n,r,i)=>{let a=()=>({name:n?.name??qp,location:e.location,parameters:om(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return lm(e.body,ts(e.definitions,Qp(r,t)),n,r,i);case`Label`:return lm(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>lm(e,t,n,r,i));case`Exists`:return sm(()=>{let o=[];return Eo(e.bounds,Qp(r,t),t=>(o.push(...lm(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=G(e)?void 0:i.get($p(e)??``),s=tm(e,t,r);if(o)return cm(o,e,t,s,r);if(!s)return[a()];let c=em(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return im(s,r)||c.some(e=>Op(e,t,r)!==0)?l():sm(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:Z(n,Qp(r,t))},parent:e}),s.scope);return lm(s.body,e,s,r,i)},l)},um=(e,t,n,r,i)=>{let a=(e,t)=>um(e,t,n,r,i);if(e.kind===`Let`){a(e.body,ts(e.definitions,Qp(n,t)));return}let o=am(e,t);if(o){a(o.expression,o.scope);return}let s=tm(e,t,n);if(s&&im(s,n))return;if(s&&s.params.length===0){if(Op(s.body,s.scope,n)===1){r.inits.push(Zp(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,$o(s,e.args,Qp(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(Zp(qp,e));return}let c=Op(e,t,n);c<=1?r.inits.push(Zp(qp,e)):c===3&&r.temporals.push(Zp(qp,e))},dm=(e,t,n,r,i)=>{let a=(t,n)=>dm(e,t,n,r,i);if(t.kind===`Let`){a(t.body,ts(t.definitions,Qp(r,n)));return}let o=am(t,n);if(o){a(o.expression,o.scope);return}let s=tm(t,n,r);if(s&&im(s,r))return;if(s&&s.params.length===em(t).length){a(s.body,t.kind===`Apply`?$o(s,t.args,Qp(r,n)):s.scope);return}if(t.kind===`Forall`&&sm(()=>(Eo(t.bounds,Qp(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(Zp(e,a)):Op(a,n,r)<2?i.invariants.push(Zp(e,a)):i.impliedTemporals.push(Zp(e,t));return}let c=Op(t,n,r);c<=1?i.impliedInits.push(Zp(e,t)):c===3&&i.impliedTemporals.push(Zp(e,t))},fm=(e,t)=>{let n=xo(e,t);return n?.kind===`Operator`&&!rm(n,t)?n:void 0},pm=e=>Bt([[`name`,e.name],[`location`,Yp(e.location)]]),mm=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:fm(e.specification,t);a&&(um(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...lm(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:zo(e.init,t);o?.kind===`Closure`&&r.inits.push(Zp(e.init??``,o.body));let s=e.next===void 0?void 0:zo(e.next,t);return s?.kind===`Closure`&&r.actions.push(...lm(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=fm(e,t);n&&r.invariants.push(Zp(e,n.body))}),e.properties.forEach(e=>{let n=fm(e,t);n&&dm(e,n.body,void 0,t,r)}),r},hm=(e,t,n)=>mm(e,t,n).actions,gm=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>W(e[1])).join(`,`)})`,_m=e=>`${e.name===qp?`Action`:e.name}${gm(e)} ${io(e.location.range??Jp)}`,vm=e=>`${e.name}${gm(e)}`,ym=(e,t,n,r)=>{let i=mm(e,t,r),a=e=>wt(e.map(Xp)),o=e=>wt(e.flatMap(e=>{let n=fm(e,t);return n?[pm(n)]:[]}));return Bt([[`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`,wt(t.variables.map((e,t)=>Bt([[`name`,e],[`location`,Yp(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},bm=`paired12`,xm=(e,t=16)=>e<=t*.75?t:xm(e,t*2),Sm=(e,t)=>{let n=xm(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)},Cm=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),wm=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Tm=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Em=e=>Tm(e).replaceAll(`
417
- `,`\\n`),Dm=(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(``))}},Om=(e,t)=>{let n=[`strict digraph DiskGraph {
418
+ `]]),hd=/* @__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)`]])]]),gd=(e,t)=>e.every(e=>xn(e,t)),_d=Mt([!1,!0]),vd=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Lt(vd(e,t,r),vd(e,r,n))},yd=[`\\cup`,`\\cap`,`\\`],bd=e=>typeof e==`object`&&e.kind===`MixedSet`,xd=e=>e.kind===`Interval`?H(e).elements:e.elements,Sd=(e,t,n)=>{let r=xd(t);if(e!==`\\cup`){let t=e===`\\cap`;return Nt(r.filter(e=>xn(e,n)===t))}if(r.length===0)return n;if(!Ae(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=H(n).elements.filter(e=>!xn(e,t));return Nt([...r,...i])},Cd=[Er(`TRUE`,!0),Er(`FALSE`,!1),Er(`BOOLEAN`,_d),Er(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),kr(`=`,At),kr(`#`,(e,t)=>!At(e,t)),J(`~`,1,e=>!vr(e,0,`~`)),J(`<=>`,2,e=>vr(e,0,`<=>`)===vr(e,1,`<=>`)),J(`/\\`,2,e=>vr(e,0,`/\\`)&&vr(e,1,`/\\`)),J(`\\/`,2,e=>vr(e,0,`\\/`)||vr(e,1,`\\/`)),J(`=>`,2,e=>!vr(e,0,`=>`)||vr(e,1,`=>`)),J(`\\in`,2,e=>xn(q(e,0,`\\in`),q(e,1,`\\in`))),J(`\\notin`,2,e=>!xn(q(e,0,`\\notin`),q(e,1,`\\notin`))),J(`\\subseteq`,2,e=>{let t=yr(e,0,`\\subseteq`),n=q(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&V(t.base)?gd(H(t.base).elements,n.base):gd(H(t).elements,n)}),...yd.map(e=>J(e,2,t=>{let n=yr(t,0,e),r=yr(t,1,e);if(Ae(n)&&Ae(r)&&!bd(n)&&!bd(r)){if(e===`\\cup`&&U(n))return r;let t=e===`\\cup`?Lt:e===`\\cap`?It:Ft;try{return t(H(n),H(r))}catch(e){if(!(e instanceof v))throw e}}return Ae(n)?Sd(e,n,r):e!==`\\`&&Ae(r)?Sd(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),J(`SUBSET`,1,e=>({kind:`Subset`,base:yr(e,0,`SUBSET`)})),J(`UNION`,1,e=>{let t=yr(e,0,`UNION`),n=vt(t)?t.elements.filter(vt):[];if(!vt(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(bd(t)||n.some(bd)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{xn(t,e)||e.elements.push(t)})),Nt(e.elements)}return n.length===0?Pt:vd(n.map(H),0,n.length)}),J(`DOMAIN`,1,e=>{let t=q(e,0,`DOMAIN`);if(!F(t))throw new v(`DOMAIN expects a function but received ${G(t)}`);return Fn(t)})],wd=Br(`Integers`,`Neg`,`IntValue`,1),Td=e=>{let t=Br(e,`DotDot`,`IntervalValue`,2);return[Vr(e,`+`,`Plus`,(e,t)=>e+t),Vr(e,`-`,`Minus`,(e,t)=>e-t),Vr(e,`*`,`Times`,(e,t)=>e*t),Vr(e,`^`,`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}),Vr(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new y(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(Ar(n))throw jr(`${e} \\div ${t}`);return n}),Vr(e,`%`,`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}),J(`..`,2,e=>({kind:`Interval`,low:zr(q(e,0,`..`),t),high:zr(q(e,1,`..`),t)}))]},Ed=[Er(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Td(`Naturals`),Ur(`<`,(e,t)=>e<t),Ur(`>`,(e,t)=>e>t),Ur(`<=`,(e,t)=>e<=t),Ur(`>=`,(e,t)=>e>=t)],Dd=[Er(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Td(`Integers`),J(`-.`,1,e=>{let t=zr(q(e,0,`-`),wd);if(Ar(-t))throw jr(`-${t}`);return-t})],Od=(e,t,n)=>{let r=q(e,t,n),i=_n(r);if(!i)throw new y(`${n}\n${G(r)}`);return i},kd=(e,t,n)=>{let r=q(e,t,n);return typeof r==`string`?r:Od(e,t,n)},Ad=(e,t,n)=>typeof e==`string`?Ge(e.slice(t,n)):B(e.slice(t,n)),jd=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Md=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Nd=(e,t)=>{let n=hd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Rr(e,t):e}):t},Pd=Nd(`Sequences`,[J(`Seq`,1,e=>({kind:`SequenceSet`,base:q(e,0,`Seq`)})),J(`Len`,1,e=>kd(e,0,jd(``,`Len`)).length),J(`\\o`,2,e=>{let t=kd(e,0,Md(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Od(e,1,Md(`t \\o s`,`sequence`));return B([...t,...n])}let n=q(e,1,`\\o`);if(typeof n!=`string`)throw new y(`${Md(`t \\o s`,`string`)}\n${G(n)}`);return Ge(t+n)}),J(`Append`,2,e=>B([...Od(e,0,Md(`Append(s, v)`,`sequence`)),q(e,1,`Append`)])),J(`Head`,1,e=>{let t=Od(e,0,jd(``,`Head`));if(t.length===0)throw new y(`Attempted to apply Head to the empty sequence.`);return t[0]}),J(`Tail`,1,e=>{let t=kd(e,0,jd(``,`Tail`));if(t.length===0)throw new y(`Attempted to apply Tail to the empty sequence.`);return Ad(t,1)}),J(`SubSeq`,3,e=>{let t=kd(e,0,jd(`first `,`SubSeq`)),n=_r(e,1,`SubSeq`),r=_r(e,2,`SubSeq`);if(n>r)return Ad(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${G(q(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ad(t,n-1,r)}),Dr(`SelectSeq`,2,e=>{let t=Tr(e,1,`SelectSeq`);return B(Od(e,0,jd(`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${G(n)}`);return n}))})]),Fd=Nd(`FiniteSets`,[J(`IsFiniteSet`,1,e=>{let t=q(e,0,`IsFiniteSet`);if(P(t))return hn(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${G(t)}\nis a finite set.`:`Attempted to check if the ${je(t)} ${G(t)} is a finite set.`)}),J(`Cardinality`,1,e=>{let t=q(e,0,`Cardinality`);if(!P(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new y(`Attempted to compute cardinality of the value\n${G(t)}`);return pn(t)})]),Id=/* @__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`]]]),Ld=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Ed};case`Integers`:return{extends:[`Naturals`],operators:Dd};case`Sequences`:return{extends:[],operators:Pd};case`FiniteSets`:return{extends:[],operators:Fd};case`TLC`:return{extends:[],operators:Nd(`TLC`,cd(t,n))};case`Randomization`:return{extends:[],operators:zu(n)};case`_Possible`:return{extends:[],operators:ed(t,n)};case`Json`:return{extends:[],operators:Nu(r)};case`Bags`:return{extends:[],operators:fu};case`TLCExt`:return{extends:[],operators:$u(t,n)};default:return}},Rd=`$subexpression`,zd=(e,t)=>new p(`${e} at line ${t.line}, column ${t.column}`),Bd=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Vd=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Hd=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}},Ud=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:mi(e.bounds),body:e.body,sets:Bd(e.bounds)};case`SetMap`:return{names:mi(e.bounds),body:e.expression,sets:Bd(e.bounds)};case`SetFilter`:return{names:pi(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:pi(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}},Wd=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Wd(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of pr(e)){let e=Wd(r,t,n);if(e)return e}},Gd=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,Kd=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),qd=(e,t)=>{let n=e.location,r=Kd(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 zd(`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 zd(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Rd,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Rd,args:e.args,location:n,resolution:ri},location:n}},Jd=(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:ri})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ri}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ri};return qd({...t,params:[...t.params,...r]},a)},Yd=(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 zd(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>$i(e)===l):t(l);if(u)return{definition:u,args:Gd(s,ci(u),r)};a.index++}throw zd(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=ci(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw zd(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw zd(`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&&Wd(a.current,t.name,[]);if(!o)throw zd(`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(...Gd(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw zd(`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`||Vd(t.operand,1)!==0)throw zd(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=Ud(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(...Gd(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[Vd(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw zd(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=Vd(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw zd(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw zd(`Unexpected subexpression selector`,n);let c=s?s.sets:Hd(o),u=c?.[Vd(t.operand,c.length)];if(!u)throw zd(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return Jd(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 zd(`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 Jd(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw zd(`Subexpression selection failed`,n);return qd(i,a.current)},Xd=(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:[]}))]},Zd=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||pr(e).some(Zd),Qd=(e,t)=>{if(!Zd(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return na(e,e=>Qd(e,n))}let n=na(e,e=>Qd(e,t));if(n.kind===`Subexpression`)return Yd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=Xd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=Yd(i,t,n.location,a);if(a.length>0)throw zd(`Too many arguments for ${r}`,n.location);return o},$d=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},ef=(e,t)=>{let n=$d(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:Qd(e.expression,n)}))}},tf=(e,t)=>{let n=$d([...t,...e.definitions]);return e.definitions.some(e=>Zd(e.body))||e.assumptions.some(e=>Zd(e.expression))?{...e,definitions:e.definitions.map(e=>ta(e,e=>Qd(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:Qd(e.expression,n)}))}:e},nf=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}])),rf=(e,t)=>`${e}${t}`,af=(e,t,n)=>`${e}${t}${n}`,of=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},sf=(e,t,n)=>`${e},${t},${n}`,cf=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),lf=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),uf=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),df=(e,t,n,r)=>({...cf(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),ff=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,pf=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,mf=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,{...df(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),hf=df(`$Set`,0,[2],[1]),gf=df(`$Junction`,0,[3],[1]),_f=df(`$Choose`,0,[2],[1]),vf=df(`$Function`,0,[3],[1]),yf=df(`$FcnApply`,0,[2,2],[1,1]),bf=df(`$RcdSelect`,0,[2,0],[1,1]),xf=df(`'`,2,[1],[0]),Sf=df(`ENABLED`,1,[2],[0]),Cf=df(`[]`,3,[3],[0]),wf=df(`$SquareAct`,2,[2,1],[0,0]),Tf=df(`$WF`,3,[1,2],[0,0]),Ef=df(`$TemporalExists`,3,[3],[0]),Df=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Of=e=>e.map(e=>({name:e,arity:0})),kf=(e,t)=>t.location.range?g(`${e}.`,t.location.range):new p(`${e} at line ${t.location.line}, column ${t.location.column}`),Af=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),jf=e=>e.kind!==`Let`&&e.kind!==`Label`,Mf=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=mf.get(t)??nf.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=cf(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(af(e,n,t))}),t.data.constraints.forEach((e,t)=>lf(r.constraints,t,e)),uf(r.argConstraints,rf(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>uf(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>ff(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(sf(t,n,r)),s=cf(Math.max(e.level,...t.filter((t,n)=>pf(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)=>{pf(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)=>lf(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||lf(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>lf(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||lf(s.constraints,t,ff(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=>lf(s.constraints,e,ff(r,a)))}))}),e.argParams.forEach(e=>{let t=of(e),n=a(t.operator)?.operator;n&&lf(s.constraints,t.param,ff(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>uf(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>uf(s.argConstraints,rf(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&uf(s.argConstraints,rf(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=of(e),n=a(t.operator);n&&uf(s.argConstraints,rf(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(of(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=of(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(af(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(af(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(af(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,Of(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=cf();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,Of(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 kf(`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 kf(`Action used where only temporal formula or state predicate allowed`,e);Af.has(e.operator)&&l(t,e)},d=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&jf(n)&&n.kind!==r)throw kf(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)=>lf(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>uf(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:kf(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return cf();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(gf,n)}case`Prime`:case`Unchanged`:return s(xf,[e.expression],t);case`Enabled`:return s(Sf,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return d(e,n.data.level),i(Cf,[n])}case`If`:return s(gf,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(gf,[...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(gf,[e.body],t,e.bounds.map(e=>e.set),mi(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw kf(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Ef:gf,[e.body],t,[],e.names);case`Choose`:return s(_f,[e.body],t,e.set?[e.set]:[],pi(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(hf,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(hf,[e.predicate],t,[e.bound.set],pi(e.bound.pattern));case`SetMap`:return s(hf,[e.expression],t,e.bounds.map(e=>e.set),mi(e.bounds));case`FunctionConstruction`:return s(vf,[e.body],t,e.bounds.map(e=>e.set),mi(e.bounds));case`Record`:return s(vf,e.fields.map(e=>e.value),t);case`RecordSet`:return s(hf,e.fields.map(e=>e.value),t);case`Except`:return s(hf,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(yf,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(hf,e.args,t)}]);case`FieldAccess`:return i(bf,[a(e.record,t),{data:cf()}]);case`BoxAction`:case`AngleAction`:return s(wf,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(Tf,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return cf()}},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 pr(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Df(t,Of(e.names))),i;default:return na(e,(e,n)=>(a(e,r,Df(t,Of(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={...cf(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(rf(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(af(e.name,n,t.name))).map(e=>sf(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(of(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=of(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,{...cf(),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}},Nf=(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`?Nf(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Pf=(e,t)=>{let n=Mf(t);Ki([...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`?Nf(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map)}))])},Ff=(e,t)=>e.maxLevels[t]??3,If=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Mf({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=>lf(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>lf(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>uf(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=of(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(rf(t.name,a));o!==void 0&&Ff(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=of(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=Ff(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
+ `))},Lf=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Rf=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),zf=new Map(ud.flatMap(e=>e.map(t=>[t,e[0]]))),Bf=e=>zf.get(e)??e,Vf=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},Hf=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(Vf(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()}},Uf=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),Wf=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Bf(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Bf(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}},Gf=(e,t)=>{let n=[];for(let r=t;;){let t=Wf(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Kf=e=>({line:e.line,column:e.column}),qf=(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=Gf(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},Jf=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Yf={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Xf=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Jf(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Jf(e[n+1],e[n+2])?n+=Jf(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=>Yf[e])}"`:r.text)}return t},Zf=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},Qf=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Qf(e.modules,t)).find(Boolean),$f=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:md.get(i)??t?.(i)??ol(e,i),s=o===void 0?[]:de(o),c=Zf(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=cl(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>Qf(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},ep=(e,t,n)=>{let r=$f(e,t),i=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=Gf(t,e+1);r.push({location:Kf(t[e]),apply:e=>i.forEach(t=>e.put(Uf(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:Kf(u),apply:t=>t.put(Uf(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`&&Gf(t,l+1).every(e=>s.has(e))&&a(l,`definition`),Rf.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(Kf(u)),r.push({location:Kf(u),apply:e=>e.put(Uf(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(Uf(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=Bf(e.name);r.push({location:e.location,apply:n=>n.put(Uf(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(Uf(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Uf(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=Hf();a.set(e??``,n),ld.toReversed().forEach(e=>n.put(Uf(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()},tp=(e,t,n)=>{let r=$f(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)}),dd.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=qf(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;Xf(s(void 0)).forEach((e,t)=>{t===3&&pd.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),Xf(s(n)).forEach(a))}Lf.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),fd.forEach(a),[...i]},np=t=>{switch(t.kind){case`Number`:try{return Me(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return et(t.name);case`Set`:return Mt(t.elements.map(np))}},rp=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],ip=e=>new p(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),ap=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:ri},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),op=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>G(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`)&&rt(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:G(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},sp=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||pr(e).some(e=>sp(e,t)),cp=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(da(e),n.get(e)??n.size)),n},lp=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),up=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw No(e);if(e.kind===`Number`&&!Ss(e.value))throw Po(e);up(e.kind===`Let`?[...pr(e),...lp(e.instances??[])]:pr(e))}),dp=(e,t)=>{let n=cl(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Cd.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,c=Ul(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=Ld(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),n=Id.get(e)??[];return t&&b(e,n),t&&n.includes(`Integers`)&&re(`Integers`),t},S=e=>(up([...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]),...lp(e.instances)]),e.modules.forEach(S),e);S(n);let ae=(e,n)=>{let r=t.loadModule?.(e)??kc.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=cl(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)},C=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 ip(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=C(ae(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=rp(l),d=`#${x.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=Gi(ef(e,t),u,t,n);te.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Ca({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,Xi(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},T=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:ri})),E=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:T(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),se=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=se(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:T(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=se(n.arity);return E(`${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=rp(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=>sp(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=[],_=Ca({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:T(e.params,o),location:o,resolution:ri}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:ri}])),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}:ap(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=se(n.arity),a=[...e.params,...i];return E(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=Lc(e,t.loadClass?.(e.name)),s=new Map([...Cd.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=>si(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>si(t.location,e)).map(e=>[e.name,{key:v(e),arity:ci(e)}])]),te=e=>{let t=x();if(t.has(e.name))throw ip(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)=>si(e.location,t.location)?-1:1).forEach(e=>e.link()),Ui(o,b(o));let ne=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&si(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=tf(Da(o,(e,t)=>O(e,t,o.name,re(e))),ce(s));qi(S,b(S)),S.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:ci(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Pf(S,{constants:new Set(p.map(e=>e.name)),variables:new Set(m),getDefinition:e=>r.get(s.get(e)?.key??e)});let ae={module:S,constants:p,variables:m,variableLocations:h,visible:s,exported:c,modules:l,extended:f};return d.push(ae),ae},A=C(n).linked,le=e=>A.visible.get(e)?.key??e;A.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let ue=[],de=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>de(e,t)),ue.push(...e.module.assumptions))};de(A,/* @__PURE__ */ new Set);let fe=A.constants.map(e=>e.name),pe=A.variables,me=e=>e.module===void 0?[e.name,le(e.name)]:e.module===n.name||fe.includes(e.name)?[]:[(l.get(e.module)??u.get(e.module))?.visible.get(e.name)?.key??e.name],j=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:A.constants.find(t=>t.name===e)?.arity??0},he=/* @__PURE__ */ new Map,ge=/* @__PURE__ */ new Set,_e=(e,t)=>{o.set(e,t),r.delete(e),he.delete(e),ge.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=np(e.value);me(e).forEach(e=>{let n=j(e);n===0?he.set(e,t):_e(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(np),np(e.value)]),ve.set(t,n)}),ve.forEach(e=>me(e).forEach(t=>_e(t,op(e.name,j(t)||e.rows[0][0].length,e.rows))));let M=new Map(e.substitutions.flatMap(e=>me(e).map(t=>[t,le(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!fe.includes(n)&&!A.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=le(i),s=r.get(a);if(!(s!==void 0||o.has(a)||he.has(a)||fe.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!==(A.constants.find(e=>e.name===n)?.arity??A.visible.get(n)?.arity))throw new _(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ye=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(me)),be=(e,t)=>{if(ye.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&be(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=be(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=E(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),A.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let xe=fe.filter(e=>!he.has(e)&&!M.has(e)&&!ge.has(e));if(xe.length>0)throw new _(`The constant parameter ${ep(t.source,t.loadModule,`constant`).find(e=>xe.includes(e))??xe[0]} is not assigned a value by the configuration file.`);let Se={runtime:c,definitions:r,builtins:o,constants:he,substitutions:M,variables:pe,variableIndex:cp(pe,d.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};If(te,e=>{let t=l.get(e)??u.get(e)??A;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 Ce=Mf({constants:new Set(he.keys()),variables:/* @__PURE__ */ new Set([...pe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>Bo(e,Se)}),we=e=>{try{Z(e,{environment:Se,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof v)return e;throw e}};return M.forEach((e,t)=>{let n=r.get(e),i=fe.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ce.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?we(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:Se,assumptions:ue,variableLocations:A.variableLocations,instanceActions:ne}},fp={kind:`Boolean`,value:!0},pp={kind:`Boolean`,value:!1},mp=e=>e?fp:pp,hp=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,gp=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),_p=(e,t,n)=>({kind:e,operands:[t,n]}),vp=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?vp(e,t.operands).operands:[t])}),yp=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return yp(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,yp(t)),0)}},bp=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 bp(e.body);case`And`:case`Or`:return e.operands.some(bp)}},xp=/* @__PURE__ */ new WeakMap,Sp={count:0},Cp=e=>{let t=xp.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`#${Sp.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Cp).join(`,`)})`;default:return`${e.kind}(${Cp(e.body)})`}})();return xp.set(e,n),n},wp=(e,t)=>e===t||Cp(e)===Cp(t),Tp=(e,t)=>{let n=Cp(t);return e.some(e=>e===t||Cp(e)===n)},Ep=e=>e===`And`?`Or`:`And`,Dp=(e,t)=>{switch(e.kind){case`Boolean`:return t?mp(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Dp(e.body,!t);case`And`:case`Or`:return vp(t?Ep(e.kind):e.kind,e.operands.map(e=>Dp(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Dp(e.body,t))}}},Op=e=>{switch(e.kind){case`Boolean`:return mp(!e.value);case`Not`:return e.body;case`And`:case`Or`:return vp(Ep(e.kind),e.operands.map(Op));case`Always`:return $(`Eventually`,Op(e.body));case`Eventually`:return $(`Always`,Op(e.body));default:return $(`Not`,e)}},kp=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=kp(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return mp(t)}return n.length===0?mp(!t):n.length===1?n[0]:vp(e.kind,n)}case`Not`:{let t=kp(e.body);return t.kind===`Boolean`?mp(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=kp(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Ap=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,jp=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=jp(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=>vp(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=jp(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Ap(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:vp(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return vp(`Or`,n)}case`Not`:return hp(e.body)?e:jp(Op(e.body));default:return e}},Mp=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Mp(e.operands[0]):vp(e.kind,e.operands.map(Mp));case`Not`:return e.body.kind===`Not`?Mp(e.body.body):$(`Not`,Mp(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Mp(e.body));default:return e}},Np=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Np(e.operands[0]);let t=Math.floor(e.operands.length/2);return _p(e.kind,Np(vp(e.kind,e.operands.slice(0,t))),Np(vp(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,Np(e.body));default:return e}},Pp=(e,t)=>{e.kind===`Eventually`&&!Tp(t,e)&&t.push(e),`body`in e&&Pp(e.body,t),`operands`in e&&e.operands.forEach(e=>Pp(e,t))},Fp=e=>{let t=e.filter(gp),n=e.flatMap(e=>e.kind===`Not`&&gp(e.body)?[e.body]:[]);return!t.some(e=>Tp(n,e))},Ip=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new v(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Lp=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Rp=(e,t,n)=>e.flatMap(e=>{let r=Lp(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),zp=e=>[...new Set(e.map(Cp))].sort().join(`|`),Bp=(e,t)=>{let n=new Set(t.map(zp));return[...e.filter(e=>!n.has(zp(e))),...t]},Vp=e=>{let t=Ip(e),n=Rp(t,`Always`,`And`),r=Rp(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Lp(t,`Eventually`,`Or`);if(n&&!(Tp(e,n.first)||Tp(e,n.second)))return Bp(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Tp(e,t.first)||Tp(e,t.second))&&!Tp(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Fp(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Lp(t[e],`Always`,`And`);n&&(Tp(t,n.first)||t.push(n.first),Tp(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Tp(t,e.first)&&Tp(t,e.second)&&!Tp(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Fp(t)?[]:i(t)};return a(e)},Hp=e=>({particle:e,successors:[],statePredicates:e.filter(e=>yp(e)<=1)}),Up=e=>{let t=Vp([e]).map(Hp),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=zp(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 Vp(n)){let n=zp(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Hp(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Wp=(e,t)=>!Tp(e,t)||Tp(e,t.body),Gp=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&yp(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Ap(e);if(n){let e=yp(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(bp(e))throw new v(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Kp=(e,t)=>{let n=e.findIndex(e=>wp(e,t));return n===-1?(e.push(t),e.length-1):n},qp=e=>{let t=jp(kp(Dp(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Mp(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Gp(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:vp(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:wp(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Np(e.formula),n=[];t&&Pp(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Kp(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Kp(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Kp(i,e))}));return{tableau:t&&Up(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Jp=/* @__PURE__ */ new Set([`~>`,`-+->`]),Yp=/* @__PURE__ */ new WeakMap,Xp=/* @__PURE__ */ new WeakSet,Zp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Qp=(t,r)=>{try{return Z(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)}},$p=e=>new v(`TLC cannot handle the temporal formula at ${wo(e)}`),em=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Fo(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return em(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?em(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Bo(e,n);if(t)return tm(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:K(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return na(e,(e,a)=>(i.value=Math.max(i.value,em(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 Jp.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},tm=(e,t)=>{let n=Yp.get(e);if(n!==void 0)return n;Yp.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(em(e.body,void 0,t),...r.map(e=>em(e.set,void 0,t)));return Yp.set(e,i),i},nm=`Temporal formula is a tautology (its negation is unsatisfiable).`,rm=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>rm(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,To(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,im(t,r,i));if(t.kind===`Identifier`){let o=K(t)?Fo(r,t.name):void 0;if(o?.kind===`Thunk`)return c(o.expression,o.scope);let l=i.constants.has(t.name)?void 0:Bo(t.name,i);if(!o&&l?.kind===`Operator`&&l.params.length===0&&tm(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&&tm(l,i)<2?[{expression:l.body,scope:void 0,name:t.name}]:r}}let l=Zp(i,r);if(t.kind===`Apply`&&(e=>a||em(e,r,i)===3)(t)){let e=os(t,l),n=K(t)?void 0:Bo(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,vs(e,t.args,l),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>em(e.set,r,i)===0)){let r=[],i={count:0};if(Go(t.bounds,l,e=>(i.count++,r.push(...c(t.body,e,To(t.body))),!1)),i.count===0)throw n(new v(nm),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},im=(e,t,n)=>{let r=bs(e.definitions,Zp(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Xp.add(e.binding);return r},am=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),om=(t,r,i)=>{let a=(e,t,n)=>{let r=n===0?em(e,t,i):n;if(r===0){let n=Qp(e,Zp(i,t));if(typeof n!=`boolean`)throw new v(`TLC expected a boolean in the temporal formula at ${wo(e)}`);return mp(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=yp(c);return l>2?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,r=Zp(i,t),a=K(e)||Bo(n,i)===void 0?Fo(t,n):void 0;if(a?.kind===`Thunk`&&Xp.has(a))return s(a.expression,a.scope,e,t);let o=a?.kind===`Operator`?a.operator:a?void 0:K(e)?ss(n,r):is(n,i);if(o?.kind!==`Closure`)throw $p(e);let c=e.kind===`Apply`?e.args:[];return s(o.body,vs(o,c,r),e,t)},l=(e,t)=>{if(!e.bounds.every(e=>em(e.set,t,i)===0))throw $p(e);let n=[];Go(e.bounds,Zp(i,t),t=>(n.push(f(e.body,t)),!1));let r=e.kind===`Forall`;if(n.length===0)return mp(r);let o=vp(r?`And`:`Or`,n),s=yp(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,im(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===`~`&&!K(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=em(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,im(e,t,i));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,_p(`Or`,$(`Not`,f(n[0],t)),$(`Eventually`,f(n[1],t)))):e.operator===`~`&&!K(e)?$(`Not`,f(n[0],t)):e.operator===`=>`?_p(`Or`,$(`Not`,f(n[0],t)),f(n[1],t)):c(e,t)}case`And`:case`Or`:return vp(e.kind,e.operands.map(e=>f(e,t)));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(em(e.condition,t,i)===0){let n=Qp(e.condition,Zp(i,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return _p(`Or`,_p(`And`,n,f(e.consequent,t)),_p(`And`,$(`Not`,n),f(e.alternative,t)))}case`Always`:case`Eventually`:return $(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=am(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,_p(`Or`,i,a))):_p(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw $p(e)}};return f(t,r)},sm=(e,t,n,r,i)=>{let a=e=>sm(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`?zo(Z(e.expression,a),`a temporal property predicate`):yo(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&&zo(Z(e.unchanged,a),`a subscript`)?!1:zo(Z(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 sm(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`)}},cm=(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)=>cm(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 sm(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},lm=(e,t)=>e.every((e,n)=>at(e,t[n])),um=e=>e.filter((t,n)=>n===0||e[n-1]!==t),dm=(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),fm=(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}},pm=(e,t)=>(e.offsets[t]??-1)!==-1,mm=(e,t)=>e.pending[t]??=[],hm=(e,t)=>{let n=e.edgeOffsets[t];return e.edges.ids.subarray(n+1,n+1+e.edges.ids[n])},gm=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,_m=2**53-1,vm=(t,r,i,a)=>{if(t.length===0)return;let o=r.map(e=>om(e.expression,e.scope,i)),s=t.map(e=>$(`Not`,om(e.expression,e.scope,i))),c=s.length===1?s[0]:vp(`Or`,s),l=o.length===0?c:vp(`And`,[...o,c]),u=qp(l);if(u.length===0)throw n(new v(nm),e.livenessEvaluationFailure);let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Cp(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=!Ms(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)=>sm(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=>+!!sm(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]=+!!sm(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=fm(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ie=(e,t,n)=>{let r=dm(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),fm(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],fm(i,t,n)),r},S=(e,t,n)=>t.nodes.flatMap((t,r)=>re(e,n,r)??[]).sort((e,t)=>e-t),ae=(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},C=(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&&lm(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=mm(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&&ae(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=mm(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)}}),ae(e,s,c,i)}if(e.errorNode!==void 0)return um(E(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},T=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)dm(e,e.nodeStates.length,-1);let a=mm(e,i),o=[];t.forEach((t,r)=>{pm(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ae(e,i,o,r)},E=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)pm(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 hm(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}pm(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}`)},se=(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=>pm(e,t)),l=[],u=t=>{let n=hm(e,t).indexOf(t);return n!==-1&&o(t,n)},d=(t,r)=>n.tableau!==void 0&&Wp(n.tableau.nodes[e.nodeTableaux[t]].particle,r),f=r=>{let i=l.pop()??r;if(i===r&&!u(i)){s[i]=_m;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]=_m,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...c].some(n=>gm(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>hm(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=um(E(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]&&gm(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(hm(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=hm(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 hm(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++};hm(e,a).forEach((t,r)=>{pm(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=C(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):T(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=se(e,t);if(n)return n}},getViolatedProperties:(e,n)=>[...new Set(t.filter((t,r)=>!cm(s[r].body,e,n,0,i)).map(e=>e.name))]}},ym=`UnnamedAction`,bm={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},xm=e=>{let t=e.range??bm;return Jt([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Sm=e=>{let t=[[`name`,e.name],[`location`,xm(e.location)]];return e.parameters.length===0?Jt(t):Jt([...t,[`context`,Jt(e.parameters)],[`parameters`,B(e.parameters.map(e=>e[0]))]])},Cm=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),wm=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Tm=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Em=e=>e.kind===`Apply`?e.args:[],Dm=(e,t,n)=>{let r=Tm(e);if(r===void 0)return;if(K(e)){let e=Fo(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=is(r,n);return i?.kind===`Closure`?i:void 0},Om=(e,t)=>{try{return Z(e,wm(t,void 0)),!0}catch(e){if(e instanceof f)return!1;throw e}},km=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Ho(e,t)&&Om(e.body,t),Am=(e,t)=>{let n=Bo(e.name,t);return n?.body===e.body&&km(n,t)},jm=(e,t)=>{if(e.kind!==`Identifier`||!K(e))return;let n=Fo(t,e.name);return n?.kind===`Thunk`?n:void 0},Mm=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Fo(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Nm=(e,t)=>{try{return e()}catch(e){if(e instanceof f)return t();throw e}},Pm=(e,t,n,r,i)=>{let a=Em(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=>em(e,n,i)!==0)?o():Nm(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),Z(e,wm(i,n))]),expression:t,scope:n}],o)},Fm=(e,t,n,r,i)=>{let a=()=>({name:n?.name??ym,location:e.location,parameters:Mm(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Fm(e.body,bs(e.definitions,wm(r,t)),n,r,i);case`Label`:return Fm(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Fm(e,t,n,r,i));case`Exists`:return Nm(()=>{let o=[];return Go(e.bounds,wm(r,t),t=>(o.push(...Fm(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=K(e)?void 0:i.get(Tm(e)??``),s=Dm(e,t,r);if(o)return Pm(o,e,t,s,r);if(!s)return[a()];let c=Em(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return Am(s,r)||c.some(e=>em(e,t,r)!==0)?l():Nm(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:Z(n,wm(r,t))},parent:e}),s.scope);return Fm(s.body,e,s,r,i)},l)},Im=(e,t,n,r,i)=>{let a=(e,t)=>Im(e,t,n,r,i);if(e.kind===`Let`){a(e.body,bs(e.definitions,wm(n,t)));return}let o=jm(e,t);if(o){a(o.expression,o.scope);return}let s=Dm(e,t,n);if(s&&Am(s,n))return;if(s&&s.params.length===0){if(em(s.body,s.scope,n)===1){r.inits.push(Cm(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,vs(s,e.args,wm(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(Cm(ym,e));return}let c=em(e,t,n);c<=1?r.inits.push(Cm(ym,e)):c===3&&r.temporals.push(Cm(ym,e))},Lm=(e,t,n,r,i)=>{let a=(t,n)=>Lm(e,t,n,r,i);if(t.kind===`Let`){a(t.body,bs(t.definitions,wm(r,n)));return}let o=jm(t,n);if(o){a(o.expression,o.scope);return}let s=Dm(t,n,r);if(s&&Am(s,r))return;if(s&&s.params.length===Em(t).length){a(s.body,t.kind===`Apply`?vs(s,t.args,wm(r,n)):s.scope);return}if(t.kind===`Forall`&&Nm(()=>(Go(t.bounds,wm(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(Cm(e,a)):em(a,n,r)<2?i.invariants.push(Cm(e,a)):i.impliedTemporals.push(Cm(e,t));return}let c=em(t,n,r);c<=1?i.impliedInits.push(Cm(e,t)):c===3&&i.impliedTemporals.push(Cm(e,t))},Rm=(e,t)=>{let n=Bo(e,t);return n?.kind===`Operator`&&!km(n,t)?n:void 0},zm=e=>Jt([[`name`,e.name],[`location`,xm(e.location)]]),Bm=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Rm(e.specification,t);a&&(Im(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Fm(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:is(e.init,t);o?.kind===`Closure`&&r.inits.push(Cm(e.init??``,o.body));let s=e.next===void 0?void 0:is(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Fm(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Rm(e,t);n&&r.invariants.push(Cm(e,n.body))}),e.properties.forEach(e=>{let n=Rm(e,t);n&&Lm(e,n.body,void 0,t,r)}),r},Vm=(e,t,n)=>Bm(e,t,n).actions,Hm=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>G(e[1])).join(`,`)})`,Um=e=>`${e.name===ym?`Action`:e.name}${Hm(e)} ${h(e.location.range??bm)}`,Wm=e=>`${e.name}${Hm(e)}`,Gm=(e,t,n,r)=>{let i=Bm(e,t,r),a=e=>Mt(e.map(Sm)),o=e=>Mt(e.flatMap(e=>{let n=Rm(e,t);return n?[zm(n)]:[]}));return Jt([[`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`,Mt(t.variables.map((e,t)=>Jt([[`name`,e],[`location`,xm(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Km=`paired12`,qm=(e,t=16)=>e<=t*.75?t:qm(e,t*2),Jm=(e,t)=>{let n=qm(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)},Ym=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Xm=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Zm=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Qm=e=>Zm(e).replaceAll(`
420
+ `,`\\n`),$m=(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(``))}},eh=(e,t)=>{let n=[`strict digraph DiskGraph {
418
421
  `,`node [shape=box,style=rounded]
419
- `,e.colorize?`edge [colorscheme="${bm}"]\n`:``,`nodesep=0.35;
422
+ `,e.colorize?`edge [colorscheme="${Km}"]\n`:``,`nodesep=0.35;
420
423
  `,`subgraph cluster_graph {
421
424
  `,`color="white";
422
425
  `],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"
423
- `,`node [ labeljust="l",colorscheme="${bm}",style=filled,shape=record ]\n`,...Sm([...i.keys()],wm).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...Sm([...r],e=>e[0]).map(e=>`{rank = same; ${Sm([...e[1]],Cm).map(e=>`${e};`).join(``)}}\n`),`}
424
- `,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="${Em(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?Tm(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${Em(r.getLabel())}",tooltip="${Em(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},km=(e,t)=>e.dot?Om(e,t):Dm(e,t),Am=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),jm=(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},Mm=t=>n(new h(`${l}${t}`),e.error),Nm=e=>{if(!N(e))throw Mm(`The symmetry values must be function records.`);let t=U(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!P(e)||!P(i))throw new m(`Symmetry function must have model values as domain and range`);e.name!==i.name&&n.set(e.name,i)}),n},Pm=(e,t)=>{let n=t.definitions.get(e);if(n===void 0&&!t.constants.has(e))throw new m(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(n?.kind!==`Operator`||n.params.length>0)throw Mm(`The symmetry function ${e} must specify a set of permutations.`);let r=Z(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!M(r)||!B(r))throw Mm(`The symmetry operator must specify a set of functions.`);let i=V(r).elements.map(Nm);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(Am(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=jm(n,e),r=Am(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}))},Fm=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Rm(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(Rm(e[r],t));return a}},Im=(e,t)=>{let n=[],r=[];for(let i of e){let e=Rm(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(R);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(R(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},Lm=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Rm=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Lm(e);if(n===0||n>64)return zm(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=zm(e,t),a=i!==e&&Ze(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},zm=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Im(e.elements,t);return n?qe(n):e}if(n===`Function`||n===`LazyFunction`&&B(e.domain)){let n=U(e),r=Fm(n.domain,t),i=Fm(n.range,t)??n.range;if(r){let e=At(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Je(n.domain,e.range):e}return i===n.range?n:Je(n.domain,i)}if(n===`Interval`||!M(e)||!B(e))return e;let r=V(e),i=Fm(r.elements,t);return i?wt(i):r},Bm=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(Rm(e[r],n));return t},Vm=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=Rm(e[o],n),c=R(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>Rm(e,n)):Bm(e,i,n)}},Hm=(e,t,n)=>t.reduce((t,r)=>Vm(e,t,r,n)??t,e),Um=(e,t)=>e*((t-e)/2**64),Wm=e=>e.includes(`.`)?e:`${e}.0`,Gm=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Wm(String(e));let[n,r]=e.toExponential().split(`e`);return`${Wm(n)}E${r.replace(`+`,``)}`},Km=e=>e!==void 0&&e>=`0`&&e<=`9`,qm=e=>{if(e===0)return`0.0`;let t=Gm(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Km(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(;Km(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Km(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Km(t[n.next])&&Number(t[n.next])>=5&&(n.result=Jm(n.result));Km(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Jm=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Jm(r)}.`:n===`9`?`${Jm(r)}0`:`${r}${Number(n)+1}`},Ym=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}`)},Xm=(e,t,n)=>{if(Um(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},Zm=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}).`},Qm={line:0,column:0},$m=`Failed to recover the initial state from its fingerprint.`,eh=`Failed to recover the next state from its fingerprint.`,th=e=>({kind:`Identifier`,name:e,location:Qm}),nh=/* @__PURE__ */ new Set([`name`,`property`]),rh=(e,t,n)=>{let r=xo(t,n);if(!r)throw new m(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new m(nh.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},ih=(e,t,n)=>{let r=rh(e,t,n);if(Co(r,n))throw new m(`The ${e} ${t} cannot be a constant.`);return r},ah=(e,t,n)=>{if(Co(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return Z(th(e),wh(n,void 0,void 0))}catch(e){if(e instanceof h||d(e))return;throw e}},oh=(e,t,n)=>{let r=rh(e,t,n),i=ah(t,r,n);if(i!==void 0&&i!==!0)throw new m(`The ${e} of ${t} is equal to ${W(i)}`);return i===void 0?r:void 0},sh=(t,r)=>{let i=of({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>xo(e,r)});return t.flatMap(t=>{let a=oh(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
426
+ `,`node [ labeljust="l",colorscheme="${Km}",style=filled,shape=record ]\n`,...Jm([...i.keys()],Xm).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]],Ym).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="${Qm(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?Zm(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${Qm(r.getLabel())}",tooltip="${Qm(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},th=(e,t)=>e.dot?eh(e,t):$m(e,t),nh=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),rh=(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},ih=t=>n(new v(`${l}${t}`),e.error),ah=e=>{if(!F(e))throw ih(`The symmetry values must be function records.`);let t=W(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!I(e)||!I(i))throw new _(`Symmetry function must have model values as domain and range`);e.name!==i.name&&n.set(e.name,i)}),n},oh=(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 ih(`The symmetry function ${e} must specify a set of permutations.`);let r=Z(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!P(r)||!V(r))throw ih(`The symmetry operator must specify a set of functions.`);let i=H(r).elements.map(ah);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(nh(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=rh(n,e),r=nh(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}))},sh=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=uh(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(uh(e[r],t));return a}},ch=(e,t)=>{let n=[],r=[];for(let i of e){let e=uh(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(z);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(z(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},lh=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,uh=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=lh(e);if(n===0||n>64)return dh(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=dh(e,t),a=i!==e&&at(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},dh=(e,t)=>{let n=e.kind;if(n===`Set`){let n=ch(e.elements,t);return n?tt(n):e}if(n===`Function`||n===`LazyFunction`&&V(e.domain)){let n=W(e),r=sh(n.domain,t),i=sh(n.range,t)??n.range;if(r){let e=Rt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?nt(n.domain,e.range):e}return i===n.range?n:nt(n.domain,i)}if(n===`Interval`||!P(e)||!V(e))return e;let r=H(e),i=sh(r.elements,t);return i?Mt(i):r},fh=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(uh(e[r],n));return t},ph=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=uh(e[o],n),c=z(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>uh(e,n)):fh(e,i,n)}},mh=(e,t,n)=>t.reduce((t,r)=>ph(e,t,r,n)??t,e),hh=(e,t)=>e*((t-e)/2**64),gh=e=>e.includes(`.`)?e:`${e}.0`,_h=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return gh(String(e));let[n,r]=e.toExponential().split(`e`);return`${gh(n)}E${r.replace(`+`,``)}`},vh=e=>e!==void 0&&e>=`0`&&e<=`9`,yh=e=>{if(e===0)return`0.0`;let t=_h(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;vh(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(;vh(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;vh(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(vh(t[n.next])&&Number(t[n.next])>=5&&(n.result=bh(n.result));vh(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},bh=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${bh(r)}.`:n===`9`?`${bh(r)}0`:`${r}${Number(n)+1}`},xh=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}`)},Sh=(e,t,n)=>{if(hh(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},Ch=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}).`},wh={line:0,column:0},Th=`Failed to recover the initial state from its fingerprint.`,Eh=`Failed to recover the next state from its fingerprint.`,Dh=e=>({kind:`Identifier`,name:e,location:wh}),Oh=/* @__PURE__ */ new Set([`name`,`property`]),kh=(e,t,n)=>{let r=Bo(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 _(Oh.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},Ah=(e,t,n)=>{let r=kh(e,t,n);if(Ho(r,n))throw new _(`The ${e} ${t} cannot be a constant.`);return r},jh=(e,t,n)=>{if(Ho(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return Z(Dh(e),Xh(n,void 0,void 0))}catch(e){if(e instanceof v||d(e))return;throw e}},Mh=(e,t,n)=>{let r=kh(e,t,n),i=jh(t,r,n);if(i!==void 0&&i!==!0)throw new _(`The ${e} of ${t} is equal to ${G(i)}`);return i===void 0?r:void 0},Nh=(t,r)=>{let i=Mf({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>Bo(e,r)});return t.flatMap(t=>{let a=Mh(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
425
428
  Note that a bug can cause TLC to incorrectly report this error.
426
429
  If you believe your TLA+ or PlusCal specification to be correct,
427
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new m(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:th(t),scope:void 0}]})},ch=(e,t)=>{if(!N(e))return;let n=U(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])))},lh=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>lh(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=xo(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return lh(n.body,t)}return[e]},uh=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Op(r,e.scope,t)>0)return!1;let i=Z(r,wh(t,void 0,void 0,e.scope));if(i===!1)throw new m(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new m(`The operator ${r.name}, which equals ${W(i)},\ncannot be used as a ${n}`);return!0},dh=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=rh(t,e,r).body,i=th(e);if(n.kind!==`Number`&&n.kind!==`String`&&Op(i,void 0,r)===0)throw new m(`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=rh(`name`,t.specification,r),c=ah(t.specification,s,r);if(c!==void 0)throw new m(`The value of ${t.specification} is equal to ${W(c)}`);if(jp(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(uh(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new m(`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`&&Op(c.expression,s.scope,r)<2)throw n(new m(`TLC cannot handle the temporal formula ${ao(c.expression)}`),e.error);let l=Op(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new m(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new m(`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:Qm},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},fh=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=oh(`property`,e,t);r&&jp(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(uh(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`&&Op(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=Op(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new m(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},ph=(e,t,n)=>t.flatMap(t=>oh(e,t,n)?[{name:t,expression:th(t),scope:void 0}]:[]),mh=(e,t)=>{let n=xo(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},hh=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new m(`_POSSIBLE lists ${n} more than once`);ih(`possible`,n,t);let i=th(n);if(Op(i,void 0,t)===3)throw new m(`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}}),gh=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||G(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},_h=(e,t)=>e.flatMap(e=>lh(e.expression,t).map(n=>{let r=e.scope===void 0?nc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:gh(n,r,t)}})),vh=(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},yh=/[\u0100-\uffff]/,bh=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),xh=e=>e.kind===`String`?yh.test(e.value):e.kind===`Set`&&e.elements.some(xh),Sh=e=>e.kind===`String`&&yh.test(e.value)||e.kind===`Apply`&&bh.has(e.operator)||er(e).some(Sh),Ch=(e,t)=>e.constants.some(e=>xh(e.value)||(e.args??[]).some(xh))||[...t.definitions.values()].some(e=>Sh(e.body)||e.kind===`Function`&&e.bounds.some(e=>Sh(e.set))),wh=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Th=(e,t,n)=>bo(Z(e,t),n),Eh=(e,t,n=Dh)=>{let r=Z(e,t);if(typeof r!=`boolean`)throw new h(n(e,t.environment));return r},Dh=(e,t)=>{let n=e.kind===`Identifier`?xo(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?io(i):ao(r)}`},Oh=()=>{},kh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Th(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ah=(e,t,n)=>{try{return Th(e,wh(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof h)return{message:e.message};throw e}},jh=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ah(n.expression,t,`an assumption`);if(e)return{name:ao(n.expression),trace:[],message:e.message}}},Mh=(t,r,i)=>{let a=sh(t.invariants,r),o=dh(t,r),s=fh(t,r),c=_h([...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 m(`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&l)throw new m(`The configuration file did not specify the next state predicate.`);let u=_h(ph(`constraint`,t.constraints,r),r),d=ph(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&rh(`rlreward`,t.rlReward,r),t.periodic!==void 0&&rh(`periodic`,t.periodic,r);let f=hh(t.possible,r);if(r.variables.length===0)return;let p=t.symmetry===void 0?[]:Pm(t.symmetry,r);t.view!==void 0&&rh(`view function`,t.view,r);let h=t.view===void 0?void 0:{name:t.view,expression:th(t.view),scope:void 0},g=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Qm};return{...e,unchanged:t}}),_=e=>Op(e.expression,void 0,r)>=2,v=f.filter(e=>!_(e)),y=f.filter(_),b=r.runtime,x={indices:void 0},ee=()=>{if(x.indices)return x.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return x.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),x.indices},te=p.length>0?ee():void 0,ne=(e,t)=>Z(e,wh(r,t,void 0)),S=e=>{let t=ee(),n=p.length===0?e:Hm(e,p,t);return $c(h===void 0?t.map(e=>n[e]):[ne(h.expression,n)])},re=Ch(t,r);b.getFingerprint=S;let C=()=>{let e=f.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=mh(e.name,r),n=t?` at ${io(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:Se(W(vl(b),!0))}};return{properties:s,spec:o,isSymmetric:p.length>0,getTlcOrder:ee,getStoredFingerprints:(e,t)=>{if(h!==void 0||re)return BigInt64Array.from(e,S);let n=new BigInt64Array(t.length),r=nl(ee(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(re)return[String(S(e))];let t=p.length===0?e:Hm(e,p,te);return h===void 0?t:[ne(h.expression,t)]},findViolatedInvariant:(t,i)=>c.find(a=>{if(vh(a,t,i))return!1;try{let e=wh(r,t,void 0,a.scope),n=a.membership;return i&&n?!fn(t[n.variable],i[n.variable],Z(n.set,e)):!Eh(a.expression,e)}catch(t){throw i?Fh(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>u.every(n=>{try{return vh(n,e,t)||Eh(n.expression,wh(r,e,void 0))}catch(e){throw t?Ph(e):e}}),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Eh(t.expression,wh(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>g.find(n=>{try{return!Eh(n.action,wh(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${ao(n.box)}`)&&!Th(n.unchanged,wh(r,e,t,n.scope),`a subscript`)}catch(e){throw Fh(Nh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>d.every(n=>{try{return Eh(n.expression,wh(r,e,t))}catch(e){throw Ph(e)}}),trackStatePossible:v.length===0?Oh:e=>kh(v,b,wh(r,e,void 0)),trackActionPossible:y.length===0?Oh:(e,t)=>kh(y,b,wh(r,e,t)),findUnwitnessedPossible:C,findPostconditionViolation:()=>{let e=C();if(e)return e;for(let e of t.postconditions){let t=Ah(th(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},Nh=e=>e instanceof g?n(e,e.exitCode):e,Ph=e=>e instanceof h&&!(e instanceof g)&&!(e instanceof _)?n(new h(`${l}${e.message}`,e),x(e)):Nh(e),Fh=(e,t)=>e instanceof h?n(new h(`${t}\n${e.message}`,e),x(e)):e,Ih=t=>{let r=t.dump&&km(t.dump,t.writeFile);try{return Lh(t,r)}catch(t){throw d(t)?n(new h(u),e.error):t}finally{r?.close()}},Lh=(t,r)=>{let i=typeof t.config==`string`?ge(t.config):t.config,a=t.onPrint??console.log,o={isMuted:!1},s=e=>{o.isMuted||a(e)},l=e=>{o.isMuted=!0;let t=e();return o.isMuted=!1,t};Le(kf(t.source,i,t.loadModule));let f=zf(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,v=p.runtime;v.pause=t.onPause??(()=>{}),v.getSpecification=()=>ym(i,p,f.variableLocations,f.instanceActions);let y={depth:0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:v.generatedStates,distinctStates:v.distinctStates,queuedStates:v.queueSize,depth:v.generatedStates===0?0:Math.max(y.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),ee=Array.from({length:32},()=>0),te={newStates:0},ne=()=>Math.min(te.newStates,31),S=()=>ee.map((e,t)=>t===ne()?e+1:e),re=()=>({...b(`success`),outDegrees:[...ee],fingerprintDistance:Xm(v.distinctStates,v.generatedStates,()=>C?C.getStoredFingerprints(A,ce):BigInt64Array.from(A,v.getFingerprint))}),C=Mh(i,p,()=>Of(t.source,t.loadModule,`variable`)),ie=jh(f.assumptions,p);if(ie)return b(`assumption-violation`,ie);if(!C)return re();let ae=i.postconditions.length>0||i.possible.length>0,w=(e,t,n)=>{if(ae){let e=t.loopStart;v.counterExample=xu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=C.findUnwitnessedPossible();return r||C.findPostconditionViolation(),b(e,r?{...t,unwitnessed:r}:t)},T=C.spec,E=C.getFingerprintState,D={value:void 0},O=i.view!==void 0||i.symmetry!==void 0,oe=[],k=c(()=>Kp(C.properties.liveness,T.temporals,p,{getFingerprint:e=>oe[e]??=Number(BigInt.asIntN(32,v.getFingerprint(A[e]))),getSuccessors:e=>{let t=[];return T.next===void 0||to(T.next,e,p,n=>{if(pe(n.state),!(C.satisfiesConstraints(n.state,e)&&C.satisfiesActionConstraints(e,n.state)))return!1;let r=E(n.state),i=Oe(Te(r),r);return t.push({index:i,state:n.state}),!1},T.scope),t}})),se=C.isSymmetric||k!==void 0,A=[],ce=[],le=[],ue=[],de=[],fe={slots:new Int32Array(1<<17),size:0,shift:16},pe=$n(),me=e=>Object.fromEntries(C.getTlcOrder().map(t=>[p.variables[t],e[t]])),j=(e,t,n,r)=>(v.getLevel=()=>n+1,v.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),he(e,t[n].state,(t[n+1]??t[r??n]).state)),he=(e,t,n)=>{try{let r=ih(`alias`,e,p).body,i=Z(th(e),wh(p,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return ch(i,a)??me(t)}catch(e){if(!(e instanceof m||e instanceof h))throw e;return{...me(t),_ALIASEvalError:e.message}}},_e=(e,t,n)=>{D.value??=hm(i,p,f.instanceActions);let r={...F};Object.assign(F,{index:e,isExpanding:!0,candidate:void 0});let a=E(n),o=D.value.find(e=>no(e.expression,t,p,e.scope).some(e=>Ee(E(e.state),a)));return Object.assign(F,r),o&&_m(o)},ve=(e,t,n)=>{let r=i.alias,a=l(()=>(e.length>1&&fs(p)&&ye(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:_e(t[r-1],e[r-1].state,n.state))));return e.map((t,i)=>({action:t.action,label:a[i],state:r===void 0?me(t.state):j(r,e,i,n)}))},ye=()=>T.init===void 0?[]:eo(T.init,p,T.scope),be=e=>T.next===void 0?[]:no(T.next,e,p,T.scope),xe=(e,t)=>Ee(E(e),ce[t]),Se=(e,t)=>be(e).find(e=>xe(e.state,t)),M=(e,t)=>{let n=O||fs(p)?ye().find(t=>xe(t,e[0])):A[e[0]];if(!n)throw new h($m);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=Se(i,e[n]);if(!a)throw new h(t);r.push(a)}return r},Ce=(e,t)=>{let n=[];for(let t=e;t!==-1;t=le[t])n.unshift(t);let r=O&&n.length>1?M(n,$m):n.map(e=>({state:A[e],action:ue[e]}));if(!t)return ve(r,n);let i=O?be(A[e]).find(e=>Ee(e.state,t.state))?.action:t.action;return ve([...r,{state:t.state,action:i}],n)},N=e=>le[e]===-1?[{action:void 0,label:void 0,state:me(A[e])}]:Ce(e),P=(t,r,i,a)=>{if(d(t))return F.isExpanding?P(n(new h(u),e.error),N(F.index)):P(new h(u),r,i);if(!(t instanceof h))throw t;return{...b(`error`,void 0,{message:t.message,trace:r,initialState:i&&!(t instanceof g)?me(i):void 0,exitCode:x(t)}),outDegrees:a}},we=(e,t)=>{let n=M(e,eh),r=n[n.length-1].state;if(O&&t!==void 0&&t!==e.length-1&&Se(r,e[t])===void 0)throw new h(eh);return n},Te=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=kn(t,Pn(e[n]));return t&1073741823},Ee=(e,t)=>{for(let n=0;n<t.length;n++)if(!Ze(e[n],t[n]))return!1;return!0},De=e=>Math.imul(e,2654435761)>>>fe.shift<<1,Oe=(e,t)=>{let n=fe.slots.length-1;for(let r=De(e);;r=r+2&n){let n=fe.slots[r+1];if(n===0)return-1;if(fe.slots[r]===e&&Ee(ce[n-1],t))return n-1}},ke=(e,t)=>{let n=fe.slots.length-1,r=De(e);for(;fe.slots[r+1]!==0;)r=r+2&n;fe.slots[r]=e,fe.slots[r+1]=t},Ae=(e,t)=>{if(fe.size++,fe.size*4>fe.slots.length){let e=fe.slots;fe.slots=new Int32Array(e.length*2),fe.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&ke(e[t],e[t+1])}ke(e,t+1)},je=e=>{v.distinctStates=A.length+1,y.depth=Math.max(y.depth,e),v.diameter=Math.max(v.diameter,e)},Me=(e,t,n,r)=>{let i=n===-1?1:de[n]+1;A.push(e),ce.push(t),le.push(n),ue.push(r),de.push(i)},F={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,isFingerprinting:!1,livenessSource:-1},Ne=e=>e===-1?[]:[...Ne(le[e]),A[e]];v.isSeen=e=>{let t=E(e);return Oe(Te(t),t)!==-1},v.getBehavior=e=>{let t=e===F.candidate?-1:A.indexOf(e);return t===-1?[...Ne(F.index),e]:Ne(t)},v.getCurrentState=()=>F.index===-1?void 0:A[F.index],v.setLivenessSource=e=>{F.livenessSource=e??-1},v.getLevel=e=>{let t=F.livenessSource;return t===-1?e===F.candidate?F.candidateLevel:F.index===-1?0:e===A[F.index]?de[F.index]:F.isExpanding?de[F.index]+1:0:e===A[t]?de[t]:de[t]+1};let Pe=(e,t)=>({fingerprint:BigInt.asIntN(64,v.getFingerprint(e)),level:t,getLabel:()=>Zn(i.alias===void 0?me(e):he(i.alias,e,void 0)),getText:()=>Zn(me(e))}),Fe=e=>{pe(e),v.generatedStates++,v.initialStates++,F.candidate=e,F.candidateLevel=1;let t=E(e),n=Te(t),i=C.satisfiesConstraints(e);if(i&&C.trackStatePossible(e),i&&Oe(n,t)!==-1)return;i&&(je(1),v.queueSize++,k?.addInitialState(A.length,e),r?.writeInitialState(Pe(e,1)));let a=C.findViolatedInvariant(e);if(a)return w(`invariant-violation`,{name:a.name,trace:ve([{action:void 0,state:e}],[])});let o=C.findFailedInitialPredicate(e);if(o)return w(`liveness-violation`,{name:o.name,trace:ve([{action:void 0,state:e}],[])});i&&(Ae(n,A.length),Me(e,t,-1,void 0))},Ie=(e,t,n,i,a)=>{let o=A[e];v.generatedStates++,F.candidate=t.state,F.candidateLevel=de[e]+1,se&&pe(t.state),F.isFingerprinting=!0;let s=E(t.state),c=Te(s);F.isFingerprinting=!1;let l=Oe(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,Pe(t.state,de[e]+1),f!==-1,a&&{name:a.name,signature:vm(a)}),f!==-1&&k){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&&(je(de[e]+1),te.newStates++),f===-1)try{let n=C.findViolatedInvariant(t.state,o);if(n)return w(`invariant-violation`,{name:n.name,trace:Ce(e,t)})}catch(n){return P(n,Ce(e,t),void 0,S())}let m=C.findViolatedActionProperty(o,t.state);if(m)return w(`liveness-violation`,{name:m.name,trace:Ce(e,t)});p&&(se||pe(t.state),Ae(c,A.length),k&&n.push({index:A.length,state:t.state}),Me(t.state,s,e,t.action),v.queueSize++)},I={result:void 0};if(T.init!==void 0)try{$a(T.init,p,e=>{try{I.result=Fe(e)}catch(t){I.result=P(t,[],e)}return I.result!==void 0},T.scope)}catch(e){return P(e,[])}if(I.result)return I.result;let Re=T.next;if(Re===void 0){if(A.length>0)throw new h(`No next state actions defined to generate successor states from.`);return re()}let ze=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),Be=(e,t)=>{if(!ze)return to(Re,e,p,e=>t(e,void 0),T.scope);D.value??=hm(i,p,f.instanceActions);let n={isStopped:!1};return D.value.reduce((r,i)=>n.isStopped?r:r+to(i.expression,e,p,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},L=e=>{let t=A[e],n=[],a=r&&Pe(t,de[e]),o=Be(t,(t,r)=>{try{I.result=Ie(e,t,n,a,r)}catch(n){if(F.isFingerprinting)throw n;I.result=P(n,Ce(e,t))}return I.result!==void 0});if(F.isExpanding=!1,I.result)return I.result;if(o===0&&i.checkDeadlock)return w(`deadlock`,{name:`deadlock`,trace:N(e)});try{let r=k?.addState(e,t,n);if(!k||!r)return;let i=we(r),a=k.getViolatedProperties(i.map(e=>e.state),i.length-1);return w(`property-violation`,{name:a[0],properties:a,trace:ve(i,r)})}catch(t){return P(t,N(e),void 0,S())}},Ve=(e,t)=>{D.value??=hm(i,p,f.instanceActions);let n=D.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 v.generatedStates++,P(n.length===1?e:new h(`Successor state is not completely specified by action ${e.action} of the next-state relation. The following ${a}`),[...N(t),{action:e.action,label:r&&_m(r),state:me(e.state.map(e=>e??Ke(`null`)))}])},He=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=we(n,r),a=ve(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(()=>_e(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:Se(u,s)?.action)},Ue=k!==void 0&&t.livenessCheck!==`final`,We=performance.now(),R={at:We+3e3,size:1,time:0},Ge=e=>{let t=performance.now();if(R.at=t+6e4,!((e-R.size)/R.size>.1)||R.time>(t-We)*.2)return;R.size=e;let n=k?.findViolation();return R.time+=performance.now()-t,n};for(let e=0;e<A.length&&!v.isStopped;e++){F.index=e,F.candidate=void 0,v.queueSize=A.length-e-1,F.isExpanding=!0;try{I.result=L(e)}catch(t){I.result=t instanceof _?Ve(t,e):P(Ph(t),N(e))}if(I.result)return I.result;if(ee[ne()]++,te.newStates=0,Ue&&performance.now()>=R.at){let t=Ge(e+1);if(k&&t)return He(k,t)}}F.index=-1,F.candidate=void 0;let qe=k?.findViolation();if(k&&qe)return He(k,qe);let Je=C.findPostconditionViolation();return Je?b(`postcondition-violation`,{...Je,trace:[]}):re()},Rh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},zh=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Pn(e[t]),16777619),r=Math.imul(r^Vn(e[t]),1540483477);t[0]=Rh(n)||1,t[1]=Rh(r)},Bh=()=>{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)}}},Vh=(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}},Hh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Uh=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Vh(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Wh=e=>Atomics.load(e.used,0)*2>=e.slots.length,Gh=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Vh(t,n);return{slots:t,used:e.used}},Kh=()=>{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=wn(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})}},qh=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 Ke(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Rt({kind:`Interval`,low:e,high:e+t-1});return Je(a,i(t))}let a=n[r.index++];if(e===5)return qe(i(a));let o=i(a);return Je(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return ge}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return eo}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return W}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Zn}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return b}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return m}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Re}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return h}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return fs}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return $n}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return zf}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Gh}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return Ic}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return zh}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return jh}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return qm}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Zm}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Um}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Hh}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Le}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Ih}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Xm}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Kh}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Uh}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Ym}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Bh}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Wh}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return qh}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Mh}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return Of}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return no}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Lc}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return kf}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return x}});
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:Dh(t),scope:void 0}]})},Ph=(e,t)=>{if(!F(e))return;let n=W(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])))},Fh=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Fh(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Bo(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Fh(n.body,t)}return[e]},Ih=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||em(r,e.scope,t)>0)return!1;let i=Z(r,Xh(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 ${G(i)},\ncannot be used as a ${n}`);return!0},Lh=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=kh(t,e,r).body,i=Dh(e);if(n.kind!==`Number`&&n.kind!==`String`&&em(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=kh(`name`,t.specification,r),c=jh(t.specification,s,r);if(c!==void 0)throw new _(`The value of ${t.specification} is equal to ${G(c)}`);if(rm(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Ih(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`&&em(c.expression,s.scope,r)<2)throw n(new _(`TLC cannot handle the temporal formula ${To(c.expression)}`),e.error);let l=em(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:wh},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},Rh=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Mh(`property`,e,t);r&&rm(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Ih(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`&&em(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=em(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},zh=(e,t,n)=>t.flatMap(t=>Mh(e,t,n)?[{name:t,expression:Dh(t),scope:void 0}]:[]),Bh=(e,t)=>{let n=Bo(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Vh=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);Ah(`possible`,n,t);let i=Dh(n);if(em(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}}),Hh=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||K(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Uh=(e,t)=>e.flatMap(e=>Fh(e.expression,t).map(n=>{let r=e.scope===void 0?Oc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Hh(n,r,t)}})),Wh=(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},Gh=/[\u0100-\uffff]/,Kh=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),qh=e=>e.kind===`String`?Gh.test(e.value):e.kind===`Set`&&e.elements.some(qh),Jh=e=>e.kind===`String`&&Gh.test(e.value)||e.kind===`Apply`&&Kh.has(e.operator)||pr(e).some(Jh),Yh=(e,t)=>e.constants.some(e=>qh(e.value)||(e.args??[]).some(qh))||[...t.definitions.values()].some(e=>Jh(e.body)||e.kind===`Function`&&e.bounds.some(e=>Jh(e.set))),Xh=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Zh=(e,t,n)=>zo(Z(e,t),n),Qh=(e,t,n=$h)=>{let r=Z(e,t);if(typeof r!=`boolean`)throw new v(n(e,t.environment));return r},$h=(e,t)=>{let n=e.kind===`Identifier`?Bo(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):To(r)}`},eg=()=>{},tg=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Zh(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),ng=(e,t,n)=>{try{return Zh(e,Xh(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof v)return{message:e.message};throw e}},rg=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=ng(n.expression,t,`an assumption`);if(e)return{name:To(n.expression),trace:[],message:e.message}}},ig=(t,r,i)=>{let a=Nh(t.invariants,r),o=Lh(t,r),s=Rh(t,r),c=Uh([...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=Uh(zh(`constraint`,t.constraints,r),r),d=zh(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&kh(`rlreward`,t.rlReward,r),t.periodic!==void 0&&kh(`periodic`,t.periodic,r);let f=Vh(t.possible,r);if(r.variables.length===0)return;let p=t.symmetry===void 0?[]:oh(t.symmetry,r);t.view!==void 0&&kh(`view function`,t.view,r);let m=t.view===void 0?void 0:{name:t.view,expression:Dh(t.view),scope:void 0},g=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:wh};return{...e,unchanged:t}}),v=e=>em(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)=>Z(e,Xh(r,t,void 0)),ie=e=>{let t=te(),n=p.length===0?e:mh(e,p,t);return Tl(m===void 0?t.map(e=>n[e]):[re(m.expression,n)])},S=Yh(t,r);x.getFingerprint=ie;let ae=()=>{let e=f.find(e=>!x.possibleCounts.get(e.name));if(!e)return;let t=Bh(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:Ee(G(Wl(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=Ol(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(S)return[String(ie(e))];let t=p.length===0?e:mh(e,p,ne);return m===void 0?t:[re(m.expression,t)]},findViolatedInvariant:(t,i)=>c.find(a=>{if(Wh(a,t,i))return!1;try{let e=Xh(r,t,void 0,a.scope),n=a.membership;return i&&n?!Sn(t[n.variable],i[n.variable],Z(n.set,e)):!Qh(a.expression,e)}catch(t){throw i?ug(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>u.every(n=>{try{return Wh(n,e,t)||Qh(n.expression,Xh(r,e,void 0))}catch(e){throw t?og(e):e}}),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Qh(t.expression,Xh(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>g.find(n=>{try{return!Qh(n.action,Xh(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${To(n.box)}`)&&!Zh(n.unchanged,Xh(r,e,t,n.scope),`a subscript`)}catch(e){throw ug(ag(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>d.every(n=>{try{return Qh(n.expression,Xh(r,e,t))}catch(e){throw og(e)}}),trackStatePossible:y.length===0?eg:e=>tg(y,x,Xh(r,e,void 0)),trackActionPossible:b.length===0?eg:(e,t)=>tg(b,x,Xh(r,e,t)),findUnwitnessedPossible:ae,findPostconditionViolation:()=>{let e=ae();if(e)return e;for(let e of t.postconditions){let t=ng(Dh(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},ag=e=>e instanceof y?n(e,e.exitCode):e,og=e=>e instanceof v&&!(e instanceof y)&&!(e instanceof x)?n(new v(`${l}${e.message}`,e),ie(e)):ag(e),sg=(e,t,n)=>t>0&&n[t-1]===e,cg=e=>e.flatMap(e=>e.location.range?[h(e.location.range)]:[]).filter((e,t,n)=>!sg(e,t,n)).map((e,t)=>`${t}) ${e}`).reverse(),lg=(e,t)=>{try{return e(),{callStack:void 0}}catch(e){if(!(e instanceof v))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)=>!sg(e,t,n)),r=Oe(e);return{callStack:n,fingerprint:r&&{sources:cg(r),reason:e.message}}}},ug=(e,t)=>e instanceof v?n(new v(`${t}\n${e.message}`,e),ie(e)):e,dg=t=>{let r=t.dump&&th(t.dump,t.writeFile);try{return fg(t,r)}catch(t){throw d(t)?n(new v(u),e.error):t}finally{r?.close()}},fg=(t,r)=>{let i=typeof t.config==`string`?be(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};We(tp(t.source,i,t.loadModule));let f=dp(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=()=>Gm(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}),b=Array.from({length:32},()=>0),te={newStates:0},ne=()=>Math.min(te.newStates,31),re=()=>b.map((e,t)=>t===ne()?e+1:e),S=()=>({...g(`success`),outDegrees:[...b],fingerprintDistance:Sh(m.distinctStates,m.generatedStates,()=>C?C.getStoredFingerprints(j,he):BigInt64Array.from(j,m.getFingerprint))}),ae=()=>ep(t.source,t.loadModule,`variable`),C=ig(i,p,ae),oe=rg(f.assumptions,p);if(oe)return g(`assumption-violation`,oe);if(!C)return S();let w=i.postconditions.length>0||i.possible.length>0,T=(e,t,n)=>{if(w){let e=t.loopStart;m.counterExample=qu(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)},E=C.spec,se=C.getFingerprintState,D={value:void 0},O=(e,t,n=!1)=>{if(!e.failure)return e;let r=[],a={...p,evaluators:/* @__PURE__ */ new WeakMap,trace:r},s=ig(i,a,ae);if(!s)return e;let c=[];o.replayed=c,N.current=/* @__PURE__ */ new WeakMap;let l=lg(()=>t(s,a),r);return N.current=void 0,o.replayed=void 0,{...e,failure:{...e.failure,replay:{output:c,...l,isBeforeError:n}}}},ce=(e,t)=>{try{Ne(se(e))}catch(e){throw t.trace&&Oe(e)&&(t.trace.length=0),e}},k=e=>O(e,(e,t)=>{E.init!==void 0&&bo(E.init,t,n=>(e.satisfiesConstraints(n)&&ce(n,t),e.findViolatedInvariant(n)!==void 0||e.findFailedInitialPredicate(n)!==void 0),E.scope)}),A=e=>{let t=ge[e];t===-1?Ee():(A(t),we(t,j[t],j[e]))},le=(e,t)=>O(e,(e,n)=>{A(t);let r=j[t];D.value??=Vm(i,p,f.instanceActions),D.value.find(t=>Co(t.expression,r,n,t.scope).some(t=>{let i=e.satisfiesConstraints(t.state)&&e.satisfiesActionConstraints(r,t.state);return i&&ce(t.state,n),!i&&e.findViolatedInvariant(t.state)!==void 0||e.findViolatedActionProperty(r,t.state)!==void 0}))}),ue=i.view!==void 0||i.symmetry!==void 0,de=[],fe={getFingerprint:e=>de[e]??=Number(BigInt.asIntN(32,m.getFingerprint(j[e]))),getSuccessors:e=>{let t=[];return E.next===void 0||So(E.next,e,p,n=>{if(ye(n.state),!(C.satisfiesConstraints(n.state,e)&&C.satisfiesActionConstraints(e,n.state)))return!1;let r=se(n.state),i=Ie(Ne(r),r);return t.push({index:i,state:n.state}),!1},E.scope),t}},pe=c(()=>vm(C.properties.liveness,E.temporals,p,fe)),me=C.isSymmetric||pe!==void 0,j=[],he=[],ge=[],_e=[],ve=[],M={slots:new Int32Array(1<<17),size:0,shift:16},ye=fr(),xe=e=>Object.fromEntries(C.getTlcOrder().map(t=>[p.variables[t],e[t]])),Se=(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=Ah(`alias`,e,p).body,i=Z(Dh(e),Xh(p,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Ph(i,a)??xe(t)}catch(e){if(!(e instanceof _||e instanceof v))throw e;return{...xe(t),_ALIASEvalError:e.message}}},we=(e,t,n)=>{D.value??=Vm(i,p,f.instanceActions);let r={...L};Object.assign(L,{index:e,isExpanding:!0,candidate:void 0});let a=se(n),o=D.value.find(e=>Co(e.expression,t,p,e.scope).some(e=>Pe(se(e.state),a)));return Object.assign(L,r),o&&Um(o)},Te=(e,t,n)=>{let r=i.alias,a=l(()=>(e.length>1&&js(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?xe(t.state):Se(r,e,i,n)}))},Ee=()=>E.init===void 0?[]:xo(E.init,p,E.scope),De=e=>E.next===void 0?[]:Co(E.next,e,p,E.scope),ke=(e,t)=>Pe(se(e),he[t]),P=(e,t)=>De(e).find(e=>ke(e.state,t)),Ae=(e,t)=>{let n=ue||js(p)?Ee().find(t=>ke(t,e[0])):j[e[0]];if(!n)throw new v(Th);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=P(i,e[n]);if(!a)throw new v(t);r.push(a)}return r},F=(e,t)=>{let n=[];for(let t=e;t!==-1;t=ge[t])n.unshift(t);let r=ue&&n.length>1?Ae(n,Th):n.map(e=>({state:j[e],action:_e[e]}));if(!t)return Te(r,n);let i=ue?De(j[e]).find(e=>Pe(e.state,t.state))?.action:t.action;return Te([...r,{state:t.state,action:i}],n)},I=e=>ge[e]===-1?[{action:void 0,label:void 0,state:xe(j[e])}]:F(e),je=(t,r,i,a)=>{if(d(t))return L.isExpanding?je(n(new v(u),e.error),I(L.index)):je(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)?xe(i):void 0,exitCode:ie(t)}),outDegrees:a}},Me=(e,t)=>{let n=Ae(e,Eh),r=n[n.length-1].state;if(ue&&t!==void 0&&t!==e.length-1&&P(r,e[t])===void 0)throw new v(Eh);return n},Ne=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=zn(t,Gn(e[n]));return qn(e),t&1073741823},Pe=(e,t)=>{for(let n=0;n<t.length;n++)if(!at(e[n],t[n]))return!1;return!0},Fe=e=>Math.imul(e,2654435761)>>>M.shift<<1,Ie=(e,t)=>{let n=M.slots.length-1;for(let r=Fe(e);;r=r+2&n){let n=M.slots[r+1];if(n===0)return-1;if(M.slots[r]===e&&Pe(he[n-1],t))return n-1}},Le=(e,t)=>{let n=M.slots.length-1,r=Fe(e);for(;M.slots[r+1]!==0;)r=r+2&n;M.slots[r]=e,M.slots[r+1]=t},Re=(e,t)=>{if(M.size++,M.size*4>M.slots.length){let e=M.slots;M.slots=new Int32Array(e.length*2),M.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&Le(e[t],e[t+1])}Le(e,t+1)},ze=e=>{m.distinctStates=j.length+1,h.depth=Math.max(h.depth,e),m.diameter=Math.max(m.diameter,e)},Be=(e,t,n,r)=>{let i=n===-1?1:ve[n]+1;j.push(e),he.push(t),ge.push(n),_e.push(r),ve.push(i)},L={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,isFingerprinting:!1,livenessSource:-1},Ve=e=>e===-1?[]:[...Ve(ge[e]),j[e]];m.isSeen=e=>{let t=se(e);return Ie(Ne(t),t)!==-1},m.getBehavior=e=>{let t=e===L.candidate?-1:j.indexOf(e);return t===-1?[...Ve(L.index),e]:Ve(t)},m.getCurrentState=()=>L.index===-1?void 0:j[L.index],m.setLivenessSource=e=>{L.livenessSource=e??-1},m.getLevel=e=>{let t=L.livenessSource;return t===-1?e===L.candidate?L.candidateLevel:L.index===-1?0:e===j[L.index]?ve[L.index]:L.isExpanding?ve[L.index]+1:0:e===j[t]?ve[t]:ve[t]+1};let He=(e,t)=>({fingerprint:BigInt.asIntN(64,m.getFingerprint(e)),level:t,getLabel:()=>ur(i.alias===void 0?xe(e):Ce(i.alias,e,void 0)),getText:()=>ur(xe(e))}),Ue=e=>{ye(e),m.generatedStates++,m.initialStates++,L.candidate=e,L.candidateLevel=1;let t=se(e),n=Ne(t),i=C.satisfiesConstraints(e);if(i&&C.trackStatePossible(e),i&&Ie(n,t)!==-1)return;i&&(ze(1),m.queueSize++,pe?.addInitialState(j.length,e),r?.writeInitialState(He(e,1)));let a=C.findViolatedInvariant(e);if(a)return T(`invariant-violation`,{name:a.name,trace:Te([{action:void 0,state:e}],[])});let o=C.findFailedInitialPredicate(e);if(o)return T(`liveness-violation`,{name:o.name,trace:Te([{action:void 0,state:e}],[])});i&&(Re(n,j.length),Be(e,t,-1,void 0))},Ge=(e,t,n,i,a)=>{let o=j[e];m.generatedStates++,L.candidate=t.state,L.candidateLevel=ve[e]+1,me&&ye(t.state),L.isFingerprinting=!0;let s=se(t.state),c=Ne(s);L.isFingerprinting=!1;let l=Ie(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,He(t.state,ve[e]+1),f!==-1,a&&{name:a.name,signature:Wm(a)}),f!==-1&&pe){let e=j[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&&(ze(ve[e]+1),te.newStates++),f===-1)try{let n=C.findViolatedInvariant(t.state,o);if(n)return T(`invariant-violation`,{name:n.name,trace:F(e,t)})}catch(n){return je(n,F(e,t),void 0,re())}let h=C.findViolatedActionProperty(o,t.state);if(h)return T(`liveness-violation`,{name:h.name,trace:F(e,t)});p&&(me||ye(t.state),Re(c,j.length),pe&&n.push({index:j.length,state:t.state}),Be(t.state,s,e,t.action),m.queueSize++)},Ke={result:void 0};if(E.init!==void 0)try{bo(E.init,p,e=>{try{Ke.result=Ue(e)}catch(t){Ke.result=je(t,[],e)}return Ke.result!==void 0},E.scope)}catch(e){if(!(e instanceof ee))return k(je(e,[]));let t=je(e,[],e.state.map(e=>e??et(`null`)));return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}if(Ke.result)return k(Ke.result);let qe=E.next;if(qe===void 0){if(j.length>0)throw new v(`No next state actions defined to generate successor states from.`);return S()}let Je=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),R=(e,t)=>{if(!Je)return So(qe,e,p,e=>t(e,void 0),E.scope);D.value??=Vm(i,p,f.instanceActions);let n={isStopped:!1};return D.value.reduce((r,i)=>n.isStopped?r:r+So(i.expression,e,p,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},Ye=e=>{let t=j[e],n=[],a=r&&He(t,ve[e]),o=R(t,(t,r)=>{try{Ke.result=Ge(e,t,n,a,r)}catch(n){if(L.isFingerprinting)throw n;let r=je(n,F(e,t));Ke.result=d(n)?r:le(r,e)}return Ke.result!==void 0});if(L.isExpanding=!1,Ke.result)return Ke.result;if(o===0&&i.checkDeadlock)return T(`deadlock`,{name:`deadlock`,trace:I(e)});try{let r=pe?.addState(e,t,n);if(!pe||!r)return;let i=Me(r),a=pe.getViolatedProperties(i.map(e=>e.state),i.length-1);return T(`property-violation`,{name:a[0],properties:a,trace:Te(i,r)})}catch(r){return O(je(og(r),I(e),void 0,re()),(r,i)=>vm(C.properties.liveness,E.temporals,i,fe)?.addState(e,t,n),!0)}},Xe=(e,t)=>{D.value??=Vm(i,p,f.instanceActions);let n=D.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++,je(n.length===1?e:new v(`Successor state is not completely specified by action ${e.action} of the next-state relation. The following ${a}`),[...I(t),{action:e.action,label:r&&Um(r),state:xe(e.state.map(e=>e??et(`null`)))}])},Ze=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=Me(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,j[s]));return T(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>s===c?a[a.length-1].action:P(u,s)?.action)},Qe=pe!==void 0&&t.livenessCheck!==`final`,z=performance.now(),$e={at:z+3e3,size:1,time:0},tt=e=>{let t=performance.now();if($e.at=t+6e4,!((e-$e.size)/$e.size>.1)||$e.time>(t-z)*.2)return;$e.size=e;let n=pe?.findViolation();return $e.time+=performance.now()-t,n};for(let e=0;e<j.length&&!m.isStopped;e++){L.index=e,L.candidate=void 0,m.queueSize=j.length-e-1,L.isExpanding=!0;try{Ke.result=Ye(e)}catch(t){let n=t instanceof x?Xe(t,e):je(og(t),I(e));Ke.result=t instanceof x||d(t)?n:le(n,e)}if(Ke.result)return Ke.result;if(b[ne()]++,te.newStates=0,Qe&&performance.now()>=$e.at){let t=tt(e+1);if(pe&&t)return Ze(pe,t)}}L.index=-1,L.candidate=void 0;let nt=pe?.findViolation();if(pe&&nt)return Ze(pe,nt);let rt=C.findPostconditionViolation();return rt?g(`postcondition-violation`,{...rt,trace:[]}):S()},pg=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},mg=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Gn(e[t]),16777619),r=Math.imul(r^er(e[t]),1540483477);qn(e),t[0]=pg(n)||1,t[1]=pg(r)},hg=()=>{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)}}},gg=(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}},_g=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),vg=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return gg(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},yg=e=>Atomics.load(e.used,0)*2>=e.slots.length,bg=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&gg(t,n);return{slots:t,used:e.used}},xg=()=>{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=Pn(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})}},Sg=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 et(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Kt({kind:`Interval`,low:e,high:e+t-1});return nt(a,i(t))}let a=n[r.index++];if(e===5)return tt(i(a));let o=i(a);return nt(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return be}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return ie}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return xo}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return G}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return ur}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return te}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return _}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return Ke}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return js}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return fr}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return dp}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return bg}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return cl}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return mg}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return rg}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return yh}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Ch}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return hh}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return _g}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return de}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return We}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return dg}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Sh}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return xg}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return vg}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return xh}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return hg}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return yg}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Sg}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return ig}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return ep}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Co}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return ll}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return tp}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return m}});